./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:16:23,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:16:23,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:16:23,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:16:23,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:16:23,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:16:23,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:16:23,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:16:23,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:16:23,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:16:23,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:16:23,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:16:23,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:16:23,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:16:23,289 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:16:23,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:16:23,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:16:23,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:16:23,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:16:23,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:16:23,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:16:23,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:16:23,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:16:23,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:16:23,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:16:23,293 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:16:23,294 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:16:23,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:16:23,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:16:23,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:16:23,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:16:23,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:16:23,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:16:23,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:16:23,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:16:23,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:16:23,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:16:23,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:16:23,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:16:23,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:16:23,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:16:23,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:16:23,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:16:23,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:16:23,305 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-10-11 21:16:23,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:16:23,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:16:23,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:16:23,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:16:23,520 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:16:23,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-10-11 21:16:24,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:16:24,969 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:16:24,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-10-11 21:16:24,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b590ab06a/371f5c1c04e34cbbadfcdc822deaa6ab/FLAGaedf458d3 [2024-10-11 21:16:24,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b590ab06a/371f5c1c04e34cbbadfcdc822deaa6ab [2024-10-11 21:16:24,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:16:24,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:16:24,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:16:24,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:16:25,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:16:25,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:24" (1/1) ... [2024-10-11 21:16:25,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5351ac98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25, skipping insertion in model container [2024-10-11 21:16:25,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:24" (1/1) ... [2024-10-11 21:16:25,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:16:25,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:16:25,155 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:16:25,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:16:25,185 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:16:25,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25 WrapperNode [2024-10-11 21:16:25,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:16:25,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:16:25,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:16:25,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:16:25,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,213 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-11 21:16:25,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:16:25,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:16:25,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:16:25,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:16:25,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,241 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2024-10-11 21:16:25,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:16:25,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:16:25,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:16:25,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:16:25,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (1/1) ... [2024-10-11 21:16:25,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:16:25,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:25,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:16:25,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:16:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:16:25,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 21:16:25,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 21:16:25,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 21:16:25,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 21:16:25,325 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-10-11 21:16:25,325 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-10-11 21:16:25,325 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-10-11 21:16:25,325 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-10-11 21:16:25,325 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-10-11 21:16:25,326 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-10-11 21:16:25,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:16:25,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:16:25,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 21:16:25,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 21:16:25,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 21:16:25,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 21:16:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 21:16:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 21:16:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-10-11 21:16:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-10-11 21:16:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-10-11 21:16:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-10-11 21:16:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 21:16:25,412 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:16:25,414 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:16:25,587 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 21:16:25,587 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:16:25,622 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:16:25,622 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:16:25,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:25 BoogieIcfgContainer [2024-10-11 21:16:25,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:16:25,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:16:25,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:16:25,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:16:25,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:16:24" (1/3) ... [2024-10-11 21:16:25,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513ef8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:16:25, skipping insertion in model container [2024-10-11 21:16:25,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:25" (2/3) ... [2024-10-11 21:16:25,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513ef8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:16:25, skipping insertion in model container [2024-10-11 21:16:25,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:25" (3/3) ... [2024-10-11 21:16:25,630 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2024-10-11 21:16:25,642 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:16:25,642 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-11 21:16:25,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:16:25,699 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e1f3514, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:16:25,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 21:16:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.5) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 21:16:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 21:16:25,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:25,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:25,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:25,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2007023355, now seen corresponding path program 1 times [2024-10-11 21:16:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639240200] [2024-10-11 21:16:25,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:26,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639240200] [2024-10-11 21:16:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639240200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:26,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:16:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776517431] [2024-10-11 21:16:26,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:26,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:16:26,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:26,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:16:26,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:16:26,254 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.5) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:16:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:26,546 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-10-11 21:16:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:16:26,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 21:16:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:26,558 INFO L225 Difference]: With dead ends: 89 [2024-10-11 21:16:26,559 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 21:16:26,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:16:26,563 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 33 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:26,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 243 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:16:26,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 21:16:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2024-10-11 21:16:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.411764705882353) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:16:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-10-11 21:16:26,594 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 11 [2024-10-11 21:16:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:26,595 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-10-11 21:16:26,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:16:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-10-11 21:16:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 21:16:26,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:26,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:26,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:16:26,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1663685642, now seen corresponding path program 1 times [2024-10-11 21:16:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381840653] [2024-10-11 21:16:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:26,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:16:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381840653] [2024-10-11 21:16:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381840653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:16:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685199546] [2024-10-11 21:16:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:26,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:16:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:16:26,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:16:26,784 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:16:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:26,942 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2024-10-11 21:16:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:16:26,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 21:16:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:26,945 INFO L225 Difference]: With dead ends: 130 [2024-10-11 21:16:26,945 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 21:16:26,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:16:26,947 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:26,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 144 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 21:16:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2024-10-11 21:16:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.4) internal successors, (49), 48 states have internal predecessors, (49), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 21:16:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-10-11 21:16:26,964 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 14 [2024-10-11 21:16:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:26,964 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-10-11 21:16:26,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:16:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-10-11 21:16:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 21:16:26,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:26,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:26,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:16:26,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:26,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash 498483849, now seen corresponding path program 1 times [2024-10-11 21:16:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:26,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204291246] [2024-10-11 21:16:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:27,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204291246] [2024-10-11 21:16:27,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204291246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:27,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:27,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:16:27,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186439478] [2024-10-11 21:16:27,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:27,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:16:27,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:16:27,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:16:27,140 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:27,189 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2024-10-11 21:16:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:16:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 21:16:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:27,190 INFO L225 Difference]: With dead ends: 122 [2024-10-11 21:16:27,190 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 21:16:27,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:16:27,192 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:27,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 266 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:16:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 21:16:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-11 21:16:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 50 states have internal predecessors, (52), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 21:16:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-10-11 21:16:27,203 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 17 [2024-10-11 21:16:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:27,203 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-10-11 21:16:27,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-10-11 21:16:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 21:16:27,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:27,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:27,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:16:27,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:27,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash 504798164, now seen corresponding path program 1 times [2024-10-11 21:16:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:27,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279429395] [2024-10-11 21:16:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:27,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:16:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:27,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279429395] [2024-10-11 21:16:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279429395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:27,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:27,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:16:27,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111719252] [2024-10-11 21:16:27,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:27,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:16:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:27,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:16:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:16:27,331 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:16:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:27,464 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-10-11 21:16:27,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:16:27,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 21:16:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:27,465 INFO L225 Difference]: With dead ends: 89 [2024-10-11 21:16:27,465 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 21:16:27,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:16:27,466 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:27,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 222 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 21:16:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2024-10-11 21:16:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 55 states have internal predecessors, (58), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-11 21:16:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-10-11 21:16:27,473 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 17 [2024-10-11 21:16:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:27,474 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-10-11 21:16:27,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:16:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-10-11 21:16:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 21:16:27,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:27,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:27,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:16:27,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:27,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1726869798, now seen corresponding path program 1 times [2024-10-11 21:16:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:27,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911028512] [2024-10-11 21:16:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911028512] [2024-10-11 21:16:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911028512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:27,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:27,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:16:27,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389745371] [2024-10-11 21:16:27,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:27,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:16:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:27,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:16:27,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:16:27,552 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:27,569 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2024-10-11 21:16:27,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:16:27,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 21:16:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:27,570 INFO L225 Difference]: With dead ends: 72 [2024-10-11 21:16:27,570 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 21:16:27,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:16:27,571 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:27,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:16:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 21:16:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 21:16:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 54 states have internal predecessors, (57), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-11 21:16:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-10-11 21:16:27,576 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 18 [2024-10-11 21:16:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:27,576 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-10-11 21:16:27,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-10-11 21:16:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 21:16:27,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:27,577 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:27,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:16:27,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:27,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:27,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1851625347, now seen corresponding path program 1 times [2024-10-11 21:16:27,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:27,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446843089] [2024-10-11 21:16:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:27,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446843089] [2024-10-11 21:16:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446843089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:16:27,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692044228] [2024-10-11 21:16:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:27,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:16:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:27,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:16:27,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:16:27,704 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:27,780 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-10-11 21:16:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:16:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 21:16:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:27,783 INFO L225 Difference]: With dead ends: 75 [2024-10-11 21:16:27,783 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 21:16:27,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:16:27,785 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:27,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:16:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 21:16:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-10-11 21:16:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-11 21:16:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-10-11 21:16:27,792 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2024-10-11 21:16:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:27,796 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-11 21:16:27,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-10-11 21:16:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 21:16:27,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:27,796 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:27,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:16:27,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:27,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1813325083, now seen corresponding path program 1 times [2024-10-11 21:16:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979099736] [2024-10-11 21:16:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:16:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 21:16:27,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979099736] [2024-10-11 21:16:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979099736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:27,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017484783] [2024-10-11 21:16:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:27,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:27,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:27,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:16:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:28,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 21:16:28,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:28,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 21:16:28,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 21:16:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:28,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:16:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017484783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:28,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:16:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-10-11 21:16:28,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520081955] [2024-10-11 21:16:28,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:28,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:16:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:16:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:16:28,185 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:16:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:28,295 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2024-10-11 21:16:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:16:28,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-11 21:16:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:28,297 INFO L225 Difference]: With dead ends: 70 [2024-10-11 21:16:28,297 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 21:16:28,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 21:16:28,298 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 61 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:28,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 234 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 21:16:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-11 21:16:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.255813953488372) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-11 21:16:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-10-11 21:16:28,305 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 22 [2024-10-11 21:16:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:28,306 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-10-11 21:16:28,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:16:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-10-11 21:16:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 21:16:28,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:28,307 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:16:28,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:16:28,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:28,512 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash 378502822, now seen corresponding path program 1 times [2024-10-11 21:16:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547760406] [2024-10-11 21:16:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:28,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:16:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:16:28,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547760406] [2024-10-11 21:16:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547760406] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350757376] [2024-10-11 21:16:28,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:28,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:28,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:28,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:16:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:28,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:16:28,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:28,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 21:16:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:16:28,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:16:28,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350757376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:28,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:16:28,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-11 21:16:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304216879] [2024-10-11 21:16:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:28,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:16:28,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:28,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:16:28,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:16:28,799 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:16:32,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 21:16:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:32,889 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-10-11 21:16:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:16:32,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 21:16:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:32,890 INFO L225 Difference]: With dead ends: 68 [2024-10-11 21:16:32,890 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 21:16:32,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:16:32,891 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 48 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:32,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 169 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 21:16:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 21:16:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-10-11 21:16:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.263157894736842) internal successors, (48), 46 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-10-11 21:16:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-10-11 21:16:32,908 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 23 [2024-10-11 21:16:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:32,908 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-10-11 21:16:32,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:16:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-10-11 21:16:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 21:16:32,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:32,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:32,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:16:33,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:33,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:33,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:33,111 INFO L85 PathProgramCache]: Analyzing trace with hash -551866449, now seen corresponding path program 1 times [2024-10-11 21:16:33,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:33,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803487117] [2024-10-11 21:16:33,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:33,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:16:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:16:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:16:33,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803487117] [2024-10-11 21:16:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803487117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:33,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:33,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:16:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272219972] [2024-10-11 21:16:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:33,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:16:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:33,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:16:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:16:33,240 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:16:33,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:33,342 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2024-10-11 21:16:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:16:33,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-11 21:16:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:33,343 INFO L225 Difference]: With dead ends: 128 [2024-10-11 21:16:33,343 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 21:16:33,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:16:33,344 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:33,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 184 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 21:16:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-10-11 21:16:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 47 states have internal predecessors, (49), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-11 21:16:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-10-11 21:16:33,351 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 38 [2024-10-11 21:16:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:33,351 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-10-11 21:16:33,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:16:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-10-11 21:16:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 21:16:33,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:33,351 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:33,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:16:33,351 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:33,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1633138441, now seen corresponding path program 1 times [2024-10-11 21:16:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:33,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117710455] [2024-10-11 21:16:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:16:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:16:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117710455] [2024-10-11 21:16:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117710455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:16:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764896165] [2024-10-11 21:16:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:33,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:16:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:33,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:16:33,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:16:33,435 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:16:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:33,532 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-10-11 21:16:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:16:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-10-11 21:16:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:33,536 INFO L225 Difference]: With dead ends: 79 [2024-10-11 21:16:33,536 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 21:16:33,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:16:33,537 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 35 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:33,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 242 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 21:16:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-10-11 21:16:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 21:16:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-10-11 21:16:33,544 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 27 [2024-10-11 21:16:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:33,544 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-11 21:16:33,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:16:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-10-11 21:16:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 21:16:33,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:33,545 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:33,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:16:33,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:33,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -704784010, now seen corresponding path program 1 times [2024-10-11 21:16:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828291752] [2024-10-11 21:16:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:16:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 21:16:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 21:16:33,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828291752] [2024-10-11 21:16:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828291752] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764598325] [2024-10-11 21:16:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:33,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:33,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:33,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:33,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:16:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:33,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 21:16:33,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:33,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 21:16:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 21:16:34,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:16:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764598325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:34,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:34,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2024-10-11 21:16:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117533283] [2024-10-11 21:16:34,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:34,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 21:16:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 21:16:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2024-10-11 21:16:34,474 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 24 states, 19 states have (on average 2.736842105263158) internal successors, (52), 21 states have internal predecessors, (52), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-11 21:16:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:34,758 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2024-10-11 21:16:34,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:16:34,762 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.736842105263158) internal successors, (52), 21 states have internal predecessors, (52), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 45 [2024-10-11 21:16:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:34,763 INFO L225 Difference]: With dead ends: 146 [2024-10-11 21:16:34,763 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 21:16:34,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2024-10-11 21:16:34,766 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 55 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:34,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 470 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:16:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 21:16:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-10-11 21:16:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) [2024-10-11 21:16:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-10-11 21:16:34,776 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 45 [2024-10-11 21:16:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:34,777 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-10-11 21:16:34,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.736842105263158) internal successors, (52), 21 states have internal predecessors, (52), 7 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-11 21:16:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-10-11 21:16:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 21:16:34,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:34,780 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:34,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:34,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:34,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:34,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash 62702726, now seen corresponding path program 2 times [2024-10-11 21:16:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254008698] [2024-10-11 21:16:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:16:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:16:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-11 21:16:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254008698] [2024-10-11 21:16:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254008698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244537615] [2024-10-11 21:16:35,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:16:35,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:35,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:35,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:16:35,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:16:35,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:35,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-11 21:16:35,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:35,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 21:16:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-11 21:16:35,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 3 proven. 124 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 21:16:36,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244537615] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:36,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:36,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 21] total 38 [2024-10-11 21:16:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739957820] [2024-10-11 21:16:36,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:36,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 21:16:36,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:36,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 21:16:36,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 21:16:36,816 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 38 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-11 21:16:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:37,525 INFO L93 Difference]: Finished difference Result 154 states and 191 transitions. [2024-10-11 21:16:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 21:16:37,525 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) Word has length 73 [2024-10-11 21:16:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:37,526 INFO L225 Difference]: With dead ends: 154 [2024-10-11 21:16:37,526 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 21:16:37,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=373, Invalid=2279, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 21:16:37,527 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 57 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:37,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 790 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:16:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 21:16:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2024-10-11 21:16:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-11 21:16:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-10-11 21:16:37,534 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 73 [2024-10-11 21:16:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:37,534 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-10-11 21:16:37,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-11 21:16:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-10-11 21:16:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 21:16:37,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:37,535 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:37,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 21:16:37,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:16:37,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:37,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash -683302022, now seen corresponding path program 1 times [2024-10-11 21:16:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:37,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087249547] [2024-10-11 21:16:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:37,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:16:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-11 21:16:37,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:37,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087249547] [2024-10-11 21:16:37,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087249547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:37,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:37,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:16:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953960952] [2024-10-11 21:16:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:37,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:16:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:37,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:16:37,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:16:37,861 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:16:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:37,929 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2024-10-11 21:16:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:16:37,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2024-10-11 21:16:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:37,931 INFO L225 Difference]: With dead ends: 80 [2024-10-11 21:16:37,931 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 21:16:37,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:16:37,931 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:37,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 21:16:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2024-10-11 21:16:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 49 states have internal predecessors, (52), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-11 21:16:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-10-11 21:16:37,942 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 88 [2024-10-11 21:16:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:37,942 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-10-11 21:16:37,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:16:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-10-11 21:16:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:16:37,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:37,944 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:37,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 21:16:37,944 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:37,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 217780949, now seen corresponding path program 1 times [2024-10-11 21:16:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473259870] [2024-10-11 21:16:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:16:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:16:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 21:16:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 21:16:38,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:38,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473259870] [2024-10-11 21:16:38,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473259870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:38,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:38,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 21:16:38,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685458183] [2024-10-11 21:16:38,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:38,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:16:38,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:38,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:16:38,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:16:38,123 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 21:16:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:38,257 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-10-11 21:16:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 21:16:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 21:16:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:38,258 INFO L225 Difference]: With dead ends: 85 [2024-10-11 21:16:38,258 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 21:16:38,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 21:16:38,258 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 85 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:38,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 175 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 21:16:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-10-11 21:16:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 12 states have call successors, (12), 9 states have call predecessors, (12), 12 states have return successors, (18), 13 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-11 21:16:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-10-11 21:16:38,265 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 68 [2024-10-11 21:16:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:38,265 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-10-11 21:16:38,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 21:16:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-10-11 21:16:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 21:16:38,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:38,266 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:16:38,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:38,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1447143500, now seen corresponding path program 1 times [2024-10-11 21:16:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536165342] [2024-10-11 21:16:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:16:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:16:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 21:16:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:16:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 17 proven. 156 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-10-11 21:16:39,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:39,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536165342] [2024-10-11 21:16:39,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536165342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:39,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580137324] [2024-10-11 21:16:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:39,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:39,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:39,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:39,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:16:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:39,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 21:16:39,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:39,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 21:16:39,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 21:16:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 21:16:39,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:16:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580137324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:16:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2024-10-11 21:16:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988036804] [2024-10-11 21:16:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:39,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:16:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:39,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:16:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-10-11 21:16:39,559 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 21:16:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:39,665 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2024-10-11 21:16:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:16:39,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 110 [2024-10-11 21:16:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:39,667 INFO L225 Difference]: With dead ends: 82 [2024-10-11 21:16:39,667 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 21:16:39,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2024-10-11 21:16:39,668 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:39,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 156 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 21:16:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-10-11 21:16:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 9 states have call predecessors, (12), 12 states have return successors, (18), 13 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-11 21:16:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-10-11 21:16:39,681 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 110 [2024-10-11 21:16:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:39,682 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-10-11 21:16:39,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 21:16:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-10-11 21:16:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 21:16:39,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:39,683 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:39,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:39,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 21:16:39,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:39,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1911775594, now seen corresponding path program 1 times [2024-10-11 21:16:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194896714] [2024-10-11 21:16:39,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 21:16:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:16:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 21:16:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:16:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 17 proven. 156 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-11 21:16:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194896714] [2024-10-11 21:16:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194896714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:40,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206547809] [2024-10-11 21:16:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:40,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:40,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:40,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:40,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:16:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:41,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:16:41,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:41,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 21:16:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-10-11 21:16:41,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:16:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206547809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:41,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:16:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-10-11 21:16:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495502640] [2024-10-11 21:16:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:41,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:16:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:16:41,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-10-11 21:16:41,193 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 21:16:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:41,264 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2024-10-11 21:16:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:16:41,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 111 [2024-10-11 21:16:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:41,265 INFO L225 Difference]: With dead ends: 78 [2024-10-11 21:16:41,265 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 21:16:41,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-10-11 21:16:41,266 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:41,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 162 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:16:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 21:16:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-10-11 21:16:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 12 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 21:16:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-10-11 21:16:41,273 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 111 [2024-10-11 21:16:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:41,274 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-10-11 21:16:41,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 21:16:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-10-11 21:16:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 21:16:41,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:41,275 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:41,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:41,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 21:16:41,479 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:41,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash 617924499, now seen corresponding path program 1 times [2024-10-11 21:16:41,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:41,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719960857] [2024-10-11 21:16:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:41,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:41,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:16:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:16:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 21:16:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 21:16:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:16:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 21:16:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 19 proven. 164 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 21:16:42,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719960857] [2024-10-11 21:16:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719960857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749524038] [2024-10-11 21:16:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:42,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:42,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:42,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:16:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:42,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 21:16:42,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:42,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 21:16:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-11 21:16:42,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-10-11 21:16:43,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749524038] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:43,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:43,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 11] total 35 [2024-10-11 21:16:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708413076] [2024-10-11 21:16:43,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:43,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 21:16:43,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:43,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 21:16:43,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 21:16:43,295 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 35 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 11 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2024-10-11 21:16:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:43,865 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2024-10-11 21:16:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 21:16:43,868 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 11 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) Word has length 133 [2024-10-11 21:16:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:43,869 INFO L225 Difference]: With dead ends: 152 [2024-10-11 21:16:43,869 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 21:16:43,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=308, Invalid=2044, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 21:16:43,870 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 137 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:43,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 286 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:16:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 21:16:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-11 21:16:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 9 states have call predecessors, (11), 14 states have return successors, (19), 14 states have call predecessors, (19), 9 states have call successors, (19) [2024-10-11 21:16:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-10-11 21:16:43,882 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 133 [2024-10-11 21:16:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:43,882 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-10-11 21:16:43,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 2.892857142857143) internal successors, (81), 29 states have internal predecessors, (81), 11 states have call successors, (28), 8 states have call predecessors, (28), 11 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2024-10-11 21:16:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-10-11 21:16:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-11 21:16:43,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:43,884 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 20, 20, 20, 20, 20, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:43,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:44,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:44,085 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:44,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash -579036173, now seen corresponding path program 2 times [2024-10-11 21:16:44,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:44,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517627327] [2024-10-11 21:16:44,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:44,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:16:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:16:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:16:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:16:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:16:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 21:16:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:16:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:16:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 21:16:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 21:16:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 221 proven. 439 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2024-10-11 21:16:45,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:45,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517627327] [2024-10-11 21:16:45,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517627327] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:45,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856347498] [2024-10-11 21:16:45,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:16:45,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:45,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:45,806 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:45,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:16:46,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:16:46,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:46,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-10-11 21:16:46,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:46,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 21:16:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 690 proven. 35 refuted. 0 times theorem prover too weak. 1186 trivial. 0 not checked. [2024-10-11 21:16:46,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 9 proven. 792 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-10-11 21:16:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856347498] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:49,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 31] total 52 [2024-10-11 21:16:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43447096] [2024-10-11 21:16:49,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:49,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 21:16:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 21:16:49,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=2186, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 21:16:49,845 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 52 states, 42 states have (on average 2.5238095238095237) internal successors, (106), 43 states have internal predecessors, (106), 12 states have call successors, (37), 11 states have call predecessors, (37), 15 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) [2024-10-11 21:16:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:50,347 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2024-10-11 21:16:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 21:16:50,348 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 42 states have (on average 2.5238095238095237) internal successors, (106), 43 states have internal predecessors, (106), 12 states have call successors, (37), 11 states have call predecessors, (37), 15 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) Word has length 269 [2024-10-11 21:16:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:50,348 INFO L225 Difference]: With dead ends: 158 [2024-10-11 21:16:50,348 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 21:16:50,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 579 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=710, Invalid=2950, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 21:16:50,350 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 64 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:50,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 627 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:16:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 21:16:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-10-11 21:16:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 54 states have internal predecessors, (58), 11 states have call successors, (11), 9 states have call predecessors, (11), 15 states have return successors, (20), 15 states have call predecessors, (20), 9 states have call successors, (20) [2024-10-11 21:16:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2024-10-11 21:16:50,357 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 269 [2024-10-11 21:16:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2024-10-11 21:16:50,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 42 states have (on average 2.5238095238095237) internal successors, (106), 43 states have internal predecessors, (106), 12 states have call successors, (37), 11 states have call predecessors, (37), 15 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) [2024-10-11 21:16:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2024-10-11 21:16:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-11 21:16:50,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:50,359 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:50,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:16:50,563 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 490751923, now seen corresponding path program 3 times [2024-10-11 21:16:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095767196] [2024-10-11 21:16:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:50,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:16:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:16:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:16:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 21:16:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:16:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:16:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 2489 trivial. 0 not checked. [2024-10-11 21:16:51,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095767196] [2024-10-11 21:16:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095767196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:51,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748282210] [2024-10-11 21:16:51,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:16:51,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:51,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:51,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:51,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:16:51,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 21:16:51,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:51,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 21:16:51,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:51,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 21:16:52,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 21:16:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 1361 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2024-10-11 21:16:52,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:16:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748282210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:16:52,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2024-10-11 21:16:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216313537] [2024-10-11 21:16:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:16:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:52,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:16:52,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 21:16:52,115 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 21:16:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:52,216 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-10-11 21:16:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:16:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 297 [2024-10-11 21:16:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:52,218 INFO L225 Difference]: With dead ends: 82 [2024-10-11 21:16:52,218 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 21:16:52,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-10-11 21:16:52,218 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 31 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:52,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 157 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:16:52,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 21:16:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-10-11 21:16:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 9 states have call predecessors, (11), 15 states have return successors, (20), 15 states have call predecessors, (20), 9 states have call successors, (20) [2024-10-11 21:16:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-10-11 21:16:52,231 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 297 [2024-10-11 21:16:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:52,231 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-10-11 21:16:52,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 21:16:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-10-11 21:16:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-11 21:16:52,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:52,234 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:52,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:52,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:52,438 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-11 21:16:52,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1966559532, now seen corresponding path program 1 times [2024-10-11 21:16:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:52,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233721445] [2024-10-11 21:16:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:52,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:16:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:52,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:16:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:16:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 21:16:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:16:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 21:16:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:16:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:16:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:16:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 29 proven. 59 refuted. 0 times theorem prover too weak. 2490 trivial. 0 not checked. [2024-10-11 21:16:53,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233721445] [2024-10-11 21:16:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233721445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389989902] [2024-10-11 21:16:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:53,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:53,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:53,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:53,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:16:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:53,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:16:53,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:53,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 21:16:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 1361 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2024-10-11 21:16:53,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:16:53,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389989902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:53,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:16:53,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-10-11 21:16:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038801226] [2024-10-11 21:16:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:16:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:16:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:16:53,899 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 21:16:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:53,960 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2024-10-11 21:16:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:16:53,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 298 [2024-10-11 21:16:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:53,961 INFO L225 Difference]: With dead ends: 84 [2024-10-11 21:16:53,961 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:16:53,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-11 21:16:53,962 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:53,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 152 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:16:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:16:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:16:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:16:53,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 298 [2024-10-11 21:16:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:53,963 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:16:53,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 21:16:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:16:53,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:16:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-11 21:16:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-11 21:16:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-11 21:16:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-11 21:16:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-11 21:16:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-11 21:16:53,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-11 21:16:53,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-11 21:16:53,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-11 21:16:53,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-11 21:16:53,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:54,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:54,172 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:54,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:17:18,726 WARN L286 SmtUtils]: Spent 24.13s on a formula simplification. DAG size of input: 91 DAG size of output: 70 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)