./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05-2.i -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 db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:22:24,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:22:24,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:22:24,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:22:24,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:22:24,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:22:24,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:22:24,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:22:24,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:22:24,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:22:24,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:22:24,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:22:24,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:22:24,786 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:24,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:22:24,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:24,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:22:24,787 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2025-04-30 10:22:25,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:22:25,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:22:25,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:22:25,028 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:22:25,029 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:22:25,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05-2.i [2025-04-30 10:22:26,310 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a109b49c/7b6b8f257f5f424f9c70e6bd21b5aec8/FLAG5fe69fb87 [2025-04-30 10:22:26,556 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:22:26,556 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/split_list_test05-2.i [2025-04-30 10:22:26,566 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a109b49c/7b6b8f257f5f424f9c70e6bd21b5aec8/FLAG5fe69fb87 [2025-04-30 10:22:27,359 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a109b49c/7b6b8f257f5f424f9c70e6bd21b5aec8 [2025-04-30 10:22:27,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:22:27,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:22:27,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:22:27,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:22:27,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:22:27,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca9e09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27, skipping insertion in model container [2025-04-30 10:22:27,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:22:27,666 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:22:27,673 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:22:27,740 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:22:27,762 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:22:27,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27 WrapperNode [2025-04-30 10:22:27,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:22:27,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:22:27,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:22:27,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:22:27,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,805 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 328 [2025-04-30 10:22:27,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:22:27,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:22:27,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:22:27,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:22:27,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,849 INFO L175 MemorySlicer]: Split 66 memory accesses to 3 slices as follows [2, 54, 10]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 6, 5]. [2025-04-30 10:22:27,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:22:27,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:22:27,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:22:27,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:22:27,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (1/1) ... [2025-04-30 10:22:27,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:27,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:27,912 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) [2025-04-30 10:22:27,915 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 [2025-04-30 10:22:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:22:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:22:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:22:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:22:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:22:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:22:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:22:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:22:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:22:27,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:22:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:22:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:22:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure append [2025-04-30 10:22:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2025-04-30 10:22:28,033 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:22:28,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:22:28,335 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-04-30 10:22:28,335 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:22:28,343 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:22:28,343 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-04-30 10:22:28,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:28 BoogieIcfgContainer [2025-04-30 10:22:28,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:22:28,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:22:28,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:22:28,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:22:28,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:22:27" (1/3) ... [2025-04-30 10:22:28,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:22:28, skipping insertion in model container [2025-04-30 10:22:28,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:27" (2/3) ... [2025-04-30 10:22:28,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:22:28, skipping insertion in model container [2025-04-30 10:22:28,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:28" (3/3) ... [2025-04-30 10:22:28,350 INFO L128 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2025-04-30 10:22:28,359 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:22:28,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG split_list_test05-2.i that has 2 procedures, 79 locations, 135 edges, 1 initial locations, 11 loop locations, and 4 error locations. [2025-04-30 10:22:28,396 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:22:28,404 INFO L340 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;@5c5501c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:22:28,404 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-30 10:22:28,408 INFO L278 IsEmpty]: Start isEmpty. Operand has 79 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 64 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-04-30 10:22:28,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-04-30 10:22:28,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:28,416 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 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] [2025-04-30 10:22:28,416 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:28,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1397446621, now seen corresponding path program 1 times [2025-04-30 10:22:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:28,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470620981] [2025-04-30 10:22:28,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:28,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-30 10:22:28,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-30 10:22:28,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:28,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-04-30 10:22:28,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:28,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470620981] [2025-04-30 10:22:28,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470620981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:28,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:28,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:22:28,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523393070] [2025-04-30 10:22:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:28,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:22:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:28,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:22:28,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:22:28,845 INFO L87 Difference]: Start difference. First operand has 79 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 64 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-04-30 10:22:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:28,865 INFO L93 Difference]: Finished difference Result 151 states and 229 transitions. [2025-04-30 10:22:28,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:22:28,867 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2025-04-30 10:22:28,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:28,873 INFO L225 Difference]: With dead ends: 151 [2025-04-30 10:22:28,873 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:22:28,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:22:28,877 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:28,878 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:22:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-04-30 10:22:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 60 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-04-30 10:22:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2025-04-30 10:22:28,916 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 82 [2025-04-30 10:22:28,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:28,917 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2025-04-30 10:22:28,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-04-30 10:22:28,918 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2025-04-30 10:22:28,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-04-30 10:22:28,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:28,923 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:28,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:22:28,924 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:28,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash -829216354, now seen corresponding path program 1 times [2025-04-30 10:22:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:28,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002133616] [2025-04-30 10:22:28,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:28,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:29,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-04-30 10:22:29,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-04-30 10:22:29,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:29,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 1 proven. 121 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-04-30 10:22:30,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:30,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002133616] [2025-04-30 10:22:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002133616] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:30,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512792702] [2025-04-30 10:22:30,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:30,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:30,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:30,377 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) [2025-04-30 10:22:30,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:22:30,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-04-30 10:22:30,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-04-30 10:22:30,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:30,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:30,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:22:30,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-04-30 10:22:30,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:22:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512792702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:30,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:22:30,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2025-04-30 10:22:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228616451] [2025-04-30 10:22:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:30,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:30,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:30,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:22:30,912 INFO L87 Difference]: Start difference. First operand 75 states and 110 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:30,954 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2025-04-30 10:22:30,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:30,954 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-04-30 10:22:30,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:30,956 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:22:30,956 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:22:30,956 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:22:30,956 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:30,957 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 304 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:22:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-04-30 10:22:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 59 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-04-30 10:22:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2025-04-30 10:22:30,964 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 121 [2025-04-30 10:22:30,965 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:30,965 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2025-04-30 10:22:30,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:30,966 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2025-04-30 10:22:30,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-04-30 10:22:30,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:30,969 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:30,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:22:31,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:31,170 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:31,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:31,171 INFO L85 PathProgramCache]: Analyzing trace with hash 64096970, now seen corresponding path program 1 times [2025-04-30 10:22:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:31,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62093544] [2025-04-30 10:22:31,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:31,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:31,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-30 10:22:31,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-30 10:22:31,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:31,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 1 proven. 121 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-04-30 10:22:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:32,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62093544] [2025-04-30 10:22:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62093544] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:32,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677331634] [2025-04-30 10:22:32,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:32,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:32,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:32,042 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) [2025-04-30 10:22:32,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:22:32,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-30 10:22:32,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-30 10:22:32,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:32,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:32,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 1791 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:22:32,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-04-30 10:22:32,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:22:32,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677331634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:32,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:22:32,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2025-04-30 10:22:32,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308714978] [2025-04-30 10:22:32,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:32,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:32,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:32,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:32,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:22:32,567 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:32,590 INFO L93 Difference]: Finished difference Result 99 states and 141 transitions. [2025-04-30 10:22:32,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:32,590 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-04-30 10:22:32,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:32,591 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:22:32,592 INFO L226 Difference]: Without dead ends: 78 [2025-04-30 10:22:32,592 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:22:32,592 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:32,593 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-30 10:22:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-04-30 10:22:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 62 states have internal predecessors, (82), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-04-30 10:22:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2025-04-30 10:22:32,604 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 122 [2025-04-30 10:22:32,604 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:32,604 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2025-04-30 10:22:32,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:32,604 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2025-04-30 10:22:32,605 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-04-30 10:22:32,605 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:32,605 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:32,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:32,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-30 10:22:32,808 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:32,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1747450532, now seen corresponding path program 1 times [2025-04-30 10:22:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:32,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19502317] [2025-04-30 10:22:32,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:32,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-30 10:22:32,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-30 10:22:32,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 1 proven. 121 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-04-30 10:22:33,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:33,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19502317] [2025-04-30 10:22:33,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19502317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:33,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642081627] [2025-04-30 10:22:33,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:33,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:33,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:33,472 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) [2025-04-30 10:22:33,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:22:33,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-30 10:22:33,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-30 10:22:33,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:33,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:33,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1809 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:22:33,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-04-30 10:22:34,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-04-30 10:22:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642081627] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:34,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2025-04-30 10:22:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949655839] [2025-04-30 10:22:34,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:34,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:22:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:34,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:22:34,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:22:34,121 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-04-30 10:22:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:34,753 INFO L93 Difference]: Finished difference Result 194 states and 334 transitions. [2025-04-30 10:22:34,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:22:34,754 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 125 [2025-04-30 10:22:34,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:34,756 INFO L225 Difference]: With dead ends: 194 [2025-04-30 10:22:34,756 INFO L226 Difference]: Without dead ends: 119 [2025-04-30 10:22:34,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:22:34,758 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 23 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:34,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 835 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:22:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-30 10:22:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2025-04-30 10:22:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.381578947368421) internal successors, (105), 82 states have internal predecessors, (105), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2025-04-30 10:22:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 180 transitions. [2025-04-30 10:22:34,780 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 180 transitions. Word has length 125 [2025-04-30 10:22:34,780 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:34,780 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 180 transitions. [2025-04-30 10:22:34,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-04-30 10:22:34,782 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 180 transitions. [2025-04-30 10:22:34,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-04-30 10:22:34,787 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:34,787 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 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, 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] [2025-04-30 10:22:34,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:22:34,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:34,987 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:34,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash 207604411, now seen corresponding path program 1 times [2025-04-30 10:22:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:34,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783693166] [2025-04-30 10:22:34,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:35,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-30 10:22:35,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-30 10:22:35,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:35,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-04-30 10:22:35,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:35,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783693166] [2025-04-30 10:22:35,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783693166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:35,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:35,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:35,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473503873] [2025-04-30 10:22:35,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:35,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:35,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:35,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:35,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:35,294 INFO L87 Difference]: Start difference. First operand 111 states and 180 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:35,314 INFO L93 Difference]: Finished difference Result 116 states and 185 transitions. [2025-04-30 10:22:35,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:35,315 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2025-04-30 10:22:35,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:35,316 INFO L225 Difference]: With dead ends: 116 [2025-04-30 10:22:35,316 INFO L226 Difference]: Without dead ends: 114 [2025-04-30 10:22:35,316 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:35,317 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:35,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 304 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-04-30 10:22:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-04-30 10:22:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 85 states have internal predecessors, (108), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2025-04-30 10:22:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 183 transitions. [2025-04-30 10:22:35,330 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 183 transitions. Word has length 142 [2025-04-30 10:22:35,330 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:35,330 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 183 transitions. [2025-04-30 10:22:35,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:35,330 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 183 transitions. [2025-04-30 10:22:35,331 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-04-30 10:22:35,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:35,334 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 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, 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] [2025-04-30 10:22:35,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:22:35,334 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:35,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash -9669875, now seen corresponding path program 1 times [2025-04-30 10:22:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:35,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749996569] [2025-04-30 10:22:35,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:35,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-04-30 10:22:35,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-04-30 10:22:35,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:35,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-04-30 10:22:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:35,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749996569] [2025-04-30 10:22:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749996569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:35,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267980395] [2025-04-30 10:22:35,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:35,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:35,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:35,737 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) [2025-04-30 10:22:35,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:22:36,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-04-30 10:22:36,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-04-30 10:22:36,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:36,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:36,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:22:36,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-04-30 10:22:36,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-04-30 10:22:36,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267980395] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:36,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:36,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-30 10:22:36,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236548945] [2025-04-30 10:22:36,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:36,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:22:36,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:36,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:22:36,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:22:36,425 INFO L87 Difference]: Start difference. First operand 114 states and 183 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:36,458 INFO L93 Difference]: Finished difference Result 146 states and 224 transitions. [2025-04-30 10:22:36,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:22:36,458 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 145 [2025-04-30 10:22:36,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:36,460 INFO L225 Difference]: With dead ends: 146 [2025-04-30 10:22:36,460 INFO L226 Difference]: Without dead ends: 123 [2025-04-30 10:22:36,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:22:36,461 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:36,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-30 10:22:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-04-30 10:22:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 94 states have internal predecessors, (117), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2025-04-30 10:22:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 192 transitions. [2025-04-30 10:22:36,470 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 192 transitions. Word has length 145 [2025-04-30 10:22:36,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:36,470 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 192 transitions. [2025-04-30 10:22:36,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:36,470 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 192 transitions. [2025-04-30 10:22:36,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-04-30 10:22:36,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:36,473 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 5, 5, 5, 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, 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] [2025-04-30 10:22:36,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:36,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:36,674 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:36,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2012087455, now seen corresponding path program 2 times [2025-04-30 10:22:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:36,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095283871] [2025-04-30 10:22:36,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:36,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:36,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-04-30 10:22:36,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 154 statements. [2025-04-30 10:22:36,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:22:36,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-04-30 10:22:36,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:36,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095283871] [2025-04-30 10:22:36,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095283871] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:36,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:36,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:22:36,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073789514] [2025-04-30 10:22:36,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:36,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:22:36,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:36,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:22:36,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:22:36,839 INFO L87 Difference]: Start difference. First operand 123 states and 192 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:36,856 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2025-04-30 10:22:36,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:22:36,856 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 154 [2025-04-30 10:22:36,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:36,858 INFO L225 Difference]: With dead ends: 135 [2025-04-30 10:22:36,858 INFO L226 Difference]: Without dead ends: 126 [2025-04-30 10:22:36,858 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:22:36,859 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:36,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-30 10:22:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-04-30 10:22:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 97 states have internal predecessors, (120), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2025-04-30 10:22:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2025-04-30 10:22:36,867 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 154 [2025-04-30 10:22:36,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:36,867 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2025-04-30 10:22:36,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:36,867 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2025-04-30 10:22:36,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-04-30 10:22:36,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:36,868 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 5, 5, 5, 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, 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] [2025-04-30 10:22:36,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:22:36,869 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:36,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1889852831, now seen corresponding path program 1 times [2025-04-30 10:22:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:36,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483930756] [2025-04-30 10:22:36,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:36,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-30 10:22:37,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-30 10:22:37,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:37,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-04-30 10:22:37,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:37,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483930756] [2025-04-30 10:22:37,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483930756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:37,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123387893] [2025-04-30 10:22:37,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:37,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:37,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:37,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:37,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:22:37,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-30 10:22:38,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-30 10:22:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:38,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:38,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1961 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:22:38,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-04-30 10:22:38,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-04-30 10:22:38,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123387893] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:38,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2025-04-30 10:22:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198499325] [2025-04-30 10:22:38,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:38,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:22:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:38,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:22:38,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:22:38,230 INFO L87 Difference]: Start difference. First operand 126 states and 195 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:38,283 INFO L93 Difference]: Finished difference Result 155 states and 231 transitions. [2025-04-30 10:22:38,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:22:38,283 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 154 [2025-04-30 10:22:38,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:38,284 INFO L225 Difference]: With dead ends: 155 [2025-04-30 10:22:38,285 INFO L226 Difference]: Without dead ends: 129 [2025-04-30 10:22:38,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 295 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:22:38,286 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:38,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 710 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-30 10:22:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-04-30 10:22:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 100 states have internal predecessors, (123), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2025-04-30 10:22:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 198 transitions. [2025-04-30 10:22:38,299 INFO L79 Accepts]: Start accepts. Automaton has 129 states and 198 transitions. Word has length 154 [2025-04-30 10:22:38,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:38,300 INFO L485 AbstractCegarLoop]: Abstraction has 129 states and 198 transitions. [2025-04-30 10:22:38,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:38,300 INFO L278 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2025-04-30 10:22:38,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-04-30 10:22:38,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:38,301 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 6, 6, 6, 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, 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] [2025-04-30 10:22:38,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:22:38,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:38,502 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:38,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash 381685327, now seen corresponding path program 2 times [2025-04-30 10:22:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:38,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274595877] [2025-04-30 10:22:38,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:38,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-04-30 10:22:38,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 157 of 157 statements. [2025-04-30 10:22:38,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:38,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-04-30 10:22:38,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:38,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274595877] [2025-04-30 10:22:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274595877] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:38,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869983271] [2025-04-30 10:22:38,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:38,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:38,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:38,894 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:38,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:22:39,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-04-30 10:22:39,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 157 of 157 statements. [2025-04-30 10:22:39,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:39,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:39,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1979 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:22:39,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-04-30 10:22:39,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:22:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869983271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:22:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-30 10:22:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252294794] [2025-04-30 10:22:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:39,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:22:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:39,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:22:39,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:22:39,794 INFO L87 Difference]: Start difference. First operand 129 states and 198 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:39,816 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2025-04-30 10:22:39,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:39,817 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 157 [2025-04-30 10:22:39,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:39,818 INFO L225 Difference]: With dead ends: 129 [2025-04-30 10:22:39,818 INFO L226 Difference]: Without dead ends: 128 [2025-04-30 10:22:39,818 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:22:39,819 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:39,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 401 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-30 10:22:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-04-30 10:22:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.297872340425532) internal successors, (122), 99 states have internal predecessors, (122), 30 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2025-04-30 10:22:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 197 transitions. [2025-04-30 10:22:39,828 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 197 transitions. Word has length 157 [2025-04-30 10:22:39,828 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:39,828 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 197 transitions. [2025-04-30 10:22:39,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:39,829 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 197 transitions. [2025-04-30 10:22:39,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-04-30 10:22:39,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:39,830 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 6, 6, 6, 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, 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] [2025-04-30 10:22:39,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:22:40,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:40,031 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:40,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:40,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1052656521, now seen corresponding path program 1 times [2025-04-30 10:22:40,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:40,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334901352] [2025-04-30 10:22:40,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:40,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:40,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-04-30 10:22:40,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-04-30 10:22:40,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-04-30 10:22:40,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:40,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334901352] [2025-04-30 10:22:40,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334901352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:40,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:40,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:22:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086246345] [2025-04-30 10:22:40,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:40,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:22:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:40,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:22:40,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:22:40,299 INFO L87 Difference]: Start difference. First operand 128 states and 197 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:40,306 INFO L93 Difference]: Finished difference Result 128 states and 197 transitions. [2025-04-30 10:22:40,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:22:40,306 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 158 [2025-04-30 10:22:40,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:40,307 INFO L225 Difference]: With dead ends: 128 [2025-04-30 10:22:40,307 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:22:40,310 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:22:40,311 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:40,311 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:22:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:22:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:22:40,312 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2025-04-30 10:22:40,312 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:40,312 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:22:40,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-04-30 10:22:40,312 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:22:40,313 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:22:40,314 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-04-30 10:22:40,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-04-30 10:22:40,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-04-30 10:22:40,315 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-04-30 10:22:40,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:22:40,317 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:40,319 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-30 10:22:40,371 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:22:40,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:22:40 BoogieIcfgContainer [2025-04-30 10:22:40,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:22:40,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:22:40,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:22:40,381 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:22:40,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:28" (3/4) ... [2025-04-30 10:22:40,386 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:22:40,390 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure append [2025-04-30 10:22:40,394 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-04-30 10:22:40,394 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:22:40,394 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:22:40,395 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:22:40,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:22:40,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:22:40,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:22:40,465 INFO L158 Benchmark]: Toolchain (without parser) took 13103.15ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 110.7MB in the beginning and 333.9MB in the end (delta: -223.2MB). Peak memory consumption was 209.0MB. Max. memory is 16.1GB. [2025-04-30 10:22:40,466 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:22:40,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.67ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 88.2MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:22:40,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.56ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 85.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:22:40,467 INFO L158 Benchmark]: Boogie Preprocessor took 78.35ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 80.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:22:40,467 INFO L158 Benchmark]: RCFGBuilder took 456.57ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 51.4MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:22:40,468 INFO L158 Benchmark]: TraceAbstraction took 12035.82ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 51.0MB in the beginning and 342.3MB in the end (delta: -291.2MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. [2025-04-30 10:22:40,468 INFO L158 Benchmark]: Witness Printer took 83.49ms. Allocated memory is still 578.8MB. Free memory was 342.3MB in the beginning and 333.9MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:22:40,469 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.16ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.67ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 88.2MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.56ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 85.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.35ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 80.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 456.57ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 51.4MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12035.82ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 51.0MB in the beginning and 342.3MB in the end (delta: -291.2MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. * Witness Printer took 83.49ms. Allocated memory is still 578.8MB. Free memory was 342.3MB in the beginning and 333.9MB in the end (delta: 8.3MB). There was no memory consumed. 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 - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 135 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 4001 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2969 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 1032 mSDtfsCounter, 715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1310 GetRequests, 1223 SyntacticMatches, 11 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=8, InterpolantAutomatonStates: 68, 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, 10 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2184 NumberOfCodeBlocks, 2074 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2589 ConstructedInterpolants, 0 QuantifiedInterpolants, 3108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 11214 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 9632/10123 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (0 < (2147483649 + counter)) - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: ((0 <= counter) && (counter <= 2147483646)) RESULT: Ultimate proved your program to be correct! [2025-04-30 10:22:40,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE