./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:44:34,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:44:34,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:44:34,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:44:34,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:44:34,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:44:34,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:44:34,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:44:34,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:44:34,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:44:34,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:44:34,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:44:34,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:44:34,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:44:34,764 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:44:34,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:44:34,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:44:34,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:44:34,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:44:34,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:44:34,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:44:34,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:44:34,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:44:34,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:44:34,765 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:44:34,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:44:34,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:44:34,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:44:34,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:44:34,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:44:34,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:34,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:34,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:44:34,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:44:34,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:44:34,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:44:34,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:44:34,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:44:34,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:44:34,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:44:34,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:44:34,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:44:34,767 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-jdk21/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 -> 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 [2025-01-10 01:44:35,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:44:35,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:44:35,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:44:35,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:44:35,027 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:44:35,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-01-10 01:44:36,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad1817835/a793ba804785424a9dddb83542bde11c/FLAG58afc3c59 [2025-01-10 01:44:36,373 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:44:36,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-01-10 01:44:36,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad1817835/a793ba804785424a9dddb83542bde11c/FLAG58afc3c59 [2025-01-10 01:44:36,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad1817835/a793ba804785424a9dddb83542bde11c [2025-01-10 01:44:36,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:44:36,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:44:36,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:44:36,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:44:36,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:44:36,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:44:36" (1/1) ... [2025-01-10 01:44:36,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45115b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:36, skipping insertion in model container [2025-01-10 01:44:36,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:44:36" (1/1) ... [2025-01-10 01:44:36,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:44:36,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:44:36,973 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:44:37,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:44:37,038 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:44:37,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37 WrapperNode [2025-01-10 01:44:37,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:44:37,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:44:37,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:44:37,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:44:37,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,078 INFO L138 Inliner]: procedures = 37, calls = 249, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 570 [2025-01-10 01:44:37,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:44:37,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:44:37,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:44:37,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:44:37,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,129 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 12, 42, 100, 10, 11, 4]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 0, 39, 97, 0, 11, 1]. [2025-01-10 01:44:37,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:44:37,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:44:37,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:44:37,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:44:37,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (1/1) ... [2025-01-10 01:44:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:37,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:44:37,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:44:37,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-10 01:44:37,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-10 01:44:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 01:44:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 01:44:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 01:44:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-10 01:44:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-10 01:44:37,217 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-10 01:44:37,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:44:37,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:44:37,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:44:37,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:44:37,330 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:44:37,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:44:38,068 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2025-01-10 01:44:38,068 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:44:38,077 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:44:38,077 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 01:44:38,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:44:38 BoogieIcfgContainer [2025-01-10 01:44:38,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:44:38,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:44:38,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:44:38,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:44:38,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:44:36" (1/3) ... [2025-01-10 01:44:38,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f559844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:44:38, skipping insertion in model container [2025-01-10 01:44:38,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:37" (2/3) ... [2025-01-10 01:44:38,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f559844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:44:38, skipping insertion in model container [2025-01-10 01:44:38,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:44:38" (3/3) ... [2025-01-10 01:44:38,085 INFO L128 eAbstractionObserver]: Analyzing ICFG discover_list.c [2025-01-10 01:44:38,097 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:44:38,098 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG discover_list.c that has 9 procedures, 187 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-01-10 01:44:38,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:44:38,142 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b676b2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:44:38,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-01-10 01:44:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 155 states have internal predecessors, (195), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:44:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 01:44:38,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:38,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 01:44:38,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:44:38,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:38,155 INFO L85 PathProgramCache]: Analyzing trace with hash 85464, now seen corresponding path program 1 times [2025-01-10 01:44:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:38,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906696878] [2025-01-10 01:44:38,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:39,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:44:39,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:44:39,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:39,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:39,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906696878] [2025-01-10 01:44:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906696878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:39,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:44:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675653636] [2025-01-10 01:44:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:39,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:44:39,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:39,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:44:39,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:39,317 INFO L87 Difference]: Start difference. First operand has 167 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 155 states have internal predecessors, (195), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-01-10 01:44:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:39,370 INFO L93 Difference]: Finished difference Result 315 states and 403 transitions. [2025-01-10 01:44:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:44:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2025-01-10 01:44:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:39,377 INFO L225 Difference]: With dead ends: 315 [2025-01-10 01:44:39,377 INFO L226 Difference]: Without dead ends: 149 [2025-01-10 01:44:39,380 INFO L434 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-01-10 01:44:39,383 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 3 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:39,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 396 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-10 01:44:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-01-10 01:44:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 100 states have (on average 1.61) internal successors, (161), 137 states have internal predecessors, (161), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:44:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2025-01-10 01:44:39,426 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 3 [2025-01-10 01:44:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:39,427 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2025-01-10 01:44:39,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-01-10 01:44:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2025-01-10 01:44:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:44:39,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:39,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-01-10 01:44:39,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:44:39,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:44:39,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash 41023128, now seen corresponding path program 1 times [2025-01-10 01:44:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:39,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429083113] [2025-01-10 01:44:39,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:40,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:44:40,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:44:40,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:40,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:40,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429083113] [2025-01-10 01:44:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429083113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:40,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:44:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912588948] [2025-01-10 01:44:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:40,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:44:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:40,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:44:40,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:40,358 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:40,385 INFO L93 Difference]: Finished difference Result 292 states and 347 transitions. [2025-01-10 01:44:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:44:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-10 01:44:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:40,388 INFO L225 Difference]: With dead ends: 292 [2025-01-10 01:44:40,388 INFO L226 Difference]: Without dead ends: 152 [2025-01-10 01:44:40,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 01:44:40,389 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:40,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 345 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-10 01:44:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2025-01-10 01:44:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 102 states have (on average 1.5980392156862746) internal successors, (163), 139 states have internal predecessors, (163), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:44:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 179 transitions. [2025-01-10 01:44:40,402 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 179 transitions. Word has length 26 [2025-01-10 01:44:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:40,403 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 179 transitions. [2025-01-10 01:44:40,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2025-01-10 01:44:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:44:40,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:40,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-01-10 01:44:40,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:44:40,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:44:40,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1953121578, now seen corresponding path program 1 times [2025-01-10 01:44:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278138258] [2025-01-10 01:44:40,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:41,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:44:41,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:44:41,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:41,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:41,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278138258] [2025-01-10 01:44:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278138258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:41,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:41,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:44:41,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449348219] [2025-01-10 01:44:41,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:41,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:44:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:41,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:44:41,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:44:41,228 INFO L87 Difference]: Start difference. First operand 151 states and 179 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:41,281 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2025-01-10 01:44:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-01-10 01:44:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:41,283 INFO L225 Difference]: With dead ends: 157 [2025-01-10 01:44:41,283 INFO L226 Difference]: Without dead ends: 153 [2025-01-10 01:44:41,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:44:41,284 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 32 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:41,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 318 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-10 01:44:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-01-10 01:44:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 106 states have (on average 1.5566037735849056) internal successors, (165), 141 states have internal predecessors, (165), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:44:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2025-01-10 01:44:41,299 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 26 [2025-01-10 01:44:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:41,299 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2025-01-10 01:44:41,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2025-01-10 01:44:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 01:44:41,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:41,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 01:44:41,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:44:41,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:44:41,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1317962921, now seen corresponding path program 1 times [2025-01-10 01:44:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:41,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11669155] [2025-01-10 01:44:41,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:41,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:44:41,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:44:41,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:41,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:43,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11669155] [2025-01-10 01:44:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11669155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:44:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602062496] [2025-01-10 01:44:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:43,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:44:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:43,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:44:43,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:44:43,118 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:43,237 INFO L93 Difference]: Finished difference Result 271 states and 319 transitions. [2025-01-10 01:44:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:44:43,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-01-10 01:44:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:43,238 INFO L225 Difference]: With dead ends: 271 [2025-01-10 01:44:43,239 INFO L226 Difference]: Without dead ends: 157 [2025-01-10 01:44:43,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:44:43,240 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 163 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:43,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 488 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-10 01:44:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-01-10 01:44:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 143 states have internal predecessors, (167), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:44:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2025-01-10 01:44:43,253 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 32 [2025-01-10 01:44:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:43,253 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2025-01-10 01:44:43,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2025-01-10 01:44:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 01:44:43,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:43,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 01:44:43,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:44:43,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:44:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash 161932414, now seen corresponding path program 1 times [2025-01-10 01:44:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38341198] [2025-01-10 01:44:43,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:43,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:44:43,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:44:43,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:43,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:44,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38341198] [2025-01-10 01:44:44,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38341198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:44,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:44,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:44:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055748919] [2025-01-10 01:44:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:44:44,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:44,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:44:44,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:44:44,816 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:44,967 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2025-01-10 01:44:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:44:44,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-01-10 01:44:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:44,969 INFO L225 Difference]: With dead ends: 165 [2025-01-10 01:44:44,969 INFO L226 Difference]: Without dead ends: 163 [2025-01-10 01:44:44,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:44:44,969 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 165 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:44,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 641 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-10 01:44:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2025-01-10 01:44:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.5446428571428572) internal successors, (173), 147 states have internal predecessors, (173), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:44:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2025-01-10 01:44:44,977 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 33 [2025-01-10 01:44:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:44,977 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2025-01-10 01:44:44,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2025-01-10 01:44:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 01:44:44,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:44,978 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 01:44:44,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:44:44,978 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:44:44,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash 748200449, now seen corresponding path program 1 times [2025-01-10 01:44:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:44,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320811986] [2025-01-10 01:44:44,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:45,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:44:45,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:44:45,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:45,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:44:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320811986] [2025-01-10 01:44:45,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320811986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:45,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:45,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:44:45,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229910460] [2025-01-10 01:44:45,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:45,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:44:45,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:45,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:44:45,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:44:45,767 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:45,807 INFO L93 Difference]: Finished difference Result 272 states and 320 transitions. [2025-01-10 01:44:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:45,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-01-10 01:44:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:45,809 INFO L225 Difference]: With dead ends: 272 [2025-01-10 01:44:45,810 INFO L226 Difference]: Without dead ends: 161 [2025-01-10 01:44:45,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-10 01:44:45,811 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:45,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-10 01:44:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-01-10 01:44:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.5350877192982457) internal successors, (175), 149 states have internal predecessors, (175), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:44:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2025-01-10 01:44:45,820 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 36 [2025-01-10 01:44:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:45,821 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2025-01-10 01:44:45,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:44:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2025-01-10 01:44:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 01:44:45,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:45,821 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 01:44:45,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:44:45,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:44:45,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash -320835034, now seen corresponding path program 1 times [2025-01-10 01:44:45,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:45,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609170181] [2025-01-10 01:44:45,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:46,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:44:46,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:44:46,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:47,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:47,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609170181] [2025-01-10 01:44:47,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609170181] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:47,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996174784] [2025-01-10 01:44:47,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:47,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:47,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:44:47,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:44:47,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:44:47,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:44:47,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:47,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:47,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:44:48,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:48,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 485 treesize of output 484 [2025-01-10 01:44:56,235 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 324 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:45:00,250 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_int#3| 9))) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (store (store (store (store (store (store (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse2 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 8) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 20) 14) (+ |c_~#smp_def_rrlen_arr~0.offset| 24) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 28) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 32) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 36) 3) (+ 40 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 44) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 48) 4) (+ |c_~#smp_def_rrlen_arr~0.offset| 52) (- 2)) (+ 56 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) (+ |c_~#smp_def_rrlen_arr~0.offset| 64) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 68) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 72) 6) (+ 76 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 96) 16) .cse0 (select .cse1 .cse0))) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) (+ 116 |c_~#smp_def_rrlen_arr~0.offset|) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) (+ |c_~#smp_def_rrlen_arr~0.offset| 124) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) (+ |c_~#smp_def_rrlen_arr~0.offset| 132) 19) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) (+ 140 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 144) 20) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse2 (select .cse1 .cse2))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) (+ |c_~#smp_def_rrlen_arr~0.offset| 184) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 188) (- 2)) (+ 192 |c_~#smp_def_rrlen_arr~0.offset|) 128) (+ 196 |c_~#smp_def_rrlen_arr~0.offset|) 3) (+ |c_~#smp_def_rrlen_arr~0.offset| 200) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 204) 129) (+ |c_~#smp_def_rrlen_arr~0.offset| 208) (- 2)) (+ 212 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 216) 130) (+ |c_~#smp_def_rrlen_arr~0.offset| 220) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 224) (- 3)) (+ 228 |c_~#smp_def_rrlen_arr~0.offset|) 131) (+ 232 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 236) (- 3)) .cse3 (select .cse1 .cse3))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 260) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 264) 135) (+ |c_~#smp_def_rrlen_arr~0.offset| 268) (- 2)) .cse4 (select .cse1 .cse4))) (+ 276 |c_~#smp_def_rrlen_arr~0.offset|) 136) (+ |c_~#smp_def_rrlen_arr~0.offset| 280) (- 2)) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 288) 137) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) (+ 296 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 300) 138) (+ |c_~#smp_def_rrlen_arr~0.offset| 304) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 308) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) (+ 316 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 320) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) (+ |c_~#smp_def_rrlen_arr~0.offset| 328) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 344) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 348) 146) (+ 352 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 360) 147) (+ |c_~#smp_def_rrlen_arr~0.offset| 364) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 368) 0) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 380) (- 1)) .cse1)) (= 9 |c_~#smp_def_rrlen_arr~0.base|)) is different from false [2025-01-10 01:45:04,262 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_int#3| 9))) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (store (store (store (store (store (store (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse2 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 8) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 20) 14) (+ |c_~#smp_def_rrlen_arr~0.offset| 24) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 28) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 32) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 36) 3) (+ 40 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 44) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 48) 4) (+ |c_~#smp_def_rrlen_arr~0.offset| 52) (- 2)) (+ 56 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) (+ |c_~#smp_def_rrlen_arr~0.offset| 64) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 68) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 72) 6) (+ 76 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 96) 16) .cse0 (select .cse1 .cse0))) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) (+ 116 |c_~#smp_def_rrlen_arr~0.offset|) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) (+ |c_~#smp_def_rrlen_arr~0.offset| 124) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) (+ |c_~#smp_def_rrlen_arr~0.offset| 132) 19) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) (+ 140 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 144) 20) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse2 (select .cse1 .cse2))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) (+ |c_~#smp_def_rrlen_arr~0.offset| 184) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 188) (- 2)) (+ 192 |c_~#smp_def_rrlen_arr~0.offset|) 128) (+ 196 |c_~#smp_def_rrlen_arr~0.offset|) 3) (+ |c_~#smp_def_rrlen_arr~0.offset| 200) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 204) 129) (+ |c_~#smp_def_rrlen_arr~0.offset| 208) (- 2)) (+ 212 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 216) 130) (+ |c_~#smp_def_rrlen_arr~0.offset| 220) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 224) (- 3)) (+ 228 |c_~#smp_def_rrlen_arr~0.offset|) 131) (+ 232 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 236) (- 3)) .cse3 (select .cse1 .cse3))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 260) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 264) 135) (+ |c_~#smp_def_rrlen_arr~0.offset| 268) (- 2)) .cse4 (select .cse1 .cse4))) (+ 276 |c_~#smp_def_rrlen_arr~0.offset|) 136) (+ |c_~#smp_def_rrlen_arr~0.offset| 280) (- 2)) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 288) 137) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) (+ 296 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 300) 138) (+ |c_~#smp_def_rrlen_arr~0.offset| 304) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 308) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) (+ 316 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 320) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) (+ |c_~#smp_def_rrlen_arr~0.offset| 328) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 344) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 348) 146) (+ 352 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 360) 147) (+ |c_~#smp_def_rrlen_arr~0.offset| 364) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 368) 0) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 380) (- 1)) .cse1)) (= 9 |c_~#smp_def_rrlen_arr~0.base|)) is different from true [2025-01-10 01:45:12,305 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 324 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:45:20,328 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:45:28,357 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 324 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:45:36,384 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:45:44,419 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 324 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:45:52,443 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:46:00,482 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 324 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:46:08,503 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 01:46:16,534 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 324 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)