./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:37:31,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:37:31,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:37:31,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:37:31,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:37:31,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:37:31,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:37:31,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:37:31,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:37:31,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:37:31,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:37:31,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:37:31,415 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:37:31,415 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:37:31,415 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:37:31,417 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:37:31,417 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:37:31,418 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:37:31,418 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:37:31,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:37:31,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:37:31,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:37:31,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:37:31,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:37:31,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:37:31,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:37:31,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:37:31,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:37:31,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:37:31,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:37:31,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:37:31,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:37:31,424 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:37:31,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:37:31,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:37:31,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:37:31,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:37:31,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:37:31,427 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:37:31,427 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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/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/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(F end) ) 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 -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a [2024-10-25 00:37:31,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:37:31,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:37:31,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:37:31,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:37:31,738 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:37:31,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2024-10-25 00:37:33,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:37:33,433 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:37:33,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2024-10-25 00:37:33,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb884e27/68de26dcab014c6086e40799c40ea1c0/FLAG4b4aac780 [2024-10-25 00:37:33,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb884e27/68de26dcab014c6086e40799c40ea1c0 [2024-10-25 00:37:33,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:37:33,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:37:33,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:33,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:37:33,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:37:33,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3711e5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33, skipping insertion in model container [2024-10-25 00:37:33,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:37:33,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:33,731 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:37:33,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:33,781 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:37:33,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33 WrapperNode [2024-10-25 00:37:33,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:33,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:33,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:37:33,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:37:33,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,829 INFO L138 Inliner]: procedures = 16, calls = 72, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-10-25 00:37:33,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:33,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:37:33,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:37:33,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:37:33,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,870 INFO L175 MemorySlicer]: Split 38 memory accesses to 7 slices as follows [2, 5, 7, 6, 6, 6, 6]. 18 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 11 writes are split as follows [0, 2, 1, 2, 2, 2, 2]. [2024-10-25 00:37:33,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:37:33,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:37:33,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:37:33,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:37:33,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (1/1) ... [2024-10-25 00:37:33,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:37:33,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:33,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:37:33,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-25 00:37:33,997 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2024-10-25 00:37:33,997 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2024-10-25 00:37:33,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:37:33,998 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2024-10-25 00:37:33,998 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2024-10-25 00:37:33,998 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2024-10-25 00:37:33,998 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2024-10-25 00:37:33,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:37:33,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-25 00:37:33,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-25 00:37:33,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-25 00:37:33,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-25 00:37:33,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-25 00:37:33,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-25 00:37:34,001 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2024-10-25 00:37:34,001 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2024-10-25 00:37:34,001 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2024-10-25 00:37:34,001 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2024-10-25 00:37:34,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 00:37:34,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-25 00:37:34,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-25 00:37:34,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-25 00:37:34,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-25 00:37:34,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-25 00:37:34,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-25 00:37:34,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-25 00:37:34,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:37:34,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:37:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-25 00:37:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-25 00:37:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-25 00:37:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-25 00:37:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-25 00:37:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-25 00:37:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-25 00:37:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:37:34,153 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:37:34,157 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:37:34,528 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-25 00:37:34,532 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:37:34,552 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:37:34,554 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-25 00:37:34,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:34 BoogieIcfgContainer [2024-10-25 00:37:34,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:37:34,555 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:37:34,555 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:37:34,559 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:37:34,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:34,560 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:37:33" (1/3) ... [2024-10-25 00:37:34,561 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f2007b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:34, skipping insertion in model container [2024-10-25 00:37:34,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:34,561 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:33" (2/3) ... [2024-10-25 00:37:34,561 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f2007b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:34, skipping insertion in model container [2024-10-25 00:37:34,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:34,562 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:34" (3/3) ... [2024-10-25 00:37:34,563 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_deep-nested.c [2024-10-25 00:37:34,616 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:37:34,616 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:37:34,617 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:37:34,617 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:37:34,617 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:37:34,617 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:37:34,617 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:37:34,617 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:37:34,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 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-25 00:37:34,642 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-25 00:37:34,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:34,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:34,650 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:34,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:34,652 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:37:34,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 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-25 00:37:34,656 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-25 00:37:34,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:34,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:34,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:34,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:34,664 INFO L745 eck$LassoCheckResult]: Stem: 20#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#2(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 19#L139true call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 35#$Ultimate##0true [2024-10-25 00:37:34,665 INFO L747 eck$LassoCheckResult]: Loop: 35#$Ultimate##0true ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#1(~a.base, ~a.offset, 4);call #t~mem34 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 17#L110true assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#6(0, ~b.base, ~b.offset, 4); 42#L116true call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 30#$Ultimate##0true ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 24#L90true assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 22#L90-1true assume true; 25#func_to_recursive_line_11_to_12_0EXITtrue >#112#return; 51#L116-1true call #t~mem36 := read~int#1(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#1(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 18#L121true call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 35#$Ultimate##0true [2024-10-25 00:37:34,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 1 times [2024-10-25 00:37:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269298003] [2024-10-25 00:37:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:34,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:34,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:34,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 376946881, now seen corresponding path program 1 times [2024-10-25 00:37:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:34,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278170420] [2024-10-25 00:37:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:35,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:35,731 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-25 00:37:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278170420] [2024-10-25 00:37:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278170420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:35,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:35,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-25 00:37:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456670437] [2024-10-25 00:37:35,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:35,739 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:35,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:37:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:37:35,778 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 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, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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-25 00:37:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:36,243 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-10-25 00:37:36,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-10-25 00:37:36,251 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-25 00:37:36,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 66 transitions. [2024-10-25 00:37:36,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-10-25 00:37:36,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-10-25 00:37:36,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2024-10-25 00:37:36,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:36,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-10-25 00:37:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2024-10-25 00:37:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-25 00:37:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-25 00:37:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-10-25 00:37:36,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-10-25 00:37:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:37:36,300 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-10-25 00:37:36,301 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:37:36,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2024-10-25 00:37:36,304 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-25 00:37:36,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:36,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:36,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:36,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:36,307 INFO L745 eck$LassoCheckResult]: Stem: 171#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#2(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 149#L139 call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 153#$Ultimate##0 [2024-10-25 00:37:36,308 INFO L747 eck$LassoCheckResult]: Loop: 153#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#1(~a.base, ~a.offset, 4);call #t~mem34 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 155#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#6(0, ~b.base, ~b.offset, 4); 140#L116 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 138#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 141#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#5(0, ~c.base, ~c.offset, 4); 160#L96 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 164#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 165#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 162#L70-1 assume true; 158#func_to_recursive_line_12_to_13_0EXIT >#106#return; 161#L96-1 call #t~mem32 := read~int#6(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#6(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 139#L101 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 138#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 141#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 172#L90-1 assume true; 173#func_to_recursive_line_11_to_12_0EXIT >#108#return; 174#L90-1 assume true; 176#func_to_recursive_line_11_to_12_0EXIT >#112#return; 175#L116-1 call #t~mem36 := read~int#1(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#1(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 154#L121 call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 153#$Ultimate##0 [2024-10-25 00:37:36,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 2 times [2024-10-25 00:37:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:36,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348825904] [2024-10-25 00:37:36,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:36,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:36,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:36,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:36,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1072601781, now seen corresponding path program 1 times [2024-10-25 00:37:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:36,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993796510] [2024-10-25 00:37:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:37,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 00:37:37,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993796510] [2024-10-25 00:37:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993796510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:37,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285396898] [2024-10-25 00:37:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:37,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:37,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:37,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:37:37,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-25 00:37:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:37,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-25 00:37:37,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:37,544 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-25 00:37:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:37:37,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 00:37:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285396898] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:38,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 25 [2024-10-25 00:37:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712349637] [2024-10-25 00:37:38,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:38,577 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:38,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-25 00:37:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-10-25 00:37:38,579 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. cyclomatic complexity: 17 Second operand has 25 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 8 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-25 00:37:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:39,494 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2024-10-25 00:37:39,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2024-10-25 00:37:39,496 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-25 00:37:39,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 65 transitions. [2024-10-25 00:37:39,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-10-25 00:37:39,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-10-25 00:37:39,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 65 transitions. [2024-10-25 00:37:39,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:39,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-10-25 00:37:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 65 transitions. [2024-10-25 00:37:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-10-25 00:37:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-25 00:37:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-10-25 00:37:39,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-10-25 00:37:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-25 00:37:39,511 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-10-25 00:37:39,513 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:37:39,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2024-10-25 00:37:39,514 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-25 00:37:39,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:39,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:39,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:39,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [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] [2024-10-25 00:37:39,518 INFO L745 eck$LassoCheckResult]: Stem: 451#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 427#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#2(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 428#L139 call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 432#$Ultimate##0 [2024-10-25 00:37:39,518 INFO L747 eck$LassoCheckResult]: Loop: 432#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#1(~a.base, ~a.offset, 4);call #t~mem34 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 434#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#6(0, ~b.base, ~b.offset, 4); 422#L116 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 424#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#5(0, ~c.base, ~c.offset, 4); 438#L96 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 443#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 444#L70 assume #t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296;havoc #t~mem27;havoc #t~mem26;call write~int#4(0, ~d.base, ~d.offset, 4); 417#L76 call func_to_recursive_line_13_to_14_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 429#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem23 := read~int#4(~d.base, ~d.offset, 4);call #t~mem22 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 450#L50 assume !(#t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296);havoc #t~mem23;havoc #t~mem22; 420#L50-1 assume true; 416#func_to_recursive_line_13_to_14_0EXIT >#98#return; 419#L76-1 call #t~mem28 := read~int#5(~c.base, ~c.offset, 4);#t~pre29 := 1 + #t~mem28;call write~int#5(1 + #t~mem28, ~c.base, ~c.offset, 4);havoc #t~mem28;havoc #t~pre29; 439#L81 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 443#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 444#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 445#L70-1 assume true; 437#func_to_recursive_line_12_to_13_0EXIT >#100#return; 440#L70-1 assume true; 442#func_to_recursive_line_12_to_13_0EXIT >#106#return; 441#L96-1 call #t~mem32 := read~int#6(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#6(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 423#L101 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 424#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 452#L90-1 assume true; 453#func_to_recursive_line_11_to_12_0EXIT >#108#return; 454#L90-1 assume true; 456#func_to_recursive_line_11_to_12_0EXIT >#112#return; 455#L116-1 call #t~mem36 := read~int#1(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#1(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 433#L121 call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 432#$Ultimate##0 [2024-10-25 00:37:39,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 3 times [2024-10-25 00:37:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298216914] [2024-10-25 00:37:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:39,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:39,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2046612426, now seen corresponding path program 1 times [2024-10-25 00:37:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814328202] [2024-10-25 00:37:39,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:39,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:40,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:40,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:40,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-25 00:37:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 00:37:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814328202] [2024-10-25 00:37:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814328202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747271001] [2024-10-25 00:37:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:40,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:40,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:40,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:37:40,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-25 00:37:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:40,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-25 00:37:40,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:40,844 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-25 00:37:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:37:41,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-25 00:37:41,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747271001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:41,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-25 00:37:41,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-10-25 00:37:41,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637253434] [2024-10-25 00:37:41,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:41,023 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:41,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-25 00:37:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-25 00:37:41,025 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. cyclomatic complexity: 17 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-25 00:37:53,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-25 00:37:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:53,380 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2024-10-25 00:37:53,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 85 transitions. [2024-10-25 00:37:53,383 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 44 [2024-10-25 00:37:53,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 83 transitions. [2024-10-25 00:37:53,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2024-10-25 00:37:53,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-10-25 00:37:53,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 83 transitions. [2024-10-25 00:37:53,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:53,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-10-25 00:37:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 83 transitions. [2024-10-25 00:37:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2024-10-25 00:37:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-25 00:37:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-10-25 00:37:53,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-10-25 00:37:53,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 00:37:53,402 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-10-25 00:37:53,402 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:37:53,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 61 transitions. [2024-10-25 00:37:53,403 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-25 00:37:53,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:53,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:53,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:53,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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, 1, 1, 1, 1] [2024-10-25 00:37:53,407 INFO L745 eck$LassoCheckResult]: Stem: 726#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 702#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#2(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 703#L139 call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 708#$Ultimate##0 [2024-10-25 00:37:53,407 INFO L747 eck$LassoCheckResult]: Loop: 708#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#1(~a.base, ~a.offset, 4);call #t~mem34 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 710#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#6(0, ~b.base, ~b.offset, 4); 698#L116 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 696#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 699#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#5(0, ~c.base, ~c.offset, 4); 714#L96 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 718#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 719#L70 assume #t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296;havoc #t~mem27;havoc #t~mem26;call write~int#4(0, ~d.base, ~d.offset, 4); 693#L76 call func_to_recursive_line_13_to_14_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 722#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem23 := read~int#4(~d.base, ~d.offset, 4);call #t~mem22 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 725#L50 assume #t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296;havoc #t~mem23;havoc #t~mem22;call write~int#3(0, ~e.base, ~e.offset, 4); 686#L56 call func_to_recursive_line_14_to_16_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 706#$Ultimate##0 ~uint32_max#1.base, ~uint32_max#1.offset := #in~uint32_max#1.base, #in~uint32_max#1.offset;~c#1.base, ~c#1.offset := #in~c#1.base, #in~c#1.offset;~b#1.base, ~b#1.offset := #in~b#1.base, #in~b#1.offset;~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~e#1.base, ~e#1.offset := #in~e#1.base, #in~e#1.offset;~d#1.base, ~d#1.offset := #in~d#1.base, #in~d#1.offset;call #t~mem5#1 := read~int#3(~e#1.base, ~e#1.offset, 4);call #t~mem4#1 := read~int#2(~uint32_max#1.base, ~uint32_max#1.offset, 4); 707#L25 assume !(#t~mem5#1 % 4294967296 < (#t~mem4#1 - 1) % 4294967296);havoc #t~mem5#1;havoc #t~mem4#1; 721#L25-1 assume true; 723#func_to_recursive_line_14_to_16_0EXIT >#102#return; 724#L56-1 call #t~mem24 := read~int#4(~d.base, ~d.offset, 4);#t~pre25 := 1 + #t~mem24;call write~int#4(1 + #t~mem24, ~d.base, ~d.offset, 4);havoc #t~mem24;havoc #t~pre25; 692#L61 call func_to_recursive_line_13_to_14_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 704#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem23 := read~int#4(~d.base, ~d.offset, 4);call #t~mem22 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 733#L50 assume !(#t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296);havoc #t~mem23;havoc #t~mem22; 695#L50-1 assume true; 691#func_to_recursive_line_13_to_14_0EXIT >#104#return; 695#L50-1 assume true; 691#func_to_recursive_line_13_to_14_0EXIT >#98#return; 694#L76-1 call #t~mem28 := read~int#5(~c.base, ~c.offset, 4);#t~pre29 := 1 + #t~mem28;call write~int#5(1 + #t~mem28, ~c.base, ~c.offset, 4);havoc #t~mem28;havoc #t~pre29; 713#L81 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 718#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 719#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 717#L70-1 assume true; 712#func_to_recursive_line_12_to_13_0EXIT >#100#return; 715#L70-1 assume true; 731#func_to_recursive_line_12_to_13_0EXIT >#106#return; 716#L96-1 call #t~mem32 := read~int#6(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#6(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 697#L101 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 696#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 699#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 727#L90-1 assume true; 728#func_to_recursive_line_11_to_12_0EXIT >#108#return; 729#L90-1 assume true; 732#func_to_recursive_line_11_to_12_0EXIT >#112#return; 730#L116-1 call #t~mem36 := read~int#1(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#1(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 709#L121 call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 708#$Ultimate##0 [2024-10-25 00:37:53,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 4 times [2024-10-25 00:37:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844296071] [2024-10-25 00:37:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:53,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1754161005, now seen corresponding path program 1 times [2024-10-25 00:37:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:53,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709199495] [2024-10-25 00:37:53,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-25 00:37:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-25 00:37:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-25 00:37:54,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709199495] [2024-10-25 00:37:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709199495] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650077481] [2024-10-25 00:37:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:54,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:54,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:54,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:37:54,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-25 00:37:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:54,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-25 00:37:54,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:54,976 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-25 00:37:55,226 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-25 00:37:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:37:56,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650077481] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:57,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-25 00:37:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2024-10-25 00:37:57,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986245979] [2024-10-25 00:37:57,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:57,151 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-25 00:37:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2024-10-25 00:37:57,152 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. cyclomatic complexity: 17 Second operand has 28 states, 25 states have (on average 2.04) internal successors, (51), 21 states have internal predecessors, (51), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-25 00:37:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:58,456 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-10-25 00:37:58,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2024-10-25 00:37:58,458 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-25 00:37:58,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 65 transitions. [2024-10-25 00:37:58,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-10-25 00:37:58,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-10-25 00:37:58,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 65 transitions. [2024-10-25 00:37:58,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:58,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-10-25 00:37:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 65 transitions. [2024-10-25 00:37:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-25 00:37:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 38 states have internal predecessors, (43), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-25 00:37:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-10-25 00:37:58,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-10-25 00:37:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-25 00:37:58,473 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-10-25 00:37:58,473 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:37:58,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2024-10-25 00:37:58,474 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-25 00:37:58,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:58,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:58,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:58,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:58,476 INFO L745 eck$LassoCheckResult]: Stem: 1159#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 1130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#2(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1131#L139 call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1136#$Ultimate##0 [2024-10-25 00:37:58,476 INFO L747 eck$LassoCheckResult]: Loop: 1136#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#1(~a.base, ~a.offset, 4);call #t~mem34 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1138#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#6(0, ~b.base, ~b.offset, 4); 1123#L116 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1122#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1125#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#5(0, ~c.base, ~c.offset, 4); 1143#L96 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1147#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1149#L70 assume #t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296;havoc #t~mem27;havoc #t~mem26;call write~int#4(0, ~d.base, ~d.offset, 4); 1133#L76 call func_to_recursive_line_13_to_14_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1153#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem23 := read~int#4(~d.base, ~d.offset, 4);call #t~mem22 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1160#L50 assume #t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296;havoc #t~mem23;havoc #t~mem22;call write~int#3(0, ~e.base, ~e.offset, 4); 1118#L56 call func_to_recursive_line_14_to_16_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1139#$Ultimate##0 ~uint32_max#1.base, ~uint32_max#1.offset := #in~uint32_max#1.base, #in~uint32_max#1.offset;~c#1.base, ~c#1.offset := #in~c#1.base, #in~c#1.offset;~b#1.base, ~b#1.offset := #in~b#1.base, #in~b#1.offset;~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~e#1.base, ~e#1.offset := #in~e#1.base, #in~e#1.offset;~d#1.base, ~d#1.offset := #in~d#1.base, #in~d#1.offset;call #t~mem5#1 := read~int#3(~e#1.base, ~e#1.offset, 4);call #t~mem4#1 := read~int#2(~uint32_max#1.base, ~uint32_max#1.offset, 4); 1140#L25 assume #t~mem5#1 % 4294967296 < (#t~mem4#1 - 1) % 4294967296;havoc #t~mem5#1;havoc #t~mem4#1;call #t~mem6#1 := read~int#1(~a#1.base, ~a#1.offset, 4);call #t~mem7#1 := read~int#6(~b#1.base, ~b#1.offset, 4);#t~short10#1 := #t~mem6#1 % 4294967296 == #t~mem7#1 % 4294967296; 1151#L29 assume !#t~short10#1; 1116#L29-2 #t~short13#1 := #t~short10#1; 1119#L29-3 assume #t~short13#1;call #t~mem11#1 := read~int#5(~c#1.base, ~c#1.offset, 4);call #t~mem12#1 := read~int#4(~d#1.base, ~d#1.offset, 4);#t~short13#1 := #t~mem11#1 % 4294967296 == #t~mem12#1 % 4294967296; 1145#L29-5 #t~short16#1 := #t~short13#1; 1120#L29-6 assume !#t~short16#1; 1121#L29-8 #t~short19#1 := #t~short16#1; 1132#L29-9 assume !#t~short19#1; 1135#L29-11 assume !#t~short19#1;havoc #t~mem6#1;havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~short10#1;havoc #t~mem11#1;havoc #t~mem12#1;havoc #t~short13#1;havoc #t~mem14#1;havoc #t~mem15#1;havoc #t~short16#1;havoc #t~mem18#1;havoc #t~mem17#1;havoc #t~short19#1; 1129#L29-13 call #t~mem20#1 := read~int#3(~e#1.base, ~e#1.offset, 4);#t~pre21#1 := 1 + #t~mem20#1;call write~int#3(1 + #t~mem20#1, ~e#1.base, ~e#1.offset, 4);havoc #t~mem20#1;havoc #t~pre21#1; 1117#L41 call func_to_recursive_line_14_to_16_0(~uint32_max#1.base, ~uint32_max#1.offset, ~c#1.base, ~c#1.offset, ~b#1.base, ~b#1.offset, ~a#1.base, ~a#1.offset, ~e#1.base, ~e#1.offset, ~d#1.base, ~d#1.offset);< 1139#$Ultimate##0 ~uint32_max#1.base, ~uint32_max#1.offset := #in~uint32_max#1.base, #in~uint32_max#1.offset;~c#1.base, ~c#1.offset := #in~c#1.base, #in~c#1.offset;~b#1.base, ~b#1.offset := #in~b#1.base, #in~b#1.offset;~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~e#1.base, ~e#1.offset := #in~e#1.base, #in~e#1.offset;~d#1.base, ~d#1.offset := #in~d#1.base, #in~d#1.offset;call #t~mem5#1 := read~int#3(~e#1.base, ~e#1.offset, 4);call #t~mem4#1 := read~int#2(~uint32_max#1.base, ~uint32_max#1.offset, 4); 1140#L25 assume !(#t~mem5#1 % 4294967296 < (#t~mem4#1 - 1) % 4294967296);havoc #t~mem5#1;havoc #t~mem4#1; 1152#L25-1 assume true; 1154#func_to_recursive_line_14_to_16_0EXIT >#110#return; 1155#L25-1 assume true; 1168#func_to_recursive_line_14_to_16_0EXIT >#102#return; 1158#L56-1 call #t~mem24 := read~int#4(~d.base, ~d.offset, 4);#t~pre25 := 1 + #t~mem24;call write~int#4(1 + #t~mem24, ~d.base, ~d.offset, 4);havoc #t~mem24;havoc #t~pre25; 1127#L61 call func_to_recursive_line_13_to_14_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1134#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem23 := read~int#4(~d.base, ~d.offset, 4);call #t~mem22 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1157#L50 assume !(#t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296);havoc #t~mem23;havoc #t~mem22; 1156#L50-1 assume true; 1126#func_to_recursive_line_13_to_14_0EXIT >#104#return; 1128#L50-1 assume true; 1167#func_to_recursive_line_13_to_14_0EXIT >#98#return; 1150#L76-1 call #t~mem28 := read~int#5(~c.base, ~c.offset, 4);#t~pre29 := 1 + #t~mem28;call write~int#5(1 + #t~mem28, ~c.base, ~c.offset, 4);havoc #t~mem28;havoc #t~pre29; 1142#L81 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1147#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1149#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 1148#L70-1 assume true; 1141#func_to_recursive_line_12_to_13_0EXIT >#100#return; 1144#L70-1 assume true; 1166#func_to_recursive_line_12_to_13_0EXIT >#106#return; 1146#L96-1 call #t~mem32 := read~int#6(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#6(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 1124#L101 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1122#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1125#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 1161#L90-1 assume true; 1162#func_to_recursive_line_11_to_12_0EXIT >#108#return; 1163#L90-1 assume true; 1165#func_to_recursive_line_11_to_12_0EXIT >#112#return; 1164#L116-1 call #t~mem36 := read~int#1(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#1(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 1137#L121 call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1136#$Ultimate##0 [2024-10-25 00:37:58,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 5 times [2024-10-25 00:37:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:58,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044775715] [2024-10-25 00:37:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:58,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:58,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:58,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash 198549804, now seen corresponding path program 1 times [2024-10-25 00:37:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269105555] [2024-10-25 00:37:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:58,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-25 00:37:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-25 00:37:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:37:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-25 00:37:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-25 00:37:58,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269105555] [2024-10-25 00:37:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269105555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:58,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:58,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-25 00:37:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031045500] [2024-10-25 00:37:58,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:58,877 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-25 00:37:58,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-25 00:37:58,879 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. cyclomatic complexity: 17 Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-25 00:37:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:59,135 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-10-25 00:37:59,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2024-10-25 00:37:59,136 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2024-10-25 00:37:59,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 68 transitions. [2024-10-25 00:37:59,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-10-25 00:37:59,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-10-25 00:37:59,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 68 transitions. [2024-10-25 00:37:59,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:59,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 68 transitions. [2024-10-25 00:37:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 68 transitions. [2024-10-25 00:37:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-25 00:37:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-25 00:37:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2024-10-25 00:37:59,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 67 transitions. [2024-10-25 00:37:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 00:37:59,151 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2024-10-25 00:37:59,152 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:37:59,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 67 transitions. [2024-10-25 00:37:59,154 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 34 [2024-10-25 00:37:59,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:59,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:59,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:59,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:59,158 INFO L745 eck$LassoCheckResult]: Stem: 1439#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 1408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#2(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1409#L139 call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1414#$Ultimate##0 [2024-10-25 00:37:59,158 INFO L747 eck$LassoCheckResult]: Loop: 1414#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#1(~a.base, ~a.offset, 4);call #t~mem34 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1416#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#6(0, ~b.base, ~b.offset, 4); 1401#L116 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1400#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1403#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#5(0, ~c.base, ~c.offset, 4); 1421#L96 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1425#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1427#L70 assume #t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296;havoc #t~mem27;havoc #t~mem26;call write~int#4(0, ~d.base, ~d.offset, 4); 1411#L76 call func_to_recursive_line_13_to_14_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1431#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem23 := read~int#4(~d.base, ~d.offset, 4);call #t~mem22 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1435#L50 assume #t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296;havoc #t~mem23;havoc #t~mem22;call write~int#3(0, ~e.base, ~e.offset, 4); 1395#L56 call func_to_recursive_line_14_to_16_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1417#$Ultimate##0 ~uint32_max#1.base, ~uint32_max#1.offset := #in~uint32_max#1.base, #in~uint32_max#1.offset;~c#1.base, ~c#1.offset := #in~c#1.base, #in~c#1.offset;~b#1.base, ~b#1.offset := #in~b#1.base, #in~b#1.offset;~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~e#1.base, ~e#1.offset := #in~e#1.base, #in~e#1.offset;~d#1.base, ~d#1.offset := #in~d#1.base, #in~d#1.offset;call #t~mem5#1 := read~int#3(~e#1.base, ~e#1.offset, 4);call #t~mem4#1 := read~int#2(~uint32_max#1.base, ~uint32_max#1.offset, 4); 1418#L25 assume #t~mem5#1 % 4294967296 < (#t~mem4#1 - 1) % 4294967296;havoc #t~mem5#1;havoc #t~mem4#1;call #t~mem6#1 := read~int#1(~a#1.base, ~a#1.offset, 4);call #t~mem7#1 := read~int#6(~b#1.base, ~b#1.offset, 4);#t~short10#1 := #t~mem6#1 % 4294967296 == #t~mem7#1 % 4294967296; 1429#L29 assume #t~short10#1;call #t~mem8#1 := read~int#6(~b#1.base, ~b#1.offset, 4);call #t~mem9#1 := read~int#5(~c#1.base, ~c#1.offset, 4);#t~short10#1 := #t~mem8#1 % 4294967296 == #t~mem9#1 % 4294967296; 1394#L29-2 #t~short13#1 := #t~short10#1; 1397#L29-3 assume #t~short13#1;call #t~mem11#1 := read~int#5(~c#1.base, ~c#1.offset, 4);call #t~mem12#1 := read~int#4(~d#1.base, ~d#1.offset, 4);#t~short13#1 := #t~mem11#1 % 4294967296 == #t~mem12#1 % 4294967296; 1423#L29-5 #t~short16#1 := #t~short13#1; 1398#L29-6 assume !#t~short16#1; 1399#L29-8 #t~short19#1 := #t~short16#1; 1410#L29-9 assume !#t~short19#1; 1413#L29-11 assume !#t~short19#1;havoc #t~mem6#1;havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~short10#1;havoc #t~mem11#1;havoc #t~mem12#1;havoc #t~short13#1;havoc #t~mem14#1;havoc #t~mem15#1;havoc #t~short16#1;havoc #t~mem18#1;havoc #t~mem17#1;havoc #t~short19#1; 1407#L29-13 call #t~mem20#1 := read~int#3(~e#1.base, ~e#1.offset, 4);#t~pre21#1 := 1 + #t~mem20#1;call write~int#3(1 + #t~mem20#1, ~e#1.base, ~e#1.offset, 4);havoc #t~mem20#1;havoc #t~pre21#1; 1396#L41 call func_to_recursive_line_14_to_16_0(~uint32_max#1.base, ~uint32_max#1.offset, ~c#1.base, ~c#1.offset, ~b#1.base, ~b#1.offset, ~a#1.base, ~a#1.offset, ~e#1.base, ~e#1.offset, ~d#1.base, ~d#1.offset);< 1417#$Ultimate##0 ~uint32_max#1.base, ~uint32_max#1.offset := #in~uint32_max#1.base, #in~uint32_max#1.offset;~c#1.base, ~c#1.offset := #in~c#1.base, #in~c#1.offset;~b#1.base, ~b#1.offset := #in~b#1.base, #in~b#1.offset;~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~e#1.base, ~e#1.offset := #in~e#1.base, #in~e#1.offset;~d#1.base, ~d#1.offset := #in~d#1.base, #in~d#1.offset;call #t~mem5#1 := read~int#3(~e#1.base, ~e#1.offset, 4);call #t~mem4#1 := read~int#2(~uint32_max#1.base, ~uint32_max#1.offset, 4); 1418#L25 assume !(#t~mem5#1 % 4294967296 < (#t~mem4#1 - 1) % 4294967296);havoc #t~mem5#1;havoc #t~mem4#1; 1430#L25-1 assume true; 1432#func_to_recursive_line_14_to_16_0EXIT >#110#return; 1433#L25-1 assume true; 1448#func_to_recursive_line_14_to_16_0EXIT >#102#return; 1436#L56-1 call #t~mem24 := read~int#4(~d.base, ~d.offset, 4);#t~pre25 := 1 + #t~mem24;call write~int#4(1 + #t~mem24, ~d.base, ~d.offset, 4);havoc #t~mem24;havoc #t~pre25; 1405#L61 call func_to_recursive_line_13_to_14_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1412#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem23 := read~int#4(~d.base, ~d.offset, 4);call #t~mem22 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1447#L50 assume !(#t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296);havoc #t~mem23;havoc #t~mem22; 1446#L50-1 assume true; 1404#func_to_recursive_line_13_to_14_0EXIT >#104#return; 1406#L50-1 assume true; 1434#func_to_recursive_line_13_to_14_0EXIT >#98#return; 1428#L76-1 call #t~mem28 := read~int#5(~c.base, ~c.offset, 4);#t~pre29 := 1 + #t~mem28;call write~int#5(1 + #t~mem28, ~c.base, ~c.offset, 4);havoc #t~mem28;havoc #t~pre29; 1420#L81 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1425#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1427#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 1426#L70-1 assume true; 1419#func_to_recursive_line_12_to_13_0EXIT >#100#return; 1422#L70-1 assume true; 1445#func_to_recursive_line_12_to_13_0EXIT >#106#return; 1424#L96-1 call #t~mem32 := read~int#6(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#6(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 1402#L101 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1400#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#6(~b.base, ~b.offset, 4);call #t~mem30 := read~int#2(~uint32_max.base, ~uint32_max.offset, 4); 1403#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 1440#L90-1 assume true; 1441#func_to_recursive_line_11_to_12_0EXIT >#108#return; 1442#L90-1 assume true; 1444#func_to_recursive_line_11_to_12_0EXIT >#112#return; 1443#L116-1 call #t~mem36 := read~int#1(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#1(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 1415#L121 call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1414#$Ultimate##0 [2024-10-25 00:37:59,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 6 times [2024-10-25 00:37:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:59,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048798741] [2024-10-25 00:37:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:59,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:59,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:59,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash -49596690, now seen corresponding path program 1 times [2024-10-25 00:37:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196542501] [2024-10-25 00:37:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-25 00:38:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-25 00:38:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:29,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-25 00:38:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-25 00:38:29,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196542501] [2024-10-25 00:38:29,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196542501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077825251] [2024-10-25 00:38:29,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:29,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:29,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:29,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-25 00:38:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:29,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-25 00:38:29,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:29,620 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-25 00:38:29,732 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