./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/list-simple/dll2c_prepend_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:38:51,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:38:51,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:38:51,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:38:51,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:38:51,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:38:51,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:38:51,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:38:51,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:38:51,318 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:38:51,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:38:51,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:38:51,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:38:51,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:38:51,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:38:51,319 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:38:51,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:38:51,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:38:51,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:38:51,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:38:51,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:38:51,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:38:51,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:38:51,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:38:51,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:38:51,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:38:51,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:38:51,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:38:51,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:38:51,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:38:51,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:38:51,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:38:51,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:38:51,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:38:51,322 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 ! call(reach_error())) ) 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2025-02-05 14:38:51,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:38:51,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:38:51,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:38:51,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:38:51,635 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:38:51,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2025-02-05 14:38:53,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/987357c1c/5ecf094bf1db4e2a9a313115e13cec91/FLAG5caccdec3 [2025-02-05 14:38:53,353 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:38:53,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2025-02-05 14:38:53,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/987357c1c/5ecf094bf1db4e2a9a313115e13cec91/FLAG5caccdec3 [2025-02-05 14:38:53,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/987357c1c/5ecf094bf1db4e2a9a313115e13cec91 [2025-02-05 14:38:53,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:38:53,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:38:53,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:38:53,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:38:53,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:38:53,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3391f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53, skipping insertion in model container [2025-02-05 14:38:53,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:38:53,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2025-02-05 14:38:53,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:38:53,699 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:38:53,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i[24729,24742] [2025-02-05 14:38:53,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:38:53,785 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:38:53,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53 WrapperNode [2025-02-05 14:38:53,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:38:53,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:38:53,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:38:53,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:38:53,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,822 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2025-02-05 14:38:53,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:38:53,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:38:53,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:38:53,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:38:53,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,853 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2025-02-05 14:38:53,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:38:53,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:38:53,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:38:53,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:38:53,888 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (1/1) ... [2025-02-05 14:38:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:38:53,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:53,916 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-02-05 14:38:53,918 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-02-05 14:38:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-05 14:38:53,936 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:38:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:38:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:38:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:38:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:38:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:38:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:38:53,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:38:53,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:38:54,070 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:38:54,071 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:38:54,316 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-05 14:38:54,332 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-05 14:38:54,356 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-05 14:38:54,356 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:38:54,368 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:38:54,369 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:38:54,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:38:54 BoogieIcfgContainer [2025-02-05 14:38:54,370 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:38:54,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:38:54,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:38:54,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:38:54,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:38:53" (1/3) ... [2025-02-05 14:38:54,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597a4569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:38:54, skipping insertion in model container [2025-02-05 14:38:54,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:38:53" (2/3) ... [2025-02-05 14:38:54,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597a4569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:38:54, skipping insertion in model container [2025-02-05 14:38:54,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:38:54" (3/3) ... [2025-02-05 14:38:54,381 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2025-02-05 14:38:54,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:38:54,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_prepend_unequal.i that has 2 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 14:38:54,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:38:54,458 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;@2b138fed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:38:54,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:38:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:38:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 14:38:54,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:54,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:54,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:54,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:54,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1924945922, now seen corresponding path program 1 times [2025-02-05 14:38:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022950205] [2025-02-05 14:38:54,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:54,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:54,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 14:38:54,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 14:38:54,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:54,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 14:38:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022950205] [2025-02-05 14:38:54,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022950205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:38:54,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:38:54,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:38:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761696348] [2025-02-05 14:38:54,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:38:54,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:38:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:38:54,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:38:54,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:38:54,965 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:38:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:38:54,991 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2025-02-05 14:38:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:38:54,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-02-05 14:38:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:38:55,001 INFO L225 Difference]: With dead ends: 62 [2025-02-05 14:38:55,002 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 14:38:55,005 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-02-05 14:38:55,008 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:38:55,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:38:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 14:38:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-02-05 14:38:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:38:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-05 14:38:55,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 22 [2025-02-05 14:38:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:38:55,063 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-05 14:38:55,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:38:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-02-05 14:38:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 14:38:55,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:38:55,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:38:55,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:38:55,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:38:55,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:38:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 630642813, now seen corresponding path program 1 times [2025-02-05 14:38:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:38:55,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070390873] [2025-02-05 14:38:55,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:55,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:38:55,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:38:55,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:38:55,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:55,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:38:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:38:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070390873] [2025-02-05 14:38:58,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070390873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:38:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738397923] [2025-02-05 14:38:58,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:38:58,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:38:58,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:38:58,475 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-02-05 14:38:58,479 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-02-05 14:38:58,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:38:58,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:38:58,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:38:58,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:38:58,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-02-05 14:38:58,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:38:58,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:38:58,928 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-05 14:38:58,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-05 14:38:59,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2025-02-05 14:38:59,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:38:59,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-05 14:38:59,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-02-05 14:38:59,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-02-05 14:39:03,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 104 [2025-02-05 14:39:03,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2025-02-05 14:39:03,396 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2025-02-05 14:39:03,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2025-02-05 14:39:03,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:39:03,568 INFO L349 Elim1Store]: treesize reduction 31, result has 49.2 percent of original size [2025-02-05 14:39:03,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 124 [2025-02-05 14:39:03,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse0) .cse2) .cse0)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse0))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|)) (.cse4 (select .cse5 .cse2))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (not (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse0 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse0) .cse2 .cse4) .cse5)))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse6 (select .cse7 .cse2))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse0) .cse2 .cse6) .cse7)) (= .cse0 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse6))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0))) is different from false [2025-02-05 14:39:03,680 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (let ((.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse0) .cse2) .cse0)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse0))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|)) (.cse4 (select .cse5 .cse2))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (not (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse0 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse0) .cse2 .cse4) .cse5)))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse6 (select .cse7 .cse2))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse0) .cse2 .cse6) .cse7)) (= .cse0 .cse6)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse6))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0))) is different from true [2025-02-05 14:39:03,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|)) (.cse0 (select .cse4 .cse3))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse2) .cse3 .cse0) .cse4)))))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse5 (select .cse6 .cse3))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse5)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse2) .cse3 .cse5) .cse6)) (= .cse2 .cse5))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse2)))) is different from false [2025-02-05 14:39:03,774 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|)) (.cse0 (select .cse4 .cse3))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) .cse2) .cse3 .cse0) .cse4)))))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse5 (select .cse6 .cse3))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse5)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse2 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse2) .cse3 .cse5) .cse6)) (= .cse2 .cse5))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse2)))) is different from true [2025-02-05 14:39:03,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 144 [2025-02-05 14:39:03,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 268 [2025-02-05 14:39:03,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 215 [2025-02-05 14:39:03,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:03,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:03,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 29 [2025-02-05 14:39:03,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2025-02-05 14:39:03,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2025-02-05 14:39:03,949 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:03,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 125 [2025-02-05 14:39:03,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 135 [2025-02-05 14:39:03,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 110 [2025-02-05 14:39:03,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 67 [2025-02-05 14:39:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:04,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 29 [2025-02-05 14:39:04,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2025-02-05 14:39:04,026 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:04,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-02-05 14:39:04,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:39:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:04,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:04,103 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_315 Int) (v_ArrVal_312 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_312) .cse1 v_ArrVal_311) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_315)) .cse0 v_ArrVal_312) .cse1 v_ArrVal_311) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_313)))) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-02-05 14:39:04,494 INFO L349 Elim1Store]: treesize reduction 167, result has 41.8 percent of original size [2025-02-05 14:39:04,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1320 treesize of output 1291 [2025-02-05 14:39:04,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:04,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1243 treesize of output 1239 [2025-02-05 14:39:04,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1428 treesize of output 1268 [2025-02-05 14:39:04,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1420 treesize of output 1340 [2025-02-05 14:39:04,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 4 [2025-02-05 14:39:05,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:05,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 223 [2025-02-05 14:39:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738397923] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:05,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:39:05,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2025-02-05 14:39:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906146949] [2025-02-05 14:39:05,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 14:39:05,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 14:39:05,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:05,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 14:39:05,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=955, Unknown=19, NotChecked=192, Total=1260 [2025-02-05 14:39:05,885 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 32 states, 30 states have (on average 1.4) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:39:06,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse9) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_prepend_~data#1|) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1) .cse3) .cse1)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|)) (.cse5 (select .cse6 .cse3))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4))) (not (= .cse5 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse1) .cse3 .cse5) .cse6)))))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse7 (select .cse8 .cse3))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) .cse1) .cse3 .cse7) .cse8)) (= .cse1 .cse7)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse9)) (= (select |c_#valid| .cse9) 1)))) is different from false [2025-02-05 14:39:06,506 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse9) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= 1 (select |c_#valid| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_prepend_~data#1|) (let ((.cse3 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1) .cse3) .cse1)))) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|)) (.cse5 (select .cse6 .cse3))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse4 (select |c_#memory_$Pointer$#1.base| .cse4))) (not (= .cse5 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse1 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse1) .cse3 .cse5) .cse6)))))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse7 (select .cse8 .cse3))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) .cse1) .cse3 .cse7) .cse8)) (= .cse1 .cse7)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse9)) (= (select |c_#valid| .cse9) 1)))) is different from true [2025-02-05 14:39:06,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select |c_#memory_$Pointer$#1.base| .cse0) (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 .cse0)) .cse0) 4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse3))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|)) (.cse1 (select .cse5 .cse4))) (and (not (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse3 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) .cse3) .cse4 .cse1) .cse5)))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse6 (select .cse7 .cse4))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse6)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse3) .cse4 .cse6) .cse7)) (= .cse3 .cse6))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse3)))) is different from false [2025-02-05 14:39:06,561 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (not (= (select |c_#memory_$Pointer$#1.base| .cse0) (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 0 .cse0)) .cse0) 4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) 8)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0) (let ((.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse3))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| |c_#memory_$Pointer$#1.base|)) (.cse1 (select .cse5 .cse4))) (and (not (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_3| .cse3 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) .cse3) .cse4 .cse1) .cse5)))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse6 (select .cse7 .cse4))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse6)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse3 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse3) .cse4 .cse6) .cse7)) (= .cse3 .cse6))))))) (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse3)))) is different from true [2025-02-05 14:39:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:06,719 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-02-05 14:39:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 14:39:06,720 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.4) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 32 [2025-02-05 14:39:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:06,721 INFO L225 Difference]: With dead ends: 34 [2025-02-05 14:39:06,722 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 14:39:06,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=152, Invalid=1566, Unknown=24, NotChecked=420, Total=2162 [2025-02-05 14:39:06,723 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:06,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 236 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 461 Invalid, 1 Unknown, 165 Unchecked, 0.5s Time] [2025-02-05 14:39:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 14:39:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-02-05 14:39:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 14:39:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-02-05 14:39:06,728 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 32 [2025-02-05 14:39:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:06,729 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-02-05 14:39:06,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.4) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:39:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-02-05 14:39:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 14:39:06,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:06,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:06,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:39:06,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:06,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:06,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash 630613022, now seen corresponding path program 1 times [2025-02-05 14:39:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:06,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259015489] [2025-02-05 14:39:06,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:06,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:39:06,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:39:06,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:06,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:39:07,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:07,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259015489] [2025-02-05 14:39:07,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259015489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:07,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634747958] [2025-02-05 14:39:07,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:07,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:07,200 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:39:07,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:39:07,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 14:39:07,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 14:39:07,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:07,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:07,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 14:39:07,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:07,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-05 14:39:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:39:07,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 14:39:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634747958] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:39:07,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:39:07,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-02-05 14:39:07,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782616942] [2025-02-05 14:39:07,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:39:07,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 14:39:07,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:39:07,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 14:39:07,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:39:07,560 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 14:39:11,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:39:15,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:39:19,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:39:23,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:39:27,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:39:32,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:39:36,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 14:39:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:39:36,067 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2025-02-05 14:39:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 14:39:36,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2025-02-05 14:39:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:39:36,068 INFO L225 Difference]: With dead ends: 59 [2025-02-05 14:39:36,068 INFO L226 Difference]: Without dead ends: 35 [2025-02-05 14:39:36,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-05 14:39:36,069 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:39:36,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 259 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 7 Unknown, 0 Unchecked, 28.4s Time] [2025-02-05 14:39:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-05 14:39:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-05 14:39:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 14:39:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-02-05 14:39:36,075 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 32 [2025-02-05 14:39:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:39:36,076 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-02-05 14:39:36,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 14:39:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-02-05 14:39:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 14:39:36,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:39:36,077 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:39:36,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:39:36,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:36,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:39:36,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:39:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash 457433022, now seen corresponding path program 1 times [2025-02-05 14:39:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:39:36,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494022829] [2025-02-05 14:39:36,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:36,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:39:36,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:39:36,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:39:36,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:36,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:39,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:39:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494022829] [2025-02-05 14:39:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494022829] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:39:39,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200634526] [2025-02-05 14:39:39,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:39:39,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:39:39,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:39:39,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:39:39,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:39:39,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 14:39:39,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 14:39:39,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:39:39,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:39:39,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-02-05 14:39:39,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:39:39,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-05 14:39:39,573 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 13 treesize of output 9 [2025-02-05 14:39:39,659 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:39:39,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-05 14:39:39,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-05 14:39:39,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-05 14:39:39,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-02-05 14:39:39,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:39,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2025-02-05 14:39:39,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-02-05 14:39:39,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2025-02-05 14:39:40,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 98 [2025-02-05 14:39:40,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2025-02-05 14:39:40,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-02-05 14:39:40,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 14:39:40,373 INFO L349 Elim1Store]: treesize reduction 8, result has 74.2 percent of original size [2025-02-05 14:39:40,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2025-02-05 14:39:40,487 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 8 .cse10)) (.cse4 (+ .cse10 4))) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (and (exists ((v_DerPreprocessor_6 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (let ((.cse1 (select .cse3 .cse4)) (.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (not (= .cse1 .cse2)) (= .cse3 (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 v_DerPreprocessor_6) .cse1 v_arrayElimArr_7) .cse2) .cse4 .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0))))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)) (= .cse2 .cse5) (= (select (select |c_#memory_int#1| .cse2) .cse6) 1)))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse9 .cse4))) (and (not (= .cse7 .cse8)) (exists ((v_DerPreprocessor_6 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse8 v_arrayElimArr_7) .cse7) .cse4 .cse8))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7)) (= .cse7 .cse5) (= (select (select |c_#memory_int#1| .cse7) .cse6) 1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2025-02-05 14:39:40,490 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 8 .cse10)) (.cse4 (+ .cse10 4))) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (and (exists ((v_DerPreprocessor_6 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (let ((.cse1 (select .cse3 .cse4)) (.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (not (= .cse1 .cse2)) (= .cse3 (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 v_DerPreprocessor_6) .cse1 v_arrayElimArr_7) .cse2) .cse4 .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0))))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2)) (= .cse2 .cse5) (= (select (select |c_#memory_int#1| .cse2) .cse6) 1)))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse9 .cse4))) (and (not (= .cse7 .cse8)) (exists ((v_DerPreprocessor_6 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse8 v_arrayElimArr_7) .cse7) .cse4 .cse8))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse8)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7)) (= .cse7 .cse5) (= (select (select |c_#memory_int#1| .cse7) .cse6) 1))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2025-02-05 14:39:40,579 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 8 .cse10)) (.cse4 (+ .cse10 4))) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (and (exists ((v_DerPreprocessor_6 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse0 (select .cse3 .cse4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (not (= .cse0 .cse2)) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= .cse3 (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 v_DerPreprocessor_6) .cse0 v_arrayElimArr_7) .cse2) .cse4 .cse0)))))) (= .cse2 .cse5) (= (select (select |c_#memory_int#1| .cse2) .cse6) 1) (not (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse9 .cse4))) (and (not (= .cse7 .cse8)) (exists ((v_DerPreprocessor_6 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse8 v_arrayElimArr_7) .cse7) .cse4 .cse8))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse8)) (= .cse7 .cse5) (= (select (select |c_#memory_int#1| .cse7) .cse6) 1) (not (= .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))))))))) is different from false [2025-02-05 14:39:40,584 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 8 .cse10)) (.cse4 (+ .cse10 4))) (or (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (and (exists ((v_DerPreprocessor_6 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |c_#memory_$Pointer$#1.base|)) (.cse0 (select .cse3 .cse4))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (not (= .cse0 .cse2)) (= .cse1 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (= .cse3 (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 v_DerPreprocessor_6) .cse0 v_arrayElimArr_7) .cse2) .cse4 .cse0)))))) (= .cse2 .cse5) (= (select (select |c_#memory_int#1| .cse2) .cse6) 1) (not (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7| Int) (v_arrayElimArr_7 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_7 |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_7|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse8 (select .cse9 .cse4))) (and (not (= .cse7 .cse8)) (exists ((v_DerPreprocessor_6 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_6) .cse8 v_arrayElimArr_7) .cse7) .cse4 .cse8))) (not (= |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| .cse8)) (= .cse7 .cse5) (= (select (select |c_#memory_int#1| .cse7) .cse6) 1) (not (= .cse7 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|))))))))))) is different from true [2025-02-05 14:39:40,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 347 [2025-02-05 14:39:40,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 597 [2025-02-05 14:39:40,668 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:39:40,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 347 [2025-02-05 14:39:40,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 693 treesize of output 590 [2025-02-05 14:39:40,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 605 treesize of output 486 [2025-02-05 14:39:40,704 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 14:39:40,714 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2025-02-05 14:39:40,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 455 treesize of output 431 [2025-02-05 14:39:40,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 369 [2025-02-05 14:39:40,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 350 [2025-02-05 14:39:40,752 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:40,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 347 [2025-02-05 14:39:40,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 597 [2025-02-05 14:39:40,790 WARN L200 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:40,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 432 [2025-02-05 14:39:40,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 837 treesize of output 710 [2025-02-05 14:39:40,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 745 treesize of output 594 [2025-02-05 14:39:40,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:40,872 INFO L349 Elim1Store]: treesize reduction 270, result has 0.4 percent of original size [2025-02-05 14:39:40,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 360 treesize of output 305 [2025-02-05 14:39:40,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 270 [2025-02-05 14:39:40,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 260 [2025-02-05 14:39:40,925 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:40,933 WARN L200 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:40,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 347 [2025-02-05 14:39:40,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 597 [2025-02-05 14:39:40,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 347 [2025-02-05 14:39:40,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 683 treesize of output 584 [2025-02-05 14:39:40,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 347 [2025-02-05 14:39:41,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 597 [2025-02-05 14:39:41,018 WARN L200 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:41,028 WARN L200 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:41,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 413 [2025-02-05 14:39:41,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 815 treesize of output 692 [2025-02-05 14:39:41,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 382 [2025-02-05 14:39:41,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 781 treesize of output 642 [2025-02-05 14:39:41,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 627 treesize of output 508 [2025-02-05 14:39:41,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:41,126 INFO L349 Elim1Store]: treesize reduction 174, result has 0.6 percent of original size [2025-02-05 14:39:41,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 340 treesize of output 309 [2025-02-05 14:39:41,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 270 [2025-02-05 14:39:41,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 260 [2025-02-05 14:39:41,165 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:39:41,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 448 [2025-02-05 14:39:41,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 881 treesize of output 718 [2025-02-05 14:39:41,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 745 treesize of output 602 [2025-02-05 14:39:41,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:41,689 INFO L349 Elim1Store]: treesize reduction 242, result has 29.0 percent of original size [2025-02-05 14:39:41,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 369 treesize of output 407 [2025-02-05 14:39:41,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 1 [2025-02-05 14:39:41,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2025-02-05 14:39:42,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 14:39:42,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-05 14:39:42,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-05 14:39:42,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-05 14:39:42,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-02-05 14:39:42,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-02-05 14:39:42,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-05 14:39:42,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-05 14:39:42,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-05 14:39:42,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-02-05 14:39:42,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-02-05 14:39:42,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2025-02-05 14:39:42,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-05 14:39:43,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-02-05 14:39:43,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-02-05 14:39:43,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:39:43,209 INFO L349 Elim1Store]: treesize reduction 212, result has 0.5 percent of original size [2025-02-05 14:39:43,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 607 treesize of output 526 [2025-02-05 14:39:43,247 INFO L349 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2025-02-05 14:39:43,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 575 treesize of output 548 [2025-02-05 14:39:43,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 778 [2025-02-05 14:39:43,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:43,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2025-02-05 14:39:43,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 1 [2025-02-05 14:39:43,417 INFO L349 Elim1Store]: treesize reduction 212, result has 0.5 percent of original size [2025-02-05 14:39:43,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 607 treesize of output 526 [2025-02-05 14:39:43,459 INFO L349 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2025-02-05 14:39:43,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 575 treesize of output 548 [2025-02-05 14:39:43,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 778 [2025-02-05 14:39:43,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 1 [2025-02-05 14:39:43,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:43,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2025-02-05 14:39:43,589 INFO L349 Elim1Store]: treesize reduction 212, result has 0.5 percent of original size [2025-02-05 14:39:43,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 607 treesize of output 526 [2025-02-05 14:39:43,641 INFO L349 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2025-02-05 14:39:43,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 584 treesize of output 555 [2025-02-05 14:39:43,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 778 [2025-02-05 14:39:43,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:43,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2025-02-05 14:39:43,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 1 [2025-02-05 14:39:43,897 INFO L349 Elim1Store]: treesize reduction 212, result has 0.5 percent of original size [2025-02-05 14:39:43,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 607 treesize of output 526 [2025-02-05 14:39:43,929 INFO L349 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2025-02-05 14:39:43,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 592 treesize of output 563 [2025-02-05 14:39:43,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 778 [2025-02-05 14:39:43,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:43,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2025-02-05 14:39:43,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 1 [2025-02-05 14:39:48,769 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse47 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (+ .cse4 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| .cse0))) (or (exists ((v_prenex_37 Int) (v_DerPreprocessor_19 (Array Int Int)) (|v_#memory_$Pointer$#1.base_57| (Array Int (Array Int Int))) (v_ArrVal_737 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_19 .cse4))) (let ((.cse1 (select v_prenex_38 v_prenex_37)) (.cse3 (+ .cse12 4))) (let ((.cse5 (select (select |v_#memory_$Pointer$#1.base_57| .cse1) .cse3))) (let ((.cse2 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_17) .cse5 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse1))) (let ((.cse7 (select .cse2 .cse3)) (.cse11 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_57|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse1 (store .cse2 .cse3 .cse4)) .cse5 v_ArrVal_737) .cse0) .cse6 .cse7) .cse8) (not (= .cse5 .cse1)) (let ((.cse10 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1))) (= (let ((.cse9 (select .cse10 .cse3))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 v_prenex_39) .cse9 v_prenex_38) .cse1) .cse3 .cse9)) .cse10)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse11 (select |v_#memory_$Pointer$#1.base_57| .cse11)) |v_#memory_$Pointer$#1.base_57|) (= (select (select |c_#memory_int#1| .cse1) (+ .cse12 8)) 1) (not (= .cse0 .cse5)) (not (= .cse0 .cse1)) (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_57| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse5 (select |c_#memory_$Pointer$#1.base| .cse5)) .cse0 (store (select (let ((.cse13 (let ((.cse14 (store |v_#memory_$Pointer$#1.base_57| .cse0 (store (select |v_#memory_$Pointer$#1.base_57| .cse0) .cse4 .cse1)))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse3 .cse0))))) (store .cse13 .cse5 (store (select .cse13 .cse5) .cse7 .cse0))) .cse0) .cse6 .cse5))) (= .cse11 .cse0)))))))) (exists ((v_arrayElimCell_94 Int) (v_prenex_37 Int) (v_DerPreprocessor_19 (Array Int Int)) (|v_#memory_$Pointer$#1.base_57| (Array Int (Array Int Int))) (v_ArrVal_737 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse25 (select v_DerPreprocessor_19 .cse4))) (let ((.cse15 (select v_prenex_38 v_prenex_37)) (.cse17 (+ .cse25 4))) (let ((.cse18 (select (select |v_#memory_$Pointer$#1.base_57| .cse15) .cse17))) (let ((.cse16 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse15 v_DerPreprocessor_17) .cse18 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse15))) (let ((.cse23 (select |c_#memory_int#1| v_arrayElimCell_94)) (.cse19 (select .cse16 .cse17)) (.cse22 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_57|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse15 (store .cse16 .cse17 .cse4)) .cse18 v_ArrVal_737) .cse0) .cse6 .cse19) .cse8) (not (= .cse18 .cse15)) (let ((.cse21 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse15))) (= (let ((.cse20 (select .cse21 .cse17))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse15 v_prenex_39) .cse20 v_prenex_38) .cse15) .cse17 .cse20)) .cse21)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse22 (select |v_#memory_$Pointer$#1.base_57| .cse22)) |v_#memory_$Pointer$#1.base_57|) (let ((.cse24 (select |c_#memory_int#1| .cse15))) (= (store .cse23 .cse17 (select .cse24 .cse17)) .cse24)) (not (= .cse0 .cse18)) (= (select .cse23 (+ .cse25 8)) 1) (not (= .cse0 .cse15)) (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_57| .cse15 (select |c_#memory_$Pointer$#1.base| .cse15)) .cse18 (select |c_#memory_$Pointer$#1.base| .cse18)) .cse0 (store (select (let ((.cse26 (let ((.cse27 (store |v_#memory_$Pointer$#1.base_57| .cse0 (store (select |v_#memory_$Pointer$#1.base_57| .cse0) .cse4 .cse15)))) (store .cse27 .cse15 (store (select .cse27 .cse15) .cse17 .cse0))))) (store .cse26 .cse18 (store (select .cse26 .cse18) .cse19 .cse0))) .cse0) .cse6 .cse18))) (= .cse22 .cse0)))))))) (exists ((v_arrayElimCell_94 Int) (v_prenex_37 Int) (v_DerPreprocessor_19 (Array Int Int)) (|v_#memory_$Pointer$#1.base_57| (Array Int (Array Int Int))) (v_ArrVal_737 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse37 (select v_DerPreprocessor_19 .cse4))) (let ((.cse28 (select v_prenex_38 v_prenex_37)) (.cse30 (+ .cse37 4))) (let ((.cse31 (select (select |v_#memory_$Pointer$#1.base_57| .cse28) .cse30))) (let ((.cse29 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse28 v_DerPreprocessor_17) .cse31 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse28))) (let ((.cse36 (select |c_#memory_int#1| .cse28)) (.cse32 (select .cse29 .cse30)) (.cse35 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_57|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse28 (store .cse29 .cse30 .cse4)) .cse31 v_ArrVal_737) .cse0) .cse6 .cse32) .cse8) (not (= .cse31 .cse28)) (let ((.cse34 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse28))) (= (let ((.cse33 (select .cse34 .cse30))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse28 v_prenex_39) .cse33 v_prenex_38) .cse28) .cse30 .cse33)) .cse34)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse35 (select |v_#memory_$Pointer$#1.base_57| .cse35)) |v_#memory_$Pointer$#1.base_57|) (= (select .cse36 (+ .cse37 8)) 1) (= (select |c_#memory_int#1| v_arrayElimCell_94) .cse36) (not (= .cse0 .cse31)) (not (= .cse0 .cse28)) (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_57| .cse28 (select |c_#memory_$Pointer$#1.base| .cse28)) .cse31 (select |c_#memory_$Pointer$#1.base| .cse31)) .cse0 (store (select (let ((.cse38 (let ((.cse39 (store |v_#memory_$Pointer$#1.base_57| .cse0 (store (select |v_#memory_$Pointer$#1.base_57| .cse0) .cse4 .cse28)))) (store .cse39 .cse28 (store (select .cse39 .cse28) .cse30 .cse0))))) (store .cse38 .cse31 (store (select .cse38 .cse31) .cse32 .cse0))) .cse0) .cse6 .cse31))) (= .cse35 .cse0)))))))) (exists ((v_DerPreprocessor_24 Int) (v_arrayElimArr_23 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse42 (select v_DerPreprocessor_19 .cse4)) (.cse41 (select v_arrayElimArr_23 .cse4))) (let ((.cse45 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse41 v_DerPreprocessor_25) v_DerPreprocessor_24 v_DerPreprocessor_26) .cse0 v_arrayElimArr_23) .cse41)) (.cse46 (+ .cse42 4))) (let ((.cse40 (select .cse45 .cse46))) (let ((.cse48 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse41 v_DerPreprocessor_17) .cse40 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse41))) (let ((.cse44 (select .cse48 .cse46))) (and (= v_DerPreprocessor_24 .cse40) (not (= .cse40 .cse0)) (not (= .cse41 .cse40)) (= (select (select |c_#memory_int#1| .cse41) (+ .cse42 8)) 1) (not (= .cse41 .cse0)) (= (store (select (let ((.cse43 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_24 v_DerPreprocessor_26) .cse0 v_arrayElimArr_23) .cse41 (store .cse45 .cse46 .cse0)))) (store .cse43 .cse40 (store (select .cse43 .cse40) .cse44 .cse0))) .cse0) .cse6 .cse40) .cse47) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse41 (store .cse48 .cse46 .cse4)) .cse40 v_ArrVal_737) .cse0) .cse6 .cse44) .cse8)))))))) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse54 (select v_DerPreprocessor_19 .cse4)) (.cse50 (select v_arrayElimArr_29 .cse4))) (let ((.cse56 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse50 v_DerPreprocessor_33) v_DerPreprocessor_32 v_DerPreprocessor_34) .cse0 v_arrayElimArr_29) .cse50)) (.cse52 (+ .cse54 4))) (let ((.cse49 (select .cse56 .cse52))) (let ((.cse51 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse50 v_DerPreprocessor_17) .cse49 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse50))) (let ((.cse53 (select .cse51 .cse52))) (and (not (= .cse49 .cse0)) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse50 (store .cse51 .cse52 .cse4)) .cse49 v_ArrVal_737) .cse0) .cse6 .cse53) .cse8) (not (= .cse50 .cse49)) (= (select (select |c_#memory_int#1| .cse50) (+ .cse54 8)) 1) (not (= .cse50 .cse0)) (= v_DerPreprocessor_32 .cse49) (= (store (select (let ((.cse55 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32 v_DerPreprocessor_34) .cse0 v_arrayElimArr_29) .cse50 (store .cse56 .cse52 .cse0)))) (store .cse55 .cse49 (store (select .cse55 .cse49) .cse53 .cse0))) .cse0) .cse6 .cse49) .cse47)))))))) (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_20 Int) (v_DerPreprocessor_22 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse66 (select v_DerPreprocessor_19 .cse4)) (.cse61 (select v_arrayElimArr_20 .cse4))) (let ((.cse65 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse61 v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse0 v_arrayElimArr_20) .cse61)) (.cse60 (+ .cse66 4))) (let ((.cse57 (select .cse65 .cse60))) (let ((.cse62 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse61 v_DerPreprocessor_17) .cse57 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse61))) (let ((.cse63 (select .cse62 .cse60)) (.cse59 (select |c_#memory_int#1| v_arrayElimCell_106))) (and (not (= .cse0 .cse57)) (let ((.cse58 (select |c_#memory_int#1| .cse61))) (= .cse58 (store .cse59 .cse60 (select .cse58 .cse60)))) (not (= .cse61 .cse0)) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse61 (store .cse62 .cse60 .cse4)) .cse57 v_ArrVal_737) .cse0) .cse6 .cse63) .cse8) (not (= .cse61 .cse57)) (= v_DerPreprocessor_20 .cse57) (= (store (select (let ((.cse64 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_20 v_DerPreprocessor_22) .cse0 v_arrayElimArr_20) .cse61 (store .cse65 .cse60 .cse0)))) (store .cse64 .cse57 (store (select .cse64 .cse57) .cse63 .cse0))) .cse0) .cse6 .cse57) .cse47) (= (select .cse59 (+ .cse66 8)) 1)))))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_arrayElimCell_105 Int)) (let ((.cse75 (select v_DerPreprocessor_19 .cse4)) (.cse70 (select v_arrayElimArr_26 .cse4))) (let ((.cse71 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse70 v_DerPreprocessor_29) v_DerPreprocessor_28 v_DerPreprocessor_30) .cse0 v_arrayElimArr_26) .cse70)) (.cse72 (+ .cse75 4))) (let ((.cse68 (select .cse71 .cse72))) (let ((.cse73 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse70 v_DerPreprocessor_17) .cse68 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse70))) (let ((.cse69 (select .cse73 .cse72)) (.cse74 (select |c_#memory_int#1| v_arrayElimCell_105))) (and (= (store (select (let ((.cse67 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_28 v_DerPreprocessor_30) .cse0 v_arrayElimArr_26) .cse70 (store .cse71 .cse72 .cse0)))) (store .cse67 .cse68 (store (select .cse67 .cse68) .cse69 .cse0))) .cse0) .cse6 .cse68) .cse47) (= v_DerPreprocessor_28 .cse68) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse70 (store .cse73 .cse72 .cse4)) .cse68 v_ArrVal_737) .cse0) .cse6 .cse69) .cse8) (not (= .cse70 .cse68)) (not (= .cse70 .cse0)) (= (select .cse74 (+ .cse75 8)) 1) (not (= .cse0 .cse68)) (= (select |c_#memory_int#1| .cse70) .cse74))))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2025-02-05 14:39:48,780 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse47 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (+ .cse4 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| .cse0))) (or (exists ((v_prenex_37 Int) (v_DerPreprocessor_19 (Array Int Int)) (|v_#memory_$Pointer$#1.base_57| (Array Int (Array Int Int))) (v_ArrVal_737 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_19 .cse4))) (let ((.cse1 (select v_prenex_38 v_prenex_37)) (.cse3 (+ .cse12 4))) (let ((.cse5 (select (select |v_#memory_$Pointer$#1.base_57| .cse1) .cse3))) (let ((.cse2 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_DerPreprocessor_17) .cse5 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse1))) (let ((.cse7 (select .cse2 .cse3)) (.cse11 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_57|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse1 (store .cse2 .cse3 .cse4)) .cse5 v_ArrVal_737) .cse0) .cse6 .cse7) .cse8) (not (= .cse5 .cse1)) (let ((.cse10 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1))) (= (let ((.cse9 (select .cse10 .cse3))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse1 v_prenex_39) .cse9 v_prenex_38) .cse1) .cse3 .cse9)) .cse10)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse11 (select |v_#memory_$Pointer$#1.base_57| .cse11)) |v_#memory_$Pointer$#1.base_57|) (= (select (select |c_#memory_int#1| .cse1) (+ .cse12 8)) 1) (not (= .cse0 .cse5)) (not (= .cse0 .cse1)) (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_57| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) .cse5 (select |c_#memory_$Pointer$#1.base| .cse5)) .cse0 (store (select (let ((.cse13 (let ((.cse14 (store |v_#memory_$Pointer$#1.base_57| .cse0 (store (select |v_#memory_$Pointer$#1.base_57| .cse0) .cse4 .cse1)))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse3 .cse0))))) (store .cse13 .cse5 (store (select .cse13 .cse5) .cse7 .cse0))) .cse0) .cse6 .cse5))) (= .cse11 .cse0)))))))) (exists ((v_arrayElimCell_94 Int) (v_prenex_37 Int) (v_DerPreprocessor_19 (Array Int Int)) (|v_#memory_$Pointer$#1.base_57| (Array Int (Array Int Int))) (v_ArrVal_737 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse25 (select v_DerPreprocessor_19 .cse4))) (let ((.cse15 (select v_prenex_38 v_prenex_37)) (.cse17 (+ .cse25 4))) (let ((.cse18 (select (select |v_#memory_$Pointer$#1.base_57| .cse15) .cse17))) (let ((.cse16 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse15 v_DerPreprocessor_17) .cse18 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse15))) (let ((.cse23 (select |c_#memory_int#1| v_arrayElimCell_94)) (.cse19 (select .cse16 .cse17)) (.cse22 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_57|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse15 (store .cse16 .cse17 .cse4)) .cse18 v_ArrVal_737) .cse0) .cse6 .cse19) .cse8) (not (= .cse18 .cse15)) (let ((.cse21 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse15))) (= (let ((.cse20 (select .cse21 .cse17))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse15 v_prenex_39) .cse20 v_prenex_38) .cse15) .cse17 .cse20)) .cse21)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse22 (select |v_#memory_$Pointer$#1.base_57| .cse22)) |v_#memory_$Pointer$#1.base_57|) (let ((.cse24 (select |c_#memory_int#1| .cse15))) (= (store .cse23 .cse17 (select .cse24 .cse17)) .cse24)) (not (= .cse0 .cse18)) (= (select .cse23 (+ .cse25 8)) 1) (not (= .cse0 .cse15)) (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_57| .cse15 (select |c_#memory_$Pointer$#1.base| .cse15)) .cse18 (select |c_#memory_$Pointer$#1.base| .cse18)) .cse0 (store (select (let ((.cse26 (let ((.cse27 (store |v_#memory_$Pointer$#1.base_57| .cse0 (store (select |v_#memory_$Pointer$#1.base_57| .cse0) .cse4 .cse15)))) (store .cse27 .cse15 (store (select .cse27 .cse15) .cse17 .cse0))))) (store .cse26 .cse18 (store (select .cse26 .cse18) .cse19 .cse0))) .cse0) .cse6 .cse18))) (= .cse22 .cse0)))))))) (exists ((v_arrayElimCell_94 Int) (v_prenex_37 Int) (v_DerPreprocessor_19 (Array Int Int)) (|v_#memory_$Pointer$#1.base_57| (Array Int (Array Int Int))) (v_ArrVal_737 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse37 (select v_DerPreprocessor_19 .cse4))) (let ((.cse28 (select v_prenex_38 v_prenex_37)) (.cse30 (+ .cse37 4))) (let ((.cse31 (select (select |v_#memory_$Pointer$#1.base_57| .cse28) .cse30))) (let ((.cse29 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse28 v_DerPreprocessor_17) .cse31 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse28))) (let ((.cse36 (select |c_#memory_int#1| .cse28)) (.cse32 (select .cse29 .cse30)) (.cse35 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_57|))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse28 (store .cse29 .cse30 .cse4)) .cse31 v_ArrVal_737) .cse0) .cse6 .cse32) .cse8) (not (= .cse31 .cse28)) (let ((.cse34 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse28))) (= (let ((.cse33 (select .cse34 .cse30))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse28 v_prenex_39) .cse33 v_prenex_38) .cse28) .cse30 .cse33)) .cse34)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse35 (select |v_#memory_$Pointer$#1.base_57| .cse35)) |v_#memory_$Pointer$#1.base_57|) (= (select .cse36 (+ .cse37 8)) 1) (= (select |c_#memory_int#1| v_arrayElimCell_94) .cse36) (not (= .cse0 .cse31)) (not (= .cse0 .cse28)) (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_57| .cse28 (select |c_#memory_$Pointer$#1.base| .cse28)) .cse31 (select |c_#memory_$Pointer$#1.base| .cse31)) .cse0 (store (select (let ((.cse38 (let ((.cse39 (store |v_#memory_$Pointer$#1.base_57| .cse0 (store (select |v_#memory_$Pointer$#1.base_57| .cse0) .cse4 .cse28)))) (store .cse39 .cse28 (store (select .cse39 .cse28) .cse30 .cse0))))) (store .cse38 .cse31 (store (select .cse38 .cse31) .cse32 .cse0))) .cse0) .cse6 .cse31))) (= .cse35 .cse0)))))))) (exists ((v_DerPreprocessor_24 Int) (v_arrayElimArr_23 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse42 (select v_DerPreprocessor_19 .cse4)) (.cse41 (select v_arrayElimArr_23 .cse4))) (let ((.cse45 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse41 v_DerPreprocessor_25) v_DerPreprocessor_24 v_DerPreprocessor_26) .cse0 v_arrayElimArr_23) .cse41)) (.cse46 (+ .cse42 4))) (let ((.cse40 (select .cse45 .cse46))) (let ((.cse48 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse41 v_DerPreprocessor_17) .cse40 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse41))) (let ((.cse44 (select .cse48 .cse46))) (and (= v_DerPreprocessor_24 .cse40) (not (= .cse40 .cse0)) (not (= .cse41 .cse40)) (= (select (select |c_#memory_int#1| .cse41) (+ .cse42 8)) 1) (not (= .cse41 .cse0)) (= (store (select (let ((.cse43 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_24 v_DerPreprocessor_26) .cse0 v_arrayElimArr_23) .cse41 (store .cse45 .cse46 .cse0)))) (store .cse43 .cse40 (store (select .cse43 .cse40) .cse44 .cse0))) .cse0) .cse6 .cse40) .cse47) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse41 (store .cse48 .cse46 .cse4)) .cse40 v_ArrVal_737) .cse0) .cse6 .cse44) .cse8)))))))) (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse54 (select v_DerPreprocessor_19 .cse4)) (.cse50 (select v_arrayElimArr_29 .cse4))) (let ((.cse56 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse50 v_DerPreprocessor_33) v_DerPreprocessor_32 v_DerPreprocessor_34) .cse0 v_arrayElimArr_29) .cse50)) (.cse52 (+ .cse54 4))) (let ((.cse49 (select .cse56 .cse52))) (let ((.cse51 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse50 v_DerPreprocessor_17) .cse49 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse50))) (let ((.cse53 (select .cse51 .cse52))) (and (not (= .cse49 .cse0)) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse50 (store .cse51 .cse52 .cse4)) .cse49 v_ArrVal_737) .cse0) .cse6 .cse53) .cse8) (not (= .cse50 .cse49)) (= (select (select |c_#memory_int#1| .cse50) (+ .cse54 8)) 1) (not (= .cse50 .cse0)) (= v_DerPreprocessor_32 .cse49) (= (store (select (let ((.cse55 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32 v_DerPreprocessor_34) .cse0 v_arrayElimArr_29) .cse50 (store .cse56 .cse52 .cse0)))) (store .cse55 .cse49 (store (select .cse55 .cse49) .cse53 .cse0))) .cse0) .cse6 .cse49) .cse47)))))))) (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_20 Int) (v_DerPreprocessor_22 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse66 (select v_DerPreprocessor_19 .cse4)) (.cse61 (select v_arrayElimArr_20 .cse4))) (let ((.cse65 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse61 v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse0 v_arrayElimArr_20) .cse61)) (.cse60 (+ .cse66 4))) (let ((.cse57 (select .cse65 .cse60))) (let ((.cse62 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse61 v_DerPreprocessor_17) .cse57 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse61))) (let ((.cse63 (select .cse62 .cse60)) (.cse59 (select |c_#memory_int#1| v_arrayElimCell_106))) (and (not (= .cse0 .cse57)) (let ((.cse58 (select |c_#memory_int#1| .cse61))) (= .cse58 (store .cse59 .cse60 (select .cse58 .cse60)))) (not (= .cse61 .cse0)) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse61 (store .cse62 .cse60 .cse4)) .cse57 v_ArrVal_737) .cse0) .cse6 .cse63) .cse8) (not (= .cse61 .cse57)) (= v_DerPreprocessor_20 .cse57) (= (store (select (let ((.cse64 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_20 v_DerPreprocessor_22) .cse0 v_arrayElimArr_20) .cse61 (store .cse65 .cse60 .cse0)))) (store .cse64 .cse57 (store (select .cse64 .cse57) .cse63 .cse0))) .cse0) .cse6 .cse57) .cse47) (= (select .cse59 (+ .cse66 8)) 1)))))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_arrayElimCell_105 Int)) (let ((.cse75 (select v_DerPreprocessor_19 .cse4)) (.cse70 (select v_arrayElimArr_26 .cse4))) (let ((.cse71 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse70 v_DerPreprocessor_29) v_DerPreprocessor_28 v_DerPreprocessor_30) .cse0 v_arrayElimArr_26) .cse70)) (.cse72 (+ .cse75 4))) (let ((.cse68 (select .cse71 .cse72))) (let ((.cse73 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse70 v_DerPreprocessor_17) .cse68 v_DerPreprocessor_18) .cse0 v_DerPreprocessor_19) .cse70))) (let ((.cse69 (select .cse73 .cse72)) (.cse74 (select |c_#memory_int#1| v_arrayElimCell_105))) (and (= (store (select (let ((.cse67 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_28 v_DerPreprocessor_30) .cse0 v_arrayElimArr_26) .cse70 (store .cse71 .cse72 .cse0)))) (store .cse67 .cse68 (store (select .cse67 .cse68) .cse69 .cse0))) .cse0) .cse6 .cse68) .cse47) (= v_DerPreprocessor_28 .cse68) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_19) .cse70 (store .cse73 .cse72 .cse4)) .cse68 v_ArrVal_737) .cse0) .cse6 .cse69) .cse8) (not (= .cse70 .cse68)) (not (= .cse70 .cse0)) (= (select .cse74 (+ .cse75 8)) 1) (not (= .cse0 .cse68)) (= (select |c_#memory_int#1| .cse70) .cse74))))))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2025-02-05 14:39:48,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4848 treesize of output 3620 [2025-02-05 14:39:48,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3624 treesize of output 2924 [2025-02-05 14:39:53,415 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse33 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (or (exists ((v_arrayElimCell_94 Int) (v_prenex_37 Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (|v_#memory_$Pointer$#1.base_57| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse0 (select v_prenex_38 v_prenex_37)) (.cse5 (+ .cse13 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_57| .cse0) .cse5))) (let ((.cse8 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_17) .cse1 v_DerPreprocessor_18) |c_ULTIMATE.start_main_~ptr~0#1.base| v_DerPreprocessor_19) .cse0))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_57|)) (.cse10 (select .cse8 .cse5)) (.cse3 (select |c_#memory_int#1| .cse0))) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (not (= .cse1 .cse0)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 (select |v_#memory_$Pointer$#1.base_57| .cse2)) |v_#memory_$Pointer$#1.base_57|) (= (select |c_#memory_int#1| v_arrayElimCell_94) .cse3) (let ((.cse6 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0))) (= (let ((.cse4 (select .cse6 .cse5))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 v_prenex_39) .cse4 v_prenex_38) .cse0) .cse5 .cse4)) .cse6)) (= .cse7 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_DerPreprocessor_19) .cse0 (store .cse8 .cse5 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse1 v_ArrVal_737) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse10)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_57| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)) .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select (let ((.cse11 (let ((.cse12 (store |v_#memory_$Pointer$#1.base_57| |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select |v_#memory_$Pointer$#1.base_57| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse0)))) (store .cse12 .cse0 (store (select .cse12 .cse0) .cse5 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) (store .cse11 .cse1 (store (select .cse11 .cse1) .cse10 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse1))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (= (select .cse3 (+ .cse13 8)) 1)))))))) (exists ((v_prenex_190 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_185 (Array Int Int)) (v_prenex_187 (Array Int Int)) (v_prenex_184 (Array Int (Array Int Int))) (v_prenex_188 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_186 (Array Int (Array Int Int))) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse24 (select v_prenex_183 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse14 (select v_prenex_190 v_prenex_182)) (.cse16 (+ .cse24 4))) (let ((.cse17 (select (select v_prenex_184 .cse14) .cse16))) (let ((.cse15 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse14 v_prenex_187) .cse17 v_prenex_188) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_183) .cse14))) (let ((.cse19 (select |c_#memory_int#1| v_prenex_181)) (.cse21 (@diff v_prenex_186 v_prenex_184)) (.cse18 (select .cse15 .cse16))) (and (= .cse7 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_183) .cse14 (store .cse15 .cse16 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse17 v_prenex_185) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse18)) (let ((.cse20 (select |c_#memory_int#1| .cse14))) (= (store .cse19 .cse16 (select .cse20 .cse16)) .cse20)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse21) (not (= .cse14 .cse17)) (let ((.cse23 (select v_prenex_186 .cse14))) (= (let ((.cse22 (select .cse23 .cse16))) (store (select (store (store v_prenex_186 .cse14 v_prenex_189) .cse22 v_prenex_190) .cse14) .cse16 .cse22)) .cse23)) (= (select .cse19 (+ 8 .cse24)) 1) (not (= .cse14 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (store v_prenex_186 .cse21 (select v_prenex_184 .cse21)) v_prenex_184) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse17)) (= |c_#memory_$Pointer$#1.base| (store (store (store v_prenex_184 .cse14 (select |c_#memory_$Pointer$#1.base| .cse14)) .cse17 (select |c_#memory_$Pointer$#1.base| .cse17)) |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select (let ((.cse25 (let ((.cse26 (store v_prenex_184 |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select v_prenex_184 |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse14)))) (store .cse26 .cse14 (store (select .cse26 .cse14) .cse16 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) (store .cse25 .cse17 (store (select .cse25 .cse17) .cse18 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse17)))))))))) (exists ((v_prenex_170 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (v_prenex_169 (Array Int Int)) (v_arrayElimCell_106 Int) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_20 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse35 (select v_prenex_169 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse28 (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse31 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse28 v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_20) .cse28)) (.cse32 (+ .cse35 4))) (let ((.cse27 (select .cse31 .cse32))) (let ((.cse36 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse28 v_prenex_171) .cse27 v_prenex_172) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_169) .cse28))) (let ((.cse30 (select .cse36 .cse32)) (.cse34 (select |c_#memory_int#1| v_arrayElimCell_106))) (and (not (= .cse27 .cse28)) (= (store (select (let ((.cse29 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_20 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_20) .cse28 (store .cse31 .cse32 |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (store .cse29 .cse27 (store (select .cse29 .cse27) .cse30 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse27) .cse33) (= (select .cse34 (+ .cse35 8)) 1) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_169) .cse28 (store .cse36 .cse32 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse27 v_prenex_170) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse30) .cse7) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse28)) (let ((.cse37 (select |c_#memory_int#1| .cse28))) (= (store .cse34 .cse32 (select .cse37 .cse32)) .cse37)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse27)) (= .cse27 v_DerPreprocessor_20)))))))) (exists ((v_prenex_199 (Array Int (Array Int Int))) (v_prenex_196 (Array Int Int)) (v_prenex_198 (Array Int Int)) (v_prenex_200 (Array Int Int)) (v_prenex_201 (Array Int Int)) (v_prenex_195 Int) (v_prenex_197 (Array Int (Array Int Int))) (v_prenex_202 (Array Int Int)) (v_prenex_203 (Array Int Int))) (let ((.cse48 (select v_prenex_196 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse39 (select v_prenex_203 v_prenex_195)) (.cse41 (+ .cse48 4))) (let ((.cse43 (select (select v_prenex_197 .cse39) .cse41))) (let ((.cse44 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse39 v_prenex_200) .cse43 v_prenex_201) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_196) .cse39))) (let ((.cse42 (@diff v_prenex_199 v_prenex_197)) (.cse45 (select .cse44 .cse41))) (and (let ((.cse38 (select v_prenex_199 .cse39))) (= .cse38 (let ((.cse40 (select .cse38 .cse41))) (store (select (store (store v_prenex_199 .cse39 v_prenex_202) .cse40 v_prenex_203) .cse39) .cse41 .cse40)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse42) (not (= .cse39 .cse43)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse43)) (= .cse7 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_196) .cse39 (store .cse44 .cse41 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse43 v_prenex_198) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse45)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse39)) (= (store v_prenex_199 .cse42 (select v_prenex_197 .cse42)) v_prenex_197) (= (store (store (store v_prenex_197 .cse39 (select |c_#memory_$Pointer$#1.base| .cse39)) .cse43 (select |c_#memory_$Pointer$#1.base| .cse43)) |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select (let ((.cse46 (let ((.cse47 (store v_prenex_197 |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select v_prenex_197 |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse39)))) (store .cse47 .cse39 (store (select .cse47 .cse39) .cse41 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) (store .cse46 .cse43 (store (select .cse46 .cse43) .cse45 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse43)) |c_#memory_$Pointer$#1.base|) (= (select (select |c_#memory_int#1| .cse39) (+ .cse48 8)) 1)))))))) (exists ((v_DerPreprocessor_24 Int) (v_prenex_180 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse56 (select v_prenex_177 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse49 (select v_arrayElimArr_23 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse55 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse49 v_DerPreprocessor_25) v_DerPreprocessor_24 v_DerPreprocessor_26) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_23) .cse49)) (.cse51 (+ .cse56 4))) (let ((.cse52 (select .cse55 .cse51))) (let ((.cse50 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse49 v_prenex_179) .cse52 v_prenex_180) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_177) .cse49))) (let ((.cse53 (select .cse50 .cse51))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_177) .cse49 (store .cse50 .cse51 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse52 v_prenex_178) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse53) .cse7) (= (store (select (let ((.cse54 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_24 v_DerPreprocessor_26) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_23) .cse49 (store .cse55 .cse51 |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (store .cse54 .cse52 (store (select .cse54 .cse52) .cse53 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse52) .cse33) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse49)) (not (= .cse49 .cse52)) (= (select (select |c_#memory_int#1| .cse49) (+ .cse56 8)) 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse52)) (= v_DerPreprocessor_24 .cse52)))))))) (exists ((v_prenex_191 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_prenex_192 (Array Int Int)) (v_prenex_193 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_prenex_194 (Array Int Int)) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimCell_105 Int)) (let ((.cse60 (select v_prenex_191 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse58 (select v_arrayElimArr_26 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse63 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse58 v_DerPreprocessor_29) v_DerPreprocessor_28 v_DerPreprocessor_30) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_26) .cse58)) (.cse64 (+ .cse60 4))) (let ((.cse57 (select .cse63 .cse64))) (let ((.cse65 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse58 v_prenex_193) .cse57 v_prenex_194) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_191) .cse58))) (let ((.cse59 (select |c_#memory_int#1| v_arrayElimCell_105)) (.cse62 (select .cse65 .cse64))) (and (= v_DerPreprocessor_28 .cse57) (= (select |c_#memory_int#1| .cse58) .cse59) (= (select .cse59 (+ 8 .cse60)) 1) (= (store (select (let ((.cse61 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_28 v_DerPreprocessor_30) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_26) .cse58 (store .cse63 .cse64 |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (store .cse61 .cse57 (store (select .cse61 .cse57) .cse62 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse57) .cse33) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_191) .cse58 (store .cse65 .cse64 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse57 v_prenex_192) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse62) .cse7) (not (= .cse58 .cse57)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse58)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse57))))))))) (exists ((v_prenex_173 (Array Int Int)) (v_prenex_174 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse73 (select v_prenex_173 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse66 (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse72 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse66 v_DerPreprocessor_33) v_DerPreprocessor_32 v_DerPreprocessor_34) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_29) .cse66)) (.cse68 (+ .cse73 4))) (let ((.cse69 (select .cse72 .cse68))) (let ((.cse67 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse66 v_prenex_175) .cse69 v_prenex_176) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_173) .cse66))) (let ((.cse70 (select .cse67 .cse68))) (and (= .cse7 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_173) .cse66 (store .cse67 .cse68 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse69 v_prenex_174) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse70)) (not (= .cse66 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (not (= .cse69 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= .cse33 (store (select (let ((.cse71 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32 v_DerPreprocessor_34) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_29) .cse66 (store .cse72 .cse68 |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (store .cse71 .cse69 (store (select .cse71 .cse69) .cse70 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse69)) (= .cse69 v_DerPreprocessor_32) (not (= .cse66 .cse69)) (= (select (select |c_#memory_int#1| .cse66) (+ .cse73 8)) 1))))))))))) is different from false [2025-02-05 14:39:53,430 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse33 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (or (exists ((v_arrayElimCell_94 Int) (v_prenex_37 Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (|v_#memory_$Pointer$#1.base_57| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_prenex_38 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_19 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse0 (select v_prenex_38 v_prenex_37)) (.cse5 (+ .cse13 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_57| .cse0) .cse5))) (let ((.cse8 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_DerPreprocessor_17) .cse1 v_DerPreprocessor_18) |c_ULTIMATE.start_main_~ptr~0#1.base| v_DerPreprocessor_19) .cse0))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| |v_#memory_$Pointer$#1.base_57|)) (.cse10 (select .cse8 .cse5)) (.cse3 (select |c_#memory_int#1| .cse0))) (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (not (= .cse1 .cse0)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse2 (select |v_#memory_$Pointer$#1.base_57| .cse2)) |v_#memory_$Pointer$#1.base_57|) (= (select |c_#memory_int#1| v_arrayElimCell_94) .cse3) (let ((.cse6 (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0))) (= (let ((.cse4 (select .cse6 .cse5))) (store (select (store (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_9| .cse0 v_prenex_39) .cse4 v_prenex_38) .cse0) .cse5 .cse4)) .cse6)) (= .cse7 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_DerPreprocessor_19) .cse0 (store .cse8 .cse5 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse1 v_ArrVal_737) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse10)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= |c_#memory_$Pointer$#1.base| (store (store (store |v_#memory_$Pointer$#1.base_57| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)) .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select (let ((.cse11 (let ((.cse12 (store |v_#memory_$Pointer$#1.base_57| |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select |v_#memory_$Pointer$#1.base_57| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse0)))) (store .cse12 .cse0 (store (select .cse12 .cse0) .cse5 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) (store .cse11 .cse1 (store (select .cse11 .cse1) .cse10 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse1))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (= (select .cse3 (+ .cse13 8)) 1)))))))) (exists ((v_prenex_190 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_185 (Array Int Int)) (v_prenex_187 (Array Int Int)) (v_prenex_184 (Array Int (Array Int Int))) (v_prenex_188 (Array Int Int)) (v_prenex_189 (Array Int Int)) (v_prenex_186 (Array Int (Array Int Int))) (v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse24 (select v_prenex_183 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse14 (select v_prenex_190 v_prenex_182)) (.cse16 (+ .cse24 4))) (let ((.cse17 (select (select v_prenex_184 .cse14) .cse16))) (let ((.cse15 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse14 v_prenex_187) .cse17 v_prenex_188) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_183) .cse14))) (let ((.cse19 (select |c_#memory_int#1| v_prenex_181)) (.cse21 (@diff v_prenex_186 v_prenex_184)) (.cse18 (select .cse15 .cse16))) (and (= .cse7 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_183) .cse14 (store .cse15 .cse16 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse17 v_prenex_185) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse18)) (let ((.cse20 (select |c_#memory_int#1| .cse14))) (= (store .cse19 .cse16 (select .cse20 .cse16)) .cse20)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse21) (not (= .cse14 .cse17)) (let ((.cse23 (select v_prenex_186 .cse14))) (= (let ((.cse22 (select .cse23 .cse16))) (store (select (store (store v_prenex_186 .cse14 v_prenex_189) .cse22 v_prenex_190) .cse14) .cse16 .cse22)) .cse23)) (= (select .cse19 (+ 8 .cse24)) 1) (not (= .cse14 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (store v_prenex_186 .cse21 (select v_prenex_184 .cse21)) v_prenex_184) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse17)) (= |c_#memory_$Pointer$#1.base| (store (store (store v_prenex_184 .cse14 (select |c_#memory_$Pointer$#1.base| .cse14)) .cse17 (select |c_#memory_$Pointer$#1.base| .cse17)) |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select (let ((.cse25 (let ((.cse26 (store v_prenex_184 |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select v_prenex_184 |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse14)))) (store .cse26 .cse14 (store (select .cse26 .cse14) .cse16 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) (store .cse25 .cse17 (store (select .cse25 .cse17) .cse18 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse17)))))))))) (exists ((v_prenex_170 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_prenex_171 (Array Int Int)) (v_prenex_172 (Array Int Int)) (v_prenex_169 (Array Int Int)) (v_arrayElimCell_106 Int) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_20 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse35 (select v_prenex_169 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse28 (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse31 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse28 v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_20) .cse28)) (.cse32 (+ .cse35 4))) (let ((.cse27 (select .cse31 .cse32))) (let ((.cse36 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse28 v_prenex_171) .cse27 v_prenex_172) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_169) .cse28))) (let ((.cse30 (select .cse36 .cse32)) (.cse34 (select |c_#memory_int#1| v_arrayElimCell_106))) (and (not (= .cse27 .cse28)) (= (store (select (let ((.cse29 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_20 v_DerPreprocessor_22) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_20) .cse28 (store .cse31 .cse32 |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (store .cse29 .cse27 (store (select .cse29 .cse27) .cse30 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse27) .cse33) (= (select .cse34 (+ .cse35 8)) 1) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_169) .cse28 (store .cse36 .cse32 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse27 v_prenex_170) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse30) .cse7) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse28)) (let ((.cse37 (select |c_#memory_int#1| .cse28))) (= (store .cse34 .cse32 (select .cse37 .cse32)) .cse37)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse27)) (= .cse27 v_DerPreprocessor_20)))))))) (exists ((v_prenex_199 (Array Int (Array Int Int))) (v_prenex_196 (Array Int Int)) (v_prenex_198 (Array Int Int)) (v_prenex_200 (Array Int Int)) (v_prenex_201 (Array Int Int)) (v_prenex_195 Int) (v_prenex_197 (Array Int (Array Int Int))) (v_prenex_202 (Array Int Int)) (v_prenex_203 (Array Int Int))) (let ((.cse48 (select v_prenex_196 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse39 (select v_prenex_203 v_prenex_195)) (.cse41 (+ .cse48 4))) (let ((.cse43 (select (select v_prenex_197 .cse39) .cse41))) (let ((.cse44 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse39 v_prenex_200) .cse43 v_prenex_201) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_196) .cse39))) (let ((.cse42 (@diff v_prenex_199 v_prenex_197)) (.cse45 (select .cse44 .cse41))) (and (let ((.cse38 (select v_prenex_199 .cse39))) (= .cse38 (let ((.cse40 (select .cse38 .cse41))) (store (select (store (store v_prenex_199 .cse39 v_prenex_202) .cse40 v_prenex_203) .cse39) .cse41 .cse40)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse42) (not (= .cse39 .cse43)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse43)) (= .cse7 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_196) .cse39 (store .cse44 .cse41 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse43 v_prenex_198) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse45)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse39)) (= (store v_prenex_199 .cse42 (select v_prenex_197 .cse42)) v_prenex_197) (= (store (store (store v_prenex_197 .cse39 (select |c_#memory_$Pointer$#1.base| .cse39)) .cse43 (select |c_#memory_$Pointer$#1.base| .cse43)) |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select (let ((.cse46 (let ((.cse47 (store v_prenex_197 |c_ULTIMATE.start_main_~ptr~0#1.base| (store (select v_prenex_197 |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse39)))) (store .cse47 .cse39 (store (select .cse47 .cse39) .cse41 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) (store .cse46 .cse43 (store (select .cse46 .cse43) .cse45 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse43)) |c_#memory_$Pointer$#1.base|) (= (select (select |c_#memory_int#1| .cse39) (+ .cse48 8)) 1)))))))) (exists ((v_DerPreprocessor_24 Int) (v_prenex_180 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_177 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse56 (select v_prenex_177 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse49 (select v_arrayElimArr_23 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse55 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse49 v_DerPreprocessor_25) v_DerPreprocessor_24 v_DerPreprocessor_26) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_23) .cse49)) (.cse51 (+ .cse56 4))) (let ((.cse52 (select .cse55 .cse51))) (let ((.cse50 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse49 v_prenex_179) .cse52 v_prenex_180) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_177) .cse49))) (let ((.cse53 (select .cse50 .cse51))) (and (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_177) .cse49 (store .cse50 .cse51 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse52 v_prenex_178) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse53) .cse7) (= (store (select (let ((.cse54 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_24 v_DerPreprocessor_26) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_23) .cse49 (store .cse55 .cse51 |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (store .cse54 .cse52 (store (select .cse54 .cse52) .cse53 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse52) .cse33) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse49)) (not (= .cse49 .cse52)) (= (select (select |c_#memory_int#1| .cse49) (+ .cse56 8)) 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse52)) (= v_DerPreprocessor_24 .cse52)))))))) (exists ((v_prenex_191 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_prenex_192 (Array Int Int)) (v_prenex_193 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_prenex_194 (Array Int Int)) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_29 (Array Int Int)) (v_arrayElimCell_105 Int)) (let ((.cse60 (select v_prenex_191 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse58 (select v_arrayElimArr_26 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse63 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse58 v_DerPreprocessor_29) v_DerPreprocessor_28 v_DerPreprocessor_30) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_26) .cse58)) (.cse64 (+ .cse60 4))) (let ((.cse57 (select .cse63 .cse64))) (let ((.cse65 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse58 v_prenex_193) .cse57 v_prenex_194) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_191) .cse58))) (let ((.cse59 (select |c_#memory_int#1| v_arrayElimCell_105)) (.cse62 (select .cse65 .cse64))) (and (= v_DerPreprocessor_28 .cse57) (= (select |c_#memory_int#1| .cse58) .cse59) (= (select .cse59 (+ 8 .cse60)) 1) (= (store (select (let ((.cse61 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_28 v_DerPreprocessor_30) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_26) .cse58 (store .cse63 .cse64 |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (store .cse61 .cse57 (store (select .cse61 .cse57) .cse62 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse57) .cse33) (= (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_191) .cse58 (store .cse65 .cse64 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse57 v_prenex_192) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse62) .cse7) (not (= .cse58 .cse57)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse58)) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse57))))))))) (exists ((v_prenex_173 (Array Int Int)) (v_prenex_174 (Array Int Int)) (v_prenex_175 (Array Int Int)) (v_prenex_176 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse73 (select v_prenex_173 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse66 (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse72 (select (store (store (store |c_#memory_$Pointer$#1.base| .cse66 v_DerPreprocessor_33) v_DerPreprocessor_32 v_DerPreprocessor_34) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_29) .cse66)) (.cse68 (+ .cse73 4))) (let ((.cse69 (select .cse72 .cse68))) (let ((.cse67 (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse66 v_prenex_175) .cse69 v_prenex_176) |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_173) .cse66))) (let ((.cse70 (select .cse67 .cse68))) (and (= .cse7 (store (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| v_prenex_173) .cse66 (store .cse67 .cse68 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) .cse69 v_prenex_174) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse70)) (not (= .cse66 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (not (= .cse69 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= .cse33 (store (select (let ((.cse71 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32 v_DerPreprocessor_34) |c_ULTIMATE.start_main_~ptr~0#1.base| v_arrayElimArr_29) .cse66 (store .cse72 .cse68 |c_ULTIMATE.start_main_~ptr~0#1.base|)))) (store .cse71 .cse69 (store (select .cse71 .cse69) .cse70 |c_ULTIMATE.start_main_~ptr~0#1.base|))) |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse9 .cse69)) (= .cse69 v_DerPreprocessor_32) (not (= .cse66 .cse69)) (= (select (select |c_#memory_int#1| .cse66) (+ .cse73 8)) 1))))))))))) is different from true [2025-02-05 14:39:53,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21232 treesize of output 20686 [2025-02-05 14:39:53,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1995 treesize of output 1969 [2025-02-05 14:39:53,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1998 treesize of output 1986 [2025-02-05 14:39:53,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1982 treesize of output 1960 [2025-02-05 14:39:53,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1985 treesize of output 1973 [2025-02-05 14:39:53,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1969 treesize of output 1951 [2025-02-05 14:39:53,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1958 treesize of output 1936 [2025-02-05 14:39:53,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1947 treesize of output 1933 [2025-02-05 14:39:53,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1950 treesize of output 1938 [2025-02-05 14:39:53,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1934 treesize of output 1920 [2025-02-05 14:39:53,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1937 treesize of output 1925 [2025-02-05 14:39:53,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1921 treesize of output 1907 [2025-02-05 14:39:53,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1924 treesize of output 1912 [2025-02-05 14:39:53,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1922 treesize of output 1910 [2025-02-05 14:39:53,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1920 treesize of output 1908 [2025-02-05 14:39:54,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:54,314 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2025-02-05 14:39:54,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4344 treesize of output 4136 [2025-02-05 14:39:54,359 INFO L349 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2025-02-05 14:39:54,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 733 treesize of output 580 [2025-02-05 14:39:54,401 INFO L349 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2025-02-05 14:39:54,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 655 treesize of output 496 [2025-02-05 14:39:54,473 INFO L349 Elim1Store]: treesize reduction 102, result has 27.7 percent of original size [2025-02-05 14:39:54,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 572 treesize of output 625 [2025-02-05 14:39:54,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 311 [2025-02-05 14:39:54,869 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-05 14:39:54,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2025-02-05 14:39:54,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2025-02-05 14:39:54,916 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2025-02-05 14:39:54,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 86 [2025-02-05 14:39:54,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 83 [2025-02-05 14:39:54,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:54,982 INFO L349 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2025-02-05 14:39:54,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 12812 treesize of output 12124 [2025-02-05 14:39:55,034 INFO L349 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2025-02-05 14:39:55,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 745 treesize of output 586 [2025-02-05 14:39:55,079 INFO L349 Elim1Store]: treesize reduction 104, result has 27.3 percent of original size [2025-02-05 14:39:55,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 668 treesize of output 717 [2025-02-05 14:39:55,129 INFO L349 Elim1Store]: treesize reduction 74, result has 32.1 percent of original size [2025-02-05 14:39:55,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 513 treesize of output 384 [2025-02-05 14:39:55,407 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2025-02-05 14:39:55,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 225 [2025-02-05 14:39:55,422 INFO L349 Elim1Store]: treesize reduction 57, result has 1.7 percent of original size [2025-02-05 14:39:55,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 295 treesize of output 261 [2025-02-05 14:39:55,578 INFO L349 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2025-02-05 14:39:55,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 204 [2025-02-05 14:39:55,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 211 [2025-02-05 14:39:55,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:55,693 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-02-05 14:39:55,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8584 treesize of output 8102 [2025-02-05 14:39:55,716 INFO L349 Elim1Store]: treesize reduction 144, result has 0.7 percent of original size [2025-02-05 14:39:55,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 781 treesize of output 778 [2025-02-05 14:39:55,755 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2025-02-05 14:39:55,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 581 treesize of output 424 [2025-02-05 14:39:55,784 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2025-02-05 14:39:55,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 499 treesize of output 342 [2025-02-05 14:39:55,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:39:55,920 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-02-05 14:39:55,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6440 treesize of output 6078 [2025-02-05 14:39:55,955 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2025-02-05 14:39:55,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 717 treesize of output 536 [2025-02-05 14:39:55,982 INFO L349 Elim1Store]: treesize reduction 142, result has 0.7 percent of original size [2025-02-05 14:39:55,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 676 treesize of output 679 [2025-02-05 14:39:56,016 INFO L349 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2025-02-05 14:39:56,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 505 treesize of output 348 [2025-02-05 14:39:56,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:56,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 811 treesize of output 729 [2025-02-05 14:39:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:39:56,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:39:56,587 INFO L349 Elim1Store]: treesize reduction 208, result has 49.6 percent of original size [2025-02-05 14:39:56,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 5738 treesize of output 5182 [2025-02-05 14:39:56,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:39:56,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5158 treesize of output 4602 [2025-02-05 14:39:56,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1401 treesize of output 1357 [2025-02-05 14:39:56,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1357 treesize of output 1335 [2025-02-05 14:39:56,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4298 treesize of output 4210 [2025-02-05 14:39:56,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2025-02-05 14:39:58,432 INFO L349 Elim1Store]: treesize reduction 20, result has 77.5 percent of original size [2025-02-05 14:39:58,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2494 treesize of output 2524 [2025-02-05 14:40:00,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8