./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 55885307ad7991ec619705bd65f9ccb0a7f28b4003909403684402b81add0d87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:42:11,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:42:11,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:42:11,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:42:11,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:42:11,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:42:11,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:42:11,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:42:11,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:42:11,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:42:11,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:42:11,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:42:11,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:42:11,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:42:11,993 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:42:11,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:42:11,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:42:11,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:42:11,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:42:11,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:42:11,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:42:11,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:42:11,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:42:11,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:42:11,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:42:11,995 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:42:11,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:42:11,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:42:11,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:42:11,996 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:42:11,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:42:11,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:42:11,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:42:11,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:42:11,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:42:11,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:42:11,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:42:11,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:42:11,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:42:11,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:42:11,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:42:11,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:42:11,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:42:11,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:42:11,998 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/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(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55885307ad7991ec619705bd65f9ccb0a7f28b4003909403684402b81add0d87 [2024-11-10 19:42:12,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:42:12,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:42:12,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:42:12,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:42:12,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:42:12,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_hard.c [2024-11-10 19:42:13,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:42:13,522 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:42:13,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_hard.c [2024-11-10 19:42:13,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44ca6de0/67473f2e76124bc0b101228482545e10/FLAG841548015 [2024-11-10 19:42:13,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44ca6de0/67473f2e76124bc0b101228482545e10 [2024-11-10 19:42:13,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:42:13,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:42:13,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:42:13,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:42:13,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:42:13,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603bd0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13, skipping insertion in model container [2024-11-10 19:42:13,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:42:13,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:42:13,742 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:42:13,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:42:13,775 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:42:13,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13 WrapperNode [2024-11-10 19:42:13,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:42:13,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:42:13,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:42:13,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:42:13,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,803 INFO L138 Inliner]: procedures = 17, calls = 92, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-11-10 19:42:13,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:42:13,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:42:13,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:42:13,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:42:13,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,828 INFO L175 MemorySlicer]: Split 56 memory accesses to 8 slices as follows [2, 7, 12, 8, 7, 9, 6, 5]. 21 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0, 0, 0, 0, 0]. The 12 writes are split as follows [0, 0, 3, 2, 1, 3, 2, 1]. [2024-11-10 19:42:13,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:42:13,842 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:42:13,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:42:13,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:42:13,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (1/1) ... [2024-11-10 19:42:13,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:42:13,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:42:13,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:42:13,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:42:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:42:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:42:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 19:42:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 19:42:13,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 19:42:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 19:42:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 19:42:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 19:42:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-10 19:42:13,912 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_41_to_51_0 [2024-11-10 19:42:13,913 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_41_to_51_0 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_38_0 [2024-11-10 19:42:13,914 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_38_0 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-10 19:42:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:42:13,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:42:13,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:42:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 19:42:14,008 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:42:14,009 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:42:14,307 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset;call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset);havoc main_~#r~0#1.base, main_~#r~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#p~0#1.base, main_~#p~0#1.offset);havoc main_~#p~0#1.base, main_~#p~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset; [2024-11-10 19:42:14,341 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-10 19:42:14,341 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:42:14,356 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:42:14,357 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:42:14,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:42:14 BoogieIcfgContainer [2024-11-10 19:42:14,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:42:14,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:42:14,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:42:14,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:42:14,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:42:13" (1/3) ... [2024-11-10 19:42:14,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396b44e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:42:14, skipping insertion in model container [2024-11-10 19:42:14,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:42:13" (2/3) ... [2024-11-10 19:42:14,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396b44e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:42:14, skipping insertion in model container [2024-11-10 19:42:14,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:42:14" (3/3) ... [2024-11-10 19:42:14,366 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_hard.c [2024-11-10 19:42:14,378 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:42:14,378 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-10 19:42:14,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:42:14,433 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3790ecb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:42:14,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-10 19:42:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 86 states have internal predecessors, (91), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 19:42:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 19:42:14,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:42:14,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:42:14,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_41_to_51_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-10 19:42:14,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:42:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1907512644, now seen corresponding path program 1 times [2024-11-10 19:42:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:42:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568928817] [2024-11-10 19:42:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:42:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:42:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:42:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-10 19:42:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:42:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:42:14,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:42:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568928817] [2024-11-10 19:42:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568928817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:42:14,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:42:14,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:42:14,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595130237] [2024-11-10 19:42:14,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:42:14,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:42:14,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:42:14,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:42:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:42:14,662 INFO L87 Difference]: Start difference. First operand has 99 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 86 states have internal predecessors, (91), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 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-11-10 19:42:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:42:14,773 INFO L93 Difference]: Finished difference Result 198 states and 238 transitions. [2024-11-10 19:42:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:42:14,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 19:42:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:42:14,785 INFO L225 Difference]: With dead ends: 198 [2024-11-10 19:42:14,786 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 19:42:14,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:42:14,791 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 44 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:42:14,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 126 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:42:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 19:42:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-10 19:42:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 79 states have internal predecessors, (80), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 19:42:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-11-10 19:42:14,865 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 13 [2024-11-10 19:42:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:42:14,866 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-11-10 19:42:14,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 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-11-10 19:42:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-11-10 19:42:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 19:42:14,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:42:14,868 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:42:14,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:42:14,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_31_to_38_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-10 19:42:14,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:42:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1056307294, now seen corresponding path program 1 times [2024-11-10 19:42:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:42:14,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702417013] [2024-11-10 19:42:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:42:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:42:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:42:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826136832] [2024-11-10 19:42:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:42:14,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:42:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:42:14,945 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-11-10 19:42:14,947 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-11-10 19:42:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:42:15,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 19:42:15,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:42:15,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 19:42:15,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 19:42:15,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 19:42:15,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 19:42:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:42:15,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:42:15,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:42:15,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702417013] [2024-11-10 19:42:15,341 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:42:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826136832] [2024-11-10 19:42:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826136832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:42:15,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:42:15,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 19:42:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874683338] [2024-11-10 19:42:15,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:42:15,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 19:42:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:42:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 19:42:15,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:42:15,343 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:42:19,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:42:23,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:42:27,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:42:31,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:42:35,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:42:39,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:42:43,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:42:47,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:42:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:42:47,613 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2024-11-10 19:42:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 19:42:47,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-10 19:42:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:42:47,616 INFO L225 Difference]: With dead ends: 162 [2024-11-10 19:42:47,616 INFO L226 Difference]: Without dead ends: 161 [2024-11-10 19:42:47,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:42:47,617 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 100 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:42:47,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 583 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 8 Unknown, 0 Unchecked, 32.2s Time] [2024-11-10 19:42:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-10 19:42:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 124. [2024-11-10 19:42:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 104 states have internal predecessors, (114), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-10 19:42:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2024-11-10 19:42:47,631 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 20 [2024-11-10 19:42:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:42:47,631 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2024-11-10 19:42:47,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:42:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2024-11-10 19:42:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 19:42:47,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:42:47,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:42:47,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 19:42:47,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:42:47,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_31_to_38_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-10 19:42:47,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:42:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1614212219, now seen corresponding path program 1 times [2024-11-10 19:42:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:42:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511461549] [2024-11-10 19:42:47,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:42:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:42:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:42:47,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754464727] [2024-11-10 19:42:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:42:47,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:42:47,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:42:47,885 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-11-10 19:42:47,885 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-11-10 19:42:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:42:47,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 19:42:47,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:42:47,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 19:42:47,998 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-11-10 19:42:48,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 19:42:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:42:48,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:42:48,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:42:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511461549] [2024-11-10 19:42:48,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:42:48,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754464727] [2024-11-10 19:42:48,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754464727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:42:48,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:42:48,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:42:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23411414] [2024-11-10 19:42:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:42:48,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:42:48,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:42:48,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:42:48,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:42:48,241 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:42:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:42:48,398 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2024-11-10 19:42:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:42:48,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-10 19:42:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:42:48,400 INFO L225 Difference]: With dead ends: 161 [2024-11-10 19:42:48,400 INFO L226 Difference]: Without dead ends: 160 [2024-11-10 19:42:48,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:42:48,402 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:42:48,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 424 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:42:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-10 19:42:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 124. [2024-11-10 19:42:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 104 states have internal predecessors, (113), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-10 19:42:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2024-11-10 19:42:48,415 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 21 [2024-11-10 19:42:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:42:48,415 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2024-11-10 19:42:48,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:42:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2024-11-10 19:42:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 19:42:48,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:42:48,416 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:42:48,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 19:42:48,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 19:42:48,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_31_to_38_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-10 19:42:48,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:42:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash 15924546, now seen corresponding path program 1 times [2024-11-10 19:42:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:42:48,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744635512] [2024-11-10 19:42:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:42:48,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:42:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:42:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-10 19:42:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:42:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:42:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:42:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 19:42:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:42:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:42:49,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:42:49,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744635512] [2024-11-10 19:42:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744635512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:42:49,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:42:49,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:42:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148959978] [2024-11-10 19:42:49,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:42:49,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:42:49,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:42:49,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:42:49,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:42:49,006 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:42:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:42:49,139 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2024-11-10 19:42:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:42:49,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-10 19:42:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:42:49,142 INFO L225 Difference]: With dead ends: 128 [2024-11-10 19:42:49,142 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 19:42:49,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:42:49,143 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 56 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:42:49,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 422 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:42:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 19:42:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-10 19:42:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.4125) internal successors, (113), 104 states have internal predecessors, (113), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-10 19:42:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2024-11-10 19:42:49,163 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 29 [2024-11-10 19:42:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:42:49,163 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2024-11-10 19:42:49,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:42:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2024-11-10 19:42:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 19:42:49,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:42:49,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:42:49,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:42:49,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_31_to_38_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-10 19:42:49,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:42:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash 493660951, now seen corresponding path program 1 times [2024-11-10 19:42:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:42:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062167749] [2024-11-10 19:42:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:42:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:42:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:42:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581946409] [2024-11-10 19:42:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:42:49,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:42:49,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:42:49,190 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-11-10 19:42:49,192 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-11-10 19:42:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 19:42:49,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 19:42:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 19:42:49,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 19:42:49,322 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 19:42:49,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location func_to_recursive_line_31_to_38_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-11-10 19:42:49,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-11-10 19:42:49,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-11-10 19:42:49,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-11-10 19:42:49,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-11-10 19:42:49,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-11-10 19:42:49,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-11-10 19:42:49,325 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-11-10 19:42:49,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-11-10 19:42:49,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-11-10 19:42:49,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-11-10 19:42:49,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-11-10 19:42:49,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-11-10 19:42:49,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-11-10 19:42:49,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-11-10 19:42:49,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 19:42:49,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:42:49,534 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 19:42:49,568 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:42:49,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:42:49 BoogieIcfgContainer [2024-11-10 19:42:49,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:42:49,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:42:49,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:42:49,571 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:42:49,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:42:14" (3/4) ... [2024-11-10 19:42:49,573 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 19:42:49,615 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:42:49,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:42:49,615 INFO L158 Benchmark]: Toolchain (without parser) took 36067.47ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 79.9MB in the beginning and 141.2MB in the end (delta: -61.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-11-10 19:42:49,615 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:42:49,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.85ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 79.6MB in the beginning and 183.5MB in the end (delta: -103.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-10 19:42:49,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.06ms. Allocated memory is still 213.9MB. Free memory was 183.5MB in the beginning and 181.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:42:49,616 INFO L158 Benchmark]: Boogie Preprocessor took 37.12ms. Allocated memory is still 213.9MB. Free memory was 181.4MB in the beginning and 179.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:42:49,616 INFO L158 Benchmark]: IcfgBuilder took 516.45ms. Allocated memory is still 213.9MB. Free memory was 179.3MB in the beginning and 153.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 19:42:49,616 INFO L158 Benchmark]: TraceAbstraction took 35210.69ms. Allocated memory is still 213.9MB. Free memory was 152.1MB in the beginning and 144.3MB in the end (delta: 7.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-10 19:42:49,616 INFO L158 Benchmark]: Witness Printer took 43.75ms. Allocated memory is still 213.9MB. Free memory was 144.3MB in the beginning and 141.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:42:49,617 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.85ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 79.6MB in the beginning and 183.5MB in the end (delta: -103.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.06ms. Allocated memory is still 213.9MB. Free memory was 183.5MB in the beginning and 181.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.12ms. Allocated memory is still 213.9MB. Free memory was 181.4MB in the beginning and 179.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 516.45ms. Allocated memory is still 213.9MB. Free memory was 179.3MB in the beginning and 153.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 35210.69ms. Allocated memory is still 213.9MB. Free memory was 152.1MB in the beginning and 144.3MB in the end (delta: 7.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Witness Printer took 43.75ms. Allocated memory is still 213.9MB. Free memory was 144.3MB in the beginning and 141.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 98]: integer overflow possible integer overflow possible We found a FailurePath: [L110] int A; [L111] int B; [L112] int r; [L113] int d; [L114] int p; [L115] int q; [L116] A = __VERIFIER_nondet_int() [L117] B = __VERIFIER_nondet_int() [L118] EXPR \read(B) [L118] CALL assume_abort_if_not(B >= 1) [L26] COND FALSE !(!cond) [L118] RET assume_abort_if_not(B >= 1) [L119] EXPR \read(A) [L119] r = A [L120] EXPR \read(B) [L120] d = B [L121] p = 1 [L122] q = 0 [L123] CALL func_to_recursive_line_31_to_38_0(&q, &B, &d, &A, &r, &p) VAL [\old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}] [L85] COND TRUE 1 [L88] EXPR \read(*q) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L88] CALL __VERIFIER_assert((*q) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L88] RET __VERIFIER_assert((*q) == 0) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L89] EXPR \read(*r) [L89] EXPR \read(*A) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L89] CALL __VERIFIER_assert((*r) == (*A)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET __VERIFIER_assert((*r) == (*A)) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L90] EXPR \read(*d) [L90] EXPR \read(*B) [L90] EXPR \read(*p) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L90] EXPR (*B) * (*p) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L90] CALL __VERIFIER_assert((*d) == ((*B) * (*p))) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET __VERIFIER_assert((*d) == ((*B) * (*p))) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L91] EXPR \read(*r) [L91] EXPR \read(*d) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L91] COND FALSE !(!((*r) >= (*d))) [L98] EXPR \read(*d) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] [L98] 2 * (*d) VAL [A={4:0}, B={8:0}, \old(A)={4:0}, \old(B)={8:0}, \old(d)={7:0}, \old(p)={6:0}, \old(q)={5:0}, \old(r)={9:0}, d={7:0}, p={6:0}, q={5:0}, r={9:0}] - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 35.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 32.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 1555 SdHoareTripleChecker+Invalid, 32.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1219 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 336 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 79 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 79 ConstructedInterpolants, 16 QuantifiedInterpolants, 677 SizeOfPredicates, 22 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 20/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 19:42:49,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)