./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:43:07,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:43:07,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:43:07,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:43:07,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:43:07,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:43:07,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:43:07,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:43:07,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:43:07,859 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:43:07,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:43:07,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:43:07,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:43:07,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:43:07,860 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:43:07,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:43:07,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:43:07,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:43:07,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:43:07,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:43:07,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:43:07,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:43:07,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:43:07,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:43:07,862 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2025-03-16 17:43:08,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:43:08,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:43:08,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:43:08,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:43:08,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:43:08,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2025-03-16 17:43:09,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90318f8c/15d3382ca4924e4a9c4dc45bec8665a2/FLAG2db98b43a [2025-03-16 17:43:09,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:43:09,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2025-03-16 17:43:09,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90318f8c/15d3382ca4924e4a9c4dc45bec8665a2/FLAG2db98b43a [2025-03-16 17:43:09,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90318f8c/15d3382ca4924e4a9c4dc45bec8665a2 [2025-03-16 17:43:09,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:43:09,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:43:09,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:43:09,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:43:09,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:43:09,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660fd5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09, skipping insertion in model container [2025-03-16 17:43:09,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:43:09,765 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/sll2c_prepend_unequal.i[24547,24560] [2025-03-16 17:43:09,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:43:09,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:43:09,803 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/sll2c_prepend_unequal.i[24547,24560] [2025-03-16 17:43:09,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:43:09,823 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:43:09,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09 WrapperNode [2025-03-16 17:43:09,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:43:09,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:43:09,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:43:09,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:43:09,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,848 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2025-03-16 17:43:09,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:43:09,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:43:09,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:43:09,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:43:09,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,871 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 10, 15]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 2, 7]. [2025-03-16 17:43:09,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:43:09,882 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:43:09,882 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:43:09,882 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:43:09,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (1/1) ... [2025-03-16 17:43:09,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:43:09,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:09,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:43:09,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:43:09,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:43:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:43:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:43:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:43:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:43:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:43:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-16 17:43:09,928 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-16 17:43:09,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:43:09,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:43:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:43:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 17:43:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:43:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:43:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:43:09,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:43:09,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:43:10,017 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:43:10,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:43:10,150 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-16 17:43:10,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-16 17:43:10,186 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-03-16 17:43:10,187 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:43:10,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:43:10,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:43:10,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:10 BoogieIcfgContainer [2025-03-16 17:43:10,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:43:10,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:43:10,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:43:10,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:43:10,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:43:09" (1/3) ... [2025-03-16 17:43:10,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75802229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:43:10, skipping insertion in model container [2025-03-16 17:43:10,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:09" (2/3) ... [2025-03-16 17:43:10,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75802229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:43:10, skipping insertion in model container [2025-03-16 17:43:10,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:10" (3/3) ... [2025-03-16 17:43:10,199 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2025-03-16 17:43:10,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:43:10,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_prepend_unequal.i that has 2 procedures, 32 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 17:43:10,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:43:10,257 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;@189c4ed4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:43:10,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:43:10,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 17:43:10,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:10,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:10,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:10,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1250832083, now seen corresponding path program 1 times [2025-03-16 17:43:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258329752] [2025-03-16 17:43:10,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:10,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 17:43:10,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 17:43:10,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:10,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:43:10,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:10,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258329752] [2025-03-16 17:43:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258329752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:10,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:43:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845634336] [2025-03-16 17:43:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:10,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:43:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:10,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:43:10,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:10,615 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:10,633 INFO L93 Difference]: Finished difference Result 61 states and 86 transitions. [2025-03-16 17:43:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:43:10,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 20 [2025-03-16 17:43:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:10,638 INFO L225 Difference]: With dead ends: 61 [2025-03-16 17:43:10,638 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 17:43:10,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:10,642 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:10,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 17:43:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-16 17:43:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-03-16 17:43:10,666 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 20 [2025-03-16 17:43:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:10,666 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-16 17:43:10,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-03-16 17:43:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 17:43:10,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:10,668 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] [2025-03-16 17:43:10,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:43:10,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:10,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash 317379919, now seen corresponding path program 1 times [2025-03-16 17:43:10,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:10,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176851341] [2025-03-16 17:43:10,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:10,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 17:43:10,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 17:43:10,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:11,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176851341] [2025-03-16 17:43:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176851341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990300349] [2025-03-16 17:43:11,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:11,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:11,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:11,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:43:11,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 17:43:11,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 17:43:11,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:11,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:11,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 17:43:11,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:11,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-16 17:43:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:43:11,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990300349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:11,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 11 [2025-03-16 17:43:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757520366] [2025-03-16 17:43:11,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:11,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 17:43:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:11,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 17:43:11,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:43:11,358 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 17:43:15,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:43:19,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:43:23,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:43:27,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:43:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:27,506 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-03-16 17:43:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 17:43:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 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 28 [2025-03-16 17:43:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:27,508 INFO L225 Difference]: With dead ends: 41 [2025-03-16 17:43:27,508 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:43:27,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-16 17:43:27,508 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:27,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 193 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-03-16 17:43:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:43:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-16 17:43:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-16 17:43:27,512 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 28 [2025-03-16 17:43:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:27,513 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-16 17:43:27,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 17:43:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-16 17:43:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 17:43:27,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:27,513 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:27,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:43:27,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:27,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:27,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:27,715 INFO L85 PathProgramCache]: Analyzing trace with hash 560899333, now seen corresponding path program 1 times [2025-03-16 17:43:27,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:27,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147568624] [2025-03-16 17:43:27,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:27,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:43:27,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:43:27,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:27,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:28,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:28,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147568624] [2025-03-16 17:43:28,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147568624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:28,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274503490] [2025-03-16 17:43:28,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:28,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:28,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:28,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:28,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:43:28,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:43:28,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:43:28,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:28,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:28,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-16 17:43:28,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:28,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:43:28,994 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:43:28,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:43:29,027 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-16 17:43:29,079 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2025-03-16 17:43:29,080 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 70 treesize of output 57 [2025-03-16 17:43:29,117 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 38 treesize of output 14 [2025-03-16 17:43:29,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:43:29,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:29,175 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 46 treesize of output 35 [2025-03-16 17:43:29,191 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-16 17:43:29,191 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 32 treesize of output 34 [2025-03-16 17:43:29,257 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 28 treesize of output 20 [2025-03-16 17:43:29,289 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 28 treesize of output 12 [2025-03-16 17:43:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:29,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:29,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274503490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:29,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:43:29,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2025-03-16 17:43:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276640759] [2025-03-16 17:43:29,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:29,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 17:43:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:29,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 17:43:29,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2025-03-16 17:43:29,461 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 28 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 22 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 17:43:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:29,912 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-03-16 17:43:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 17:43:29,913 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 22 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2025-03-16 17:43:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:29,913 INFO L225 Difference]: With dead ends: 53 [2025-03-16 17:43:29,913 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 17:43:29,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2025-03-16 17:43:29,915 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:29,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 298 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:43:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 17:43:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2025-03-16 17:43:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:43:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-16 17:43:29,920 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 31 [2025-03-16 17:43:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:29,921 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-16 17:43:29,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 22 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 17:43:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-03-16 17:43:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:43:29,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:29,922 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] [2025-03-16 17:43:29,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:43:30,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 17:43:30,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:30,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1106178460, now seen corresponding path program 1 times [2025-03-16 17:43:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:30,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984427093] [2025-03-16 17:43:30,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:30,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:30,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:43:30,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:43:30,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:30,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:31,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:31,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984427093] [2025-03-16 17:43:31,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984427093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:31,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751441422] [2025-03-16 17:43:31,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:31,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:31,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:31,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:31,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:43:31,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:43:31,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:43:31,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:31,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:31,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-16 17:43:31,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:31,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:43:31,822 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:43:31,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:43:31,863 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-16 17:43:31,909 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-16 17:43:31,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-16 17:43:31,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:43:32,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:43:32,087 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 18 treesize of output 7 [2025-03-16 17:43:32,171 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-16 17:43:32,172 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 20 treesize of output 22 [2025-03-16 17:43:32,184 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-16 17:43:32,483 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:43:32,484 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:43:32,484 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2025-03-16 17:43:32,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:32,574 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-16 17:43:32,754 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-16 17:43:32,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-03-16 17:43:32,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-16 17:43:32,762 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 36 treesize of output 34 [2025-03-16 17:43:32,765 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-16 17:43:32,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-16 17:43:32,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:43:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:32,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:33,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:33,400 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2025-03-16 17:43:33,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:33,413 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 94 treesize of output 95 [2025-03-16 17:43:33,420 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 35 treesize of output 19 [2025-03-16 17:43:33,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:33,429 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 1 case distinctions, treesize of input 19 treesize of output 8 [2025-03-16 17:43:33,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:33,441 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 36 treesize of output 39 [2025-03-16 17:43:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751441422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:33,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:43:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 37 [2025-03-16 17:43:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179797637] [2025-03-16 17:43:33,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:33,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-16 17:43:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:33,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-16 17:43:33,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1830, Unknown=11, NotChecked=0, Total=1980 [2025-03-16 17:43:33,603 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 37 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 29 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 17:43:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:34,719 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-03-16 17:43:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 17:43:34,720 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 29 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2025-03-16 17:43:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:34,721 INFO L225 Difference]: With dead ends: 49 [2025-03-16 17:43:34,721 INFO L226 Difference]: Without dead ends: 47 [2025-03-16 17:43:34,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=273, Invalid=3022, Unknown=11, NotChecked=0, Total=3306 [2025-03-16 17:43:34,722 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:34,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 311 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 17:43:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-16 17:43:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-16 17:43:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:43:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-03-16 17:43:34,728 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 33 [2025-03-16 17:43:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:34,729 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-16 17:43:34,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 29 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 17:43:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-03-16 17:43:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:43:34,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:34,729 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] [2025-03-16 17:43:34,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:43:34,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:34,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:34,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2114467813, now seen corresponding path program 1 times [2025-03-16 17:43:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:34,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926292926] [2025-03-16 17:43:34,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:34,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:43:34,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:43:34,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:34,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:36,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926292926] [2025-03-16 17:43:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926292926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:36,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631838785] [2025-03-16 17:43:36,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:36,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:36,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:36,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:43:36,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:43:36,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:43:36,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:36,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:36,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 143 conjuncts are in the unsatisfiable core [2025-03-16 17:43:36,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:36,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:43:36,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:43:36,643 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_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)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2025-03-16 17:43:36,644 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_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)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2025-03-16 17:43:36,651 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 23 treesize of output 11 [2025-03-16 17:43:36,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:43:36,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:43:36,671 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_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_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2025-03-16 17:43:36,673 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_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_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2025-03-16 17:43:36,697 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-16 17:43:36,698 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 86 treesize of output 55 [2025-03-16 17:43:36,709 INFO L349 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2025-03-16 17:43:36,709 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 36 treesize of output 31 [2025-03-16 17:43:36,732 INFO L349 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2025-03-16 17:43:36,732 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 36 treesize of output 31 [2025-03-16 17:43:36,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse1 (= .cse0 .cse2))) (and (or (= (select (select |c_#memory_int#2| .cse0) 4) 1) .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) .cse1) (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 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|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:43:36,742 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse1 (= .cse0 .cse2))) (and (or (= (select (select |c_#memory_int#2| .cse0) 4) 1) .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) .cse1) (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 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|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:43:36,751 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 68 treesize of output 44 [2025-03-16 17:43:36,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-16 17:43:36,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-16 17:43:36,784 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-16 17:43:36,786 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-16 17:43:36,808 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-16 17:43:36,810 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-16 17:43:36,852 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 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|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|)) is different from false [2025-03-16 17:43:36,854 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 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|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|)) is different from true [2025-03-16 17:43:36,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:36,907 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 76 treesize of output 59 [2025-03-16 17:43:36,917 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:43:36,917 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 36 treesize of output 39 [2025-03-16 17:43:36,934 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:43:36,935 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 36 treesize of output 39 [2025-03-16 17:43:36,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1)) (.cse2 (= .cse1 .cse3))) (and (or .cse0 (= (select (select |c_#memory_int#2| .cse1) 4) 1) .cse2) (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_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:43:36,964 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1)) (.cse2 (= .cse1 .cse3))) (and (or .cse0 (= (select (select |c_#memory_int#2| .cse1) 4) 1) .cse2) (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_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) .cse2) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:43:37,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse5 (= .cse3 .cse2)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (or (= (select (select |c_#memory_int#2| .cse3) 4) 1) .cse5 .cse6) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:43:37,048 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse5 (= .cse3 .cse2)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (or (= (select (select |c_#memory_int#2| .cse3) 4) 1) .cse5 .cse6) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:43:37,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse5 (= .cse3 .cse2)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3))) (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (or (= (select (select |c_#memory_int#2| .cse3) 4) 1) .cse5 .cse6) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:43:37,123 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (let ((.cse5 (= .cse3 .cse2)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3))) (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (or (= (select (select |c_#memory_int#2| .cse3) 4) 1) .cse5 .cse6) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse5 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:43:37,221 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (= .cse5 .cse4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (or (= (select (select |c_#memory_int#2| .cse5) 4) 1) .cse7 .cse8) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0) .cse7 .cse8) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:43:37,224 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse7 (= .cse5 .cse4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (or (= (select (select |c_#memory_int#2| .cse5) 4) 1) .cse7 .cse8) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0) .cse7 .cse8) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:43:37,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse6)) (.cse8 (= .cse3 .cse2)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (or (not (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse6))) (not (= .cse7 .cse5))) (or (= (select (select |c_#memory_int#2| .cse3) 4) 1) .cse8 .cse9) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse8 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:43:37,302 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse6)) (.cse8 (= .cse3 .cse2)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse3))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (or (not (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse6))) (not (= .cse7 .cse5))) (or (= (select (select |c_#memory_int#2| .cse3) 4) 1) .cse8 .cse9) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse8 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:43:37,445 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-16 17:43:37,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:37,457 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 112 treesize of output 102 [2025-03-16 17:43:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:37,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 162 [2025-03-16 17:43:37,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:37,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:37,479 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 76 treesize of output 42 [2025-03-16 17:43:37,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:37,516 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-16 17:43:37,516 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 202 treesize of output 162 [2025-03-16 17:43:37,571 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-16 17:43:37,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 229 treesize of output 161 [2025-03-16 17:43:37,600 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-03-16 17:43:37,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-03-16 17:43:37,871 INFO L349 Elim1Store]: treesize reduction 93, result has 34.5 percent of original size [2025-03-16 17:43:37,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 179 treesize of output 163 [2025-03-16 17:43:38,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse6))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (let ((.cse2 (= .cse3 .cse1)) (.cse0 (= .cse1 .cse4))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) .cse2) (not (= .cse3 .cse4)) (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_13| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 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|) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse6) 0) (or (= (select (select |c_#memory_int#2| .cse1) 4) 1) .cse0 .cse2) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8)))))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 1) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse11 (select |v_#valid_BEFORE_CALL_11| .cse11)))))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1))) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse13) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse13) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= .cse13 .cse1)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse14 (select |v_#valid_BEFORE_CALL_11| .cse14)))))))))))))) is different from false [2025-03-16 17:43:38,605 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse6))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (let ((.cse2 (= .cse3 .cse1)) (.cse0 (= .cse1 .cse4))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) .cse2) (not (= .cse3 .cse4)) (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_13| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 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|) (= (select |v_old(#valid)_AFTER_CALL_12| .cse4) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse6) 0) (or (= (select (select |c_#memory_int#2| .cse1) 4) 1) .cse0 .cse2) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8)))))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse10) 1) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse11 (select |v_#valid_BEFORE_CALL_11| .cse11)))))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse4) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse4) 1))) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse13) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse13) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= .cse13 .cse1)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse14 (select |v_#valid_BEFORE_CALL_11| .cse14)))))))))))))) is different from true [2025-03-16 17:43:38,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:38,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 515 treesize of output 459 [2025-03-16 17:43:38,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:38,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 386 treesize of output 374 [2025-03-16 17:44:16,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (.cse2 (= .cse0 .cse3))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) .cse1 .cse2) (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_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 4) 1) .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)))))) is different from false [2025-03-16 17:44:16,957 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (.cse2 (= .cse0 .cse3))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) .cse1 .cse2) (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_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 4) 1) .cse1 .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)))))) is different from true [2025-03-16 17:44:16,970 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:44:16,970 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 54 [2025-03-16 17:44:16,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:16,974 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 22 treesize of output 14 [2025-03-16 17:44:16,999 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_14| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (v_arrayElimCell_69 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| |v_ULTIMATE.start_main_~ptr~0#1.base_14|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 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 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2025-03-16 17:44:17,001 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_14| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (v_arrayElimCell_69 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| |v_ULTIMATE.start_main_~ptr~0#1.base_14|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 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 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2025-03-16 17:44:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2025-03-16 17:44:17,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:17,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_630) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_628) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_631) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_622) .cse1) .cse2) 4)))))) is different from false [2025-03-16 17:44:17,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:44:17,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 146 [2025-03-16 17:44:17,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631838785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:17,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:17,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2025-03-16 17:44:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035525634] [2025-03-16 17:44:17,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:17,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 17:44:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:17,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 17:44:17,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1308, Unknown=30, NotChecked=1290, Total=2756 [2025-03-16 17:44:17,760 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 44 states, 40 states have (on average 1.325) internal successors, (53), 34 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:17,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (= .cse0 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#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)))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))) is different from false [2025-03-16 17:44:17,973 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (= .cse0 1) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_circular_create_#t~ret5#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)))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))) is different from true [2025-03-16 17:44:17,976 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= 1 (select |c_#valid| .cse1)) (= .cse0 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_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_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0))) is different from false [2025-03-16 17:44:17,977 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= 1 (select |c_#valid| .cse1)) (= .cse0 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_11| |c_ULTIMATE.start_sll_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_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0))) is different from true [2025-03-16 17:44:17,980 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse3 (= .cse2 .cse4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 4)) (or (= (select (select |c_#memory_int#2| .cse2) 4) 1) .cse3) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) .cse3) (= (select |c_#valid| .cse2) 1) (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| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |c_#valid| .cse5)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:44:17,981 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse3 (= .cse2 .cse4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 4)) (or (= (select (select |c_#memory_int#2| .cse2) 4) 1) .cse3) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse0) 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) .cse3) (= (select |c_#valid| .cse2) 1) (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| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_11| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_11| .cse5 (select |c_#valid| .cse5)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:44:17,986 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (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_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-16 17:44:17,987 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse0) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (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_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-16 17:44:17,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse5 (select |c_#memory_int#2| .cse5)))) (let ((.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse4 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 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|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse4) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from false [2025-03-16 17:44:17,995 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse0 (store |c_old(#memory_int#2)| .cse5 (select |c_#memory_int#2| .cse5)))) (let ((.cse1 (@diff .cse0 |c_#memory_int#2|)) (.cse4 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_int#2| (store .cse0 .cse1 (select |c_#memory_int#2| .cse1))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 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|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse4) 0)) (or (= .cse0 |c_#memory_int#2|) (= (select |c_old(#valid)| .cse1) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_old(#memory_int#2)| |c_#memory_int#2|)))))) is different from true [2025-03-16 17:44:18,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)) (.cse4 (= .cse3 .cse5))) (and (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= .cse1 .cse0)) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1) .cse4) (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_13| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse4) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:44:18,005 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse3)) (.cse4 (= .cse3 .cse5))) (and (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= .cse1 .cse0)) (or .cse2 (= (select (select |c_#memory_int#2| .cse3) 4) 1) .cse4) (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_13| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse3) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse7) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse8 (select |v_#valid_BEFORE_CALL_11| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse2 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) .cse4) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:44:18,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse7 (= .cse5 .cse4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 4)) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (or (= (select (select |c_#memory_int#2| .cse5) 4) 1) .cse7 .cse8) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0) .cse7 .cse8) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:44:18,014 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse7 (= .cse5 .cse4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 4)) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (or (= (select (select |c_#memory_int#2| .cse5) 4) 1) .cse7 .cse8) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0) .cse7 .cse8) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:44:18,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (= .cse6 .cse5)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6))) (and (= .cse0 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 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|))) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_int#2| .cse6) 4) 1) .cse8 .cse9) (not (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 0) 0) .cse8 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:44:18,022 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (= .cse6 .cse5)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6))) (and (= .cse0 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 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|))) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_int#2| .cse6) 4) 1) .cse8 .cse9) (not (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 0) 0) .cse8 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:44:18,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (= .cse6 .cse5)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6))) (and (= .cse0 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 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|))) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (or (= (select (select |c_#memory_int#2| .cse6) 4) 1) .cse8 .cse9) (not (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 0) 0) .cse8 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:44:18,033 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (= .cse6 .cse5)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse6))) (and (= .cse0 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (not (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse3) 0) (= (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| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse6) 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|))) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (not (= .cse2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (or (= (select (select |c_#memory_int#2| .cse6) 4) 1) .cse8 .cse9) (not (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 0) 0) .cse8 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:44:18,042 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse0)) (.cse8 (= .cse5 .cse4)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5))) (and (= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (not (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|)) (or (not (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse0))) (not (= .cse1 .cse7))) (or (= (select (select |c_#memory_int#2| .cse5) 4) 1) .cse8 .cse9) (not (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0) .cse8 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-03-16 17:44:18,045 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse0)) (.cse8 (= .cse5 .cse4)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse5))) (and (= .cse0 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse1) 4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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_13| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (not (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|)) (or (not (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse0))) (not (= .cse1 .cse7))) (or (= (select (select |c_#memory_int#2| .cse5) 4) 1) .cse8 .cse9) (not (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0) .cse8 .cse9) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-03-16 17:44:18,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse7))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (let ((.cse3 (select (select |c_#memory_int#2| .cse1) 4)) (.cse2 (= .cse4 .cse1)) (.cse0 (= .cse1 .cse5))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (not (= .cse4 .cse5)) (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_13| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse7) 0) (or (= .cse3 1) .cse0 .cse2) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9)))))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse11) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse11) 1) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12)))))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse13 (select |v_#valid_BEFORE_CALL_11| .cse13)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1))) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse14) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse14) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= .cse14 .cse1)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse15 (select |v_#valid_BEFORE_CALL_11| .cse15)))))))))))))) is different from false [2025-03-16 17:44:18,524 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse7))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (let ((.cse3 (select (select |c_#memory_int#2| .cse1) 4)) (.cse2 (= .cse4 .cse1)) (.cse0 (= .cse1 .cse5))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| .cse3) (not (= .cse4 .cse5)) (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_13| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_12| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_13| .cse4) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse6 (select |v_old(#valid)_AFTER_CALL_12| .cse6))) |v_old(#valid)_AFTER_CALL_12|) (= (select |v_old(#valid)_AFTER_CALL_12| .cse5) 0))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse7) 0) (or (= .cse3 1) .cse0 .cse2) (or (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse8) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse9 (select |v_#valid_BEFORE_CALL_11| .cse9)))))))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse10 (select |v_#valid_BEFORE_CALL_11| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1))) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse11) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse11) 1) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse12 (select |v_#valid_BEFORE_CALL_11| .cse12)))))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse5) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse13 (select |v_#valid_BEFORE_CALL_11| .cse13)))) (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1))) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (v_arrayElimCell_43 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_11| v_arrayElimCell_43) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|))) (and (= (select |v_old(#valid)_AFTER_CALL_11| .cse14) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse14) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0) (= .cse14 .cse1)))) (= |v_#valid_BEFORE_CALL_11| (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_11| |v_#valid_BEFORE_CALL_11|))) (store |v_old(#valid)_AFTER_CALL_11| .cse15 (select |v_#valid_BEFORE_CALL_11| .cse15)))))))))))))) is different from true [2025-03-16 17:44:18,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (.cse2 (= .cse0 .cse3)) (.cse5 (select (select |c_#memory_int#2| .cse0) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) .cse1 .cse2) (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_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 1) .cse1 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| .cse5) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)))))) is different from false [2025-03-16 17:44:18,535 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (let ((.cse1 (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (.cse2 (= .cse0 .cse3)) (.cse5 (select (select |c_#memory_int#2| .cse0) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) .cse1 .cse2) (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_13| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_13| |v_old(#valid)_AFTER_CALL_12|))) (store |v_old(#valid)_AFTER_CALL_13| .cse4 (select |v_old(#valid)_AFTER_CALL_12| .cse4))) |v_old(#valid)_AFTER_CALL_12|))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse5 1) .cse1 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| .cse5) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3)))))) is different from true [2025-03-16 17:44:18,542 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_14| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (v_arrayElimCell_69 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| |v_ULTIMATE.start_main_~ptr~0#1.base_14|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 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|))) (= .cse1 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1))) is different from false [2025-03-16 17:44:18,544 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_14| Int) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_13| (Array Int Int)) (v_arrayElimCell_69 Int)) (and (= 0 (select |v_old(#valid)_AFTER_CALL_13| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_12| |v_ULTIMATE.start_main_~ptr~0#1.base_14|) 0) (= (select |v_old(#valid)_AFTER_CALL_13| v_arrayElimCell_69) 1) (= (select |v_old(#valid)_AFTER_CALL_12| |c_ULTIMATE.start_main_~ptr~0#1.base|) 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|))) (= .cse1 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse1))) is different from true [2025-03-16 17:44:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:18,668 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-03-16 17:44:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 17:44:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.325) internal successors, (53), 34 states have internal predecessors, (53), 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 35 [2025-03-16 17:44:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:18,669 INFO L225 Difference]: With dead ends: 60 [2025-03-16 17:44:18,669 INFO L226 Difference]: Without dead ends: 58 [2025-03-16 17:44:18,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=166, Invalid=1450, Unknown=56, NotChecked=2884, Total=4556 [2025-03-16 17:44:18,670 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1305 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:18,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 349 Invalid, 0 Unknown, 1305 Unchecked, 0.2s Time] [2025-03-16 17:44:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-16 17:44:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-16 17:44:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:44:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-16 17:44:18,677 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 35 [2025-03-16 17:44:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:18,677 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-16 17:44:18,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.325) internal successors, (53), 34 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-16 17:44:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:44:18,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:18,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:18,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:44:18,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:18,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:18,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1145136125, now seen corresponding path program 2 times [2025-03-16 17:44:18,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:18,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596183739] [2025-03-16 17:44:18,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:44:18,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:18,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-16 17:44:18,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:44:18,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:44:18,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:19,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596183739] [2025-03-16 17:44:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596183739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:19,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712583851] [2025-03-16 17:44:19,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:44:19,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:19,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:19,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:19,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:44:19,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-16 17:44:19,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:44:19,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:44:19,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:19,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-16 17:44:19,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:44:19,896 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2025-03-16 17:44:19,897 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2025-03-16 17:44:19,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:44:19,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:44:19,920 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2025-03-16 17:44:19,922 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2025-03-16 17:44:19,939 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-16 17:44:19,939 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 72 treesize of output 42 [2025-03-16 17:44:19,951 INFO L349 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2025-03-16 17:44:19,952 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 39 treesize of output 30 [2025-03-16 17:44:19,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2))))))))) is different from false [2025-03-16 17:44:19,958 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2))))))))) is different from true [2025-03-16 17:44:19,968 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:44:19,968 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2025-03-16 17:44:19,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:19,973 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 19 treesize of output 7 [2025-03-16 17:44:19,984 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-16 17:44:19,985 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-16 17:44:19,999 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (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-16 17:44:20,000 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (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-16 17:44:20,031 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0)))) is different from false [2025-03-16 17:44:20,033 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0)))) is different from true [2025-03-16 17:44:20,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:20,074 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-16 17:44:20,074 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 56 treesize of output 45 [2025-03-16 17:44:20,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:20,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:20,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:20,087 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 35 treesize of output 33 [2025-03-16 17:44:20,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_16| .cse4))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from false [2025-03-16 17:44:20,107 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_16| .cse4))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from true [2025-03-16 17:44:20,172 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_16| .cse4))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from false [2025-03-16 17:44:20,175 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_16| .cse4))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from true [2025-03-16 17:44:20,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_16| .cse4))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from false [2025-03-16 17:44:20,245 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_old(#valid)_AFTER_CALL_16| .cse4))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from true [2025-03-16 17:44:20,261 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:44:20,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:44:20,277 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:44:20,277 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 26 [2025-03-16 17:44:20,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:20,282 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 19 treesize of output 7 [2025-03-16 17:44:20,304 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimCell_85 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| v_arrayElimCell_85) 1) (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_16| .cse1))) |v_old(#valid)_AFTER_CALL_16|))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|))) is different from false [2025-03-16 17:44:20,306 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimCell_85 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| v_arrayElimCell_85) 1) (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_16| .cse1))) |v_old(#valid)_AFTER_CALL_16|))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|))) is different from true [2025-03-16 17:44:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2025-03-16 17:44:20,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712583851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:20,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:20,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2025-03-16 17:44:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416541488] [2025-03-16 17:44:20,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:20,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 17:44:20,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:20,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 17:44:20,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=494, Unknown=20, NotChecked=530, Total=1122 [2025-03-16 17:44:20,471 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 17:44:20,579 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2025-03-16 17:44:20,580 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2025-03-16 17:44:20,582 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from false [2025-03-16 17:44:20,583 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0)) is different from true [2025-03-16 17:44:20,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse6 0)) (.cse1 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse0 (select .cse6 .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |c_#valid| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |c_#valid| .cse4)))))) (= (select .cse1 .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0))))) is different from false [2025-03-16 17:44:20,586 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse2 (select .cse6 0)) (.cse1 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse0 (select .cse6 .cse5))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0) (= (select |c_#valid| .cse0) 1) (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |c_#valid| .cse3) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |c_#valid| .cse4)))))) (= (select .cse1 .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0))))) is different from true [2025-03-16 17:44:20,592 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (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-16 17:44:20,593 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (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-16 17:44:20,596 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|))) (let ((.cse1 (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| .cse0)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) .cse1) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse0 .cse4) |c_#memory_$Pointer$#2.offset|) (or .cse1 (= (select .cse4 0) 0)) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|)))) is different from false [2025-03-16 17:44:20,599 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|))) (let ((.cse1 (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| .cse0)) (.cse5 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) .cse1) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse0 .cse4) |c_#memory_$Pointer$#2.offset|) (or .cse1 (= (select .cse4 0) 0)) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse5) 0)) (exists ((|v_node_create_~temp~0#1.base_40| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_40|))) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_40| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_40|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_40|) 0))) (= (store |c_old(#memory_$Pointer$#2.base)| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|)))) is different from true [2025-03-16 17:44:20,604 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| .cse5)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse5)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select .cse9 .cse10)) (.cse7 (select .cse1 .cse10)) (.cse2 (select .cse9 0))) (and (= .cse0 0) (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse8 (select |v_old(#valid)_AFTER_CALL_16| .cse8))) |v_old(#valid)_AFTER_CALL_16|))))))) is different from false [2025-03-16 17:44:20,607 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| .cse5)) (.cse9 (select |c_#memory_$Pointer$#2.base| .cse5)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select .cse9 .cse10)) (.cse7 (select .cse1 .cse10)) (.cse2 (select .cse9 0))) (and (= .cse0 0) (= (select .cse1 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse5)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse8 (select |v_old(#valid)_AFTER_CALL_16| .cse8))) |v_old(#valid)_AFTER_CALL_16|))))))) is different from true [2025-03-16 17:44:20,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse7 (select |v_old(#valid)_AFTER_CALL_16| .cse7))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from false [2025-03-16 17:44:20,618 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) .cse3)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse3) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse7 (select |v_old(#valid)_AFTER_CALL_16| .cse7))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from true [2025-03-16 17:44:20,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse5 (select |v_old(#valid)_AFTER_CALL_16| .cse5))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from false [2025-03-16 17:44:20,629 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse2) (exists ((|v_node_create_~temp~0#1.base_40| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= 0 (select |v_#valid_BEFORE_CALL_17| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse5 (select |v_old(#valid)_AFTER_CALL_16| .cse5))) |v_old(#valid)_AFTER_CALL_16|)))))) is different from true [2025-03-16 17:44:20,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimCell_85 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| v_arrayElimCell_85) 1) (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_16| .cse1))) |v_old(#valid)_AFTER_CALL_16|))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|))) is different from false [2025-03-16 17:44:20,641 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_node_create_~temp~0#1.base_40| Int) (v_arrayElimCell_85 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| v_arrayElimCell_85) 1) (= 0 (select |v_#valid_BEFORE_CALL_17| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_16| |v_node_create_~temp~0#1.base_40|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_old(#valid)_AFTER_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_old(#valid)_AFTER_CALL_16| .cse1))) |v_old(#valid)_AFTER_CALL_16|))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|))) is different from true [2025-03-16 17:44:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:20,701 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2025-03-16 17:44:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 17:44:20,702 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2025-03-16 17:44:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:20,702 INFO L225 Difference]: With dead ends: 69 [2025-03-16 17:44:20,702 INFO L226 Difference]: Without dead ends: 58 [2025-03-16 17:44:20,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=581, Unknown=38, NotChecked=1254, Total=1980 [2025-03-16 17:44:20,703 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 729 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:20,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 157 Invalid, 0 Unknown, 729 Unchecked, 0.1s Time] [2025-03-16 17:44:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-16 17:44:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-16 17:44:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:44:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-03-16 17:44:20,711 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 35 [2025-03-16 17:44:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:20,711 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-03-16 17:44:20,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 23 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 17:44:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-03-16 17:44:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:44:20,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:20,712 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, 1] [2025-03-16 17:44:20,719 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-16 17:44:20,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:20,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:20,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash 484109767, now seen corresponding path program 1 times [2025-03-16 17:44:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:20,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106500113] [2025-03-16 17:44:20,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:20,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:44:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:44:20,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:20,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:21,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106500113] [2025-03-16 17:44:21,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106500113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:21,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815637221] [2025-03-16 17:44:21,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:21,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:21,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:21,979 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:21,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:44:22,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:44:22,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:44:22,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:22,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:22,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-16 17:44:22,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:22,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:44:22,211 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:44:22,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:44:22,241 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-16 17:44:22,245 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-16 17:44:22,286 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-16 17:44:22,286 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 78 treesize of output 53 [2025-03-16 17:44:22,289 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 36 treesize of output 15 [2025-03-16 17:44:22,333 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 30 treesize of output 14 [2025-03-16 17:44:22,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-16 17:44:22,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:44:22,479 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:44:22,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-16 17:44:22,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:22,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-16 17:44:22,503 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:44:22,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-16 17:44:22,859 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 56 treesize of output 54 [2025-03-16 17:44:22,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 63 [2025-03-16 17:44:22,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 83 [2025-03-16 17:44:22,876 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-03-16 17:44:22,876 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 99 [2025-03-16 17:44:22,879 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 75 treesize of output 41 [2025-03-16 17:44:22,895 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-03-16 17:44:22,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-03-16 17:44:22,934 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 118 treesize of output 90 [2025-03-16 17:44:22,982 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 27 treesize of output 7 [2025-03-16 17:44:23,041 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 83 treesize of output 51 [2025-03-16 17:44:23,044 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 17:44:23,044 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-03-16 17:44:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:23,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:23,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:44:23,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 164 [2025-03-16 17:44:23,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815637221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:23,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 41 [2025-03-16 17:44:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348750716] [2025-03-16 17:44:23,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:23,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-16 17:44:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:23,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-16 17:44:23,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2009, Unknown=23, NotChecked=0, Total=2162 [2025-03-16 17:44:23,948 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 41 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 33 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 17:44:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:25,005 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-16 17:44:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 17:44:25,005 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 33 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2025-03-16 17:44:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:25,006 INFO L225 Difference]: With dead ends: 70 [2025-03-16 17:44:25,006 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 17:44:25,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=228, Invalid=3170, Unknown=24, NotChecked=0, Total=3422 [2025-03-16 17:44:25,007 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:25,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 357 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:44:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 17:44:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2025-03-16 17:44:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:44:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-03-16 17:44:25,014 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 37 [2025-03-16 17:44:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:25,014 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-03-16 17:44:25,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 33 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 17:44:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-03-16 17:44:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 17:44:25,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:25,015 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-16 17:44:25,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 17:44:25,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:25,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:25,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2122481208, now seen corresponding path program 1 times [2025-03-16 17:44:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:25,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535013076] [2025-03-16 17:44:25,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:25,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 17:44:25,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 17:44:25,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:25,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:26,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535013076] [2025-03-16 17:44:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535013076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870253166] [2025-03-16 17:44:26,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:26,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:26,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:44:26,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 17:44:26,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 17:44:26,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:26,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:26,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 169 conjuncts are in the unsatisfiable core [2025-03-16 17:44:26,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:26,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:44:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:44:27,058 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:44:27,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:44:27,075 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:44:27,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:44:27,127 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-16 17:44:27,133 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-16 17:44:27,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-16 17:44:27,191 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-16 17:44:27,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 83 [2025-03-16 17:44:27,195 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 19 [2025-03-16 17:44:27,199 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 36 treesize of output 15 [2025-03-16 17:44:27,263 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 45 treesize of output 21 [2025-03-16 17:44:27,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-16 17:44:27,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:44:27,272 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-16 17:44:27,444 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:44:27,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-16 17:44:27,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:27,454 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 53 treesize of output 36 [2025-03-16 17:44:27,469 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:44:27,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-16 17:44:27,475 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 24 treesize of output 19 [2025-03-16 17:44:28,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:28,086 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 62 treesize of output 43 [2025-03-16 17:44: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 0 case distinctions, treesize of input 202 treesize of output 131 [2025-03-16 17:44:28,093 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 40 treesize of output 38 [2025-03-16 17:44:28,105 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-16 17:44:28,105 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 72 [2025-03-16 17:44:28,121 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2025-03-16 17:44:28,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 203 treesize of output 106 [2025-03-16 17:44:28,123 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 13 treesize of output 11 [2025-03-16 17:44:28,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:28,127 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 59 treesize of output 33 [2025-03-16 17:44:28,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2025-03-16 17:44:28,145 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-16 17:44:28,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-03-16 17:44:28,209 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 97 treesize of output 65 [2025-03-16 17:44:28,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:44:28,372 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 33 [2025-03-16 17:44:28,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-03-16 17:44:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:28,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:28,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1104))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1112)) (.cse1 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1103)) (.cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (select (select .cse4 .cse5) .cse6))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1108) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select v_ArrVal_1108 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) v_ArrVal_1108))))) is different from false [2025-03-16 17:44:29,411 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1124 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_33| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_33| v_ArrVal_1124)) (.cse4 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse13 (select .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_33| v_ArrVal_1122) .cse4) .cse13)) (.cse0 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_33| v_ArrVal_1104)) (.cse1 (select (select .cse3 .cse4) .cse13))) (or (not (= v_ArrVal_1108 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1108 .cse2)))) (not (= (select (select .cse3 .cse1) .cse2) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (store (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_33| (store v_ArrVal_1122 0 .cse13)) .cse1 v_ArrVal_1112)) (.cse5 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_33| (store v_ArrVal_1124 0 .cse4)) .cse1 v_ArrVal_1103)) (.cse9 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_33|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse5 .cse9) .cse10)) (.cse7 (select (select .cse8 .cse9) .cse10))) (select (select (store .cse0 .cse1 v_ArrVal_1108) (select (select .cse5 .cse6) .cse7)) (+ (select (select .cse8 .cse6) .cse7) 4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_33|) 0))))))) is different from false [2025-03-16 17:44:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870253166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:29,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2025-03-16 17:44:29,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212785676] [2025-03-16 17:44:29,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:29,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 17:44:29,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:29,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 17:44:29,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3024, Unknown=3, NotChecked=222, Total=3422 [2025-03-16 17:44:29,419 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 48 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 38 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:30,948 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-03-16 17:44:30,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 17:44:30,948 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 38 states have internal predecessors, (59), 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 38 [2025-03-16 17:44:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:30,949 INFO L225 Difference]: With dead ends: 71 [2025-03-16 17:44:30,949 INFO L226 Difference]: Without dead ends: 69 [2025-03-16 17:44:30,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=336, Invalid=5369, Unknown=3, NotChecked=298, Total=6006 [2025-03-16 17:44:30,951 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:30,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 305 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 17:44:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-16 17:44:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2025-03-16 17:44:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:44:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-03-16 17:44:30,958 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 38 [2025-03-16 17:44:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:30,958 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-03-16 17:44:30,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 38 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-03-16 17:44:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 17:44:30,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:30,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:30,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 17:44:31,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:31,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:31,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash -404952230, now seen corresponding path program 1 times [2025-03-16 17:44:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:31,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392713203] [2025-03-16 17:44:31,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:31,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:44:31,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:44:31,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:31,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 17:44:31,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392713203] [2025-03-16 17:44:31,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392713203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575712663] [2025-03-16 17:44:31,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:31,234 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:31,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 17:44:31,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 17:44:31,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 17:44:31,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:31,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:31,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 17:44:31,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 17:44:31,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 17:44:31,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575712663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:44:31,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:44:31,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-16 17:44:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885039730] [2025-03-16 17:44:31,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:31,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:44:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:31,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:44:31,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:44:31,431 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:44:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:31,465 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-03-16 17:44:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:44:31,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-16 17:44:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:31,465 INFO L225 Difference]: With dead ends: 81 [2025-03-16 17:44:31,466 INFO L226 Difference]: Without dead ends: 78 [2025-03-16 17:44:31,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:44:31,466 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:31,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 185 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:44:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-16 17:44:31,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2025-03-16 17:44:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:44:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-03-16 17:44:31,474 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 40 [2025-03-16 17:44:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:31,475 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-03-16 17:44:31,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 17:44:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-03-16 17:44:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 17:44:31,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:31,476 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:31,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 17:44:31,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-16 17:44:31,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 102559076, now seen corresponding path program 1 times [2025-03-16 17:44:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828112925] [2025-03-16 17:44:31,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:31,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 17:44:31,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:44:31,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:31,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 17:44:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828112925] [2025-03-16 17:44:31,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828112925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173298724] [2025-03-16 17:44:31,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:31,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:31,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:31,751 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:31,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 17:44:31,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 17:44:31,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:44:31,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:31,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:31,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:44:31,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 17:44:31,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:44:31,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173298724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:44:31,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:44:31,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-16 17:44:31,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492897127] [2025-03-16 17:44:31,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:44:31,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:44:31,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:31,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:44:31,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:44:31,918 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:44:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:31,932 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2025-03-16 17:44:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:44:31,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-03-16 17:44:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:31,933 INFO L225 Difference]: With dead ends: 79 [2025-03-16 17:44:31,933 INFO L226 Difference]: Without dead ends: 39 [2025-03-16 17:44:31,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:44:31,934 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:31,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:44:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-16 17:44:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-16 17:44:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:44:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-16 17:44:31,942 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 41 [2025-03-16 17:44:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:31,942 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-16 17:44:31,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:44:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-16 17:44:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 17:44:31,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:31,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:31,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 17:44:32,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 17:44:32,144 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:32,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash 331363077, now seen corresponding path program 2 times [2025-03-16 17:44:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:32,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483770334] [2025-03-16 17:44:32,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:44:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:32,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-16 17:44:32,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:44:32,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:44:32,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:33,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:33,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483770334] [2025-03-16 17:44:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483770334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:33,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958536080] [2025-03-16 17:44:33,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:44:33,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:33,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:33,234 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:33,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 17:44:33,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-16 17:44:33,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 17:44:33,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:44:33,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:33,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 153 conjuncts are in the unsatisfiable core [2025-03-16 17:44:33,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:33,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:44:33,491 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:44:33,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:44:33,522 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-16 17:44:33,527 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-16 17:44:33,569 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-16 17:44:33,569 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 78 treesize of output 53 [2025-03-16 17:44:33,572 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 36 treesize of output 15 [2025-03-16 17:44:33,621 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 30 treesize of output 14 [2025-03-16 17:44:33,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:44:33,626 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-16 17:44:33,768 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:44:33,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-16 17:44:33,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:33,783 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 48 treesize of output 32 [2025-03-16 17:44:33,797 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:44:33,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-16 17:44:34,310 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-16 17:44:34,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-03-16 17:44:34,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 215 [2025-03-16 17:44:34,338 INFO L349 Elim1Store]: treesize reduction 82, result has 15.5 percent of original size [2025-03-16 17:44:34,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 108 [2025-03-16 17:44:34,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:34,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 49 [2025-03-16 17:44:34,747 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 121 treesize of output 81 [2025-03-16 17:44:34,773 INFO L349 Elim1Store]: treesize reduction 123, result has 12.8 percent of original size [2025-03-16 17:44:34,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 15 case distinctions, treesize of input 198 treesize of output 89 [2025-03-16 17:44:34,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-16 17:44:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:34,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958536080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:36,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 45 [2025-03-16 17:44:36,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424666475] [2025-03-16 17:44:36,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:36,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 17:44:36,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:36,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 17:44:36,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 17:44:36,692 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 45 states, 43 states have (on average 1.441860465116279) internal successors, (62), 37 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:44:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:37,867 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-16 17:44:37,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 17:44:37,867 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.441860465116279) internal successors, (62), 37 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 41 [2025-03-16 17:44:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:37,867 INFO L225 Difference]: With dead ends: 39 [2025-03-16 17:44:37,867 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:44:37,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=311, Invalid=3721, Unknown=0, NotChecked=0, Total=4032 [2025-03-16 17:44:37,868 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:37,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 17:44:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:44:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:44:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:44:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:44:37,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2025-03-16 17:44:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:37,869 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:44:37,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.441860465116279) internal successors, (62), 37 states have internal predecessors, (62), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 17:44:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:44:37,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:44:37,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:44:37,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 17:44:38,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 17:44:38,074 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:38,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.