./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 04:32:51,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:32:51,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:32:51,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:32:51,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:32:51,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:32:51,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:32:51,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:32:51,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:32:51,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:32:51,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:32:51,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:32:51,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:32:51,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:32:51,412 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:32:51,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:32:51,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:32:51,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:32:51,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:32:51,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:32:51,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:32:51,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:32:51,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:32:51,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:32:51,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:32:51,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:32:51,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:32:51,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:32:51,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:32:51,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:32:51,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:32:51,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:32:51,415 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-08 04:32:51,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:32:51,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:32:51,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:32:51,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:32:51,660 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:32:51,661 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-08 04:32:52,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c352a780e/9b08e554a0f8424086e5fb482bbbac1a/FLAG864f8cfcc [2025-03-08 04:32:53,043 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:32:53,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-08 04:32:53,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c352a780e/9b08e554a0f8424086e5fb482bbbac1a/FLAG864f8cfcc [2025-03-08 04:32:53,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c352a780e/9b08e554a0f8424086e5fb482bbbac1a [2025-03-08 04:32:53,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:32:53,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:32:53,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:32:53,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:32:53,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:32:53,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fadb9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53, skipping insertion in model container [2025-03-08 04:32:53,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:32:53,649 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-08 04:32:53,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:32:53,661 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:32:53,701 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-08 04:32:53,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:32:53,722 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:32:53,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53 WrapperNode [2025-03-08 04:32:53,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:32:53,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:32:53,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:32:53,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:32:53,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,751 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2025-03-08 04:32:53,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:32:53,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:32:53,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:32:53,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:32:53,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,777 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 9, 20]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2025-03-08 04:32:53,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:32:53,791 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:32:53,791 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:32:53,791 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:32:53,792 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (1/1) ... [2025-03-08 04:32:53,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:32:53,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:53,817 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-08 04:32:53,819 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-08 04:32:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 04:32:53,835 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:32:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:32:53,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:32:53,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:32:53,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:32:54,111 INFO L1307 $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-08 04:32:54,132 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 04:32:54,142 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-08 04:32:54,143 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:32:54,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:32:54,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:32:54,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:32:54 BoogieIcfgContainer [2025-03-08 04:32:54,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:32:54,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:32:54,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:32:54,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:32:54,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:32:53" (1/3) ... [2025-03-08 04:32:54,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f00570a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:32:54, skipping insertion in model container [2025-03-08 04:32:54,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:53" (2/3) ... [2025-03-08 04:32:54,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f00570a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:32:54, skipping insertion in model container [2025-03-08 04:32:54,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:32:54" (3/3) ... [2025-03-08 04:32:54,161 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2025-03-08 04:32:54,171 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:32:54,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.i that has 2 procedures, 34 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 04:32:54,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:32:54,216 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;@7b92d580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:32:54,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:32:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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-08 04:32:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:32:54,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:54,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:32:54,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:54,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1837586127, now seen corresponding path program 1 times [2025-03-08 04:32:54,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:54,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305411652] [2025-03-08 04:32:54,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:54,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:54,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:32:54,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:32:54,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:54,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:54,564 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-08 04:32:54,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305411652] [2025-03-08 04:32:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305411652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:32:54,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:32:54,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:32:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77179508] [2025-03-08 04:32:54,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:32:54,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:32:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:54,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:32:54,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:32:54,589 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 04:32:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:54,613 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2025-03-08 04:32:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:32:54,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2025-03-08 04:32:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:54,620 INFO L225 Difference]: With dead ends: 64 [2025-03-08 04:32:54,621 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:32:54,624 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-08 04:32:54,627 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:32:54,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:32:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:32:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-03-08 04:32:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-08 04:32:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-08 04:32:54,656 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2025-03-08 04:32:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:54,657 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-08 04:32:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 04:32:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-08 04:32:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:32:54,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:54,659 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] [2025-03-08 04:32:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:32:54,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:54,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:54,661 INFO L85 PathProgramCache]: Analyzing trace with hash -173661198, now seen corresponding path program 1 times [2025-03-08 04:32:54,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196287837] [2025-03-08 04:32:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:54,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:54,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:32:54,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:32:54,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:54,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:55,074 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-08 04:32:55,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196287837] [2025-03-08 04:32:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196287837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:32:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828921329] [2025-03-08 04:32:55,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:55,080 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-08 04:32:55,081 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-08 04:32:55,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:32:55,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:32:55,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:55,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:55,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 04:32:55,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:32:55,350 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-08 04:32:55,365 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-08 04:32:55,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:32:55,430 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-08 04:32:55,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828921329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:32:55,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:32:55,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2025-03-08 04:32:55,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720906749] [2025-03-08 04:32:55,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:32:55,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:32:55,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:55,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:32:55,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:32:55,436 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-08 04:32:59,476 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-08 04:33:03,495 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-08 04:33:07,507 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-08 04:33:11,527 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-08 04:33:15,687 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-08 04:33:19,717 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-08 04:33:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:19,722 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2025-03-08 04:33:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 04:33:19,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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 33 [2025-03-08 04:33:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:19,723 INFO L225 Difference]: With dead ends: 59 [2025-03-08 04:33:19,723 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 04:33:19,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-08 04:33:19,724 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:19,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 242 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2025-03-08 04:33:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 04:33:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 04:33:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-08 04:33:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-08 04:33:19,729 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2025-03-08 04:33:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:19,729 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-08 04:33:19,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-08 04:33:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-08 04:33:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:33:19,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:19,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:19,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:19,930 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-08 04:33:19,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:19,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -172737677, now seen corresponding path program 1 times [2025-03-08 04:33:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142483998] [2025-03-08 04:33:19,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:19,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:33:20,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:33:20,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:20,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:21,875 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-08 04:33:21,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142483998] [2025-03-08 04:33:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142483998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914733444] [2025-03-08 04:33:21,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:21,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:21,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:21,877 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-08 04:33:21,879 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-08 04:33:21,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:33:22,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:33:22,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:22,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:22,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-08 04:33:22,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:22,334 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-08 04:33:22,499 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-08 04:33:22,567 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:33:22,568 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-08 04:33:22,643 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-08 04:33:22,710 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-08 04:33:22,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:22,841 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 26 treesize of output 23 [2025-03-08 04:33:22,848 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 24 treesize of output 32 [2025-03-08 04:33:22,857 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 12 treesize of output 11 [2025-03-08 04:33:22,879 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 11 [2025-03-08 04:33:23,074 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 82 treesize of output 50 [2025-03-08 04:33:23,078 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 34 treesize of output 26 [2025-03-08 04:33:23,084 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 7 [2025-03-08 04:33:23,089 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 11 treesize of output 3 [2025-03-08 04:33:23,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:23,281 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 90 treesize of output 57 [2025-03-08 04:33:23,288 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 65 treesize of output 49 [2025-03-08 04:33:23,299 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:33:23,300 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-08 04:33:23,339 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:33:23,339 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-08 04:33:23,350 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-08 04:33:23,503 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-08 04:33:23,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:23,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:23,511 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-08 04:33:23,515 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-08 04:33:23,568 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-08 04:33:23,636 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-08 04:33:23,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:23,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_451 Int) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_454 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.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$#1.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#2| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) v_ArrVal_452) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_454))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_451)))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2025-03-08 04:33:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914733444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:23,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2025-03-08 04:33:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674961663] [2025-03-08 04:33:23,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:23,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 04:33:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:23,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 04:33:23,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2080, Unknown=25, NotChecked=92, Total=2352 [2025-03-08 04:33:23,936 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 35 states have internal predecessors, (50), 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-08 04:33:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:25,074 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-03-08 04:33:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 04:33:25,074 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.25) internal successors, (50), 35 states have internal predecessors, (50), 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 33 [2025-03-08 04:33:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:25,075 INFO L225 Difference]: With dead ends: 62 [2025-03-08 04:33:25,075 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 04:33:25,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=260, Invalid=3376, Unknown=28, NotChecked=118, Total=3782 [2025-03-08 04:33:25,078 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:25,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 411 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 913 Invalid, 2 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 04:33:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 04:33:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2025-03-08 04:33:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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-08 04:33:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-08 04:33:25,084 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 33 [2025-03-08 04:33:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:25,084 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-08 04:33:25,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.25) internal successors, (50), 35 states have internal predecessors, (50), 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-08 04:33:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-08 04:33:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:33:25,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:25,085 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, 1, 1] [2025-03-08 04:33:25,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:25,285 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-08 04:33:25,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -654902940, now seen corresponding path program 1 times [2025-03-08 04:33:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590064096] [2025-03-08 04:33:25,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:25,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:33:25,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:25,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:27,432 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-08 04:33:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590064096] [2025-03-08 04:33:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590064096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942053478] [2025-03-08 04:33:27,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:27,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:27,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:27,434 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-08 04:33:27,436 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-08 04:33:27,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:33:27,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:27,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:27,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:27,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-03-08 04:33:27,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:27,896 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-08 04:33:27,913 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-08 04:33:28,087 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:33:28,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 04:33:28,102 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:33:28,102 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-08 04:33:28,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:33:28,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:33:28,182 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-08 04:33:28,243 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:33:28,244 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-08 04:33:28,248 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 39 treesize of output 15 [2025-03-08 04:33:28,255 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 24 treesize of output 11 [2025-03-08 04:33:28,393 INFO L349 Elim1Store]: treesize reduction 56, result has 8.2 percent of original size [2025-03-08 04:33:28,393 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 156 treesize of output 137 [2025-03-08 04:33:28,401 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2025-03-08 04:33:28,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 111 [2025-03-08 04:33:28,406 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2025-03-08 04:33:28,411 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 55 treesize of output 18 [2025-03-08 04:33:28,417 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 33 treesize of output 31 [2025-03-08 04:33:28,424 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 20 treesize of output 15 [2025-03-08 04:33:28,568 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 64 treesize of output 24 [2025-03-08 04:33:28,573 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 23 treesize of output 7 [2025-03-08 04:33:28,578 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-08 04:33:28,581 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 7 treesize of output 3 [2025-03-08 04:33:28,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:28,770 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 72 treesize of output 43 [2025-03-08 04:33:28,781 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-08 04:33:28,781 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 24 treesize of output 31 [2025-03-08 04:33:28,798 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:33:28,798 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-08 04:33:28,808 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 31 treesize of output 20 [2025-03-08 04:33:29,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:29,032 INFO L349 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2025-03-08 04:33:29,032 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 232 [2025-03-08 04:33:29,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:29,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:29,043 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 58 treesize of output 43 [2025-03-08 04:33:29,045 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 18 [2025-03-08 04:33:29,051 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2025-03-08 04:33:29,056 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 118 treesize of output 89 [2025-03-08 04:33:29,064 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 37 treesize of output 19 [2025-03-08 04:33:29,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 43 [2025-03-08 04:33:29,225 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 76 treesize of output 48 [2025-03-08 04:33:29,235 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 34 treesize of output 18 [2025-03-08 04:33:29,239 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-08 04:33:29,305 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-08 04:33:29,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:29,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse5))) (let ((.cse1 (select |c_#memory_int#2| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse5)) (.cse10 (+ .cse7 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_682 Int) (v_ArrVal_690 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse9 (select (let ((.cse11 (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_691) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_694))) (store .cse11 .cse3 (store (select .cse11 .cse3) .cse5 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse6))) (let ((.cse8 (select .cse9 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 (store .cse1 .cse2 v_ArrVal_688)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_686) .cse3 v_ArrVal_693) (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_692) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_690))) (store .cse4 .cse3 (store (select .cse4 .cse3) .cse5 v_ArrVal_682))) .cse6) .cse7)) (+ 8 .cse8))) (= (select .cse9 .cse10) .cse8))))) (forall ((v_ArrVal_682 Int) (v_ArrVal_690 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse14 (select (let ((.cse15 (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_692) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_690))) (store .cse15 .cse3 (store (select .cse15 .cse3) .cse5 v_ArrVal_682))) .cse6))) (let ((.cse12 (select .cse14 .cse7))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 (store .cse1 .cse2 v_ArrVal_688)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_686) .cse3 v_ArrVal_693) .cse12) (+ 8 (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_691) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_694))) (store .cse13 .cse3 (store (select .cse13 .cse3) .cse5 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse6) .cse7)))) (= .cse12 (select .cse14 .cse10)))))))))) is different from false [2025-03-08 04:33:29,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse8))) (let ((.cse4 (select |c_#memory_int#2| .cse3)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse8)) (.cse1 (+ .cse10 4)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_682 Int) (v_ArrVal_690 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (select (let ((.cse11 (store (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_692) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_690))) (store .cse11 .cse6 (store (select .cse11 .cse6) .cse8 v_ArrVal_682))) .cse9))) (let ((.cse2 (select .cse0 .cse10))) (or (= (select .cse0 .cse1) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse3 (store .cse4 .cse5 v_ArrVal_688)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_686) .cse6 v_ArrVal_693) .cse2) (+ (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_691) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_694))) (store .cse7 .cse6 (store (select .cse7 .cse6) .cse8 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse9) .cse10) 8))))))) (forall ((v_ArrVal_682 Int) (v_ArrVal_690 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse14 (select (let ((.cse15 (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_691) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_694))) (store .cse15 .cse6 (store (select .cse15 .cse6) .cse8 |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) .cse9))) (let ((.cse13 (select .cse14 .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse3 (store .cse4 .cse5 v_ArrVal_688)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_686) .cse6 v_ArrVal_693) (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$#2.base| .cse3 v_ArrVal_692) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_690))) (store .cse12 .cse6 (store (select .cse12 .cse6) .cse8 v_ArrVal_682))) .cse9) .cse10)) (+ .cse13 8))) (= .cse13 (select .cse14 .cse1)))))))))) is different from false [2025-03-08 04:33:29,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942053478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:29,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:29,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2025-03-08 04:33:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126682114] [2025-03-08 04:33:29,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:29,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 04:33:29,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:29,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 04:33:29,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2203, Unknown=2, NotChecked=190, Total=2550 [2025-03-08 04:33:29,969 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 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-08 04:33:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:31,420 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-08 04:33:31,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 04:33:31,420 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 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 36 [2025-03-08 04:33:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:31,421 INFO L225 Difference]: With dead ends: 66 [2025-03-08 04:33:31,421 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 04:33:31,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=273, Invalid=3765, Unknown=2, NotChecked=250, Total=4290 [2025-03-08 04:33:31,422 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:31,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 317 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 04:33:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 04:33:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-03-08 04:33:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 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-08 04:33:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-03-08 04:33:31,429 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 36 [2025-03-08 04:33:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:31,429 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-03-08 04:33:31,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.3) internal successors, (52), 35 states have internal predecessors, (52), 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-08 04:33:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-03-08 04:33:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:33:31,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:31,431 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, 1, 1] [2025-03-08 04:33:31,439 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-08 04:33:31,632 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-08 04:33:31,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:31,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -654881085, now seen corresponding path program 1 times [2025-03-08 04:33:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061339425] [2025-03-08 04:33:31,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:31,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:33:31,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:31,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:31,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:32,628 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-08 04:33:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061339425] [2025-03-08 04:33:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061339425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022441704] [2025-03-08 04:33:32,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:32,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:32,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:32,631 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-08 04:33:32,633 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-08 04:33:32,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:33:32,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:32,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:32,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:32,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-08 04:33:33,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:33,023 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-08 04:33:33,111 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|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |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_#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-08 04:33:33,112 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|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |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_#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-08 04:33:33,118 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-08 04:33:33,132 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) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-03-08 04:33:33,134 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) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-03-08 04:33:33,149 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:33:33,149 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-08 04:33:33,153 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-08 04:33:33,174 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from false [2025-03-08 04:33:33,175 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)))) is different from true [2025-03-08 04:33:33,191 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-03-08 04:33:33,192 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-03-08 04:33:33,207 INFO L349 Elim1Store]: treesize reduction 56, result has 8.2 percent of original size [2025-03-08 04:33:33,208 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 62 treesize of output 61 [2025-03-08 04:33:33,211 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 12 treesize of output 11 [2025-03-08 04:33:33,218 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2025-03-08 04:33:33,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 34 [2025-03-08 04:33:33,220 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-08 04:33:33,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2025-03-08 04:33:33,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= .cse0 (select .cse1 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from false [2025-03-08 04:33:33,239 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= .cse0 (select .cse1 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from true [2025-03-08 04:33:33,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= (select |c_#valid| .cse2) 1) (not (= .cse0 .cse2)) (= |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_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-03-08 04:33:33,263 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= (select |c_#valid| .cse2) 1) (not (= .cse0 .cse2)) (= |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_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-03-08 04:33:33,283 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 49 treesize of output 17 [2025-03-08 04:33:33,299 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_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-08 04:33:33,300 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_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-08 04:33:33,320 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-08 04:33:33,321 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-08 04:33:33,358 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_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-08 04:33:33,360 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_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-08 04:33:33,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:33,407 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 57 treesize of output 34 [2025-03-08 04:33:33,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (not (= .cse0 .cse2)) (= |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_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-03-08 04:33:33,440 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (not (= .cse0 .cse2)) (= |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_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-03-08 04:33:33,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (not (= .cse0 .cse2)) (= |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_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))))))) is different from false [2025-03-08 04:33:33,495 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (not (= .cse0 .cse2)) (= |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_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))))))) is different from true [2025-03-08 04:33:33,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:33,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:33,530 INFO L349 Elim1Store]: treesize reduction 138, result has 7.4 percent of original size [2025-03-08 04:33:33,531 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 180 [2025-03-08 04:33:33,542 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 232 treesize of output 197 [2025-03-08 04:33:33,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse9 0)) (.cse2 (select .cse9 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse0 .cse1)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 .cse1))) (and (= (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) (= .cse7 v_DerPreprocessor_5) (= .cse6 v_DerPreprocessor_4) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse2)) (= v_DerPreprocessor_6 (store .cse6 4 .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-03-08 04:33:33,586 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse9 0)) (.cse2 (select .cse9 4))) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse0 .cse1)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 .cse1))) (and (= (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) (= .cse7 v_DerPreprocessor_5) (= .cse6 v_DerPreprocessor_4) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse2)) (= v_DerPreprocessor_6 (store .cse6 4 .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-03-08 04:33:33,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse9 0)) (.cse2 (select .cse9 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse0 .cse1)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 .cse1))) (and (= (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) (= .cse7 v_DerPreprocessor_5) (= .cse6 v_DerPreprocessor_4) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse2)) (= v_DerPreprocessor_6 (store .cse6 4 .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-03-08 04:33:33,644 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse9 0)) (.cse2 (select .cse9 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse0 .cse1)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 .cse1))) (and (= (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) (= .cse7 v_DerPreprocessor_5) (= .cse6 v_DerPreprocessor_4) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse2)) (= v_DerPreprocessor_6 (store .cse6 4 .cse2)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-03-08 04:33:33,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,716 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 342 treesize of output 218 [2025-03-08 04:33:33,727 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 04:33:33,727 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 365 treesize of output 265 [2025-03-08 04:33:33,738 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 131 treesize of output 91 [2025-03-08 04:33:33,753 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 04:33:33,753 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-08 04:33:33,798 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_82 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_82) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_82) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0))) is different from false [2025-03-08 04:33:33,799 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_82 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_82) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_82) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0))) is different from true [2025-03-08 04:33:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-03-08 04:33:33,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:33,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_908 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4) v_ArrVal_908) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_910))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2025-03-08 04:33:33,869 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_908 (Array Int Int))) (not (let ((.cse0 (select (let ((.cse3 (select (select |c_#memory_$Pointer$#1.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$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4) v_ArrVal_908) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_910))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2025-03-08 04:33:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022441704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:33,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 40 [2025-03-08 04:33:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306639036] [2025-03-08 04:33:33,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:33,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 04:33:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:33,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 04:33:33,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=747, Unknown=30, NotChecked=1104, Total=1980 [2025-03-08 04:33:33,948 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 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-08 04:33:34,113 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |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_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |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_#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)) is different from false [2025-03-08 04:33:34,115 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |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_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_11| |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_#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)) is different from true [2025-03-08 04:33:34,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (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) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (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-08 04:33:34,119 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (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) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (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-08 04:33:34,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not .cse0))) is different from false [2025-03-08 04:33:34,122 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not .cse0))) is different from true [2025-03-08 04:33:34,124 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_~head~0#1.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#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)) is different from false [2025-03-08 04:33:34,125 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_~head~0#1.base|)) (.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_~last~0#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)) is different from true [2025-03-08 04:33:34,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse3 0)) (.cse0 (select .cse3 4))) (and (= .cse0 .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from false [2025-03-08 04:33:34,131 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse3 0)) (.cse0 (select .cse3 4))) (and (= .cse0 .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from true [2025-03-08 04:33:34,147 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= (select |c_#valid| .cse2) 1) (not (= .cse0 .cse2)) (= |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_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| .cse4) 1) (not (= (select .cse5 4) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| (select .cse5 0)) 1)))))) is different from false [2025-03-08 04:33:34,149 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse0 (select .cse1 4)) (.cse5 (select |c_#memory_$Pointer$#2.base| .cse4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (= (select |c_#valid| .cse2) 1) (not (= .cse0 .cse2)) (= |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_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |c_#valid| .cse3)))))) (= (select |c_#valid| .cse4) 1) (not (= (select .cse5 4) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| (select .cse5 0)) 1)))))) is different from true [2025-03-08 04:33:34,165 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |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_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-08 04:33:34,167 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= |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_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-08 04:33:34,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |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) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse2) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from false [2025-03-08 04:33:34,172 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |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) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse0) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_11| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse2) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|))) is different from true [2025-03-08 04:33:34,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse0 (select .cse1 4)) (.cse2 (select |c_#memory_$Pointer$#2.base| .cse3))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (not (= (select .cse2 4) .cse3)) (not (= .cse0 .cse4)) (= |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_#t~ret9#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse2 0))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-03-08 04:33:34,184 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse0 (select .cse1 4)) (.cse2 (select |c_#memory_$Pointer$#2.base| .cse3))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (not (= (select .cse2 4) .cse3)) (not (= .cse0 .cse4)) (= |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_#t~ret9#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse5 (select |v_old(#valid)_AFTER_CALL_12| .cse5))) |v_old(#valid)_AFTER_CALL_12|))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse6) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse7 (select |v_#valid_BEFORE_CALL_11| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse6) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select .cse2 0))) (= 0 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-03-08 04:33:34,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (not (= (select .cse2 4) .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse0 .cse4)) (= |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_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse2 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|))))))) is different from false [2025-03-08 04:33:34,210 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse0 (select .cse1 4))) (and (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| 0) (= .cse0 (select .cse1 0)) (not (= (select .cse2 4) .cse3)) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3)) (not (= .cse0 .cse4)) (= |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_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0)))) (= |c_ULTIMATE.start_dll_circular_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select .cse2 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse7 (select |v_old(#valid)_AFTER_CALL_12| .cse7))) |v_old(#valid)_AFTER_CALL_12|))))))) is different from true [2025-03-08 04:33:34,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse10 0))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse12 0)) (.cse2 (select .cse12 4)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse0 .cse1)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 .cse1))) (and (= (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) (= .cse7 v_DerPreprocessor_5) (= .cse6 v_DerPreprocessor_4) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse2)) (= v_DerPreprocessor_6 (store .cse6 4 .cse2)))))) (not (let ((.cse9 (select |c_#memory_$Pointer$#2.base| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse9 4) (select .cse9 0)))) (= (select .cse11 0) 0) (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2025-03-08 04:33:34,225 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse10 0))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse12 0)) (.cse2 (select .cse12 4)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse0 .cse1)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 .cse1))) (and (= (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) (= .cse7 v_DerPreprocessor_5) (= .cse6 v_DerPreprocessor_4) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse2)) (= v_DerPreprocessor_6 (store .cse6 4 .cse2)))))) (not (let ((.cse9 (select |c_#memory_$Pointer$#2.base| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (= (select .cse9 4) (select .cse9 0)))) (= (select .cse11 0) 0) (= (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2025-03-08 04:33:34,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse10 0))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse11 0)) (.cse2 (select .cse11 4)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse0 .cse1)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 .cse1))) (and (= (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) (= .cse7 v_DerPreprocessor_5) (= .cse6 v_DerPreprocessor_4) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse2)) (= v_DerPreprocessor_6 (store .cse6 4 .cse2)))))) (= (select .cse9 0) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2025-03-08 04:33:34,293 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select .cse10 0))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse11 0)) (.cse2 (select .cse11 4)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_12| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_12| .cse3))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_76 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_76) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |v_#valid_BEFORE_CALL_11| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0)))) (not (= .cse0 .cse1)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_4) .cse2 v_DerPreprocessor_5) .cse0 v_DerPreprocessor_6))) (let ((.cse7 (select .cse8 .cse2)) (.cse6 (select .cse8 .cse1))) (and (= (select |c_#memory_$Pointer$#2.base| .cse1) .cse6) (= .cse7 v_DerPreprocessor_5) (= .cse6 v_DerPreprocessor_4) (= .cse7 (select |c_#memory_$Pointer$#2.base| .cse2)) (= v_DerPreprocessor_6 (store .cse6 4 .cse2)))))) (= (select .cse9 0) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2025-03-08 04:33:34,305 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) (exists ((v_arrayElimCell_82 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_82) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_82) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0)))) is different from false [2025-03-08 04:33:34,307 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) (exists ((v_arrayElimCell_82 Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_82) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| v_arrayElimCell_82) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0)))) is different from true [2025-03-08 04:33:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:34,337 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-03-08 04:33:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 04:33:34,337 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 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 36 [2025-03-08 04:33:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:34,338 INFO L225 Difference]: With dead ends: 73 [2025-03-08 04:33:34,338 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 04:33:34,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=855, Unknown=56, NotChecked=2494, Total=3540 [2025-03-08 04:33:34,339 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1194 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:34,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 1194 Unchecked, 0.2s Time] [2025-03-08 04:33:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 04:33:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-08 04:33:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 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-08 04:33:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-03-08 04:33:34,354 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 36 [2025-03-08 04:33:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:34,355 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-03-08 04:33:34,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 31 states have internal predecessors, (48), 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-08 04:33:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-03-08 04:33:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:33:34,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:34,356 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, 1, 1] [2025-03-08 04:33:34,366 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-08 04:33:34,556 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-08 04:33:34,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:34,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1499352956, now seen corresponding path program 1 times [2025-03-08 04:33:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222560444] [2025-03-08 04:33:34,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:34,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:34,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:33:34,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:34,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:34,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:34,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222560444] [2025-03-08 04:33:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222560444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827972679] [2025-03-08 04:33:34,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:34,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:34,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:34,624 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-08 04:33:34,626 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-08 04:33:34,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:33:34,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:34,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:34,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:34,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 04:33:34,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:34,772 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-08 04:33:34,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827972679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:34,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:33:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-08 04:33:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119937882] [2025-03-08 04:33:34,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:34,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:33:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:34,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:33:34,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:33:34,797 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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-08 04:33:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:34,825 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2025-03-08 04:33:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:33:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 36 [2025-03-08 04:33:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:34,826 INFO L225 Difference]: With dead ends: 98 [2025-03-08 04:33:34,826 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 04:33:34,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 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-08 04:33:34,826 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:34,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 04:33:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 04:33:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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-08 04:33:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-03-08 04:33:34,834 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 36 [2025-03-08 04:33:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:34,834 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-08 04:33:34,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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-08 04:33:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-03-08 04:33:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 04:33:34,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:34,837 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, 1, 1] [2025-03-08 04:33:34,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:35,041 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-08 04:33:35,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:35,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1825352147, now seen corresponding path program 2 times [2025-03-08 04:33:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292756882] [2025-03-08 04:33:35,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:33:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:35,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 04:33:35,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:33:35,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:33:35,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292756882] [2025-03-08 04:33:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292756882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465090762] [2025-03-08 04:33:38,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:33:38,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:38,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:38,026 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-08 04:33:38,028 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-08 04:33:38,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 04:33:38,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:33:38,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:33:38,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:38,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 179 conjuncts are in the unsatisfiable core [2025-03-08 04:33:38,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:38,319 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-08 04:33:38,477 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:33:38,477 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-08 04:33:38,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:33:38,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:33:38,594 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-08 04:33:38,601 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-08 04:33:38,708 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 04:33:38,708 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 1 case distinctions, treesize of input 108 treesize of output 61 [2025-03-08 04:33:38,717 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 51 treesize of output 29 [2025-03-08 04:33:38,887 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 04:33:38,887 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-08 04:33:38,890 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-08 04:33:38,897 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-08 04:33:39,038 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-08 04:33:39,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:39,165 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 04:33:39,165 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-08 04:33:39,184 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:33:39,184 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-08 04:33:39,191 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 46 treesize of output 38 [2025-03-08 04:33:39,441 INFO L349 Elim1Store]: treesize reduction 49, result has 18.3 percent of original size [2025-03-08 04:33:39,441 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 353 treesize of output 229 [2025-03-08 04:33:39,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:39,469 INFO L349 Elim1Store]: treesize reduction 82, result has 5.7 percent of original size [2025-03-08 04:33:39,470 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 282 treesize of output 211 [2025-03-08 04:33:39,478 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 97 treesize of output 82 [2025-03-08 04:33:39,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:39,486 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 60 treesize of output 41 [2025-03-08 04:33:39,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:39,491 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 62 treesize of output 48 [2025-03-08 04:33:39,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 78 treesize of output 57 [2025-03-08 04:33:39,508 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-08 04:33:39,515 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2025-03-08 04:33:39,519 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 45 treesize of output 22 [2025-03-08 04:33:39,524 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-08 04:33:40,167 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 148 treesize of output 100 [2025-03-08 04:33:40,173 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:33:40,173 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 79 treesize of output 42 [2025-03-08 04:33:40,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-08 04:33:40,258 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-08 04:33:40,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:41,455 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse20 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11)) (.cse54 (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (+ .cse8 8)) (.cse14 (+ .cse8 4)) (.cse12 (store |c_#memory_$Pointer$#2.base| .cse20 (store (select |c_#memory_$Pointer$#2.base| .cse20) .cse54 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (store |c_#memory_$Pointer$#2.offset| .cse20 (store (select |c_#memory_$Pointer$#2.offset| .cse20) .cse54 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse19 (+ |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 4))) (and (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1321 Int) (v_DerPreprocessor_8 Int)) (let ((.cse2 (store (let ((.cse18 (store |c_#memory_int#2| .cse20 v_ArrVal_1314))) (store .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse19 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1321))) .cse10 v_ArrVal_1316))) (or (forall ((v_ArrVal_1315 (Array Int Int))) (let ((.cse6 (let ((.cse15 (store .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1315))) (store .cse15 .cse10 (store (select .cse15 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (let ((.cse13 (select .cse6 .cse7))) (let ((.cse1 (select .cse13 .cse14)) (.cse5 (select .cse13 .cse8))) (or (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse3 (let ((.cse9 (store .cse12 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1319))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse4 (select (select .cse3 .cse7) .cse8))) (let ((.cse0 (select (select .cse6 .cse4) .cse5))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 (select (select .cse3 .cse4) .cse5)) (+ .cse0 8))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse4) (+ .cse5 8)))))))) (= .cse1 .cse5)))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse2 .cse7) .cse17)))))) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1321 Int) (v_DerPreprocessor_8 Int)) (let ((.cse23 (store (let ((.cse31 (store |c_#memory_int#2| .cse20 v_ArrVal_1314))) (store .cse31 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse19 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1321))) .cse10 v_ArrVal_1316))) (or (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse27 (let ((.cse30 (store .cse12 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1319))) (store .cse30 .cse10 (store (select .cse30 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse29 (select .cse27 .cse7))) (let ((.cse25 (select .cse29 .cse8)) (.cse22 (select .cse29 .cse14))) (or (forall ((v_ArrVal_1315 (Array Int Int))) (let ((.cse24 (let ((.cse28 (store .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1315))) (store .cse28 .cse10 (store (select .cse28 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (let ((.cse26 (select (select .cse24 .cse7) .cse8))) (let ((.cse21 (select (select .cse27 .cse25) .cse26))) (or (= .cse21 .cse22) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse21) (+ (select (select .cse24 .cse25) .cse26) 8))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse25) (+ .cse26 8)))))))) (= .cse25 .cse22)))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse7) .cse17)))))) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1321 Int) (v_DerPreprocessor_8 Int)) (let ((.cse34 (store (let ((.cse42 (store |c_#memory_int#2| .cse20 v_ArrVal_1314))) (store .cse42 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse42 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse19 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1321))) .cse10 v_ArrVal_1316))) (or (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse35 (let ((.cse41 (store .cse12 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1319))) (store .cse41 .cse10 (store (select .cse41 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse40 (select .cse35 .cse7))) (let ((.cse36 (select .cse40 .cse8))) (or (forall ((v_ArrVal_1315 (Array Int Int))) (let ((.cse38 (let ((.cse39 (store .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1315))) (store .cse39 .cse10 (store (select .cse39 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (let ((.cse33 (select .cse38 .cse7))) (let ((.cse37 (select .cse33 .cse8))) (let ((.cse32 (select (select .cse38 .cse36) .cse37))) (or (= .cse32 (select .cse33 .cse14)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 (select (select .cse35 .cse36) .cse37)) (+ .cse32 8))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 .cse36) (+ .cse37 8))))))))) (= .cse36 (select .cse40 .cse14))))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 .cse7) .cse17)))))) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1321 Int) (v_DerPreprocessor_8 Int)) (let ((.cse43 (store (let ((.cse53 (store |c_#memory_int#2| .cse20 v_ArrVal_1314))) (store .cse53 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (store (store (select .cse53 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) .cse19 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| v_ArrVal_1321))) .cse10 v_ArrVal_1316))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 .cse7) .cse17))) (forall ((v_ArrVal_1315 (Array Int Int))) (let ((.cse48 (let ((.cse52 (store .cse16 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1315))) (store .cse52 .cse10 (store (select .cse52 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))))) (let ((.cse44 (select .cse48 .cse7))) (let ((.cse45 (select .cse44 .cse8))) (or (= (select .cse44 .cse14) .cse45) (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse50 (let ((.cse51 (store .cse12 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_1319))) (store .cse51 .cse10 (store (select .cse51 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|))))) (let ((.cse47 (select .cse50 .cse7))) (let ((.cse49 (select .cse47 .cse8))) (let ((.cse46 (select (select .cse50 .cse49) .cse45))) (or (= .cse46 (select .cse47 .cse14)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 .cse46) (+ (select (select .cse48 .cse49) .cse45) 8))) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 .cse49) (+ .cse45 8))))))))))))))))))))) is different from false [2025-03-08 04:33:41,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11)) (.cse54 (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11))) (let ((.cse16 (store |c_#memory_$Pointer$#2.offset| .cse20 (store (select |c_#memory_$Pointer$#2.offset| .cse20) .cse54 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) (.cse14 (+ .cse8 4)) (.cse12 (store |c_#memory_$Pointer$#2.base| .cse20 (store (select |c_#memory_$Pointer$#2.base| .cse20) .cse54 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (+ .cse8 8)) (.cse19 (+ 4 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1321 Int) (v_DerPreprocessor_8 Int)) (let ((.cse0 (store (let ((.cse18 (store |c_#memory_int#2| .cse20 v_ArrVal_1314))) (store .cse18 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse19 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1321))) .cse10 v_ArrVal_1316))) (or (forall ((v_ArrVal_1315 (Array Int Int))) (let ((.cse6 (let ((.cse15 (store .cse16 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1315))) (store .cse15 .cse10 (store (select .cse15 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) (let ((.cse13 (select .cse6 .cse7))) (let ((.cse3 (select .cse13 .cse14)) (.cse2 (select .cse13 .cse8))) (or (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse5 (let ((.cse9 (store .cse12 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1319))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))))) (let ((.cse1 (select (select .cse5 .cse7) .cse8))) (let ((.cse4 (select (select .cse6 .cse1) .cse2))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) (+ 8 .cse2))) (= .cse3 .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 (select (select .cse5 .cse1) .cse2)) (+ 8 .cse4)))))))) (= .cse3 .cse2)))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse7) .cse17)))))) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1321 Int) (v_DerPreprocessor_8 Int)) (let ((.cse23 (store (let ((.cse31 (store |c_#memory_int#2| .cse20 v_ArrVal_1314))) (store .cse31 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse19 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1321))) .cse10 v_ArrVal_1316))) (or (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse27 (let ((.cse30 (store .cse12 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1319))) (store .cse30 .cse10 (store (select .cse30 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))))) (let ((.cse29 (select .cse27 .cse7))) (let ((.cse21 (select .cse29 .cse14)) (.cse24 (select .cse29 .cse8))) (or (forall ((v_ArrVal_1315 (Array Int Int))) (let ((.cse26 (let ((.cse28 (store .cse16 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1315))) (store .cse28 .cse10 (store (select .cse28 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) (let ((.cse25 (select (select .cse26 .cse7) .cse8))) (let ((.cse22 (select (select .cse27 .cse24) .cse25))) (or (= .cse21 .cse22) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse24) (+ 8 .cse25))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse22) (+ 8 (select (select .cse26 .cse24) .cse25))))))))) (= .cse21 .cse24)))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 .cse7) .cse17)))))) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1321 Int) (v_DerPreprocessor_8 Int)) (let ((.cse36 (store (let ((.cse42 (store |c_#memory_int#2| .cse20 v_ArrVal_1314))) (store .cse42 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse42 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse19 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1321))) .cse10 v_ArrVal_1316))) (or (forall ((v_ArrVal_1315 (Array Int Int))) (let ((.cse38 (let ((.cse41 (store .cse16 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1315))) (store .cse41 .cse10 (store (select .cse41 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) (let ((.cse32 (select .cse38 .cse7))) (let ((.cse33 (select .cse32 .cse8))) (or (= (select .cse32 .cse14) .cse33) (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse39 (let ((.cse40 (store .cse12 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1319))) (store .cse40 .cse10 (store (select .cse40 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))))) (let ((.cse34 (select .cse39 .cse7))) (let ((.cse37 (select .cse34 .cse8))) (let ((.cse35 (select (select .cse39 .cse37) .cse33))) (or (= (select .cse34 .cse14) .cse35) (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse36 .cse37) (+ 8 .cse33))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse36 .cse35) (+ 8 (select (select .cse38 .cse37) .cse33))))))))))))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse36 .cse7) .cse17)))))) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1314 (Array Int Int)) (v_ArrVal_1321 Int) (v_DerPreprocessor_8 Int)) (let ((.cse43 (store (let ((.cse53 (store |c_#memory_int#2| .cse20 v_ArrVal_1314))) (store .cse53 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (store (store (select .cse53 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) .cse19 v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| v_ArrVal_1321))) .cse10 v_ArrVal_1316))) (or (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse48 (let ((.cse52 (store .cse12 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1319))) (store .cse52 .cse10 (store (select .cse52 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|))))) (let ((.cse51 (select .cse48 .cse7))) (let ((.cse44 (select .cse51 .cse8))) (or (forall ((v_ArrVal_1315 (Array Int Int))) (let ((.cse49 (let ((.cse50 (store .cse16 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_1315))) (store .cse50 .cse10 (store (select .cse50 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))))) (let ((.cse46 (select .cse49 .cse7))) (let ((.cse45 (select .cse46 .cse8))) (let ((.cse47 (select (select .cse49 .cse44) .cse45))) (or (< |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 .cse44) (+ 8 .cse45))) (= (select .cse46 .cse14) .cse47) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 (select (select .cse48 .cse44) .cse45)) (+ 8 .cse47))))))))) (= (select .cse51 .cse14) .cse44)))))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 .cse7) .cse17)))))))))) is different from false [2025-03-08 04:33:48,430 WARN L286 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 429 DAG size of output: 382 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-08 04:33:48,430 INFO L349 Elim1Store]: treesize reduction 11925, result has 81.1 percent of original size [2025-03-08 04:33:48,431 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 347049 treesize of output 370596 [2025-03-08 04:33:49,251 INFO L224 Elim1Store]: Index analysis took 513 ms [2025-03-08 04:33:52,422 INFO L349 Elim1Store]: treesize reduction 2172, result has 90.8 percent of original size [2025-03-08 04:33:52,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 79047 treesize of output 97935 [2025-03-08 04:33:52,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:52,868 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 76763 treesize of output 76084 [2025-03-08 04:33:53,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:53,340 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 71831 treesize of output 70504 [2025-03-08 04:33:53,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:53,765 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 80623 treesize of output 79608 [2025-03-08 04:33:54,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:54,270 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 72579 treesize of output 71252 [2025-03-08 04:33:54,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:54,846 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 81147 treesize of output 80148 [2025-03-08 04:33:55,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:55,356 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 73327 treesize of output 72000 [2025-03-08 04:33:56,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:56,022 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 82119 treesize of output 81104 [2025-03-08 04:33:56,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:56,837 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 74075 treesize of output 72748