./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 Calling Ultimate with: /usr/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:30:10,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:30:10,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:30:10,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:30:10,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:30:10,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:30:10,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:30:10,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:30:10,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:30:10,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:30:10,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:30:10,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:30:10,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:30:10,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:30:10,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:30:10,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:30:10,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:30:10,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:30:10,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:30:10,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:30:10,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:30:10,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:30:10,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:30:10,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:30:10,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:30:10,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:30:10,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:30:10,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:30:10,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:30:10,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:30:10,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:30:10,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:30:10,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:30:10,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:30:10,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:30:10,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:30:10,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:30:10,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:30:10,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:30:10,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:30:10,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:30:10,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:30:10,844 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:30:10,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:30:10,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:30:10,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:30:10,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:30:10,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:30:10,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:30:10,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:30:10,848 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:30:10,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:30:10,849 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:30:10,849 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:30:10,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:30:10,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:30:10,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:30:10,850 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:30:10,850 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:30:10,850 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:30:10,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:30:10,850 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:30:10,850 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:30:10,850 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:30:10,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:30:10,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:30:10,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:30:10,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:30:10,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:30:10,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:30:10,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:30:10,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:30:10,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:30:10,852 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:30:10,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:30:10,852 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:30:10,852 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2023-02-15 13:30:11,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:30:11,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:30:11,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:30:11,095 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:30:11,095 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:30:11,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-02-15 13:30:12,053 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:30:12,285 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:30:12,286 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-02-15 13:30:12,295 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aafbb9c67/273e4d44f4774a19b22ad957f9193790/FLAGd122a6b3b [2023-02-15 13:30:12,652 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aafbb9c67/273e4d44f4774a19b22ad957f9193790 [2023-02-15 13:30:12,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:30:12,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:30:12,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:30:12,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:30:12,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:30:12,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:30:12" (1/1) ... [2023-02-15 13:30:12,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391f6f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:12, skipping insertion in model container [2023-02-15 13:30:12,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:30:12" (1/1) ... [2023-02-15 13:30:12,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:30:12,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:30:12,954 WARN L237 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-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-02-15 13:30:12,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:30:12,966 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:30:13,001 WARN L237 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-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-02-15 13:30:13,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:30:13,021 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:30:13,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13 WrapperNode [2023-02-15 13:30:13,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:30:13,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:30:13,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:30:13,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:30:13,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,078 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2023-02-15 13:30:13,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:30:13,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:30:13,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:30:13,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:30:13,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:30:13,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:30:13,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:30:13,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:30:13,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (1/1) ... [2023-02-15 13:30:13,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:30:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:13,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:30:13,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:30:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 13:30:13,150 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 13:30:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:30:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:30:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:30:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:30:13,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:30:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:30:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:30:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:30:13,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:30:13,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:30:13,215 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:30:13,216 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:30:13,245 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 13:30:13,427 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:30:13,431 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:30:13,431 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 13:30:13,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:30:13 BoogieIcfgContainer [2023-02-15 13:30:13,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:30:13,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:30:13,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:30:13,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:30:13,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:30:12" (1/3) ... [2023-02-15 13:30:13,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66abd7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:30:13, skipping insertion in model container [2023-02-15 13:30:13,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:30:13" (2/3) ... [2023-02-15 13:30:13,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66abd7ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:30:13, skipping insertion in model container [2023-02-15 13:30:13,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:30:13" (3/3) ... [2023-02-15 13:30:13,438 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2023-02-15 13:30:13,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:30:13,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-02-15 13:30:13,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:30:13,479 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@44d9ccc9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:30:13,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-02-15 13:30:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:30:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:30:13,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:13,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:30:13,487 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-15 13:30:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:13,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514078690] [2023-02-15 13:30:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:13,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:13,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514078690] [2023-02-15 13:30:13,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514078690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:13,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:13,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:30:13,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097824562] [2023-02-15 13:30:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:13,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:13,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:13,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:13,681 INFO L87 Difference]: Start difference. First operand has 80 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-15 13:30:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:13,777 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2023-02-15 13:30:13,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 13:30:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:13,782 INFO L225 Difference]: With dead ends: 93 [2023-02-15 13:30:13,784 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 13:30:13,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:13,787 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:13,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 62 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 13:30:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2023-02-15 13:30:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 69 states have internal predecessors, (73), 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) [2023-02-15 13:30:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2023-02-15 13:30:13,808 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 4 [2023-02-15 13:30:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:13,809 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2023-02-15 13:30:13,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-15 13:30:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2023-02-15 13:30:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:30:13,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:13,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:30:13,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:30:13,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-15 13:30:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:13,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227566543] [2023-02-15 13:30:13,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:13,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227566543] [2023-02-15 13:30:13,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227566543] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:13,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:13,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:30:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637555614] [2023-02-15 13:30:13,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:13,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:13,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:13,911 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-15 13:30:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:13,990 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-02-15 13:30:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:13,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 13:30:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:13,992 INFO L225 Difference]: With dead ends: 66 [2023-02-15 13:30:14,006 INFO L226 Difference]: Without dead ends: 66 [2023-02-15 13:30:14,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:14,008 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:14,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-15 13:30:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-15 13:30:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 65 states have internal predecessors, (69), 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) [2023-02-15 13:30:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2023-02-15 13:30:14,012 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 4 [2023-02-15 13:30:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:14,012 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2023-02-15 13:30:14,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-15 13:30:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2023-02-15 13:30:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 13:30:14,013 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:14,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:14,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:30:14,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:14,015 INFO L85 PathProgramCache]: Analyzing trace with hash -401980428, now seen corresponding path program 1 times [2023-02-15 13:30:14,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:14,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682674048] [2023-02-15 13:30:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:14,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:14,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:14,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682674048] [2023-02-15 13:30:14,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682674048] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:14,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:14,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:30:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995812567] [2023-02-15 13:30:14,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:14,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:14,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:14,112 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 13:30:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:14,195 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2023-02-15 13:30:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:14,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 13:30:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:14,197 INFO L225 Difference]: With dead ends: 108 [2023-02-15 13:30:14,198 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 13:30:14,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:14,200 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:14,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 118 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 13:30:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2023-02-15 13:30:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 63 states have internal predecessors, (67), 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) [2023-02-15 13:30:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2023-02-15 13:30:14,211 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 10 [2023-02-15 13:30:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:14,212 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2023-02-15 13:30:14,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 13:30:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2023-02-15 13:30:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 13:30:14,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:14,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:14,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:30:14,213 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -401980427, now seen corresponding path program 1 times [2023-02-15 13:30:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:14,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253529708] [2023-02-15 13:30:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:14,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:14,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:14,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253529708] [2023-02-15 13:30:14,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253529708] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:14,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:14,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:30:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880532015] [2023-02-15 13:30:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:14,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:14,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:14,342 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 13:30:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:14,397 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2023-02-15 13:30:14,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 13:30:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:14,399 INFO L225 Difference]: With dead ends: 110 [2023-02-15 13:30:14,399 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 13:30:14,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:14,406 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 56 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:14,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 127 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:30:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 13:30:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 62. [2023-02-15 13:30:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 61 states have internal predecessors, (65), 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) [2023-02-15 13:30:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2023-02-15 13:30:14,416 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 10 [2023-02-15 13:30:14,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:14,416 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2023-02-15 13:30:14,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 13:30:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2023-02-15 13:30:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 13:30:14,417 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:14,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:14,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:30:14,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -401981869, now seen corresponding path program 1 times [2023-02-15 13:30:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:14,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412808356] [2023-02-15 13:30:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:14,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412808356] [2023-02-15 13:30:14,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412808356] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:14,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:14,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:30:14,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171091048] [2023-02-15 13:30:14,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:14,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:30:14,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:14,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:30:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:30:14,479 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 13:30:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:14,484 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2023-02-15 13:30:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:30:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 13:30:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:14,485 INFO L225 Difference]: With dead ends: 70 [2023-02-15 13:30:14,486 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 13:30:14,486 INFO L412 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 [2023-02-15 13:30:14,486 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 119 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 [2023-02-15 13:30:14,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:30:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 13:30:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2023-02-15 13:30:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 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) [2023-02-15 13:30:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-02-15 13:30:14,490 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 10 [2023-02-15 13:30:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:14,490 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-02-15 13:30:14,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 13:30:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-02-15 13:30:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:30:14,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:14,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:14,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:30:14,491 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 243865783, now seen corresponding path program 1 times [2023-02-15 13:30:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:14,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440464226] [2023-02-15 13:30:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:14,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:14,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440464226] [2023-02-15 13:30:14,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440464226] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:14,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:14,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:30:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018127688] [2023-02-15 13:30:14,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:14,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:30:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:14,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:30:14,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:30:14,578 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-02-15 13:30:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:14,654 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-15 13:30:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:30:14,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 13:30:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:14,655 INFO L225 Difference]: With dead ends: 85 [2023-02-15 13:30:14,655 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 13:30:14,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:30:14,656 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 148 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:14,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 62 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 13:30:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2023-02-15 13:30:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 66 states have internal predecessors, (71), 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) [2023-02-15 13:30:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-02-15 13:30:14,659 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2023-02-15 13:30:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:14,659 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-02-15 13:30:14,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-02-15 13:30:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-02-15 13:30:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:30:14,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:14,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:14,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:30:14,660 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:14,661 INFO L85 PathProgramCache]: Analyzing trace with hash 243865784, now seen corresponding path program 1 times [2023-02-15 13:30:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:14,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393408789] [2023-02-15 13:30:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:14,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:14,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:14,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393408789] [2023-02-15 13:30:14,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393408789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:14,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:14,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:30:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925561066] [2023-02-15 13:30:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:14,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:30:14,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:30:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:30:14,830 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2023-02-15 13:30:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:14,926 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-15 13:30:14,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:30:14,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 13:30:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:14,927 INFO L225 Difference]: With dead ends: 85 [2023-02-15 13:30:14,927 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 13:30:14,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:30:14,928 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 85 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:14,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 84 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 13:30:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2023-02-15 13:30:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 66 states have internal predecessors, (70), 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) [2023-02-15 13:30:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-02-15 13:30:14,931 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2023-02-15 13:30:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:14,931 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-02-15 13:30:14,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2023-02-15 13:30:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-02-15 13:30:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:30:14,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:14,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:14,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:30:14,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:14,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash -27720857, now seen corresponding path program 1 times [2023-02-15 13:30:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:14,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105451451] [2023-02-15 13:30:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:14,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105451451] [2023-02-15 13:30:14,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105451451] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:14,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195731086] [2023-02-15 13:30:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:14,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:14,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:15,017 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) [2023-02-15 13:30:15,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:30:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:15,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:30:15,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:15,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:15,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195731086] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:15,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:15,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 13:30:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893278849] [2023-02-15 13:30:15,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:15,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:30:15,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:30:15,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:30:15,181 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2023-02-15 13:30:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:15,196 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-15 13:30:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:30:15,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 13:30:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:15,197 INFO L225 Difference]: With dead ends: 85 [2023-02-15 13:30:15,197 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 13:30:15,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:30:15,197 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:15,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:30:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 13:30:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-02-15 13:30:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 80 states have internal predecessors, (88), 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) [2023-02-15 13:30:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2023-02-15 13:30:15,200 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 16 [2023-02-15 13:30:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:15,200 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2023-02-15 13:30:15,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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) [2023-02-15 13:30:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2023-02-15 13:30:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:30:15,201 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:15,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:15,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 13:30:15,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:15,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash -868554549, now seen corresponding path program 1 times [2023-02-15 13:30:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:15,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239973850] [2023-02-15 13:30:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:15,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239973850] [2023-02-15 13:30:15,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239973850] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:15,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794013535] [2023-02-15 13:30:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:15,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:15,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:15,509 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) [2023-02-15 13:30:15,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:30:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:15,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:30:15,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:15,614 INFO L350 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 [2023-02-15 13:30:15,641 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:30:15,641 INFO L350 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 [2023-02-15 13:30:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:15,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:15,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794013535] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:15,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:15,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-02-15 13:30:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878291494] [2023-02-15 13:30:15,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:15,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:30:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:15,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:30:15,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:30:15,710 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2023-02-15 13:30:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:15,785 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2023-02-15 13:30:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:30:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 13:30:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:15,787 INFO L225 Difference]: With dead ends: 96 [2023-02-15 13:30:15,787 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 13:30:15,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:30:15,787 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:15,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 114 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 13:30:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2023-02-15 13:30:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 78 states have internal predecessors, (84), 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) [2023-02-15 13:30:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-15 13:30:15,790 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 18 [2023-02-15 13:30:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:15,790 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-15 13:30:15,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2023-02-15 13:30:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-15 13:30:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:30:15,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:15,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:15,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:30:15,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-15 13:30:15,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash -868554548, now seen corresponding path program 1 times [2023-02-15 13:30:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:15,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955621996] [2023-02-15 13:30:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:16,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:16,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955621996] [2023-02-15 13:30:16,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955621996] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:16,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209174508] [2023-02-15 13:30:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:16,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:16,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:16,089 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) [2023-02-15 13:30:16,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:30:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:16,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:30:16,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:16,184 INFO L350 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 [2023-02-15 13:30:16,187 INFO L350 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 [2023-02-15 13:30:16,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:16,233 INFO L350 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 12 treesize of output 14 [2023-02-15 13:30:16,241 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:30:16,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:30:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:16,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209174508] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:18,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:18,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2023-02-15 13:30:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810808847] [2023-02-15 13:30:18,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:18,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:30:18,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:30:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:30:18,426 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 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) [2023-02-15 13:30:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:18,597 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2023-02-15 13:30:18,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:30:18,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 13:30:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:18,598 INFO L225 Difference]: With dead ends: 94 [2023-02-15 13:30:18,598 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 13:30:18,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:30:18,598 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 289 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:18,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 73 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 13:30:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2023-02-15 13:30:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 76 states have internal predecessors, (80), 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) [2023-02-15 13:30:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2023-02-15 13:30:18,601 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 18 [2023-02-15 13:30:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:18,601 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2023-02-15 13:30:18,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 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) [2023-02-15 13:30:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2023-02-15 13:30:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:30:18,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:18,602 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:18,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 13:30:18,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:18,807 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 140768543, now seen corresponding path program 1 times [2023-02-15 13:30:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:18,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91397409] [2023-02-15 13:30:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 13:30:18,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:18,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91397409] [2023-02-15 13:30:18,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91397409] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:18,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:18,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:30:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803894236] [2023-02-15 13:30:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:18,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:30:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:18,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:30:18,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:30:18,901 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) [2023-02-15 13:30:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:18,997 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2023-02-15 13:30:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:30:18,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 13:30:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:18,998 INFO L225 Difference]: With dead ends: 90 [2023-02-15 13:30:18,998 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 13:30:18,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:30:18,999 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 149 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:18,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 76 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 13:30:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2023-02-15 13:30:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 73 states have internal predecessors, (78), 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) [2023-02-15 13:30:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-02-15 13:30:19,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 37 [2023-02-15 13:30:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:19,001 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-02-15 13:30:19,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) [2023-02-15 13:30:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-02-15 13:30:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:30:19,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:19,002 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:19,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:30:19,003 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:19,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 140768544, now seen corresponding path program 1 times [2023-02-15 13:30:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:19,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110615738] [2023-02-15 13:30:19,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:30:19,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:19,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110615738] [2023-02-15 13:30:19,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110615738] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:19,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:19,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:30:19,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573129871] [2023-02-15 13:30:19,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:19,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:30:19,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:19,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:30:19,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:30:19,185 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) [2023-02-15 13:30:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:19,288 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2023-02-15 13:30:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:30:19,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 13:30:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:19,289 INFO L225 Difference]: With dead ends: 80 [2023-02-15 13:30:19,289 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 13:30:19,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:30:19,290 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 157 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:19,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 54 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 13:30:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2023-02-15 13:30:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 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) [2023-02-15 13:30:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-15 13:30:19,291 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 37 [2023-02-15 13:30:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:19,291 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-15 13:30:19,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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) [2023-02-15 13:30:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-15 13:30:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:30:19,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:19,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:19,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:30:19,292 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2134585018, now seen corresponding path program 1 times [2023-02-15 13:30:19,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:19,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462978271] [2023-02-15 13:30:19,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:19,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:30:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:19,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462978271] [2023-02-15 13:30:19,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462978271] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:19,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186292428] [2023-02-15 13:30:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:19,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:19,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:19,853 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) [2023-02-15 13:30:19,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:30:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:20,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:30:20,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:20,097 INFO L350 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 [2023-02-15 13:30:20,170 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:30:20,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:30:20,223 INFO L350 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 [2023-02-15 13:30:20,250 INFO L350 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 14 treesize of output 16 [2023-02-15 13:30:20,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:20,327 INFO L350 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 21 treesize of output 20 [2023-02-15 13:30:20,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:20,351 INFO L350 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 21 treesize of output 20 [2023-02-15 13:30:20,395 INFO L350 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 [2023-02-15 13:30:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:30:20,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:20,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:20,540 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2023-02-15 13:30:20,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:20,555 INFO L350 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 218 treesize of output 214 [2023-02-15 13:30:20,560 INFO L350 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 248 treesize of output 234 [2023-02-15 13:30:20,596 INFO L350 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 82 treesize of output 78 [2023-02-15 13:30:22,342 INFO L350 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 39 treesize of output 33 [2023-02-15 13:30:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:30:22,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186292428] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:22,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:22,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-02-15 13:30:22,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146813598] [2023-02-15 13:30:22,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:22,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 13:30:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:22,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 13:30:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=819, Unknown=15, NotChecked=0, Total=930 [2023-02-15 13:30:22,544 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 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) [2023-02-15 13:30:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:23,134 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2023-02-15 13:30:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:30:23,135 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 13:30:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:23,135 INFO L225 Difference]: With dead ends: 92 [2023-02-15 13:30:23,135 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 13:30:23,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=1382, Unknown=15, NotChecked=0, Total=1722 [2023-02-15 13:30:23,136 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 354 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:23,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 389 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:30:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 13:30:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2023-02-15 13:30:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 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) [2023-02-15 13:30:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2023-02-15 13:30:23,138 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 39 [2023-02-15 13:30:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:23,138 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2023-02-15 13:30:23,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 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) [2023-02-15 13:30:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2023-02-15 13:30:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:30:23,138 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:23,139 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:23,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:30:23,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:23,345 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash -56889687, now seen corresponding path program 1 times [2023-02-15 13:30:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:23,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665568684] [2023-02-15 13:30:23,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:23,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 13:30:23,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:23,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665568684] [2023-02-15 13:30:23,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665568684] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:23,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:23,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:30:23,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246689060] [2023-02-15 13:30:23,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:23,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:30:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:23,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:30:23,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:30:23,468 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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) [2023-02-15 13:30:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:23,574 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2023-02-15 13:30:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:30:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 13:30:23,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:23,575 INFO L225 Difference]: With dead ends: 92 [2023-02-15 13:30:23,575 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 13:30:23,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:30:23,576 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 190 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:23,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 77 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 13:30:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2023-02-15 13:30:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 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) [2023-02-15 13:30:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2023-02-15 13:30:23,577 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 43 [2023-02-15 13:30:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:23,578 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2023-02-15 13:30:23,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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) [2023-02-15 13:30:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2023-02-15 13:30:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:30:23,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:23,579 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:23,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:30:23,579 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash -56889686, now seen corresponding path program 1 times [2023-02-15 13:30:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:23,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731619559] [2023-02-15 13:30:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:30:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:23,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731619559] [2023-02-15 13:30:23,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731619559] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:30:23,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:30:23,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:30:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907948210] [2023-02-15 13:30:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:30:23,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:30:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:30:23,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:30:23,774 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-02-15 13:30:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:23,887 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2023-02-15 13:30:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:30:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 13:30:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:23,887 INFO L225 Difference]: With dead ends: 76 [2023-02-15 13:30:23,888 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 13:30:23,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:30:23,888 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 163 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:23,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 49 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:30:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 13:30:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2023-02-15 13:30:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 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) [2023-02-15 13:30:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2023-02-15 13:30:23,889 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 43 [2023-02-15 13:30:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:23,890 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2023-02-15 13:30:23,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-02-15 13:30:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2023-02-15 13:30:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:30:23,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:23,890 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:23,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:30:23,890 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash -56889649, now seen corresponding path program 1 times [2023-02-15 13:30:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:23,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347688367] [2023-02-15 13:30:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:23,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:30:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:24,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347688367] [2023-02-15 13:30:24,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347688367] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:24,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272630111] [2023-02-15 13:30:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:24,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:24,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:24,615 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) [2023-02-15 13:30:24,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:30:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:24,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-15 13:30:24,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:24,794 INFO L350 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 [2023-02-15 13:30:24,834 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:30:24,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:30:24,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:30:24,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:24,883 INFO L350 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 21 treesize of output 20 [2023-02-15 13:30:24,896 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:30:24,896 INFO L350 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 34 treesize of output 35 [2023-02-15 13:30:24,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:24,963 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 13:30:24,963 INFO L350 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 33 treesize of output 30 [2023-02-15 13:30:25,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:25,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:25,008 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:25,011 INFO L350 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 1 case distinctions, treesize of input 57 treesize of output 53 [2023-02-15 13:30:25,162 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:25,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 64 [2023-02-15 13:30:25,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:25,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 47 [2023-02-15 13:30:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:30:25,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:25,362 INFO L321 Elim1Store]: treesize reduction 18, result has 73.9 percent of original size [2023-02-15 13:30:25,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 62 [2023-02-15 13:30:25,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:25,445 INFO L350 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 103 treesize of output 69 [2023-02-15 13:30:25,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:25,452 INFO L350 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 317 treesize of output 307 [2023-02-15 13:30:25,456 INFO L350 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 323 treesize of output 291 [2023-02-15 13:30:25,468 INFO L350 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 171 treesize of output 155 [2023-02-15 13:30:26,208 INFO L350 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 161 treesize of output 149 [2023-02-15 13:30:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:30:26,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272630111] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:26,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:26,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2023-02-15 13:30:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301049371] [2023-02-15 13:30:26,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 13:30:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 13:30:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1330, Unknown=6, NotChecked=0, Total=1482 [2023-02-15 13:30:26,334 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 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) [2023-02-15 13:30:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:27,787 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2023-02-15 13:30:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:30:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 13:30:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:27,788 INFO L225 Difference]: With dead ends: 100 [2023-02-15 13:30:27,788 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 13:30:27,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=554, Invalid=2520, Unknown=6, NotChecked=0, Total=3080 [2023-02-15 13:30:27,790 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 575 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:27,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 386 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:30:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 13:30:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2023-02-15 13:30:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 75 states have internal predecessors, (81), 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) [2023-02-15 13:30:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-02-15 13:30:27,792 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 43 [2023-02-15 13:30:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:27,792 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-02-15 13:30:27,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 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) [2023-02-15 13:30:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-02-15 13:30:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:30:27,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:27,792 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:27,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 13:30:27,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 13:30:27,999 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:27,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash -56889648, now seen corresponding path program 1 times [2023-02-15 13:30:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:27,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360237282] [2023-02-15 13:30:28,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:30:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:29,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360237282] [2023-02-15 13:30:29,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360237282] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:29,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152798697] [2023-02-15 13:30:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:29,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:29,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:29,025 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) [2023-02-15 13:30:29,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:30:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:29,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-15 13:30:29,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:29,211 INFO L350 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 [2023-02-15 13:30:29,275 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:30:29,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:30:29,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:30:29,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:30:29,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:29,341 INFO L350 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 21 treesize of output 20 [2023-02-15 13:30:29,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:29,350 INFO L350 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 21 treesize of output 20 [2023-02-15 13:30:29,361 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:30:29,362 INFO L350 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 54 treesize of output 53 [2023-02-15 13:30:29,366 INFO L350 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 41 treesize of output 41 [2023-02-15 13:30:29,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:29,447 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 13:30:29,447 INFO L350 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 41 treesize of output 38 [2023-02-15 13:30:29,451 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:29,458 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-15 13:30:29,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2023-02-15 13:30:29,542 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:29,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:29,545 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:29,546 INFO L350 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 94 [2023-02-15 13:30:29,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:29,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:29,552 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-02-15 13:30:29,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 103 [2023-02-15 13:30:29,741 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:29,741 INFO L350 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 1 case distinctions, treesize of input 92 treesize of output 86 [2023-02-15 13:30:29,745 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:30:29,745 INFO L350 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 1 case distinctions, treesize of input 92 treesize of output 86 [2023-02-15 13:30:29,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:29,767 INFO L350 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 88 treesize of output 76 [2023-02-15 13:30:29,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:29,773 INFO L350 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 72 treesize of output 60 [2023-02-15 13:30:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:30:29,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:30,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:30,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 104 treesize of output 188 [2023-02-15 13:30:33,663 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse20 (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse92 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse92 v_prenex_2 (store (select .cse92 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))) (.cse13 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse14 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse29 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse90 (select (select (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse90 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse90 |ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (.cse3 (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (<= 0 (select (select (let ((.cse89 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse89 v_prenex_2 (store (select .cse89 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2)))) (.cse67 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse87 (select (select (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse87 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (and (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse3) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse4 v_prenex_2 (store (select .cse4 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse5 v_prenex_2 (store (select .cse5 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse7 v_prenex_2) (= .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse9 v_prenex_2 (store (select .cse9 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse11 v_prenex_2 (store (select .cse11 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse12 .cse13) (< .cse12 .cse14)))) (= (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse17 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse17 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse19 v_prenex_2 (store (select .cse19 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (or .cse20 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse22 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse24 v_prenex_2 (store (select .cse24 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse25 (select (select (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse25 .cse13) (< .cse25 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (<= 0 (select (select (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse27 v_prenex_2 (store (select .cse27 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) .cse29 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse30 (select (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse30 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse31 v_prenex_2 (store (select .cse31 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse33 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse33 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse34 v_prenex_2 (store (select .cse34 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse36 (select (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse36 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse37 v_prenex_2 (store (select .cse37 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse40 v_prenex_2 (store (select .cse40 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse13) (= (select (select (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse13)) (= (select (select (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse14))) .cse20 (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse48 v_prenex_2 (store (select .cse48 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse50 v_prenex_2 (store (select .cse50 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse51 (select (select (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse51 .cse13) (< .cse51 .cse14)))) (or .cse3 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse54 (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse54 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse55 v_prenex_2 (store (select .cse55 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse57 (select (select (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse57 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse57 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse59 v_prenex_2 (store (select .cse59 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse61 (select (select (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse13) (= .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse63 (select (select (let ((.cse65 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse63 .cse13) (= (select (select (let ((.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< .cse63 .cse14)))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) .cse3) .cse67 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse68 (select (select (let ((.cse70 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse68 .cse13) (= (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse68 .cse14)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse72 (select (select (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (.cse71 (select (select (let ((.cse73 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse71 .cse13) (= .cse72 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse71 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse76 (select (select (let ((.cse77 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse76 .cse13) (< .cse76 .cse14)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse78 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse14)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse80 (select (select (let ((.cse82 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse80 .cse13) (= (select (select (let ((.cse81 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse80 .cse14)))) (or .cse29 .cse3) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse84 v_prenex_2 (store (select .cse84 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (or .cse3 .cse67) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse85 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse86 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse86 v_prenex_2 (store (select .cse86 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2023-02-15 13:30:36,173 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse13 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse93 (select (select (let ((.cse94 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse94 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse94 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse93 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse93 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (.cse38 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse91 (select (select (let ((.cse92 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse91 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (.cse24 (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse90 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse90 v_prenex_2 (store (select .cse90 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)))) (.cse14 (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (or (<= 0 (select (select (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse89 v_prenex_2 (store (select .cse89 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2)))) (.cse9 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse4 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) .cse4)) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse8 .cse9) (< .cse8 .cse4)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse12 v_prenex_2 (store (select .cse12 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) .cse13 (or .cse13 .cse14) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse15 (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (< .cse15 .cse9) (< .cse15 .cse4)))) (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse18 (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse18 v_prenex_2)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse20 v_prenex_2 (store (select .cse20 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse22 v_prenex_2 (store (select .cse22 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse24) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse26 v_prenex_2 (store (select .cse26 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) .cse14) (or .cse14 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse29 v_prenex_2 (store (select .cse29 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse31 v_prenex_2 (store (select .cse31 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse32 (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse34 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse32 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse33 v_prenex_2 (store (select .cse33 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse35 (select (select (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse35 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse37 v_prenex_2 (store (select .cse37 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) .cse38 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse39 (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse39 .cse9) (< .cse39 .cse4)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse41 (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (forall ((v_prenex_2 Int)) (or (= .cse41 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse42 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse42 v_prenex_2 (store (select .cse42 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (= .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse44 (select (select (let ((.cse46 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse45 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) .cse9) (= .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse48 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) .cse4))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse50 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse50 v_prenex_2 (store (select .cse50 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse52 (select (select (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) (.cse51 (select (select (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse52 .cse9) (< .cse52 .cse4) (= .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse55 (select (select (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (forall ((v_prenex_2 Int)) (or (= .cse55 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse56 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse56 v_prenex_2 (store (select .cse56 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (= .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse58 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) .cse9) (= (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or .cse38 .cse14) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse60 (select (select (let ((.cse61 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse60 v_prenex_2) (= .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse62 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse62 v_prenex_2 (store (select .cse62 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse63 (select (select (let ((.cse64 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (< .cse63 .cse9) (< .cse63 .cse4)))) (= (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse66 (select (select (let ((.cse68 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= .cse66 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse66 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse67 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse67 v_prenex_2 (store (select .cse67 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)))))))) .cse24 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse69 (select (select (let ((.cse71 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (< .cse69 .cse9) (< .cse69 .cse4) (= (select (select (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) .cse14) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse73 (select (select (let ((.cse74 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse73 v_prenex_2) (= .cse73 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse75 v_prenex_2 (store (select .cse75 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse76 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse77 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse77 v_prenex_2 (store (select .cse77 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse78 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse79 v_prenex_2 (store (select .cse79 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) .cse9)) (= (select (select (let ((.cse81 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse82 (select (select (let ((.cse83 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (< .cse82 .cse9) (< .cse82 .cse4)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse84 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse85 v_prenex_2 (store (select .cse85 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse87 (select (select (let ((.cse88 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= (select (select (let ((.cse86 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse87 .cse9) (< .cse87 .cse4))))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2023-02-15 13:30:36,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:36,296 INFO L350 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 51 treesize of output 44 [2023-02-15 13:30:36,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:36,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2023-02-15 13:30:36,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:36,337 INFO L350 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 328 treesize of output 318 [2023-02-15 13:30:36,346 INFO L350 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 334 treesize of output 302 [2023-02-15 13:30:36,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:36,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:36,368 INFO L350 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 1 case distinctions, treesize of input 84 treesize of output 84 [2023-02-15 13:30:36,378 INFO L350 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 33 treesize of output 29 [2023-02-15 13:30:36,410 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:36,490 INFO L350 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 170 treesize of output 154 [2023-02-15 13:30:41,900 INFO L350 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 21 treesize of output 13 [2023-02-15 13:30:41,910 INFO L350 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 8 treesize of output 4 [2023-02-15 13:30:41,929 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:41,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 1 [2023-02-15 13:30:41,935 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:41,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:41,937 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:41,943 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:41,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:41,951 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:41,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:41,959 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:41,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-15 13:30:41,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:30:41,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2023-02-15 13:30:41,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:41,987 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:30:41,987 INFO L350 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 84 treesize of output 80 [2023-02-15 13:30:41,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-02-15 13:30:41,998 INFO L350 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 88 treesize of output 72 [2023-02-15 13:30:42,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:42,022 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,029 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,036 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-15 13:30:42,042 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,050 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-02-15 13:30:42,057 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-15 13:30:42,064 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,072 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,080 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,088 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-15 13:30:42,093 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-15 13:30:42,099 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 1 [2023-02-15 13:30:42,102 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:42,108 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,112 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:42,122 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,130 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-02-15 13:30:42,134 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:42,143 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-15 13:30:42,150 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,151 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:42,161 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,170 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-02-15 13:30:42,176 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,178 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:42,187 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,196 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,205 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,215 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 1 [2023-02-15 13:30:42,218 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:30:42,227 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,236 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,246 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,255 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,262 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-15 13:30:42,271 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-02-15 13:30:42,280 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 13:30:42,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-15 13:30:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2023-02-15 13:30:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152798697] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:30:42,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:30:42,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 41 [2023-02-15 13:30:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374684488] [2023-02-15 13:30:42,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:42,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 13:30:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 13:30:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1423, Unknown=2, NotChecked=154, Total=1722 [2023-02-15 13:30:42,512 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 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) [2023-02-15 13:30:44,964 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select .cse2 .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse13 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse93 (select (select (let ((.cse94 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse94 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse94 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse93 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse93 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (.cse38 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse91 (select (select (let ((.cse92 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse91 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (.cse24 (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse90 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse90 v_prenex_2 (store (select .cse90 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))) (.cse14 (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (or (<= 0 (select (select (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse89 v_prenex_2 (store (select .cse89 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2)))) (.cse9 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse5 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse3 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse5)) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse8 .cse9) (< .cse8 .cse5)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse12 v_prenex_2 (store (select .cse12 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) .cse13 (or .cse13 .cse14) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse15 (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse15 .cse9) (< .cse15 .cse5)))) (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse18 (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse18 v_prenex_2)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse20 v_prenex_2 (store (select .cse20 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse22 v_prenex_2 (store (select .cse22 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse24) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse26 v_prenex_2 (store (select .cse26 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) .cse14) (or .cse14 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse29 v_prenex_2 (store (select .cse29 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse31 v_prenex_2 (store (select .cse31 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse32 (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse34 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse32 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse33 v_prenex_2 (store (select .cse33 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse35 (select (select (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse35 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse37 v_prenex_2 (store (select .cse37 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) .cse38 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse39 (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse39 .cse9) (< .cse39 .cse5)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse41 (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse41 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse42 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse42 v_prenex_2 (store (select .cse42 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse44 (select (select (let ((.cse46 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse45 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse9) (= .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse48 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse5))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse50 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse50 v_prenex_2 (store (select .cse50 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse52 (select (select (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.cse51 (select (select (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse52 .cse9) (< .cse52 .cse5) (= .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse55 (select (select (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse55 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse56 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse56 v_prenex_2 (store (select .cse56 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse58 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse9) (= (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or .cse38 .cse14) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse60 (select (select (let ((.cse61 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse60 v_prenex_2) (= .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse62 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse62 v_prenex_2 (store (select .cse62 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse63 (select (select (let ((.cse64 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse63 .cse9) (< .cse63 .cse5)))) (= (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse66 (select (select (let ((.cse68 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse66 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse66 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse67 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse67 v_prenex_2 (store (select .cse67 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) .cse24 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse69 (select (select (let ((.cse71 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse69 .cse9) (< .cse69 .cse5) (= (select (select (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) .cse14) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse73 (select (select (let ((.cse74 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse73 v_prenex_2) (= .cse73 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse75 v_prenex_2 (store (select .cse75 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse76 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse77 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse77 v_prenex_2 (store (select .cse77 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse78 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse79 v_prenex_2 (store (select .cse79 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse9)) (= (select (select (let ((.cse81 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse82 (select (select (let ((.cse83 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse82 .cse9) (< .cse82 .cse5)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse84 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse85 v_prenex_2 (store (select .cse85 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse87 (select (select (let ((.cse88 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse86 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse87 .cse9) (< .cse87 .cse5))))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2023-02-15 13:30:46,997 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse20 (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse92 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse92 v_prenex_2 (store (select .cse92 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (.cse13 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse14 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse29 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse90 (select (select (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse90 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse90 |ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (.cse3 (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (<= 0 (select (select (let ((.cse89 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse89 v_prenex_2 (store (select .cse89 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2)))) (.cse67 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse87 (select (select (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse87 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (and (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse3) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse4 v_prenex_2 (store (select .cse4 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse5 v_prenex_2 (store (select .cse5 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse7 v_prenex_2) (= .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse9 v_prenex_2 (store (select .cse9 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse11 v_prenex_2 (store (select .cse11 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse12 .cse13) (< .cse12 .cse14)))) (= (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse17 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse17 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse19 v_prenex_2 (store (select .cse19 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (or .cse20 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse22 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse24 v_prenex_2 (store (select .cse24 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse25 (select (select (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse25 .cse13) (< .cse25 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (<= 0 (select (select (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse27 v_prenex_2 (store (select .cse27 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) .cse29 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse30 (select (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse30 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse31 v_prenex_2 (store (select .cse31 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse33 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse33 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse34 v_prenex_2 (store (select .cse34 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse36 (select (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse36 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse37 v_prenex_2 (store (select .cse37 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse40 v_prenex_2 (store (select .cse40 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13) (= (select (select (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse43 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13)) (= (select (select (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse14))) .cse20 (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse48 v_prenex_2 (store (select .cse48 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse50 v_prenex_2 (store (select .cse50 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse51 (select (select (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse51 .cse13) (< .cse51 .cse14)))) (or .cse3 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse54 (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse54 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse55 v_prenex_2 (store (select .cse55 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse57 (select (select (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse57 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse57 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse59 v_prenex_2 (store (select .cse59 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse61 (select (select (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13) (= .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse63 (select (select (let ((.cse65 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse63 .cse13) (= (select (select (let ((.cse64 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< .cse63 .cse14)))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) .cse3) .cse67 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse68 (select (select (let ((.cse70 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse68 .cse13) (= (select (select (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse68 .cse14)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse72 (select (select (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (.cse71 (select (select (let ((.cse73 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse71 .cse13) (= .cse72 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse71 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse76 (select (select (let ((.cse77 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse76 .cse13) (< .cse76 .cse14)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse78 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse14)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse80 (select (select (let ((.cse82 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse80 .cse13) (= (select (select (let ((.cse81 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse80 .cse14)))) (or .cse29 .cse3) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse84 v_prenex_2 (store (select .cse84 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (or .cse3 .cse67) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse85 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse86 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse86 v_prenex_2 (store (select .cse86 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2023-02-15 13:30:49,430 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (select .cse5 .cse1))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse14 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse94 (select (select (let ((.cse95 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse95 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse95 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse94 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse94 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (.cse39 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse92 (select (select (let ((.cse93 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse93 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse93 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse92 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (.cse25 (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse91 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse91 v_prenex_2 (store (select .cse91 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))) (.cse15 (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (or (<= 0 (select (select (let ((.cse90 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse90 v_prenex_2 (store (select .cse90 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2)))) (.cse10 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse6 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse3 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse6)) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse9 .cse10) (< .cse9 .cse6)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse12 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse13 v_prenex_2 (store (select .cse13 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) .cse14 (or .cse14 .cse15) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse16 .cse10) (< .cse16 .cse6)))) (= (select (select (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse19 (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse19 v_prenex_2)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse21 v_prenex_2 (store (select .cse21 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse23 v_prenex_2 (store (select .cse23 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse25) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse27 v_prenex_2 (store (select .cse27 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) .cse15) (or .cse15 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse30 v_prenex_2 (store (select .cse30 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse32 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse32 v_prenex_2 (store (select .cse32 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse33 (select (select (let ((.cse35 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse33 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse34 v_prenex_2 (store (select .cse34 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse36 (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse36 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse38 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse38 v_prenex_2 (store (select .cse38 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) .cse39 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse40 (select (select (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse40 .cse10) (< .cse40 .cse6)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse42 (select (select (let ((.cse44 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse42 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse43 v_prenex_2 (store (select .cse43 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse45 (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse46 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse10) (= .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse48 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse6))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse50 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse51 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse51 v_prenex_2 (store (select .cse51 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse53 (select (select (let ((.cse55 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.cse52 (select (select (let ((.cse54 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse53 .cse10) (< .cse53 .cse6) (= .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse56 (select (select (let ((.cse58 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse56 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse57 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse57 v_prenex_2 (store (select .cse57 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse10) (= (select (select (let ((.cse60 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or .cse39 .cse15) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse61 (select (select (let ((.cse62 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse61 v_prenex_2) (= .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse63 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse63 v_prenex_2 (store (select .cse63 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse64 (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse64 .cse10) (< .cse64 .cse6)))) (= (select (select (let ((.cse66 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse67 (select (select (let ((.cse69 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse67 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse67 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse68 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse68 v_prenex_2 (store (select .cse68 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) .cse25 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse70 (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse70 .cse10) (< .cse70 .cse6) (= (select (select (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse73 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) .cse15) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse74 (select (select (let ((.cse75 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse74 v_prenex_2) (= .cse74 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse76 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse76 v_prenex_2 (store (select .cse76 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse77 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse78 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse78 v_prenex_2 (store (select .cse78 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse79 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse80 v_prenex_2 (store (select .cse80 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse81 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse10)) (= (select (select (let ((.cse82 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse83 (select (select (let ((.cse84 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse83 .cse10) (< .cse83 .cse6)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse86 v_prenex_2 (store (select .cse86 v_prenex_2) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse88 (select (select (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse89 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse89 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse87 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse88 .cse10) (< .cse88 .cse6))))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from true [2023-02-15 13:30:51,465 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse21 (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse93 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse93 v_prenex_2 (store (select .cse93 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))) (.cse14 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse15 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse30 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse91 (select (select (let ((.cse92 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse91 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (.cse4 (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (<= 0 (select (select (let ((.cse90 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse90 v_prenex_2 (store (select .cse90 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2)))) (.cse68 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse88 (select (select (let ((.cse89 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse89 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse89 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse88 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (and (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse4) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse5 v_prenex_2 (store (select .cse5 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse6 v_prenex_2 (store (select .cse6 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse8 v_prenex_2) (= .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse10 v_prenex_2 (store (select .cse10 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse12 v_prenex_2 (store (select .cse12 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse13 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse13 .cse14) (< .cse13 .cse15)))) (= (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse18 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse18 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse20 v_prenex_2 (store (select .cse20 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (or .cse21 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse23 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse23 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse25 v_prenex_2 (store (select .cse25 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse26 (select (select (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse26 .cse14) (< .cse26 .cse15)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (<= 0 (select (select (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse28 v_prenex_2 (store (select .cse28 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) .cse30 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse31 (select (select (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse31 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse32 v_prenex_2 (store (select .cse32 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse34 (select (select (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse34 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse35 v_prenex_2 (store (select .cse35 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse34 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse37 (select (select (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse37 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse38 v_prenex_2 (store (select .cse38 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse41 v_prenex_2 (store (select .cse41 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse14) (= (select (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse14)) (= (select (select (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse15))) .cse21 (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse49 v_prenex_2 (store (select .cse49 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse51 v_prenex_2 (store (select .cse51 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse52 (select (select (let ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse52 .cse14) (< .cse52 .cse15)))) (or .cse4 (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse55 (select (select (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse55 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse56 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse56 v_prenex_2 (store (select .cse56 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse58 (select (select (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse58 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse60 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse60 v_prenex_2 (store (select .cse60 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse62 (select (select (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse61 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse14) (= .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse64 (select (select (let ((.cse66 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse64 .cse14) (= (select (select (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< .cse64 .cse15)))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) .cse4) .cse68 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse69 (select (select (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse69 .cse14) (= (select (select (let ((.cse70 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse69 .cse15)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse73 (select (select (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (.cse72 (select (select (let ((.cse74 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse72 .cse14) (= .cse73 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse72 .cse15)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse76 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse77 (select (select (let ((.cse78 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse77 .cse14) (< .cse77 .cse15)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse15)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse81 (select (select (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse81 .cse14) (= (select (select (let ((.cse82 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse81 .cse15)))) (or .cse30 .cse4) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse85 v_prenex_2 (store (select .cse85 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (or .cse4 .cse68) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse86 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse87 v_prenex_2 (store (select .cse87 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)))))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from true [2023-02-15 13:30:54,011 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse100 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse104 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse103 (select .cse100 .cse104)) (.cse102 (select .cse2 .cse104)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse5 (select .cse8 .cse1)) (.cse4 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (<= 0 .cse102)) (.cse99 (not (= .cse103 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse101 (<= (+ .cse102 12) (select |c_#length| .cse103))) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select .cse2 .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse4 12) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse6 (or (let ((.cse17 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse97 (select (select (let ((.cse98 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse98 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse98 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse97 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse97 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (.cse42 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse95 (select (select (let ((.cse96 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse96 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse96 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse95 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse95 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (.cse28 (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse94 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse94 v_prenex_2 (store (select .cse94 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))) (.cse18 (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (or (<= 0 (select (select (let ((.cse93 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse93 v_prenex_2 (store (select .cse93 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2)))) (.cse13 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse9 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse9)) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse12 (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse12 .cse13) (< .cse12 .cse9)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse16 v_prenex_2 (store (select .cse16 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) .cse17 (or .cse17 .cse18) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse19 (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse19 .cse13) (< .cse19 .cse9)))) (= (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse22 (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse22 v_prenex_2)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse24 v_prenex_2 (store (select .cse24 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse26 v_prenex_2 (store (select .cse26 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse28) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse30 v_prenex_2 (store (select .cse30 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) .cse18) (or .cse18 (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse33 v_prenex_2 (store (select .cse33 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse34 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse35 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse35 v_prenex_2 (store (select .cse35 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse36 (select (select (let ((.cse38 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse36 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse37 v_prenex_2 (store (select .cse37 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse39 (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse39 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse41 v_prenex_2 (store (select .cse41 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) .cse42 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse43 (select (select (let ((.cse44 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse43 .cse13) (< .cse43 .cse9)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse45 (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse45 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse46 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse46 v_prenex_2 (store (select .cse46 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse48 (select (select (let ((.cse50 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13) (= .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse9))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse54 v_prenex_2 (store (select .cse54 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse56 (select (select (let ((.cse58 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.cse55 (select (select (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse56 .cse13) (< .cse56 .cse9) (= .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse59 (select (select (let ((.cse61 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse59 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse60 v_prenex_2 (store (select .cse60 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse62 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13) (= (select (select (let ((.cse63 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or .cse42 .cse18) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse64 (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse64 v_prenex_2) (= .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse66 v_prenex_2 (store (select .cse66 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse67 (select (select (let ((.cse68 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse67 .cse13) (< .cse67 .cse9)))) (= (select (select (let ((.cse69 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse70 (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse70 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse70 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse71 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse71 v_prenex_2 (store (select .cse71 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) .cse28 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse73 (select (select (let ((.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse73 .cse13) (< .cse73 .cse9) (= (select (select (let ((.cse74 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse76 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) .cse18) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse77 (select (select (let ((.cse78 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse77 v_prenex_2) (= .cse77 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse79 v_prenex_2 (store (select .cse79 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse80 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse81 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse81 v_prenex_2 (store (select .cse81 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse82 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse83 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse83 v_prenex_2 (store (select .cse83 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse84 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13)) (= (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse86 (select (select (let ((.cse87 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse86 .cse13) (< .cse86 .cse9)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse88 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse89 v_prenex_2 (store (select .cse89 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse91 (select (select (let ((.cse92 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse90 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse90 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse90 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse91 .cse13) (< .cse91 .cse9)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse99 (or (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse100 4)) (exists ((v_arrayElimCell_44 Int)) (and (<= 12 (select |c_#length| v_arrayElimCell_44)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_44)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select .cse2 4)) (<= 8 .cse4)) (and .cse6 .cse99 .cse101 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)) (<= 8 (select |c_#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse101 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 12 (select |c_#length| (select .cse100 .cse3))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from true [2023-02-15 13:30:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:59,370 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2023-02-15 13:30:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 13:30:59,371 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-15 13:30:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:59,371 INFO L225 Difference]: With dead ends: 109 [2023-02-15 13:30:59,371 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:30:59,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=578, Invalid=2983, Unknown=7, NotChecked=854, Total=4422 [2023-02-15 13:30:59,373 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 519 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:59,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 357 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 846 Invalid, 0 Unknown, 174 Unchecked, 1.5s Time] [2023-02-15 13:30:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:30:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2023-02-15 13:30:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 77 states have internal predecessors, (83), 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) [2023-02-15 13:30:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-02-15 13:30:59,374 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 43 [2023-02-15 13:30:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:59,374 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-02-15 13:30:59,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 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) [2023-02-15 13:30:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-02-15 13:30:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:30:59,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:59,375 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:59,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:30:59,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 13:30:59,575 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-15 13:30:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1163623530, now seen corresponding path program 1 times [2023-02-15 13:30:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:59,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511269419] [2023-02-15 13:30:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:31:03,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:31:03,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511269419] [2023-02-15 13:31:03,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511269419] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:31:03,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749194565] [2023-02-15 13:31:03,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:31:03,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:31:03,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:31:03,263 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) [2023-02-15 13:31:03,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:31:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:31:03,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 111 conjunts are in the unsatisfiable core [2023-02-15 13:31:03,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:31:03,769 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:31:03,770 INFO L350 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 [2023-02-15 13:31:04,165 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 13:31:04,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 13:31:04,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:31:04,483 INFO L350 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 14 treesize of output 16 [2023-02-15 13:31:04,800 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 13:31:04,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 13:31:04,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:31:04,986 INFO L350 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 14 treesize of output 16 [2023-02-15 13:31:04,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:31:05,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:05,129 INFO L350 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 21 treesize of output 20 [2023-02-15 13:31:05,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:05,152 INFO L350 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 21 treesize of output 20 [2023-02-15 13:31:05,166 INFO L350 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 14 treesize of output 16 [2023-02-15 13:31:05,216 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:31:05,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2023-02-15 13:31:05,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2023-02-15 13:31:05,238 INFO L350 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 22 treesize of output 24 [2023-02-15 13:31:05,551 INFO L350 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 45 treesize of output 32 [2023-02-15 13:31:05,558 INFO L350 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 20 treesize of output 22 [2023-02-15 13:31:05,570 INFO L350 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 21 treesize of output 20 [2023-02-15 13:31:05,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:05,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:05,741 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:05,741 INFO L350 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 1 case distinctions, treesize of input 54 treesize of output 44 [2023-02-15 13:31:05,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:05,753 INFO L350 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 30 treesize of output 32 [2023-02-15 13:31:05,772 INFO L350 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 22 [2023-02-15 13:31:06,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:06,168 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:31:06,168 INFO L350 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 1 case distinctions, treesize of input 73 treesize of output 50 [2023-02-15 13:31:06,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:06,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:31:06,181 INFO L350 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 26 treesize of output 28 [2023-02-15 13:31:06,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:31:06,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:06,357 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-15 13:31:06,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 39 [2023-02-15 13:31:06,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:31:06,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2023-02-15 13:31:06,739 INFO L350 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 [2023-02-15 13:31:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:31:06,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:31:10,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:10,975 INFO L350 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 177 treesize of output 143 [2023-02-15 13:31:10,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:10,996 INFO L350 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 1365 treesize of output 1351 [2023-02-15 13:31:11,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:11,020 INFO L350 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 1112 treesize of output 818 [2023-02-15 13:31:11,029 INFO L350 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 1167 treesize of output 1111 [2023-02-15 13:31:11,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:31:11,065 INFO L350 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 5424 treesize of output 5302 [2023-02-15 13:31:11,097 INFO L350 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 6242 treesize of output 5986 [2023-02-15 13:31:11,423 INFO L350 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 2209 treesize of output 2121