./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:49:55,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:49:55,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:49:55,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:49:55,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:49:55,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:49:55,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:49:55,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:49:55,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:49:55,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:49:55,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:49:55,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:49:55,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:49:55,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:49:55,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:49:55,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:49:55,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:49:55,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:49:55,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:49:55,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:49:55,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:49:55,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:49:55,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:49:55,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:49:55,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:49:55,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:49:55,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:49:55,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:49:55,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:49:55,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:49:55,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:49:55,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:49:55,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:49:55,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:49:55,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:49:55,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:49:55,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:49:55,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:49:55,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:49:55,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:49:55,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:49:55,648 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:49:55,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:49:55,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:49:55,688 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:49:55,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:49:55,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:49:55,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:49:55,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:49:55,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:49:55,690 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:49:55,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:49:55,692 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:49:55,692 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:49:55,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:49:55,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:49:55,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:49:55,693 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:49:55,694 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:49:55,694 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:49:55,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:49:55,695 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:49:55,695 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:49:55,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:49:55,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:49:55,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:49:55,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:49:55,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:49:55,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:49:55,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:49:55,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:49:55,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:49:55,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN 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 [2022-11-20 11:49:55,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:49:55,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:49:55,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:49:55,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:49:55,996 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:49:55,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2022-11-20 11:49:58,956 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:49:59,251 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:49:59,252 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2022-11-20 11:49:59,274 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/data/a01c6d84c/dc39450b78cd4577b545d44903a722b2/FLAGe8a02ab33 [2022-11-20 11:49:59,286 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/data/a01c6d84c/dc39450b78cd4577b545d44903a722b2 [2022-11-20 11:49:59,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:49:59,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:49:59,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:49:59,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:49:59,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:49:59,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111ddf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59, skipping insertion in model container [2022-11-20 11:49:59,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:49:59,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:49:59,609 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2022-11-20 11:49:59,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:49:59,628 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:49:59,698 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2022-11-20 11:49:59,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:49:59,738 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:49:59,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59 WrapperNode [2022-11-20 11:49:59,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:49:59,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:49:59,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:49:59,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:49:59,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,787 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2022-11-20 11:49:59,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:49:59,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:49:59,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:49:59,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:49:59,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,820 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:49:59,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:49:59,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:49:59,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:49:59,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (1/1) ... [2022-11-20 11:49:59,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:49:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:49:59,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:49:59,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:49:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-20 11:49:59,917 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-20 11:49:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:49:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:49:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:49:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:49:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:49:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:49:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:49:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:49:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:49:59,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:50:00,086 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:50:00,088 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:50:00,138 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-20 11:50:00,521 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:50:00,529 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:50:00,535 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 11:50:00,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:00 BoogieIcfgContainer [2022-11-20 11:50:00,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:50:00,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:50:00,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:50:00,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:50:00,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:49:59" (1/3) ... [2022-11-20 11:50:00,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6004a522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:50:00, skipping insertion in model container [2022-11-20 11:50:00,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:49:59" (2/3) ... [2022-11-20 11:50:00,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6004a522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:50:00, skipping insertion in model container [2022-11-20 11:50:00,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:50:00" (3/3) ... [2022-11-20 11:50:00,554 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2022-11-20 11:50:00,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:50:00,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-11-20 11:50:00,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:50:00,640 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=FINITE_AUTOMATA, 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;@73af2e88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:50:00,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-11-20 11:50:00,645 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) [2022-11-20 11:50:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 11:50:00,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:00,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 11:50:00,654 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)] === [2022-11-20 11:50:00,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-11-20 11:50:00,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:00,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360634614] [2022-11-20 11:50:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:00,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:00,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360634614] [2022-11-20 11:50:00,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360634614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:00,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:00,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745154184] [2022-11-20 11:50:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:00,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:00,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:00,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:00,938 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) [2022-11-20 11:50:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:01,044 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-11-20 11:50:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:01,046 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 [2022-11-20 11:50:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:01,053 INFO L225 Difference]: With dead ends: 93 [2022-11-20 11:50:01,054 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 11:50:01,056 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 [2022-11-20 11:50:01,059 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 [2022-11-20 11:50:01,072 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] [2022-11-20 11:50:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 11:50:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2022-11-20 11:50:01,108 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) [2022-11-20 11:50:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-11-20 11:50:01,111 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 4 [2022-11-20 11:50:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:01,111 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-11-20 11:50:01,112 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) [2022-11-20 11:50:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-11-20 11:50:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 11:50:01,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:01,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 11:50:01,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:50:01,113 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)] === [2022-11-20 11:50:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-11-20 11:50:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:01,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139699101] [2022-11-20 11:50:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:01,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:01,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139699101] [2022-11-20 11:50:01,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139699101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:01,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:01,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577367918] [2022-11-20 11:50:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:01,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:01,221 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) [2022-11-20 11:50:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:01,316 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-20 11:50:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:01,317 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 [2022-11-20 11:50:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:01,322 INFO L225 Difference]: With dead ends: 66 [2022-11-20 11:50:01,322 INFO L226 Difference]: Without dead ends: 66 [2022-11-20 11:50:01,323 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 [2022-11-20 11:50:01,325 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2022-11-20 11:50:01,325 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] [2022-11-20 11:50:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-20 11:50:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-20 11:50:01,330 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) [2022-11-20 11:50:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-11-20 11:50:01,331 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 4 [2022-11-20 11:50:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:01,332 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-11-20 11:50:01,332 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) [2022-11-20 11:50:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-11-20 11:50:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:50:01,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:01,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:01,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:50:01,333 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)] === [2022-11-20 11:50:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:01,334 INFO L85 PathProgramCache]: Analyzing trace with hash -401980428, now seen corresponding path program 1 times [2022-11-20 11:50:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:01,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485514680] [2022-11-20 11:50:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:01,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485514680] [2022-11-20 11:50:01,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485514680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:01,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:01,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747325059] [2022-11-20 11:50:01,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:01,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:01,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:01,530 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) [2022-11-20 11:50:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:01,648 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-11-20 11:50:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:01,648 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 [2022-11-20 11:50:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:01,649 INFO L225 Difference]: With dead ends: 108 [2022-11-20 11:50:01,650 INFO L226 Difference]: Without dead ends: 108 [2022-11-20 11:50:01,650 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 [2022-11-20 11:50:01,651 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 [2022-11-20 11:50:01,652 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] [2022-11-20 11:50:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-20 11:50:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2022-11-20 11:50:01,663 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) [2022-11-20 11:50:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-11-20 11:50:01,664 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 10 [2022-11-20 11:50:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:01,664 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-11-20 11:50:01,667 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) [2022-11-20 11:50:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-11-20 11:50:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:50:01,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:01,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:01,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:50:01,668 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)] === [2022-11-20 11:50:01,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash -401980427, now seen corresponding path program 1 times [2022-11-20 11:50:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:01,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41671221] [2022-11-20 11:50:01,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:01,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41671221] [2022-11-20 11:50:01,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41671221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:01,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:01,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:50:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798502063] [2022-11-20 11:50:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:01,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:01,792 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) [2022-11-20 11:50:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:01,869 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-11-20 11:50:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:01,870 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 [2022-11-20 11:50:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:01,871 INFO L225 Difference]: With dead ends: 110 [2022-11-20 11:50:01,871 INFO L226 Difference]: Without dead ends: 110 [2022-11-20 11:50:01,871 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 [2022-11-20 11:50:01,872 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 56 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:01,873 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.1s Time] [2022-11-20 11:50:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-20 11:50:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 62. [2022-11-20 11:50:01,878 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) [2022-11-20 11:50:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-11-20 11:50:01,878 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 10 [2022-11-20 11:50:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:01,879 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-11-20 11:50:01,879 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) [2022-11-20 11:50:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-11-20 11:50:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 11:50:01,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:01,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:01,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:50:01,880 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)] === [2022-11-20 11:50:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash -401981869, now seen corresponding path program 1 times [2022-11-20 11:50:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:01,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741788793] [2022-11-20 11:50:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:01,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:01,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741788793] [2022-11-20 11:50:01,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741788793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:01,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:01,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:50:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399395280] [2022-11-20 11:50:01,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:01,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:50:01,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:50:01,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:50:01,954 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) [2022-11-20 11:50:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:01,966 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-11-20 11:50:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:50:01,967 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 [2022-11-20 11:50:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:01,967 INFO L225 Difference]: With dead ends: 70 [2022-11-20 11:50:01,967 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 11:50:01,968 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 [2022-11-20 11:50:01,969 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 [2022-11-20 11:50:01,970 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] [2022-11-20 11:50:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 11:50:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-11-20 11:50:01,973 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) [2022-11-20 11:50:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-11-20 11:50:01,974 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 10 [2022-11-20 11:50:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:01,975 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-11-20 11:50:01,975 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) [2022-11-20 11:50:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-11-20 11:50:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:50:01,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:01,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:01,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:50:01,982 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)] === [2022-11-20 11:50:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 243865783, now seen corresponding path program 1 times [2022-11-20 11:50:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:01,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140369961] [2022-11-20 11:50:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:02,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140369961] [2022-11-20 11:50:02,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140369961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:02,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:02,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:50:02,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185493739] [2022-11-20 11:50:02,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:02,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:50:02,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:50:02,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:50:02,214 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) [2022-11-20 11:50:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:02,335 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-11-20 11:50:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:50:02,336 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 [2022-11-20 11:50:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:02,338 INFO L225 Difference]: With dead ends: 85 [2022-11-20 11:50:02,338 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 11:50:02,338 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 [2022-11-20 11:50:02,343 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 150 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:02,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 62 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 11:50:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2022-11-20 11:50:02,351 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) [2022-11-20 11:50:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-11-20 11:50:02,351 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-11-20 11:50:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:02,352 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-11-20 11:50:02,352 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) [2022-11-20 11:50:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-11-20 11:50:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:50:02,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:02,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:02,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:50:02,353 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)] === [2022-11-20 11:50:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash 243865784, now seen corresponding path program 1 times [2022-11-20 11:50:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:02,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736154972] [2022-11-20 11:50:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:02,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:02,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736154972] [2022-11-20 11:50:02,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736154972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:02,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:02,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:50:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182983883] [2022-11-20 11:50:02,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:02,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:50:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:02,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:50:02,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:50:02,623 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) [2022-11-20 11:50:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:02,790 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-11-20 11:50:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:50:02,791 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 [2022-11-20 11:50:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:02,792 INFO L225 Difference]: With dead ends: 85 [2022-11-20 11:50:02,793 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 11:50:02,794 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 [2022-11-20 11:50:02,796 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 88 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:02,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 84 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 11:50:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2022-11-20 11:50:02,806 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) [2022-11-20 11:50:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-11-20 11:50:02,810 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2022-11-20 11:50:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:02,810 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-11-20 11:50:02,810 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) [2022-11-20 11:50:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-11-20 11:50:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:50:02,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:02,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:02,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:50:02,812 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)] === [2022-11-20 11:50:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -27720857, now seen corresponding path program 1 times [2022-11-20 11:50:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:02,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861877380] [2022-11-20 11:50:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:02,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861877380] [2022-11-20 11:50:02,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861877380] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:02,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911367504] [2022-11-20 11:50:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:02,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:02,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:02,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:50:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:03,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:50:03,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:03,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:03,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911367504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:03,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:03,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-20 11:50:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547230205] [2022-11-20 11:50:03,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:03,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:50:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:03,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:50:03,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:50:03,208 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) [2022-11-20 11:50:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:03,232 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-11-20 11:50:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:50:03,233 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 [2022-11-20 11:50:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:03,236 INFO L225 Difference]: With dead ends: 85 [2022-11-20 11:50:03,236 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 11:50:03,237 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 [2022-11-20 11:50:03,238 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 33 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:03,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 231 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:50:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 11:50:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-11-20 11:50:03,257 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) [2022-11-20 11:50:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-11-20 11:50:03,260 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 16 [2022-11-20 11:50:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:03,260 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-11-20 11:50:03,261 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) [2022-11-20 11:50:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-11-20 11:50:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:50:03,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:03,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:03,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:03,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:03,476 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)] === [2022-11-20 11:50:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:03,477 INFO L85 PathProgramCache]: Analyzing trace with hash -868554549, now seen corresponding path program 1 times [2022-11-20 11:50:03,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:03,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573690865] [2022-11-20 11:50:03,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:03,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:03,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573690865] [2022-11-20 11:50:03,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573690865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:03,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772139841] [2022-11-20 11:50:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:03,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:03,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:03,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:50:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:03,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:50:03,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:03,863 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 [2022-11-20 11:50:03,899 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:50:03,899 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 [2022-11-20 11:50:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:03,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:04,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772139841] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:04,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:04,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-20 11:50:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309221796] [2022-11-20 11:50:04,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:04,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:50:04,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:04,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:50:04,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:50:04,030 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) [2022-11-20 11:50:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:04,129 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-11-20 11:50:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:50:04,130 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 [2022-11-20 11:50:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:04,130 INFO L225 Difference]: With dead ends: 96 [2022-11-20 11:50:04,131 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 11:50:04,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:50:04,132 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 96 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:04,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 114 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-11-20 11:50:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 11:50:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2022-11-20 11:50:04,135 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) [2022-11-20 11:50:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-11-20 11:50:04,135 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 18 [2022-11-20 11:50:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:04,136 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-11-20 11:50:04,136 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) [2022-11-20 11:50:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-11-20 11:50:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:50:04,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:04,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:04,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:04,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 11:50:04,343 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)] === [2022-11-20 11:50:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:04,343 INFO L85 PathProgramCache]: Analyzing trace with hash -868554548, now seen corresponding path program 1 times [2022-11-20 11:50:04,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:04,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315271506] [2022-11-20 11:50:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:04,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:04,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315271506] [2022-11-20 11:50:04,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315271506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:04,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9106138] [2022-11-20 11:50:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:04,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:04,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:04,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:50:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:04,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:50:04,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:04,721 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 [2022-11-20 11:50:04,727 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 [2022-11-20 11:50:04,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:04,803 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 [2022-11-20 11:50:04,812 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:50:04,813 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 [2022-11-20 11:50:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:04,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:11,018 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:50:17,156 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:50:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:50:17,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9106138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:17,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:17,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-11-20 11:50:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194564554] [2022-11-20 11:50:17,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:17,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:50:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:17,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:50:17,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:50:17,282 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) [2022-11-20 11:50:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:17,541 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-11-20 11:50:17,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:50:17,541 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 [2022-11-20 11:50:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:17,542 INFO L225 Difference]: With dead ends: 94 [2022-11-20 11:50:17,542 INFO L226 Difference]: Without dead ends: 94 [2022-11-20 11:50:17,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:50:17,543 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 328 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:17,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 75 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-11-20 11:50:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-20 11:50:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2022-11-20 11:50:17,546 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) [2022-11-20 11:50:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-11-20 11:50:17,546 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 18 [2022-11-20 11:50:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:17,546 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-11-20 11:50:17,547 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) [2022-11-20 11:50:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-11-20 11:50:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 11:50:17,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:17,548 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:17,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:17,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 11:50:17,753 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)] === [2022-11-20 11:50:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash 140768543, now seen corresponding path program 1 times [2022-11-20 11:50:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:17,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125496040] [2022-11-20 11:50:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 11:50:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125496040] [2022-11-20 11:50:17,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125496040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:17,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:17,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:50:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731145443] [2022-11-20 11:50:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:17,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:50:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:50:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:50:17,928 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) [2022-11-20 11:50:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:18,085 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-20 11:50:18,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:50:18,085 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 [2022-11-20 11:50:18,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:18,086 INFO L225 Difference]: With dead ends: 90 [2022-11-20 11:50:18,086 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 11:50:18,086 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 [2022-11-20 11:50:18,087 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 [2022-11-20 11:50:18,087 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] [2022-11-20 11:50:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 11:50:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2022-11-20 11:50:18,090 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) [2022-11-20 11:50:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-11-20 11:50:18,090 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 37 [2022-11-20 11:50:18,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:18,090 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-11-20 11:50:18,091 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) [2022-11-20 11:50:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-11-20 11:50:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 11:50:18,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:18,097 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:50:18,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:50:18,097 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)] === [2022-11-20 11:50:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:18,098 INFO L85 PathProgramCache]: Analyzing trace with hash 140768544, now seen corresponding path program 1 times [2022-11-20 11:50:18,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:18,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210513600] [2022-11-20 11:50:18,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:18,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 11:50:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:18,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210513600] [2022-11-20 11:50:18,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210513600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:18,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:18,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:50:18,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986361631] [2022-11-20 11:50:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:18,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:50:18,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:50:18,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:50:18,483 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) [2022-11-20 11:50:18,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:18,653 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-20 11:50:18,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:50:18,654 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 [2022-11-20 11:50:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:18,655 INFO L225 Difference]: With dead ends: 80 [2022-11-20 11:50:18,655 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 11:50:18,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:50:18,656 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 [2022-11-20 11:50:18,656 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] [2022-11-20 11:50:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 11:50:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-11-20 11:50:18,658 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) [2022-11-20 11:50:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-11-20 11:50:18,659 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 37 [2022-11-20 11:50:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:18,659 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-11-20 11:50:18,659 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) [2022-11-20 11:50:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-11-20 11:50:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:50:18,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:18,660 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] [2022-11-20 11:50:18,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:50:18,660 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)] === [2022-11-20 11:50:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2134585018, now seen corresponding path program 1 times [2022-11-20 11:50:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:18,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686520346] [2022-11-20 11:50:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:50:19,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:19,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686520346] [2022-11-20 11:50:19,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686520346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:19,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500358511] [2022-11-20 11:50:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:19,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:19,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:19,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:50:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:19,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 11:50:19,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:19,964 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 [2022-11-20 11:50:20,084 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:50:20,085 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 [2022-11-20 11:50:20,157 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 [2022-11-20 11:50:20,204 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 [2022-11-20 11:50:20,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:20,319 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 [2022-11-20 11:50:20,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:20,362 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 [2022-11-20 11:50:20,445 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 [2022-11-20 11:50:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:50:20,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:20,620 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 Int) (v_ArrVal_909 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_909))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_911))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2022-11-20 11:50:20,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:20,631 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 [2022-11-20 11:50:20,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:20,651 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 [2022-11-20 11:50:20,661 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 [2022-11-20 11:50:20,718 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 [2022-11-20 11:50:20,964 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 [2022-11-20 11:50:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 3 not checked. [2022-11-20 11:50:21,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500358511] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:21,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:21,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-11-20 11:50:21,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539339433] [2022-11-20 11:50:21,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:21,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 11:50:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:21,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 11:50:21,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=778, Unknown=1, NotChecked=56, Total=930 [2022-11-20 11:50:21,326 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) [2022-11-20 11:50:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:22,407 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2022-11-20 11:50:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:50:22,408 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 [2022-11-20 11:50:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:22,409 INFO L225 Difference]: With dead ends: 92 [2022-11-20 11:50:22,409 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 11:50:22,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=348, Invalid=1377, Unknown=1, NotChecked=80, Total=1806 [2022-11-20 11:50:22,410 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 339 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:22,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 430 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 557 Invalid, 0 Unknown, 152 Unchecked, 0.4s Time] [2022-11-20 11:50:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 11:50:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2022-11-20 11:50:22,427 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) [2022-11-20 11:50:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-11-20 11:50:22,428 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 39 [2022-11-20 11:50:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:22,428 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-11-20 11:50:22,428 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) [2022-11-20 11:50:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-11-20 11:50:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:50:22,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:22,430 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] [2022-11-20 11:50:22,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:22,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 11:50:22,636 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)] === [2022-11-20 11:50:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash -56889687, now seen corresponding path program 1 times [2022-11-20 11:50:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:22,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359292338] [2022-11-20 11:50:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 11:50:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359292338] [2022-11-20 11:50:22,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359292338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:22,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:22,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:50:22,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926570403] [2022-11-20 11:50:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:22,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:50:22,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:22,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:50:22,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:50:22,818 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) [2022-11-20 11:50:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:23,058 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-11-20 11:50:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:50:23,058 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 [2022-11-20 11:50:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:23,059 INFO L225 Difference]: With dead ends: 92 [2022-11-20 11:50:23,059 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 11:50:23,059 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 [2022-11-20 11:50:23,060 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 159 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:23,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 91 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:50:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 11:50:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2022-11-20 11:50:23,062 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) [2022-11-20 11:50:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-20 11:50:23,062 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 43 [2022-11-20 11:50:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:23,062 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-20 11:50:23,063 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) [2022-11-20 11:50:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-20 11:50:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:50:23,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:23,064 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] [2022-11-20 11:50:23,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:50:23,064 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)] === [2022-11-20 11:50:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash -56889686, now seen corresponding path program 1 times [2022-11-20 11:50:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:23,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846036344] [2022-11-20 11:50:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:23,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 11:50:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:23,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846036344] [2022-11-20 11:50:23,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846036344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:50:23,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:50:23,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:50:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303710269] [2022-11-20 11:50:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:50:23,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:50:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:50:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:50:23,456 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) [2022-11-20 11:50:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:23,645 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-11-20 11:50:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:50:23,646 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 [2022-11-20 11:50:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:23,646 INFO L225 Difference]: With dead ends: 76 [2022-11-20 11:50:23,646 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 11:50:23,647 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 [2022-11-20 11:50:23,647 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 172 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:23,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 49 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:50:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 11:50:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-11-20 11:50:23,649 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) [2022-11-20 11:50:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-11-20 11:50:23,649 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 43 [2022-11-20 11:50:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:23,650 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-11-20 11:50:23,650 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) [2022-11-20 11:50:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-11-20 11:50:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:50:23,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:23,651 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] [2022-11-20 11:50:23,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:50:23,651 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)] === [2022-11-20 11:50:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash -56889649, now seen corresponding path program 1 times [2022-11-20 11:50:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:23,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351475977] [2022-11-20 11:50:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:50:25,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:25,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351475977] [2022-11-20 11:50:25,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351475977] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:25,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844972350] [2022-11-20 11:50:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:25,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:25,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:25,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:25,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:50:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:25,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-20 11:50:25,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:25,276 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 [2022-11-20 11:50:25,372 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:50:25,372 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 [2022-11-20 11:50:25,408 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 [2022-11-20 11:50:25,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:25,453 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 [2022-11-20 11:50:25,476 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:50:25,476 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 [2022-11-20 11:50:25,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:50:25,584 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 11:50:25,585 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 [2022-11-20 11:50:25,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:25,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:50:25,670 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:50:25,671 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 [2022-11-20 11:50:25,988 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:50:25,989 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 [2022-11-20 11:50:26,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:26,027 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 [2022-11-20 11:50:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:50:26,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:26,358 INFO L321 Elim1Store]: treesize reduction 18, result has 73.9 percent of original size [2022-11-20 11:50:26,359 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 [2022-11-20 11:50:26,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:26,508 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 [2022-11-20 11:50:26,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:26,520 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 [2022-11-20 11:50:26,536 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 [2022-11-20 11:50:26,559 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 [2022-11-20 11:50:27,065 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 [2022-11-20 11:50:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:50:27,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844972350] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:27,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:27,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2022-11-20 11:50:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920809066] [2022-11-20 11:50:27,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:27,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 11:50:27,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 11:50:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1330, Unknown=6, NotChecked=0, Total=1482 [2022-11-20 11:50:27,243 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) [2022-11-20 11:50:29,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:29,143 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-11-20 11:50:29,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 11:50:29,144 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 [2022-11-20 11:50:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:29,145 INFO L225 Difference]: With dead ends: 100 [2022-11-20 11:50:29,145 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 11:50:29,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=537, Invalid=2649, Unknown=6, NotChecked=0, Total=3192 [2022-11-20 11:50:29,146 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 457 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:29,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 356 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 442 Invalid, 0 Unknown, 254 Unchecked, 0.4s Time] [2022-11-20 11:50:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 11:50:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2022-11-20 11:50:29,149 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) [2022-11-20 11:50:29,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-11-20 11:50:29,149 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 43 [2022-11-20 11:50:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:29,150 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-11-20 11:50:29,150 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) [2022-11-20 11:50:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-11-20 11:50:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 11:50:29,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:29,151 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] [2022-11-20 11:50:29,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:29,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:29,358 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)] === [2022-11-20 11:50:29,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash -56889648, now seen corresponding path program 1 times [2022-11-20 11:50:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:29,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626653995] [2022-11-20 11:50:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:50:30,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:50:30,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626653995] [2022-11-20 11:50:30,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626653995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:50:30,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320309853] [2022-11-20 11:50:30,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:30,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:50:30,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:50:30,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:50:31,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:50:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:50:31,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-20 11:50:31,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:50:31,269 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 [2022-11-20 11:50:31,391 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:50:31,391 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 [2022-11-20 11:50:31,442 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 [2022-11-20 11:50:31,448 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 [2022-11-20 11:50:31,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:31,509 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 [2022-11-20 11:50:31,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:31,524 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 [2022-11-20 11:50:31,548 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:50:31,549 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 [2022-11-20 11:50:31,556 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 [2022-11-20 11:50:31,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:50:31,695 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 11:50:31,696 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 [2022-11-20 11:50:31,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:50:31,715 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-20 11:50:31,716 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 [2022-11-20 11:50:31,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:50:31,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:31,919 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:50:31,920 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 [2022-11-20 11:50:31,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:50:31,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:50:31,932 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-20 11:50:31,932 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 [2022-11-20 11:50:32,336 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:50:32,337 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 [2022-11-20 11:50:32,344 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:50:32,345 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 [2022-11-20 11:50:32,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:32,397 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 [2022-11-20 11:50:32,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:32,427 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 [2022-11-20 11:50:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 11:50:32,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:50:35,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:35,326 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 [2022-11-20 11:50:40,532 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse13 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.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)) (.cse12 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (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 ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse0 v_prenex_2 (store (select .cse0 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 ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse3 v_prenex_2 (store (select .cse3 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 ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |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 ((|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 ((.cse5 (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|) .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 (= .cse5 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 ((.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) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~head~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|) .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 (= .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) .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 ((.cse11 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |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|) .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 (< .cse11 .cse12) (< .cse11 .cse13)))) (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |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|) .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 ((.cse16 (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|) .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 (= .cse16 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) (= .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse18 v_prenex_2 (store (select .cse18 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 (= |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 |c_#memory_$Pointer$.base| |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|) .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 (= .cse19 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse21 v_prenex_2 (store (select .cse21 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 ((.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (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.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|) (< .cse22 .cse12) (< .cse22 .cse13)))) (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 ((.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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse25 (store |c_#memory_$Pointer$.base| |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|) .cse2) |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 ((.cse26 (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))) (or (forall ((v_prenex_2 Int)) (or (= .cse26 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 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))))) (= .cse26 |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 ((.cse29 (select (select (let ((.cse30 (store |c_#memory_$Pointer$.base| |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|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse29 |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)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse31 |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 ((.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) |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 ((.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 |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 ((.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) (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) .cse12) (= (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_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 ((.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|) .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 ((.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|) .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))) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse45 v_prenex_2 (store (select .cse45 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 (= |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 ((.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|) .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 ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse47 v_prenex_2 (store (select .cse47 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 ((.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|) .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 ((.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) .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 ((.cse50 (select (select (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |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 (< .cse50 .cse12) (< .cse50 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse52 (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|) .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 (= .cse52 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 ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse53 v_prenex_2 (store (select .cse53 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))))) (= .cse52 |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 ((.cse55 (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 (= .cse55 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse57 v_prenex_2 (store (select .cse57 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 ((.cse59 (select (select (let ((.cse60 (store |c_#memory_$Pointer$.base| |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|) .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 ((.cse58 (store |c_#memory_$Pointer$.offset| |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|) .cse2) .cse12) (= .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse59 |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 ((.cse61 (select (select (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse63 |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 (< .cse61 .cse12) (= (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) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< .cse61 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse64 (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|) .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|) (= .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse64 |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 ((.cse66 (select (select (let ((.cse68 (store |c_#memory_$Pointer$.offset| |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|) .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 (< .cse66 .cse12) (= (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|) .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|) (< .cse66 .cse13)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse70 (select (select (let ((.cse72 (store |c_#memory_$Pointer$.base| |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|) .cse2)) (.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|) .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 (< .cse69 .cse12) (= .cse70 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse69 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse73 (store |c_#memory_$Pointer$.base| |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|) .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 ((.cse74 (select (select (let ((.cse75 (store |c_#memory_$Pointer$.offset| |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|) .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 (< .cse74 .cse12) (< .cse74 .cse13)))))) (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))) (= (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|) .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 ((.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|) .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 (< .cse77 .cse12) (< .cse77 .cse13)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse79 (select (select (let ((.cse81 (store |c_#memory_$Pointer$.offset| |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|) .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|) (< .cse79 .cse12) (= (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|) .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|) (< .cse79 .cse13)))) (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 ((.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|) .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 ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse83 v_prenex_2 (store (select .cse83 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) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (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|) .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 ((.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) .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 ((|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))) (= (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|) .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))) (< (select (select (let ((.cse87 (store |c_#memory_$Pointer$.offset| |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|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse12)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2022-11-20 11:50:43,569 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse12 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse13 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (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_1645 (Array Int Int))) (let ((.cse0 (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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse0 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse1 v_prenex_2 (store (select .cse1 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|) .cse4)))))))))) (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 ((.cse7 (select (select (let ((.cse9 (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 .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |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|) .cse4))) (or (forall ((v_prenex_2 Int)) (or (= .cse7 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 ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse8 v_prenex_2 (store (select .cse8 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|) .cse4))))) (= .cse7 |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)) (let ((.cse11 (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= (select (select (let ((.cse10 (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 .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|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse11 .cse12) (< .cse11 .cse13)))) (forall ((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 .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< .cse15 .cse12) (< .cse15 .cse13)))) (= |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 ((.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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (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 ((.cse18 (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 .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|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .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|) .cse4)) (= |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_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 ((.cse20 (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 .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse20 |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|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 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 .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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse22 |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)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse24 (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |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|) .cse4))) (or (< .cse24 .cse12) (< .cse24 .cse13)))) (= (select (select (let ((.cse26 (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 .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.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |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 ((.cse27 (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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse27 |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|) (= .cse27 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 .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .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)) (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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) 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 ((.cse31 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (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 ((.cse32 (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 .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|) .cse4) 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 .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (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 ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .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 ((.cse35 (select (select (let ((.cse37 (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 .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse37 |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|) .cse4))) (or (= .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse35 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse36 v_prenex_2 (store (select .cse36 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|) .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)) (let ((.cse38 (select (select (let ((.cse39 (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 .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|) .cse4))) (or (= .cse38 |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|) (= .cse38 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 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .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|) .cse4))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse41 (select (select (let ((.cse42 (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 .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|) .cse4))) (or (= .cse41 |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|) (= .cse41 |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 ((.cse43 (select (select (let ((.cse44 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse43 .cse12) (< .cse43 .cse13)))) (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 .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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (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 .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (= .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 .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 .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse50 |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|) .cse4))) (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 .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse12) (= .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 .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 .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |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|) .cse4) |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 .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse13))) (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 .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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) 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 .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (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 .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) (.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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse56 .cse12) (< .cse56 .cse13) (= .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 (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse12)) (= |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 ((.cse60 (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 .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.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |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 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse61 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |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|) .cse4) .cse12) (= (select (select (let ((.cse62 (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 .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|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~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 ((.cse63 (select (select (let ((.cse64 (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 .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|) .cse4))) (or (= .cse63 v_prenex_2) (= .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse65 v_prenex_2 (store (select .cse65 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|) .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)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse66 (select (select (let ((.cse67 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse67 |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|) .cse4))) (or (< .cse66 .cse12) (< .cse66 .cse13)))) (= (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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |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 ((.cse69 (select (select (let ((.cse71 (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 .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |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|) .cse4))) (or (= .cse69 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse69 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse70 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse70 v_prenex_2 (store (select .cse70 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|) .cse4)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse72 v_prenex_2 (store (select .cse72 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|) .cse4))) (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 .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< .cse73 .cse12) (< .cse73 .cse13) (= (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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (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 ((.cse76 (select (select (let ((.cse77 (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 .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.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse76 v_prenex_2) (= .cse76 |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 ((.cse78 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (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 ((.cse79 (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 .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|) .cse4) 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 ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .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 ((.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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse82 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |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 .cse82 v_prenex_2 (store (select .cse82 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|) .cse4)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (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 .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< .cse83 .cse12) (< .cse83 .cse13)))) (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 .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 .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|) .cse4) 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 .cse3 |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) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (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 .cse3 |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|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= (select (select (let ((.cse87 (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 .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse87 |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|) .cse4) |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 .cse12) (< .cse88 .cse13)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2022-11-20 11:50:43,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:43,962 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 [2022-11-20 11:50:43,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:43,991 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 [2022-11-20 11:50:44,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:44,036 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 [2022-11-20 11:50:44,055 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 [2022-11-20 11:50:44,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:50:44,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:50:44,100 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 [2022-11-20 11:50:44,120 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 [2022-11-20 11:50:44,272 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 [2022-11-20 11:50:44,768 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 [2022-11-20 11:50:44,785 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 [2022-11-20 11:50:44,799 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,800 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 [2022-11-20 11:50:44,815 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,815 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 [2022-11-20 11:50:44,826 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,826 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 [2022-11-20 11:50:44,841 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,841 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 [2022-11-20 11:50:44,856 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,857 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 [2022-11-20 11:50:44,871 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,872 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 [2022-11-20 11:50:44,885 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,885 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 [2022-11-20 11:50:44,895 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,895 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 [2022-11-20 11:50:44,909 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,909 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 [2022-11-20 11:50:44,923 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,924 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 [2022-11-20 11:50:44,939 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,939 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 [2022-11-20 11:50:44,953 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,953 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 [2022-11-20 11:50:44,964 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,964 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 [2022-11-20 11:50:44,975 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,976 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 [2022-11-20 11:50:44,982 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:50:44,996 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:44,997 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 [2022-11-20 11:50:45,004 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-20 11:50:45,018 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,018 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 [2022-11-20 11:50:45,034 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,034 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 [2022-11-20 11:50:45,048 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,049 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 [2022-11-20 11:50:45,061 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,061 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 [2022-11-20 11:50:45,076 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,076 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 [2022-11-20 11:50:45,089 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,090 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 [2022-11-20 11:50:45,104 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,104 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 [2022-11-20 11:50:45,119 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,119 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 [2022-11-20 11:50:45,138 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,139 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 [2022-11-20 11:50:45,153 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,153 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 [2022-11-20 11:50:45,167 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,167 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 [2022-11-20 11:50:45,181 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,181 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 [2022-11-20 11:50:45,195 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,195 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 [2022-11-20 11:50:45,209 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,210 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 [2022-11-20 11:50:45,221 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,222 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 [2022-11-20 11:50:45,236 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-20 11:50:45,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 [2022-11-20 11:50:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2022-11-20 11:50:45,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320309853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:50:45,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:50:45,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 41 [2022-11-20 11:50:45,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106106110] [2022-11-20 11:50:45,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:50:45,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 11:50:45,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:50:45,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 11:50:45,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1422, Unknown=3, NotChecked=154, Total=1722 [2022-11-20 11:50:45,715 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) [2022-11-20 11:50:48,688 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (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 ((.cse2 (select .cse6 .cse1)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (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) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~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_~last~0#1.base|) 1) (or (let ((.cse13 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse14 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (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_1645 (Array Int Int))) (let ((.cse3 (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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse3 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse4 v_prenex_2 (store (select .cse4 v_prenex_2) .cse5 |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_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 ((.cse8 (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|) .cse5 |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 (= .cse8 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 ((.cse9 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse9 v_prenex_2 (store (select .cse9 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse8 |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)) (let ((.cse12 (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |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|) .cse5 |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|) .cse5 |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 .cse14)))) (forall ((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 .cse6 |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|) .cse5 |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 .cse13) (< .cse16 .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 ((.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|) .cse5 |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_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 ((.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|) .cse5 |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 ((.cse20 (store (store |c_#memory_$Pointer$.offset| |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_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) .cse5 |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))) (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 (= (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|) .cse5 |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))) (< (select (select (let ((.cse22 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |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_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse23 (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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse23 |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)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse25 (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse25 .cse13) (< .cse25 .cse14)))) (= (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|) .cse5 |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 ((.cse28 (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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse28 |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|) (= .cse28 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 .cse6 |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) .cse5 |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 ((.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|) .cse5 |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 ((.cse32 (store (store |c_#memory_$Pointer$.offset| |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_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) .cse5 |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 ((.cse33 (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 .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |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 ((.cse34 (store (store |c_#memory_$Pointer$.offset| |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_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) .cse5 |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_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 ((.cse35 (store (store |c_#memory_$Pointer$.offset| |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_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) .cse5 |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|) .cse5 |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 .cse6 |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) .cse5 |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|) .cse5 |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 .cse6 |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) .cse5 |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) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse42 (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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse42 |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|) (= .cse42 |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 ((.cse44 (select (select (let ((.cse45 (store (store |c_#memory_$Pointer$.offset| |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_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|) .cse5 |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|) (< .cse44 .cse13) (< .cse44 .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)) (let ((.cse46 (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|) .cse5 |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 (= .cse46 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 ((.cse47 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse47 v_prenex_2 (store (select .cse47 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse46 |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 ((.cse49 (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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse49 |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 ((.cse50 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13) (= .cse49 |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 ((.cse52 (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 .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |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 ((.cse53 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |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|) .cse5 |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_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 ((.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|) .cse5 |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 ((.cse55 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse55 v_prenex_2 (store (select .cse55 v_prenex_2) .cse5 |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 ((.cse57 (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |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_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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse57 .cse13) (< .cse57 .cse14) (= .cse56 |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 (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |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|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13)) (= |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 ((.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|) .cse5 |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_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 .cse6 |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|) .cse5 |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|) .cse5 |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_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|) .cse5 |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 .cse6 |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) .cse5 |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 .cse6 |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|) .cse5 |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 .cse14)))) (= (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|) .cse5 |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|) .cse5 |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 .cse6 |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) .cse5 |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_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse73 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse73 v_prenex_2 (store (select .cse73 v_prenex_2) .cse5 |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 ((.cse74 (select (select (let ((.cse76 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse74 .cse13) (< .cse74 .cse14) (= (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|) .cse5 |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_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|) .cse5 |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 .cse6 |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) .cse5 |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|) .cse5 |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 .cse6 |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) .cse5 |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|) .cse5 |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 .cse6 |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) .cse5 |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_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse84 (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse84 .cse13) (< .cse84 .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)) (= (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|) .cse5 |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 ((.cse87 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse87 v_prenex_2 (store (select .cse87 v_prenex_2) .cse5 |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 ((.cse89 (select (select (let ((.cse90 (store (store |c_#memory_$Pointer$.offset| |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_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse90 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse90 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |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 ((.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|) .cse5 |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|) (< .cse89 .cse13) (< .cse89 .cse14)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (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 [2022-11-20 11:50:50,746 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|) (= (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|)) (or (let ((.cse14 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse13 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (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 ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse2 v_prenex_2 (store (select .cse2 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 ((.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) .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 ((.cse5 (store |c_#memory_$Pointer$.base| |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|) .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 ((|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 ((.cse6 (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|) .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 (= .cse6 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 ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse7 v_prenex_2 (store (select .cse7 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))))) (= .cse6 |c_ULTIMATE.start_dll_circular_create_~head~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 ((.cse9 (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|) .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 (= .cse9 v_prenex_2) (= .cse9 |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 ((.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) .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 ((.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|) .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 (< .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|) .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 ((.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|) .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 (= .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) .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 (= |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 ((.cse20 (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|) .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 (= .cse20 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse22 v_prenex_2 (store (select .cse22 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 ((.cse23 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (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.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|) (< .cse23 .cse13) (< .cse23 .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 ((.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)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |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|) .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 ((|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 ((.cse27 (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))) (or (forall ((v_prenex_2 Int)) (or (= .cse27 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 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))))) (= .cse27 |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 ((.cse30 (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |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|) .cse0))) (or (= .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse30 |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)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse14)) (= (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) |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 ((.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 |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 ((.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) (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) .cse13) (= (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_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 ((.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|) .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 ((.cse45 (store |c_#memory_$Pointer$.offset| |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|) .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))) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse46 (store |c_#memory_$Pointer$.offset| |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|) .cse0))) (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|) .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 ((.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) .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 ((.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|) .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 ((.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) .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 ((.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|) .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 (< .cse51 .cse13) (< .cse51 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse53 (select (select (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse55 |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 (= .cse53 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 ((.cse54 (store |c_#memory_$Pointer$.offset| |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|) .cse0))))) (= .cse53 |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 ((.cse56 (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 (= .cse56 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse58 v_prenex_2 (store (select .cse58 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 ((.cse60 (select (select (let ((.cse61 (store |c_#memory_$Pointer$.base| |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|) .cse0))) (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 |c_#memory_$Pointer$.offset| |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|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13) (= .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse60 |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 ((.cse62 (select (select (let ((.cse64 (store |c_#memory_$Pointer$.offset| |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|) .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 (< .cse62 .cse13) (= (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) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< .cse62 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse65 (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|) .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|) (= .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse65 |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 ((.cse67 (select (select (let ((.cse69 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse67 .cse13) (= (select (select (let ((.cse68 (store |c_#memory_$Pointer$.base| |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|) .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|) (< .cse67 .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 ((.cse71 (select (select (let ((.cse73 (store |c_#memory_$Pointer$.base| |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|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (.cse70 (select (select (let ((.cse72 (store |c_#memory_$Pointer$.offset| |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|) .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 (< .cse70 .cse13) (= .cse71 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse70 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (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|) .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 ((.cse75 (select (select (let ((.cse76 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse75 .cse13) (< .cse75 .cse14)))))) (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))) (= (select (select (let ((.cse77 (store |c_#memory_$Pointer$.base| |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|) .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 ((.cse78 (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))) (or (< .cse78 .cse13) (< .cse78 .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 ((.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|) .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|) (< .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|) .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|) (< .cse80 .cse14)))) (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|) .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 ((.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) .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) (|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|) .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 ((.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) .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 ((|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))) (= (select (select (let ((.cse87 (store |c_#memory_$Pointer$.base| |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|) .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))) (< (select (select (let ((.cse88 (store |c_#memory_$Pointer$.offset| |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|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (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 [2022-11-20 11:50:53,594 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse95 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse10 (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 ((.cse4 (select .cse10 .cse1)) (.cse5 (select .cse2 .cse95)) (.cse6 (select .cse7 .cse95)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.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|) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 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|) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 .cse5) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= (+ .cse5 12) (select |c_#length| .cse6)) (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) (= 12 (select |c_#length| (select .cse7 .cse3))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (let ((.cse17 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse18 (+ 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_1645 (Array Int Int))) (let ((.cse8 (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))) (or (= .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse8 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse9 v_prenex_2 (store (select .cse9 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_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 ((.cse12 (select (select (let ((.cse14 (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 .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.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse12 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 ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse12 |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)) (let ((.cse16 (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (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|) (< .cse16 .cse17) (< .cse16 .cse18)))) (forall ((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 ((.cse20 (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse20 .cse17) (< .cse20 .cse18)))) (= |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 ((.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|) .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_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 ((.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) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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)) (= |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_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 ((.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) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |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) .cse18)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse27 (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|) .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 (= .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse27 |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)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse29 (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse30 |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 (< .cse29 .cse17) (< .cse29 .cse18)))) (= (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) |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 ((.cse32 (select (select (let ((.cse33 (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 .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|) .cse1))) (or (= .cse32 |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|) (= .cse32 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 .cse10 |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) .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 ((.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|) .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 ((.cse36 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse36 v_prenex_2 (store (select .cse36 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 ((.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|) .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 ((.cse38 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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) .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_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 ((.cse39 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse39 v_prenex_2 (store (select .cse39 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 ((.cse40 (select (select (let ((.cse42 (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 .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.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse40 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 .cse10 |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)))))))) (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 ((.cse43 (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|) .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 (= .cse43 |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|) (= .cse43 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 ((.cse45 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse45 v_prenex_2 (store (select .cse45 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) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse46 (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 (= .cse46 |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|) (= .cse46 |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 ((.cse48 (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse48 .cse17) (< .cse48 .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)) (let ((.cse50 (select (select (let ((.cse52 (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 .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.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse50 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 ((.cse51 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse50 |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 ((.cse53 (select (select (let ((.cse55 (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 .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse55 |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 (= .cse53 |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 ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse17) (= .cse53 |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 ((.cse56 (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 .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse56 |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 ((.cse57 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse18))) (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 ((.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|) .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 ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse59 v_prenex_2 (store (select .cse59 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 ((.cse61 (select (select (let ((.cse63 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.cse60 (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|) .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 (= .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse61 .cse17) (< .cse61 .cse18) (= .cse60 |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 (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse64 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse17)) (= |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 ((.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) |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 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .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|) .cse1) .cse17) (= (select (select (let ((.cse67 (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 .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|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~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 ((.cse68 (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))) (or (= .cse68 v_prenex_2) (= .cse68 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse70 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse70 v_prenex_2 (store (select .cse70 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 ((.cse71 (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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|) .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 (< .cse71 .cse17) (< .cse71 .cse18)))) (= (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|) .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 ((.cse74 (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))) (or (= .cse74 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse74 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 .cse10 |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) .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_1641 Int) (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 .cse10 |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) .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 ((.cse78 (select (select (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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|) .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 (< .cse78 .cse17) (< .cse78 .cse18) (= (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|) .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_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 ((.cse81 (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))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse81 v_prenex_2) (= .cse81 |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 ((.cse83 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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))))) (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 ((.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|) .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 ((.cse85 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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) .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 ((.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|) .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 ((.cse87 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .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|) .cse1)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1646 (Array Int 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 .cse10 |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|) .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 (< .cse88 .cse17) (< .cse88 .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)) (= (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) 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 ((.cse91 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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) .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 ((.cse93 (select (select (let ((.cse94 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse10 |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 .cse94 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse94 |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 ((.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|) .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|) (< .cse93 .cse17) (< .cse93 .cse18)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (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 [2022-11-20 11:50:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:50:55,092 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-20 11:50:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:50:55,092 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 [2022-11-20 11:50:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:50:55,093 INFO L225 Difference]: With dead ends: 83 [2022-11-20 11:50:55,093 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 11:50:55,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=279, Invalid=2285, Unknown=6, NotChecked=510, Total=3080 [2022-11-20 11:50:55,095 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 71 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:50:55,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 332 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 509 Invalid, 0 Unknown, 348 Unchecked, 1.1s Time] [2022-11-20 11:50:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 11:50:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2022-11-20 11:50:55,098 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) [2022-11-20 11:50:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-11-20 11:50:55,099 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 43 [2022-11-20 11:50:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:50:55,100 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-11-20 11:50:55,100 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) [2022-11-20 11:50:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-11-20 11:50:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 11:50:55,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:50:55,101 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] [2022-11-20 11:50:55,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:50:55,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 11:50:55,308 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)] === [2022-11-20 11:50:55,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:50:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1163623530, now seen corresponding path program 1 times [2022-11-20 11:50:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:50:55,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746457452] [2022-11-20 11:50:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:50:55,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:50:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:51:00,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746457452] [2022-11-20 11:51:00,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746457452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:51:00,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172528544] [2022-11-20 11:51:00,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:51:00,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:51:00,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:51:00,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:51:00,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c279b6ae-628e-4701-85cd-11406533119d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:51:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:51:01,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-20 11:51:01,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:51:01,807 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:51:01,808 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 [2022-11-20 11:51:02,352 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 11:51:02,353 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 [2022-11-20 11:51:02,684 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 [2022-11-20 11:51:02,905 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 [2022-11-20 11:51:03,410 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 11:51:03,411 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 [2022-11-20 11:51:03,669 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 [2022-11-20 11:51:03,688 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 [2022-11-20 11:51:03,708 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 [2022-11-20 11:51:03,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:03,938 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 [2022-11-20 11:51:03,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:03,982 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 [2022-11-20 11:51:04,003 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 [2022-11-20 11:51:04,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:51:04,081 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 [2022-11-20 11:51:04,097 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 [2022-11-20 11:51:04,114 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 [2022-11-20 11:51:04,616 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 [2022-11-20 11:51:04,630 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 [2022-11-20 11:51:04,646 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 [2022-11-20 11:51:04,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:04,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:51:04,926 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:51:04,926 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 [2022-11-20 11:51:04,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:04,962 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 [2022-11-20 11:51:04,994 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 [2022-11-20 11:51:05,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:05,607 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:51:05,607 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 [2022-11-20 11:51:05,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:05,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:51:05,628 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 [2022-11-20 11:51:05,652 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 [2022-11-20 11:51:05,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:51:05,866 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-20 11:51:05,866 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 [2022-11-20 11:51:05,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:51:05,877 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 [2022-11-20 11:51:06,370 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 [2022-11-20 11:51:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:51:06,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:12,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:51:12,641 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 [2022-11-20 11:51:12,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:51:12,675 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 [2022-11-20 11:51:12,693 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 1583 treesize of output 1527 [2022-11-20 11:51:12,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:51:12,752 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 1316 treesize of output 918 [2022-11-20 11:51:12,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:51:12,819 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 [2022-11-20 11:51:12,892 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 [2022-11-20 11:51:13,011 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 [2022-11-20 11:53:17,486 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 4422 treesize of output 4314