./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:41:17,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:41:17,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:41:17,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:41:17,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:41:17,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:41:17,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:41:17,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:41:17,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:41:17,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:41:17,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:41:17,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:41:17,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:41:17,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:41:17,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:41:17,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:41:17,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:41:17,471 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2025-03-16 17:41:17,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:41:17,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:41:17,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:41:17,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:41:17,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:41:17,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-16 17:41:18,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1a860a5/ee2d1d40627745a59464b0766530e926/FLAGf9b57c9fc [2025-03-16 17:41:19,092 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:41:19,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-16 17:41:19,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1a860a5/ee2d1d40627745a59464b0766530e926/FLAGf9b57c9fc [2025-03-16 17:41:19,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1a860a5/ee2d1d40627745a59464b0766530e926 [2025-03-16 17:41:19,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:41:19,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:41:19,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:41:19,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:41:19,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:41:19,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ade778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19, skipping insertion in model container [2025-03-16 17:41:19,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:41:19,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2025-03-16 17:41:19,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:41:19,646 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:41:19,688 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2025-03-16 17:41:19,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:41:19,712 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:41:19,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19 WrapperNode [2025-03-16 17:41:19,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:41:19,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:41:19,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:41:19,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:41:19,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,747 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2025-03-16 17:41:19,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:41:19,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:41:19,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:41:19,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:41:19,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,779 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 14 writes are split as follows [0, 13, 1]. [2025-03-16 17:41:19,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:41:19,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:41:19,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:41:19,805 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:41:19,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (1/1) ... [2025-03-16 17:41:19,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:41:19,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:19,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:41:19,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:41:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:41:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:41:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:41:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:41:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:41:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:41:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-16 17:41:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:41:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 17:41:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:41:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:41:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:41:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:41:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:41:19,954 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:41:19,956 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:41:20,160 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: 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-03-16 17:41:20,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-16 17:41:20,199 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-16 17:41:20,199 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:41:20,207 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:41:20,208 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:41:20,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:41:20 BoogieIcfgContainer [2025-03-16 17:41:20,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:41:20,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:41:20,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:41:20,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:41:20,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:41:19" (1/3) ... [2025-03-16 17:41:20,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4336b88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:41:20, skipping insertion in model container [2025-03-16 17:41:20,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:41:19" (2/3) ... [2025-03-16 17:41:20,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4336b88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:41:20, skipping insertion in model container [2025-03-16 17:41:20,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:41:20" (3/3) ... [2025-03-16 17:41:20,218 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2025-03-16 17:41:20,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:41:20,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 17:41:20,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:41:20,282 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;@1360b1ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:41:20,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:41:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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-03-16 17:41:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 17:41:20,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:20,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:20,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:20,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash 880857123, now seen corresponding path program 1 times [2025-03-16 17:41:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:20,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678253021] [2025-03-16 17:41:20,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:20,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 17:41:20,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 17:41:20,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:20,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:41:20,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678253021] [2025-03-16 17:41:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678253021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:41:20,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:41:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:41:20,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446136210] [2025-03-16 17:41:20,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:41:20,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:41:20,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:20,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:41:20,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:41:20,648 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-03-16 17:41:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:20,679 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2025-03-16 17:41:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:41:20,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 21 [2025-03-16 17:41:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:20,689 INFO L225 Difference]: With dead ends: 61 [2025-03-16 17:41:20,689 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 17:41:20,692 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-03-16 17:41:20,695 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:20,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:41:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 17:41:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-03-16 17:41:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-03-16 17:41:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-03-16 17:41:20,723 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 21 [2025-03-16 17:41:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:20,723 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-16 17:41:20,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-03-16 17:41:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-03-16 17:41:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 17:41:20,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:20,726 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] [2025-03-16 17:41:20,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:41:20,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:20,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1592150178, now seen corresponding path program 1 times [2025-03-16 17:41:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:20,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493972000] [2025-03-16 17:41:20,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:20,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:20,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:41:20,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:41:20,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:20,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:41:21,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:21,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493972000] [2025-03-16 17:41:21,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493972000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:21,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862506100] [2025-03-16 17:41:21,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:21,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:21,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:21,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:41:21,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:41:21,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:41:21,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:41:21,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:21,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:21,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 17:41:21,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:21,405 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-03-16 17:41:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:41:21,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:41:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:41:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862506100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:41:21,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:41:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-03-16 17:41:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979986259] [2025-03-16 17:41:21,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:41:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 17:41:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:21,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 17:41:21,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 17:41:21,478 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-03-16 17:41:25,499 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-03-16 17:41:29,518 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-03-16 17:41:33,532 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-03-16 17:41:37,688 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-03-16 17:41:41,720 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-03-16 17:41:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:41,726 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-03-16 17:41:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 17:41:41,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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 31 [2025-03-16 17:41:41,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:41,727 INFO L225 Difference]: With dead ends: 56 [2025-03-16 17:41:41,727 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 17:41:41,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:41:41,728 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:41,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 196 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-03-16 17:41:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 17:41:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-16 17:41:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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-03-16 17:41:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-16 17:41:41,732 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 31 [2025-03-16 17:41:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:41,732 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-16 17:41:41,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-03-16 17:41:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-16 17:41:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 17:41:41,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:41,733 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] [2025-03-16 17:41:41,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:41:41,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:41,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:41,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1593073699, now seen corresponding path program 1 times [2025-03-16 17:41:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:41,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623306315] [2025-03-16 17:41:41,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:41,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:41:42,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:41:42,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:42,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:41:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623306315] [2025-03-16 17:41:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623306315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382612081] [2025-03-16 17:41:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:43,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:43,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:41:43,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:41:43,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:41:44,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:41:44,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:44,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:44,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-03-16 17:41:44,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:44,306 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-03-16 17:41:44,472 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-03-16 17:41:44,547 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:41:44,548 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-03-16 17:41:44,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 17:41:44,673 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 16 treesize of output 11 [2025-03-16 17:41:44,796 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 36 treesize of output 52 [2025-03-16 17:41:44,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:44,808 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 50 treesize of output 39 [2025-03-16 17:41:44,813 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 26 treesize of output 15 [2025-03-16 17:41:44,826 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 86 treesize of output 81 [2025-03-16 17:41:44,920 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 104 treesize of output 56 [2025-03-16 17:41:44,926 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-03-16 17:41:44,933 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 11 treesize of output 3 [2025-03-16 17:41:44,938 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-03-16 17:41:45,145 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:41:45,147 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-16 17:41:45,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:45,177 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 112 treesize of output 65 [2025-03-16 17:41:45,197 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:41:45,197 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 28 treesize of output 30 [2025-03-16 17:41:45,206 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 20 treesize of output 1 [2025-03-16 17:41:45,211 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-03-16 17:41:45,368 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 84 treesize of output 52 [2025-03-16 17:41:45,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:45,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:45,374 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 45 treesize of output 36 [2025-03-16 17:41:45,377 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 26 treesize of output 15 [2025-03-16 17:41:45,425 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 19 treesize of output 11 [2025-03-16 17:41:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:41:45,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:41:45,719 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_451 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_453 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_453) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_451))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_4)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2025-03-16 17:41:45,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_453 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_14|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_14| v_ArrVal_462) .cse1) .cse2) v_ArrVal_453) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_14| v_ArrVal_451))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_4)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-03-16 17:41:45,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382612081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:45,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:41:45,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2025-03-16 17:41:45,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849928403] [2025-03-16 17:41:45,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:41:45,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 17:41:45,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:45,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 17:41:45,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1821, Unknown=19, NotChecked=174, Total=2162 [2025-03-16 17:41:45,774 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 42 states, 38 states have (on average 1.263157894736842) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:41:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:46,707 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-03-16 17:41:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 17:41:46,708 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 1.263157894736842) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2025-03-16 17:41:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:46,709 INFO L225 Difference]: With dead ends: 59 [2025-03-16 17:41:46,709 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 17:41:46,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=245, Invalid=2934, Unknown=21, NotChecked=222, Total=3422 [2025-03-16 17:41:46,712 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:46,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 261 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 573 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 17:41:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 17:41:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2025-03-16 17:41:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:41:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-03-16 17:41:46,722 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 31 [2025-03-16 17:41:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:46,722 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-03-16 17:41:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 1.263157894736842) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:41:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2025-03-16 17:41:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:41:46,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:46,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:41:46,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:41:46,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 17:41:46,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:46,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash -127641932, now seen corresponding path program 1 times [2025-03-16 17:41:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637971458] [2025-03-16 17:41:46,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:46,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:41:46,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:41:46,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:46,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:41:48,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:48,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637971458] [2025-03-16 17:41:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637971458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:48,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822188270] [2025-03-16 17:41:48,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:48,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:48,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:48,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:41:48,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:41:49,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:41:49,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:41:49,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:49,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:49,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 168 conjuncts are in the unsatisfiable core [2025-03-16 17:41:49,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:49,290 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-03-16 17:41:49,299 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-03-16 17:41:49,489 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2025-03-16 17:41:49,494 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2025-03-16 17:41:49,528 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:41:49,528 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:41:49,545 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-03-16 17:41:49,557 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-03-16 17:41:49,561 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2025-03-16 17:41:49,563 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2025-03-16 17:41:49,582 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:41:49,582 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 80 [2025-03-16 17:41:49,592 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 47 treesize of output 23 [2025-03-16 17:41:49,603 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-16 17:41:49,603 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 1 case distinctions, treesize of input 24 treesize of output 19 [2025-03-16 17:41:49,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse2) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2)))) is different from false [2025-03-16 17:41:49,617 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse2) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2)))) is different from true [2025-03-16 17:41:49,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse2)))) is different from false [2025-03-16 17:41:49,648 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 8) 1) .cse2) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse2)))) is different from true [2025-03-16 17:41:49,680 INFO L349 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2025-03-16 17:41:49,681 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 120 [2025-03-16 17:41:49,685 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:41:49,687 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:41:49,709 INFO L349 Elim1Store]: treesize reduction 88, result has 9.3 percent of original size [2025-03-16 17:41:49,710 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 172 [2025-03-16 17:41:49,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:49,730 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 52 treesize of output 41 [2025-03-16 17:41:49,735 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 18 treesize of output 26 [2025-03-16 17:41:49,746 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 151 treesize of output 54 [2025-03-16 17:41:49,754 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 54 treesize of output 29 [2025-03-16 17:41:49,762 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 40 treesize of output 39 [2025-03-16 17:41:49,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 0) 0) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) v_DerPreprocessor_5 v_DerPreprocessor_7))) (let ((.cse5 (select .cse3 .cse0))) (let ((.cse2 (select .cse5 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse2) 1) (= .cse0 (select (select .cse3 .cse2) 0)) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse4 (select |c_#valid| .cse4)))) (= (select |c_#memory_$Pointer$#1.base| .cse0) (store .cse5 4 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= v_DerPreprocessor_5 .cse2))))))))) is different from false [2025-03-16 17:41:49,798 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse1 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse1 0) 0) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_6) v_DerPreprocessor_5 v_DerPreprocessor_7))) (let ((.cse5 (select .cse3 .cse0))) (let ((.cse2 (select .cse5 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse2) 1) (= .cse0 (select (select .cse3 .cse2) 0)) (= (select (select |c_#memory_int#1| .cse2) 8) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse4 (select |c_#valid| .cse4)))) (= (select |c_#memory_$Pointer$#1.base| .cse0) (store .cse5 4 .cse2)) (= (select |v_old(#valid)_AFTER_CALL_8| .cse0) 0) (= v_DerPreprocessor_5 .cse2))))))))) is different from true [2025-03-16 17:41:49,831 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-16 17:41:49,832 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 341 treesize of output 324 [2025-03-16 17:41:49,847 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 271 treesize of output 258 [2025-03-16 17:41:49,855 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 266 treesize of output 253 [2025-03-16 17:41:49,867 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 140 treesize of output 138 [2025-03-16 17:41:49,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 7 [2025-03-16 17:41:49,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:49,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 24 [2025-03-16 17:41:49,935 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 9 [2025-03-16 17:41:49,939 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 17 treesize of output 11 [2025-03-16 17:41:49,954 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:41:49,955 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:41:49,977 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:41:49,979 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:41:50,039 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2025-03-16 17:41:50,044 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2025-03-16 17:41:50,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,108 INFO L349 Elim1Store]: treesize reduction 88, result has 11.1 percent of original size [2025-03-16 17:41:50,109 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 449 treesize of output 436 [2025-03-16 17:41:50,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2025-03-16 17:41:50,130 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 296 treesize of output 281 [2025-03-16 17:41:50,138 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 291 treesize of output 278 [2025-03-16 17:41:50,185 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 17 treesize of output 11 [2025-03-16 17:41:50,208 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:41:50,208 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 1 case distinctions, treesize of input 31 treesize of output 28 [2025-03-16 17:41:50,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse4 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse0 4) 0) (= (select .cse0 0) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse3) 1))) (= (select .cse4 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6))) |v_#valid_BEFORE_CALL_7|)))))))) is different from false [2025-03-16 17:41:50,232 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse4 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse0 4) 0) (= (select .cse0 0) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |v_old(#valid)_AFTER_CALL_9| .cse2))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse3) 1))) (= (select .cse4 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| .cse3) 8) 1) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6))) |v_#valid_BEFORE_CALL_7|)))))))) is different from true [2025-03-16 17:41:50,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse2 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (or (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse0 4) 0) (= (select .cse0 0) 0))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= (select .cse2 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#1| .cse3) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6))) |v_#valid_BEFORE_CALL_7|)))))))) is different from false [2025-03-16 17:41:50,300 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse2 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (or (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse0 4) 0) (= (select .cse0 0) 0))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (= (select .cse2 4) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse4 (select |v_old(#valid)_AFTER_CALL_9| .cse4))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#1| .cse3) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6))) |v_#valid_BEFORE_CALL_7|)))))))) is different from true [2025-03-16 17:41:50,331 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:41:50,362 INFO L349 Elim1Store]: treesize reduction 72, result has 27.3 percent of original size [2025-03-16 17:41:50,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 405 treesize of output 171 [2025-03-16 17:41:50,380 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 0 case distinctions, treesize of input 85 treesize of output 75 [2025-03-16 17:41:50,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,385 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 53 treesize of output 19 [2025-03-16 17:41:50,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:50,393 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 68 treesize of output 53 [2025-03-16 17:41:50,396 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 23 treesize of output 29 [2025-03-16 17:41:50,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse9 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (select .cse0 4)) (.cse6 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select .cse0 0) .cse1) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse6) 1))) (= (select .cse4 0) 0) (= .cse3 .cse6) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))) |v_#valid_BEFORE_CALL_7|)))))))))) is different from false [2025-03-16 17:41:50,420 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse9 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (select .cse0 4)) (.cse6 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select .cse0 0) .cse1) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse6) 1))) (= (select .cse4 0) 0) (= .cse3 .cse6) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))) |v_#valid_BEFORE_CALL_7|)))))))))) is different from true [2025-03-16 17:41:50,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse9 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (select .cse0 4)) (.cse6 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) .cse1) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse6) 1))) (= (select .cse4 0) 0) (= .cse3 .cse6) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))) |v_#valid_BEFORE_CALL_7|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))))) is different from false [2025-03-16 17:41:50,484 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse9 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (select .cse0 4)) (.cse6 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) .cse1) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse6) 1))) (= (select .cse4 0) 0) (= .cse3 .cse6) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))) |v_#valid_BEFORE_CALL_7|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))))) is different from true [2025-03-16 17:41:50,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:41:50,570 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 196 treesize of output 132 [2025-03-16 17:41:50,583 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-03-16 17:41:50,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 90 treesize of output 40 [2025-03-16 17:41:50,598 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-16 17:41:50,599 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 15 treesize of output 7 [2025-03-16 17:41:50,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-03-16 17:41:50,628 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((v_arrayElimCell_71 Int) (v_arrayElimCell_69 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_71) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_69) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_69) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from false [2025-03-16 17:41:50,630 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((v_arrayElimCell_71 Int) (v_arrayElimCell_69 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_71) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_69) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_69) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) 1)) is different from true [2025-03-16 17:41:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2025-03-16 17:41:50,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:41:55,270 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| Int) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_689 Int) (v_ArrVal_686 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_707)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (select (select .cse6 .cse2) .cse4)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_706) .cse2) .cse4))) (select (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_708) .cse0) .cse1 v_ArrVal_689)) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_691) .cse2 v_ArrVal_684) (select (select (let ((.cse3 (let ((.cse5 (store (select .cse6 .cse0) .cse1 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|))) (store (store |c_#memory_$Pointer$#1.base| .cse0 .cse5) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| (store (store (select (store .cse6 .cse0 .cse5) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|) 4 .cse0) 0 .cse2))))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|))) .cse7) .cse8))) (+ (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_686) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18| v_ArrVal_693))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse4 0))) .cse7) .cse8) 8))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_18|) 0)))) is different from false [2025-03-16 17:41:55,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822188270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:55,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:41:55,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 41 [2025-03-16 17:41:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321094916] [2025-03-16 17:41:55,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:41:55,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-16 17:41:55,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:55,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-16 17:41:55,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=922, Unknown=81, NotChecked=1050, Total=2162 [2025-03-16 17:41:55,276 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 31 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:41:55,602 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1)))) is different from false [2025-03-16 17:41:55,604 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_4| |c_#memory_int#1|))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_4| .cse0 (select |c_#memory_int#1| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_4| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) 1)))) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1)))) is different from true [2025-03-16 17:41:55,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= .cse0 1)) (not .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2025-03-16 17:41:55,609 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= .cse0 1)) (not .cse2) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2025-03-16 17:41:55,612 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or .cse0 .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (= (select (select |c_#memory_int#1| .cse1) 8) 1) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2025-03-16 17:41:55,613 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or .cse0 .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (= (select (select |c_#memory_int#1| .cse1) 8) 1) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from true [2025-03-16 17:41:55,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (or (= (select (select |c_#memory_int#1| .cse1) 8) 1) .cse3) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or .cse0 .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8))))) is different from false [2025-03-16 17:41:55,619 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (or (= (select (select |c_#memory_int#1| .cse1) 8) 1) .cse3) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 8)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (or .cse0 .cse3) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8))))) is different from true [2025-03-16 17:41:55,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse11 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse1 (select .cse11 4)) (.cse5 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= (select .cse3 4) 8)) (= (select |c_#valid| .cse4) 1) (= 0 (select .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse6 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= (select |c_#valid| .cse1) 1) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_6) v_DerPreprocessor_5 v_DerPreprocessor_7))) (let ((.cse10 (select .cse8 .cse4))) (let ((.cse7 (select .cse10 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 1) (= .cse4 (select (select .cse8 .cse7) 0)) (= (select (select |c_#memory_int#1| .cse7) 8) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse9 (select |c_#valid| .cse9)))) (= (select |c_#memory_$Pointer$#1.base| .cse4) (store .cse10 4 .cse7)) (= (select |v_old(#valid)_AFTER_CALL_8| .cse4) 0) (= v_DerPreprocessor_5 .cse7)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= .cse1 (select .cse11 .cse5)))))) is different from false [2025-03-16 17:41:55,629 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse11 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse1 (select .cse11 4)) (.cse5 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= (select .cse3 4) 8)) (= (select |c_#valid| .cse4) 1) (= 0 (select .cse3 .cse5)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse6 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= (select |c_#valid| .cse1) 1) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_DerPreprocessor_5 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_6) v_DerPreprocessor_5 v_DerPreprocessor_7))) (let ((.cse10 (select .cse8 .cse4))) (let ((.cse7 (select .cse10 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 1) (= .cse4 (select (select .cse8 .cse7) 0)) (= (select (select |c_#memory_int#1| .cse7) 8) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_8| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_8| .cse9 (select |c_#valid| .cse9)))) (= (select |c_#memory_$Pointer$#1.base| .cse4) (store .cse10 4 .cse7)) (= (select |v_old(#valid)_AFTER_CALL_8| .cse4) 0) (= v_DerPreprocessor_5 .cse7)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (= .cse1 (select .cse11 .cse5)))))) is different from true [2025-03-16 17:41:55,659 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:41:55,660 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:41:55,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse5 (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2)))) (let ((.cse6 (@diff .cse5 |c_#memory_int#1|))) (let ((.cse3 (store .cse5 .cse6 (select |c_#memory_int#1| .cse6)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#1.base|)) (.cse4 (@diff .cse3 |c_#memory_int#1|)) (.cse9 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#in~data#1| (select .cse1 8)) (or (= |c_#memory_int#1| .cse3) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_int#1| (store .cse3 .cse4 (select |c_#memory_int#1| .cse4))) (or (= |c_#memory_int#1| .cse5) (= (select |c_old(#valid)| .cse6) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse8) 0)))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse9)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse9 (select |c_#memory_$Pointer$#1.offset| .cse9))))))))) is different from false [2025-03-16 17:41:55,674 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse5 (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2)))) (let ((.cse6 (@diff .cse5 |c_#memory_int#1|))) (let ((.cse3 (store .cse5 .cse6 (select |c_#memory_int#1| .cse6)))) (let ((.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#1.base|)) (.cse4 (@diff .cse3 |c_#memory_int#1|)) (.cse9 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|))) (and (or (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= .cse0 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| .cse2) 0)) (= |c_node_create_#in~data#1| (select .cse1 8)) (or (= |c_#memory_int#1| .cse3) (= (select |c_old(#valid)| .cse4) 0)) (= |c_#memory_int#1| (store .cse3 .cse4 (select |c_#memory_int#1| .cse4))) (or (= |c_#memory_int#1| .cse5) (= (select |c_old(#valid)| .cse6) 0)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_46) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_8| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_8| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse8) 0)))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#res#1.base| .cse9)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse9 (select |c_#memory_$Pointer$#1.offset| .cse9))))))))) is different from true [2025-03-16 17:41:55,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse6 (select .cse9 0)) (.cse3 (select .cse12 4)) (.cse8 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (= (select .cse1 4) 0) (= (select .cse1 0) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (not (= .cse3 .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse6) 1))) (not (= (select .cse7 4) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= 0 (select .cse7 .cse8)) (= (select .cse9 4) .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse10) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))) |v_#valid_BEFORE_CALL_7|)))) (= .cse3 (select .cse12 .cse8)))))) is different from false [2025-03-16 17:41:55,699 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse9 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse6 (select .cse9 0)) (.cse3 (select .cse12 4)) (.cse8 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and (= (select .cse1 4) 0) (= (select .cse1 0) 0))) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse2)) (not (= .cse3 .cse4)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse6) 1))) (not (= (select .cse7 4) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4)) (= 0 (select .cse7 .cse8)) (= (select .cse9 4) .cse6) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 8)) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse3)) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse10) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))) |v_#valid_BEFORE_CALL_7|)))) (= .cse3 (select .cse12 .cse8)))))) is different from true [2025-03-16 17:41:55,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2))) (let ((.cse3 (select .cse4 4)) (.cse5 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select .cse8 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select .cse0 0) 0) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= .cse3 8)) (= 0 (select .cse4 .cse5)) (or (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse7))) (and (= (select .cse6 4) 0) (= (select .cse6 0) 0))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (= (select .cse8 4) .cse9) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse10 (select |v_old(#valid)_AFTER_CALL_9| .cse10))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse9) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= .cse1 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse1 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse2))) .cse2) .cse5)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#1| .cse9) 8) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13))) |v_#valid_BEFORE_CALL_7|)))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)))))) is different from false [2025-03-16 17:41:55,748 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| .cse2))) (let ((.cse3 (select .cse4 4)) (.cse5 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select .cse8 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select .cse0 0) 0) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (not (= .cse3 8)) (= 0 (select .cse4 .cse5)) (or (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse7))) (and (= (select .cse6 4) 0) (= (select .cse6 0) 0))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse7)) (= (select .cse8 4) .cse9) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse2)) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse10 (select |v_old(#valid)_AFTER_CALL_9| .cse10))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse9) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 8)) (= .cse1 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse1 (store (select |c_#memory_$Pointer$#1.base| .cse1) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (store .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4) .cse1) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| .cse2))) .cse2) .cse5)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_int#1| .cse9) 8) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13))) |v_#valid_BEFORE_CALL_7|)))) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)))))) is different from true [2025-03-16 17:41:55,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse13 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse5 (select .cse12 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse6 (select .cse3 4)) (.cse1 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select .cse12 0))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (= (select .cse3 0) .cse4) (= .cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse7 4) 0) (not (= .cse5 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse9) 1))) (= (select .cse7 0) 0) (= .cse6 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 8)) (= (select (select |c_#memory_int#1| .cse9) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse10) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))) |v_#valid_BEFORE_CALL_7|))))))))))) is different from false [2025-03-16 17:41:55,762 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse13 0))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse5 (select .cse12 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse5))) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse4)) (.cse6 (select .cse3 4)) (.cse1 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select .cse12 0))) (and (= (select .cse0 0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (= (select .cse3 0) .cse4) (= .cse5 (select (select |c_#memory_$Pointer$#1.base| .cse6) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse7 4) 0) (not (= .cse5 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse5) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse8 (select |v_old(#valid)_AFTER_CALL_9| .cse8))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse9) 1))) (= (select .cse7 0) 0) (= .cse6 .cse9) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 8)) (= (select (select |c_#memory_int#1| .cse9) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse10) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse10) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse11 (select |v_#valid_BEFORE_CALL_7| .cse11))) |v_#valid_BEFORE_CALL_7|))))))))))) is different from true [2025-03-16 17:41:55,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse9 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (select .cse0 4)) (.cse6 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) .cse1) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse6) 1))) (= (select .cse4 0) 0) (= .cse3 .cse6) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))) |v_#valid_BEFORE_CALL_7|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))))) is different from false [2025-03-16 17:41:55,841 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse9 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse3 (select .cse0 4)) (.cse6 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse0 0) .cse1) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 8)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| .cse2) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse5 (select |v_old(#valid)_AFTER_CALL_9| .cse5))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_8| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_8| .cse6) 1))) (= (select .cse4 0) 0) (= .cse3 .cse6) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= (select (select |c_#memory_int#1| .cse6) 8) 1) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_arrayElimCell_46 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_10| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_10| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_10| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_10| .cse8 (select |v_#valid_BEFORE_CALL_7| .cse8))) |v_#valid_BEFORE_CALL_7|)))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))))) is different from true [2025-03-16 17:41:55,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((v_arrayElimCell_71 Int) (v_arrayElimCell_69 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_71) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_69) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_69) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1))) is different from false [2025-03-16 17:41:55,863 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((v_arrayElimCell_71 Int) (v_arrayElimCell_69 Int) (|v_old(#valid)_AFTER_CALL_8| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_71) 0) (= (select |v_old(#valid)_AFTER_CALL_8| v_arrayElimCell_69) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_8| |v_old(#valid)_AFTER_CALL_9|))) (store |v_old(#valid)_AFTER_CALL_8| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1))) |v_old(#valid)_AFTER_CALL_9|) (= (select |v_old(#valid)_AFTER_CALL_9| v_arrayElimCell_69) 1) (= (select |v_old(#valid)_AFTER_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= .cse0 1))) is different from true [2025-03-16 17:41:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:41:55,956 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-03-16 17:41:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 17:41:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 31 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-03-16 17:41:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:41:55,957 INFO L225 Difference]: With dead ends: 65 [2025-03-16 17:41:55,957 INFO L226 Difference]: Without dead ends: 63 [2025-03-16 17:41:55,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=155, Invalid=1170, Unknown=111, NotChecked=2470, Total=3906 [2025-03-16 17:41:55,958 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1203 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:41:55,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 341 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 408 Invalid, 0 Unknown, 1203 Unchecked, 0.4s Time] [2025-03-16 17:41:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-16 17:41:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-16 17:41:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:41:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-03-16 17:41:55,972 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 34 [2025-03-16 17:41:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:41:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-03-16 17:41:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 31 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:41:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-03-16 17:41:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:41:55,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:41:55,973 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-03-16 17:41:55,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:41:56,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:56,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:41:56,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:41:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash -127620077, now seen corresponding path program 1 times [2025-03-16 17:41:56,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:41:56,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843162119] [2025-03-16 17:41:56,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:41:56,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:41:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:41:56,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:56,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:41:57,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:41:57,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843162119] [2025-03-16 17:41:57,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843162119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:57,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803544163] [2025-03-16 17:41:57,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:41:57,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:41:57,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:41:57,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:41:57,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:41:57,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:41:57,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:41:57,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:41:57,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:41:57,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-03-16 17:41:57,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:41:57,784 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-03-16 17:41:57,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-16 17:41:57,987 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:41:57,987 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:41:58,006 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:41:58,006 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 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:41:58,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-16 17:41:58,111 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-16 17:41:58,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-16 17:41:58,221 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2025-03-16 17:41:58,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 53 [2025-03-16 17:41:58,279 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:41:58,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 27 [2025-03-16 17:41:58,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-03-16 17:41:58,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:41:58,448 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-16 17:41:58,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 53 [2025-03-16 17:41:58,462 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:41:58,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-16 17:41:58,673 INFO L349 Elim1Store]: treesize reduction 401, result has 11.9 percent of original size [2025-03-16 17:41:58,673 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 340 treesize of output 121 [2025-03-16 17:41:58,677 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 71 treesize of output 55 [2025-03-16 17:41:58,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:41:58,919 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 204 treesize of output 140 [2025-03-16 17:41:58,926 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-16 17:41:58,926 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 15 treesize of output 7 [2025-03-16 17:41:58,948 INFO L349 Elim1Store]: treesize reduction 76, result has 14.6 percent of original size [2025-03-16 17:41:58,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 124 treesize of output 50 [2025-03-16 17:41:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:41:58,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:41:59,017 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 598 treesize of output 486 [2025-03-16 17:41:59,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803544163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:41:59,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:41:59,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2025-03-16 17:41:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855750722] [2025-03-16 17:41:59,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:41:59,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-16 17:41:59,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:41:59,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-16 17:41:59,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 17:41:59,387 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 41 states, 38 states have (on average 1.368421052631579) internal successors, (52), 32 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:42:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:00,150 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-03-16 17:42:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 17:42:00,151 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.368421052631579) internal successors, (52), 32 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-03-16 17:42:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:00,152 INFO L225 Difference]: With dead ends: 79 [2025-03-16 17:42:00,152 INFO L226 Difference]: Without dead ends: 74 [2025-03-16 17:42:00,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=198, Invalid=2454, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 17:42:00,153 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:00,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 326 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 17:42:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-16 17:42:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2025-03-16 17:42:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:42:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-03-16 17:42:00,160 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 34 [2025-03-16 17:42:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:00,160 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-03-16 17:42:00,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.368421052631579) internal successors, (52), 32 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:42:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-03-16 17:42:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:42:00,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:00,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:00,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:42:00,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:00,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:00,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1124714285, now seen corresponding path program 1 times [2025-03-16 17:42:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732290758] [2025-03-16 17:42:00,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:00,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:42:00,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:42:00,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:00,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:42:00,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:00,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732290758] [2025-03-16 17:42:00,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732290758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:00,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432043387] [2025-03-16 17:42:00,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:42:00,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:00,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:00,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:42:00,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:42:00,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 17:42:00,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:42:00,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:42:00,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:00,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 17:42:00,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:42:00,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:42:00,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432043387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:42:00,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:42:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-16 17:42:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632375053] [2025-03-16 17:42:00,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:42:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:42:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:42:00,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:42:00,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:42:00,607 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 17:42:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:42:00,635 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2025-03-16 17:42:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:42:00,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2025-03-16 17:42:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:42:00,636 INFO L225 Difference]: With dead ends: 91 [2025-03-16 17:42:00,636 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 17:42:00,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:42:00,637 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:42:00,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:42:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 17:42:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-16 17:42:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:42:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-16 17:42:00,648 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 34 [2025-03-16 17:42:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:42:00,648 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-16 17:42:00,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 17:42:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-16 17:42:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:42:00,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:42:00,651 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:42:00,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 17:42:00,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:00,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:42:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:42:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1532327293, now seen corresponding path program 2 times [2025-03-16 17:42:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:42:00,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600184310] [2025-03-16 17:42:00,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:42:00,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:42:00,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 17:42:00,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:42:00,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:42:00,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:42:02,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:42:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600184310] [2025-03-16 17:42:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600184310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:42:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349645850] [2025-03-16 17:42:02,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:42:02,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:42:02,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:42:02,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:42:02,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:42:02,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 17:42:02,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:42:02,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:42:02,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:42:02,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 177 conjuncts are in the unsatisfiable core [2025-03-16 17:42:02,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:42:02,921 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-03-16 17:42:03,059 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2025-03-16 17:42:03,060 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2025-03-16 17:42:03,068 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-03-16 17:42:03,071 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-03-16 17:42:03,085 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-03-16 17:42:03,086 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-03-16 17:42:03,104 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:42:03,105 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:42:03,120 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:42:03,120 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:42:03,127 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-03-16 17:42:03,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2025-03-16 17:42:03,146 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2025-03-16 17:42:03,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or .cse1 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2025-03-16 17:42:03,175 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_18| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse0 (select |c_#valid| .cse0)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (or .cse1 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2025-03-16 17:42:03,207 INFO L349 Elim1Store]: treesize reduction 33, result has 45.0 percent of original size [2025-03-16 17:42:03,207 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 1 case distinctions, treesize of input 119 treesize of output 74 [2025-03-16 17:42:03,224 INFO L349 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2025-03-16 17:42:03,224 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 1 case distinctions, treesize of input 95 treesize of output 73 [2025-03-16 17:42:03,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse0 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 0) (or (= .cse0 (select .cse3 0)) (= .cse0 .cse1)) (<= 5 |c_ULTIMATE.start_dll_circular_append_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1))))))) is different from false [2025-03-16 17:42:03,245 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse0 (select .cse3 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= (select |c_#valid| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 4) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse2 0) 0) (or (= .cse0 (select .cse3 0)) (= .cse0 .cse1)) (<= 5 |c_ULTIMATE.start_dll_circular_append_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_18| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_18| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_18| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_18| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 1))))))) is different from true [2025-03-16 17:42:03,261 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:42:03,262 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 34 [2025-03-16 17:42:03,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:03,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2025-03-16 17:42:03,281 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:42:03,283 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:42:03,306 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:42:03,308 WARN L873 $PredicateComparison]: unable to prove that (and (<= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:42:03,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 17:42:03,359 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (<= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2025-03-16 17:42:03,362 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (<= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2025-03-16 17:42:03,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:03,435 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-16 17:42:03,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 62 [2025-03-16 17:42:03,483 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2025-03-16 17:42:03,483 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 46 treesize of output 78 [2025-03-16 17:42:03,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse3) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse0))) (let ((.cse5 (= (select .cse8 0) 0)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0))) (or (and (or .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse7 4) 0) (= (select .cse7 0) 0) (or .cse5 .cse6 (= .cse8 .cse7))))))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse9 (select |v_old(#valid)_AFTER_CALL_19| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))))))) is different from false [2025-03-16 17:42:03,548 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse3) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse0))) (let ((.cse5 (= (select .cse8 0) 0)) (.cse6 (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse0))) (or (and (or .cse5 .cse6) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse1)) (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and (= (select .cse7 4) 0) (= (select .cse7 0) 0) (or .cse5 .cse6 (= .cse8 .cse7))))))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse9 (select |v_old(#valid)_AFTER_CALL_19| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0))))))) is different from true [2025-03-16 17:42:03,637 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_19| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse4) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)))) (or (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and .cse6 (= (select .cse7 4) 0) (= (select .cse7 0) 0))) (and .cse6 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0))))) is different from false [2025-03-16 17:42:03,640 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 0) .cse1) (= .cse0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_19| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse4) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)) (let ((.cse6 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0)))) (or (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and .cse6 (= (select .cse7 4) 0) (= (select .cse7 0) 0))) (and .cse6 (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0))))) is different from true [2025-03-16 17:42:03,702 INFO L349 Elim1Store]: treesize reduction 110, result has 0.9 percent of original size [2025-03-16 17:42:03,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 488 treesize of output 192 [2025-03-16 17:42:03,710 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 0 case distinctions, treesize of input 171 treesize of output 105 [2025-03-16 17:42:03,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:03,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 44 [2025-03-16 17:42:03,719 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 31 treesize of output 45 [2025-03-16 17:42:03,730 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:42:03,779 INFO L349 Elim1Store]: treesize reduction 84, result has 24.3 percent of original size [2025-03-16 17:42:03,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 557 treesize of output 263 [2025-03-16 17:42:03,786 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 92 [2025-03-16 17:42:03,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:03,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2025-03-16 17:42:03,798 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 23 treesize of output 29 [2025-03-16 17:42:03,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:03,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:03,809 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 135 treesize of output 49 [2025-03-16 17:42:03,813 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 49 treesize of output 19 [2025-03-16 17:42:03,843 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:42:03,853 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:42:03,871 INFO L349 Elim1Store]: treesize reduction 110, result has 0.9 percent of original size [2025-03-16 17:42:03,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 457 treesize of output 177 [2025-03-16 17:42:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:03,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 89 [2025-03-16 17:42:03,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:03,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 45 [2025-03-16 17:42:03,884 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 23 treesize of output 29 [2025-03-16 17:42:03,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse8 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select .cse2 0) .cse3) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1))) (= (select .cse4 0) 0) (= .cse1 (select .cse8 0)))))))) is different from false [2025-03-16 17:42:03,921 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse8 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= (select .cse2 0) .cse3) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1))) (= (select .cse4 0) 0) (= .cse1 (select .cse8 0)))))))) is different from true [2025-03-16 17:42:03,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse8 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse2 0) .cse3) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1))) (= (select .cse4 0) 0) (= .cse1 (select .cse8 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))))) is different from false [2025-03-16 17:42:03,989 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse8 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse2 0) .cse3) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1))) (= (select .cse4 0) 0) (= .cse1 (select .cse8 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))))) is different from true [2025-03-16 17:42:04,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse8 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse2 0) .cse3) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1))) (= (select .cse4 0) 0) (= .cse1 (select .cse8 0)) (= |c_ULTIMATE.start_main_#t~mem17#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))))) is different from false [2025-03-16 17:42:04,065 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (select .cse8 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse3)) (.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse2 0) .cse3) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (not (= .cse0 .cse3)) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1))) (= (select .cse4 0) 0) (= .cse1 (select .cse8 0)) (= |c_ULTIMATE.start_main_#t~mem17#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3))))))) is different from true [2025-03-16 17:42:04,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select .cse3 4)) (.cse8 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse3 0) .cse1) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select .cse4 0) 0) (= .cse2 .cse8) (= .cse0 |c_ULTIMATE.start_main_#t~mem21#1.base|))))))) is different from false [2025-03-16 17:42:04,144 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select .cse3 4)) (.cse8 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse3 0) .cse1) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select .cse4 0) 0) (= .cse2 .cse8) (= .cse0 |c_ULTIMATE.start_main_#t~mem21#1.base|))))))) is different from true [2025-03-16 17:42:04,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select .cse3 4)) (.cse8 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse3 0) .cse1) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select .cse4 0) 0) (= .cse2 .cse8))))))) is different from false [2025-03-16 17:42:04,208 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select .cse3 4)) (.cse8 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse3 0) .cse1) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select .cse4 0) 0) (= .cse2 .cse8))))))) is different from true [2025-03-16 17:42:04,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select .cse3 4)) (.cse8 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse3 0) .cse1) (<= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_#t~mem17#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select .cse4 0) 0) (= .cse2 .cse8))))))) is different from false [2025-03-16 17:42:04,281 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse9 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse2 (select .cse3 4)) (.cse8 (select .cse9 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 5 (select (select |c_#memory_int#1| .cse0) 8)) (= (select (select |c_#memory_int#1| .cse1) 8) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse3 0) .cse1) (<= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_#t~mem17#1|) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse4 4) 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_18| (Array Int Int)) (v_arrayElimIndex_13 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_18| v_arrayElimIndex_13) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_18| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_18| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_18| .cse5) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse7 (select |v_old(#valid)_AFTER_CALL_19| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse8) (= (select .cse4 0) 0) (= .cse2 .cse8))))))) is different from true [2025-03-16 17:42:04,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:04,321 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 259 treesize of output 183 [2025-03-16 17:42:04,336 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2025-03-16 17:42:04,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 134 treesize of output 66 [2025-03-16 17:42:04,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:42:04,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-16 17:42:04,364 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-16 17:42:04,364 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 15 treesize of output 7 [2025-03-16 17:42:04,388 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimCell_161 Int) (v_arrayElimIndex_19 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse0 (select |v_old(#valid)_AFTER_CALL_19| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_int#1| v_arrayElimCell_161) 8) 1) (= (select |v_old(#valid)_AFTER_CALL_20| v_arrayElimCell_161) 0) (<= (select (select |c_#memory_int#1| v_arrayElimIndex_19) 8) 1) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_161) 1) (= (select |v_old(#valid)_AFTER_CALL_20| v_arrayElimIndex_19) 1)))) is different from false [2025-03-16 17:42:04,390 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 5 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (v_arrayElimCell_161 Int) (v_arrayElimIndex_19 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_19| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_20| |v_old(#valid)_AFTER_CALL_19|))) (store |v_old(#valid)_AFTER_CALL_20| .cse0 (select |v_old(#valid)_AFTER_CALL_19| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select (select |c_#memory_int#1| v_arrayElimCell_161) 8) 1) (= (select |v_old(#valid)_AFTER_CALL_20| v_arrayElimCell_161) 0) (<= (select (select |c_#memory_int#1| v_arrayElimIndex_19) 8) 1) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_161) 1) (= (select |v_old(#valid)_AFTER_CALL_20| v_arrayElimIndex_19) 1)))) is different from true [2025-03-16 17:42:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2025-03-16 17:42:04,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:42:39,353 WARN L286 SmtUtils]: Spent 11.17s on a formula simplification. DAG size of input: 378 DAG size of output: 334 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-16 17:42:39,353 INFO L349 Elim1Store]: treesize reduction 18693, result has 80.3 percent of original size [2025-03-16 17:42:39,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 46 case distinctions, treesize of input 475895 treesize of output 516878 [2025-03-16 17:42:39,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:39,870 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 100887 treesize of output 99184 [2025-03-16 17:42:40,233 INFO L224 Elim1Store]: Index analysis took 226 ms [2025-03-16 17:42:41,682 INFO L349 Elim1Store]: treesize reduction 3480, result has 84.8 percent of original size [2025-03-16 17:42:41,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 114219 treesize of output 128803 [2025-03-16 17:42:42,726 INFO L349 Elim1Store]: treesize reduction 4314, result has 49.9 percent of original size [2025-03-16 17:42:42,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 97623 treesize of output 101065 [2025-03-16 17:42:43,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:43,129 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 96761 treesize of output 95058 [2025-03-16 17:42:43,425 INFO L224 Elim1Store]: Index analysis took 138 ms [2025-03-16 17:42:44,698 INFO L349 Elim1Store]: treesize reduction 4314, result has 49.9 percent of original size [2025-03-16 17:42:44,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 93353 treesize of output 96795 [2025-03-16 17:42:45,041 INFO L224 Elim1Store]: Index analysis took 167 ms [2025-03-16 17:42:45,952 INFO L349 Elim1Store]: treesize reduction 4314, result has 49.9 percent of original size [2025-03-16 17:42:45,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 92491 treesize of output 95933 [2025-03-16 17:42:46,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:46,358 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 91629 treesize of output 89926 [2025-03-16 17:42:46,709 INFO L224 Elim1Store]: Index analysis took 147 ms [2025-03-16 17:42:47,620 INFO L349 Elim1Store]: treesize reduction 4314, result has 49.9 percent of original size [2025-03-16 17:42:47,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 88221 treesize of output 91663 [2025-03-16 17:42:48,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:42:48,172 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 87359 treesize of output 85656