./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.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_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- 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 20:10:33,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:10:33,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:10:33,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:10:33,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:10:33,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:10:33,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:10:33,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:10:33,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:10:33,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:10:33,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:10:33,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:10:33,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:10:33,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:10:33,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:10:33,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:10:33,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:10:33,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:10:33,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:10:33,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:10:33,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:10:33,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:10:33,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:10:33,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:10:34,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:10:34,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:10:34,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:10:34,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:10:34,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:10:34,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:10:34,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:10:34,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:10:34,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:10:34,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:10:34,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:10:34,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:10:34,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:10:34,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:10:34,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:10:34,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:10:34,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:10:34,024 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-20 20:10:34,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:10:34,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:10:34,064 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:10:34,064 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:10:34,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:10:34,065 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:10:34,066 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:10:34,066 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:10:34,066 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:10:34,066 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:10:34,068 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:10:34,068 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:10:34,068 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:10:34,069 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:10:34,069 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:10:34,069 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:10:34,070 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:10:34,070 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:10:34,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:10:34,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:10:34,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:10:34,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:10:34,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:10:34,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:10:34,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:10:34,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:10:34,073 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:10:34,073 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:10:34,074 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 20:10:34,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:10:34,074 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:10:34,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:10:34,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:10:34,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:10:34,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:10:34,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:10:34,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:10:34,077 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:10:34,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:10:34,077 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:10:34,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:10:34,078 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:10:34,078 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_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/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_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9 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 -> Taipan 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-11-20 20:10:34,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:10:34,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:10:34,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:10:34,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:10:34,469 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:10:34,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-11-20 20:10:37,457 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:10:37,751 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:10:37,752 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-11-20 20:10:37,765 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/data/3f7e50799/42693c5542e6463bbe5fa4b499d16bd4/FLAG3cee14609 [2022-11-20 20:10:37,782 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/data/3f7e50799/42693c5542e6463bbe5fa4b499d16bd4 [2022-11-20 20:10:37,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:10:37,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:10:37,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:10:37,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:10:37,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:10:37,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:10:37" (1/1) ... [2022-11-20 20:10:37,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c829ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:37, skipping insertion in model container [2022-11-20 20:10:37,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:10:37" (1/1) ... [2022-11-20 20:10:37,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:10:37,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:10:38,324 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_54a0b76a-7f75-4917-b427-6664c123931f/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-11-20 20:10:38,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:10:38,348 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:10:38,397 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_54a0b76a-7f75-4917-b427-6664c123931f/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-11-20 20:10:38,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:10:38,435 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:10:38,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38 WrapperNode [2022-11-20 20:10:38,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:10:38,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:10:38,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:10:38,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:10:38,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,487 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2022-11-20 20:10:38,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:10:38,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:10:38,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:10:38,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:10:38,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,521 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:10:38,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:10:38,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:10:38,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:10:38,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (1/1) ... [2022-11-20 20:10:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:10:38,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:38,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:10:38,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:10:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:10:38,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:10:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 20:10:38,621 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 20:10:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:10:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:10:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:10:38,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:10:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:10:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:10:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 20:10:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:10:38,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:10:38,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:10:38,771 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:10:38,772 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:10:39,294 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:10:39,353 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:10:39,353 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 20:10:39,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:10:39 BoogieIcfgContainer [2022-11-20 20:10:39,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:10:39,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:10:39,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:10:39,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:10:39,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:10:37" (1/3) ... [2022-11-20 20:10:39,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac943cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:10:39, skipping insertion in model container [2022-11-20 20:10:39,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:10:38" (2/3) ... [2022-11-20 20:10:39,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac943cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:10:39, skipping insertion in model container [2022-11-20 20:10:39,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:10:39" (3/3) ... [2022-11-20 20:10:39,365 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-11-20 20:10:39,385 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:10:39,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-20 20:10:39,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:10:39,437 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;@407acd02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:10:39,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-11-20 20:10:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 77 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 20:10:39,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:39,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 20:10:39,450 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:10:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1977358206, now seen corresponding path program 1 times [2022-11-20 20:10:39,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:39,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714158839] [2022-11-20 20:10:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:39,822 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 20:10:39,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:39,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714158839] [2022-11-20 20:10:39,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714158839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:39,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:39,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:10:39,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848115903] [2022-11-20 20:10:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:39,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:10:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:39,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:10:39,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:10:39,864 INFO L87 Difference]: Start difference. First operand has 81 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 77 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:10:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:39,984 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-11-20 20:10:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:10:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 20:10:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:40,000 INFO L225 Difference]: With dead ends: 87 [2022-11-20 20:10:40,001 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 20:10:40,002 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 20:10:40,008 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:40,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 20:10:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-11-20 20:10:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 38 states have (on average 2.236842105263158) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-20 20:10:40,055 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 6 [2022-11-20 20:10:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:40,056 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-20 20:10:40,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:10:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-20 20:10:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 20:10:40,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:40,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 20:10:40,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:10:40,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:10:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2132845308, now seen corresponding path program 1 times [2022-11-20 20:10:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:40,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614162882] [2022-11-20 20:10:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:40,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:40,137 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 20:10:40,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:40,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614162882] [2022-11-20 20:10:40,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614162882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:40,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:40,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:10:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304951047] [2022-11-20 20:10:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:40,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:10:40,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:10:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:10:40,141 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:10:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:40,277 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-11-20 20:10:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:10:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 20:10:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:40,304 INFO L225 Difference]: With dead ends: 78 [2022-11-20 20:10:40,304 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 20:10:40,308 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 20:10:40,311 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:40,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 104 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 20:10:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-20 20:10:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-11-20 20:10:40,329 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 6 [2022-11-20 20:10:40,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:40,330 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-11-20 20:10:40,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:10:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-11-20 20:10:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 20:10:40,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:40,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 20:10:40,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:10:40,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:10:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:40,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2132845309, now seen corresponding path program 1 times [2022-11-20 20:10:40,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:40,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073869272] [2022-11-20 20:10:40,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:40,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:40,489 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 20:10:40,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:40,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073869272] [2022-11-20 20:10:40,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073869272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:40,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:40,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:10:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071386871] [2022-11-20 20:10:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:40,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:10:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:10:40,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:10:40,493 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:10:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:40,590 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-11-20 20:10:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:10:40,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 20:10:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:40,592 INFO L225 Difference]: With dead ends: 76 [2022-11-20 20:10:40,592 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 20:10:40,592 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 20:10:40,593 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:40,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 20:10:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-20 20:10:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 72 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-20 20:10:40,600 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 6 [2022-11-20 20:10:40,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:40,601 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-20 20:10:40,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:10:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-20 20:10:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 20:10:40,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:40,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:40,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:10:40,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:10:40,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash -399588339, now seen corresponding path program 1 times [2022-11-20 20:10:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:40,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136288266] [2022-11-20 20:10:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:40,736 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 20:10:40,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:40,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136288266] [2022-11-20 20:10:40,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136288266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:40,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:40,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:10:40,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525633737] [2022-11-20 20:10:40,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:40,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:10:40,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:40,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:10:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:10:40,741 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 20:10:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:40,919 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-11-20 20:10:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:10:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-20 20:10:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:40,923 INFO L225 Difference]: With dead ends: 76 [2022-11-20 20:10:40,924 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 20:10:40,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:10:40,936 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:40,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 212 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 20:10:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-20 20:10:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 71 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-11-20 20:10:40,944 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2022-11-20 20:10:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:40,944 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-11-20 20:10:40,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 20:10:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-11-20 20:10:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 20:10:40,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:40,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:40,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:10:40,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:10:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash -399588338, now seen corresponding path program 1 times [2022-11-20 20:10:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:40,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648745242] [2022-11-20 20:10:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:40,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:41,203 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 20:10:41,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:41,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648745242] [2022-11-20 20:10:41,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648745242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:10:41,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:10:41,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:10:41,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354150855] [2022-11-20 20:10:41,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:10:41,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:10:41,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:41,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:10:41,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:10:41,211 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 20:10:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:41,385 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-11-20 20:10:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:10:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-20 20:10:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:41,390 INFO L225 Difference]: With dead ends: 75 [2022-11-20 20:10:41,391 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 20:10:41,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:10:41,397 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:41,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 248 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 20:10:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-20 20:10:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 70 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:10:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-11-20 20:10:41,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2022-11-20 20:10:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:41,407 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-11-20 20:10:41,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 20:10:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-11-20 20:10:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:10:41,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:41,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:41,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:10:41,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:10:41,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1876340112, now seen corresponding path program 1 times [2022-11-20 20:10:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:41,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726413811] [2022-11-20 20:10:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:10:41,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:41,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726413811] [2022-11-20 20:10:41,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726413811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:41,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033516721] [2022-11-20 20:10:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:41,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:41,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:41,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:41,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:10:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:41,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:10:41,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:10:41,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:10:41,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033516721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:10:41,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [266693000] [2022-11-20 20:10:41,986 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-20 20:10:41,986 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:41,997 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:42,003 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:42,019 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:42,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:10:42,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:10:42,217 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 9 [2022-11-20 20:10:42,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:10:42,240 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 19 treesize of output 1 [2022-11-20 20:10:42,247 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 20:10:42,254 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 20:10:42,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,280 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 25 treesize of output 13 [2022-11-20 20:10:42,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,293 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 25 treesize of output 13 [2022-11-20 20:10:42,302 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 20:10:42,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:42,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:10:42,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:42,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:42,655 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 27 treesize of output 11 [2022-11-20 20:10:42,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:42,669 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 13 [2022-11-20 20:10:42,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:42,687 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 13 [2022-11-20 20:10:42,956 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:10:42,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:10:43,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:43,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:10:43,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:10:43,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:10:43,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:43,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:10:43,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:43,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:43,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:43,552 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:10:43,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:10:43,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:43,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:10:43,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:43,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:43,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:43,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:10:43,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:10:43,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:43,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:43,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:10:44,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:44,138 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 229 treesize of output 209 [2022-11-20 20:10:44,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:44,154 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:10:44,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:44,169 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 0 case distinctions, treesize of input 233 treesize of output 221 [2022-11-20 20:10:44,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:44,404 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 13 [2022-11-20 20:10:44,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:44,416 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 13 [2022-11-20 20:10:44,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:44,430 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 27 treesize of output 11 [2022-11-20 20:10:44,644 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 7 treesize of output 3 [2022-11-20 20:10:44,665 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 7 treesize of output 3 [2022-11-20 20:10:44,751 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 7 treesize of output 3 [2022-11-20 20:10:44,764 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 7 treesize of output 3 [2022-11-20 20:10:44,980 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:10:45,215 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:10:48,556 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '998#(and (= |ULTIMATE.start_main_~mid_index~0#1| (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2))) (= (select (select |#memory_int| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) |ULTIMATE.start_sll_insert_~data#1|) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_main_~mid_index~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_sll_insert_~index#1|) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_insert_#in~data#1| |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (= |ULTIMATE.start_sll_insert_~head#1.offset| |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 8) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:10:48,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:10:48,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:10:48,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-20 20:10:48,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818018287] [2022-11-20 20:10:48,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:10:48,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:10:48,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:48,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:10:48,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-11-20 20:10:48,561 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 20:10:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:48,622 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-11-20 20:10:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:10:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2022-11-20 20:10:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:48,624 INFO L225 Difference]: With dead ends: 78 [2022-11-20 20:10:48,624 INFO L226 Difference]: Without dead ends: 78 [2022-11-20 20:10:48,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-11-20 20:10:48,625 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:48,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 191 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:10:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-20 20:10:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-20 20:10:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 2.0) internal successors, (82), 73 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:10:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-11-20 20:10:48,631 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2022-11-20 20:10:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:48,631 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-11-20 20:10:48,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 20:10:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-11-20 20:10:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 20:10:48,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:48,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:48,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:10:48,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:48,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:10:48,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1436278219, now seen corresponding path program 2 times [2022-11-20 20:10:48,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:48,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741816297] [2022-11-20 20:10:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 20:10:49,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:49,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741816297] [2022-11-20 20:10:49,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741816297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:49,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069898204] [2022-11-20 20:10:49,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:10:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:49,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:49,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:49,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:10:49,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:10:49,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:10:49,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-20 20:10:49,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:49,660 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 20:10:49,689 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 5 treesize of output 3 [2022-11-20 20:10:49,698 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_230 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_230))) is different from true [2022-11-20 20:10:49,711 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_230 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_230))) is different from true [2022-11-20 20:10:49,734 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:10:49,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-11-20 20:10:49,816 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 5 treesize of output 3 [2022-11-20 20:10:49,828 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_231 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_231))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 20:10:49,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,860 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 20:10:49,899 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 5 treesize of output 3 [2022-11-20 20:10:49,908 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_232 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_232))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 20:10:49,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:49,942 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 20:10:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2022-11-20 20:10:49,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:50,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069898204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:50,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1264343603] [2022-11-20 20:10:50,032 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-20 20:10:50,032 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:50,033 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:50,033 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:50,033 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:50,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:10:50,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:10:50,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:10:50,110 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 9 [2022-11-20 20:10:50,118 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 19 treesize of output 1 [2022-11-20 20:10:50,125 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 20:10:50,131 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 20:10:50,141 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 20:10:50,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,151 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 25 treesize of output 13 [2022-11-20 20:10:50,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,159 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 25 treesize of output 13 [2022-11-20 20:10:50,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:50,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:10:50,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:50,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:50,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,393 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:10:50,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:50,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:10:50,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:50,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:10:50,595 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:10:50,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:10:50,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:10:50,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:50,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:50,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:50,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:10:50,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:10:50,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:50,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:10:51,075 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:10:51,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:10:51,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:51,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:10:51,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:10:51,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:51,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:51,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:10:51,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:10:51,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:51,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:51,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:51,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:51,627 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 232 treesize of output 212 [2022-11-20 20:10:51,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:51,640 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:10:51,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:51,656 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 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-20 20:10:51,801 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:10:51,810 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:10:51,818 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:10:52,048 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 7 treesize of output 3 [2022-11-20 20:10:52,060 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 7 treesize of output 3 [2022-11-20 20:10:52,134 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 7 treesize of output 3 [2022-11-20 20:10:52,158 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 7 treesize of output 3 [2022-11-20 20:10:52,316 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:10:52,501 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:10:55,839 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1275#(and (= |ULTIMATE.start_main_~mid_index~0#1| (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2))) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_main_~mid_index~0#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_sll_insert_~index#1|) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_sll_insert_#in~data#1| |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4) 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 8) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_sll_insert_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0)) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:10:55,840 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:10:55,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:10:55,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2022-11-20 20:10:55,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041240012] [2022-11-20 20:10:55,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:10:55,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 20:10:55,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:10:55,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 20:10:55,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=615, Unknown=4, NotChecked=212, Total=930 [2022-11-20 20:10:55,842 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 18 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:10:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:10:56,341 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2022-11-20 20:10:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:10:56,341 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-11-20 20:10:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:10:56,342 INFO L225 Difference]: With dead ends: 85 [2022-11-20 20:10:56,342 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 20:10:56,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=130, Invalid=812, Unknown=4, NotChecked=244, Total=1190 [2022-11-20 20:10:56,344 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:10:56,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 241 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 298 Unchecked, 0.3s Time] [2022-11-20 20:10:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 20:10:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2022-11-20 20:10:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 70 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:10:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-11-20 20:10:56,349 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 28 [2022-11-20 20:10:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:10:56,349 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-11-20 20:10:56,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 15 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:10:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-11-20 20:10:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 20:10:56,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:10:56,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 20:10:56,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:10:56,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:56,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:10:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:10:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1436278218, now seen corresponding path program 1 times [2022-11-20 20:10:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:10:56,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446716246] [2022-11-20 20:10:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:10:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:10:57,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:10:57,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446716246] [2022-11-20 20:10:57,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446716246] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:57,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258466361] [2022-11-20 20:10:57,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:10:57,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:10:57,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:10:57,471 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:10:57,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:10:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:10:57,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 20:10:57,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:10:57,622 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 20:10:57,654 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 5 treesize of output 3 [2022-11-20 20:10:57,663 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_349 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_349) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 20:10:57,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:57,690 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 20:10:57,716 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 5 treesize of output 3 [2022-11-20 20:10:57,723 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_350 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_350) |c_#length|)))) is different from true [2022-11-20 20:10:57,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:57,749 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 20:10:57,782 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 5 treesize of output 3 [2022-11-20 20:10:57,790 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_351 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_351) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-20 20:10:57,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:57,817 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 20:10:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2022-11-20 20:10:57,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:10:57,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258466361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:10:57,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [537586860] [2022-11-20 20:10:57,965 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-20 20:10:57,965 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:10:57,966 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:10:57,966 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:10:57,966 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:10:57,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:57,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:57,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:10:58,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:10:58,055 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 9 [2022-11-20 20:10:58,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:10:58,070 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 19 treesize of output 1 [2022-11-20 20:10:58,077 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 20:10:58,083 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 20:10:58,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,093 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 25 treesize of output 13 [2022-11-20 20:10:58,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,102 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 25 treesize of output 13 [2022-11-20 20:10:58,110 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 20:10:58,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:58,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:10:58,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:58,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:58,248 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 13 [2022-11-20 20:10:58,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,259 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 27 treesize of output 11 [2022-11-20 20:10:58,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:58,270 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 13 [2022-11-20 20:10:58,444 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:10:58,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:10:58,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:10:58,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:58,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:58,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:10:58,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:10:58,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:58,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:10:58,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:58,891 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:10:58,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:10:59,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:10:59,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:59,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:10:59,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:10:59,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:10:59,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:10:59,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:10:59,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,441 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 229 treesize of output 209 [2022-11-20 20:10:59,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:59,458 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:10:59,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:59,474 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 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-20 20:10:59,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:59,647 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 13 [2022-11-20 20:10:59,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:10:59,656 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 13 [2022-11-20 20:10:59,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:10:59,668 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 27 treesize of output 11 [2022-11-20 20:10:59,750 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 7 treesize of output 3 [2022-11-20 20:10:59,773 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 7 treesize of output 3 [2022-11-20 20:10:59,861 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 7 treesize of output 3 [2022-11-20 20:10:59,873 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 7 treesize of output 3 [2022-11-20 20:11:00,075 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:11:00,258 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:11:02,407 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1566#(and (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|) (+ |ULTIMATE.start_sll_insert_~head#1.offset| 4)) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:11:02,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:11:02,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:11:02,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2022-11-20 20:11:02,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580855403] [2022-11-20 20:11:02,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:11:02,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 20:11:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:02,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 20:11:02,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=657, Unknown=3, NotChecked=162, Total=930 [2022-11-20 20:11:02,410 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 20:11:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:02,853 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-11-20 20:11:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:11:02,855 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-11-20 20:11:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:02,856 INFO L225 Difference]: With dead ends: 80 [2022-11-20 20:11:02,856 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 20:11:02,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=135, Invalid=804, Unknown=3, NotChecked=180, Total=1122 [2022-11-20 20:11:02,857 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 281 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:02,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 92 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 223 Invalid, 0 Unknown, 243 Unchecked, 0.3s Time] [2022-11-20 20:11:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 20:11:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-11-20 20:11:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 65 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-20 20:11:02,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 28 [2022-11-20 20:11:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:02,863 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-20 20:11:02,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 20:11:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-20 20:11:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 20:11:02,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:02,865 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:02,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:11:03,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 20:11:03,075 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1578703745, now seen corresponding path program 1 times [2022-11-20 20:11:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:03,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888700867] [2022-11-20 20:11:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:11:03,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:03,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888700867] [2022-11-20 20:11:03,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888700867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:03,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408280531] [2022-11-20 20:11:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:03,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:11:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:11:03,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:11:03,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:11:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:03,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-20 20:11:03,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:11:03,930 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 20:11:04,097 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 9 treesize of output 5 [2022-11-20 20:11:04,238 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_470 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_470))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_468 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_468))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 20:11:04,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,252 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 16 treesize of output 18 [2022-11-20 20:11:04,273 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-20 20:11:04,273 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 21 treesize of output 29 [2022-11-20 20:11:04,314 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 17 treesize of output 9 [2022-11-20 20:11:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-20 20:11:04,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:11:04,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408280531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:04,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1353285919] [2022-11-20 20:11:04,435 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-20 20:11:04,435 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:11:04,435 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:11:04,436 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:11:04,436 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:11:04,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:11:04,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:11:04,504 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 9 [2022-11-20 20:11:04,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:11:04,514 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 20:11:04,520 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 20:11:04,525 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 19 treesize of output 1 [2022-11-20 20:11:04,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,536 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 25 treesize of output 13 [2022-11-20 20:11:04,541 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 20:11:04,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,548 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 25 treesize of output 13 [2022-11-20 20:11:04,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:04,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:11:04,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:04,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:04,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:04,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:11:04,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:04,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:11:04,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:04,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:11:04,959 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:11:04,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:11:05,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:05,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:11:05,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:05,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:05,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:05,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:11:05,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:05,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:05,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:05,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:11:05,415 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:11:05,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:11:05,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:05,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:11:05,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:05,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:05,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:05,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:11:05,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:05,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:11:05,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:05,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:05,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:05,899 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 232 treesize of output 212 [2022-11-20 20:11:05,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:05,919 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:11:05,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:05,933 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 0 case distinctions, treesize of input 236 treesize of output 224 [2022-11-20 20:11:06,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:06,099 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 13 [2022-11-20 20:11:06,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:06,128 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 27 treesize of output 11 [2022-11-20 20:11:06,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:06,141 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 13 [2022-11-20 20:11:06,232 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 7 treesize of output 3 [2022-11-20 20:11:06,244 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 7 treesize of output 3 [2022-11-20 20:11:06,349 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 7 treesize of output 3 [2022-11-20 20:11:06,363 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 7 treesize of output 3 [2022-11-20 20:11:06,716 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:11:06,886 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:11:11,610 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1861#(and (= |ULTIMATE.start_main_~mid_index~0#1| (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_insert_~last~0#1.offset|) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_main_~mid_index~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= (+ |ULTIMATE.start_sll_insert_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_sll_insert_#in~index#1| |ULTIMATE.start_sll_insert_~index#1|) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|) |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_sll_insert_#in~data#1| |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~last~0#1.base|) 1)) (= |ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4) 0) (< 0 |ULTIMATE.start_sll_insert_~index#1|) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 8) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_sll_insert_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0)) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:11:11,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:11:11,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:11:11,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-11-20 20:11:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416474616] [2022-11-20 20:11:11,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:11:11,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 20:11:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:11,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 20:11:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1281, Unknown=3, NotChecked=72, Total=1482 [2022-11-20 20:11:11,613 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:11:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:12,253 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2022-11-20 20:11:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:11:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2022-11-20 20:11:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:12,254 INFO L225 Difference]: With dead ends: 119 [2022-11-20 20:11:12,255 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 20:11:12,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=176, Invalid=1714, Unknown=6, NotChecked=84, Total=1980 [2022-11-20 20:11:12,256 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 99 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:12,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 418 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 516 Invalid, 0 Unknown, 252 Unchecked, 0.4s Time] [2022-11-20 20:11:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 20:11:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 72. [2022-11-20 20:11:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.813953488372093) internal successors, (78), 67 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-11-20 20:11:12,263 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 30 [2022-11-20 20:11:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:12,263 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-11-20 20:11:12,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:11:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-11-20 20:11:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 20:11:12,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:12,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:12,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:11:12,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 20:11:12,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:12,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1578703744, now seen corresponding path program 1 times [2022-11-20 20:11:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:12,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106029918] [2022-11-20 20:11:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:11:13,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:13,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106029918] [2022-11-20 20:11:13,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106029918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:13,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79601738] [2022-11-20 20:11:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:13,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:11:13,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:11:13,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:11:13,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:11:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:13,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-20 20:11:13,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:11:14,000 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 25 treesize of output 17 [2022-11-20 20:11:14,005 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 21 treesize of output 13 [2022-11-20 20:11:14,130 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_594 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_593) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_594)))) is different from true [2022-11-20 20:11:14,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:14,151 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 31 treesize of output 31 [2022-11-20 20:11:14,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:14,158 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 31 treesize of output 31 [2022-11-20 20:11:14,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:14,164 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 24 treesize of output 19 [2022-11-20 20:11:14,176 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:11:14,176 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 15 treesize of output 15 [2022-11-20 20:11:14,218 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 23 treesize of output 15 [2022-11-20 20:11:14,220 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 28 treesize of output 16 [2022-11-20 20:11:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 20:11:14,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:11:14,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79601738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:14,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:11:14,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 21 [2022-11-20 20:11:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929533709] [2022-11-20 20:11:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:14,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:11:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:11:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=368, Unknown=1, NotChecked=38, Total=462 [2022-11-20 20:11:14,254 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:11:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:14,707 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2022-11-20 20:11:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:11:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-20 20:11:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:14,708 INFO L225 Difference]: With dead ends: 120 [2022-11-20 20:11:14,708 INFO L226 Difference]: Without dead ends: 120 [2022-11-20 20:11:14,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2022-11-20 20:11:14,709 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 190 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:14,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 207 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2022-11-20 20:11:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-20 20:11:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 72. [2022-11-20 20:11:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 67 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-11-20 20:11:14,713 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 30 [2022-11-20 20:11:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:14,714 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-11-20 20:11:14,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.25) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:11:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-11-20 20:11:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 20:11:14,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:14,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:14,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:11:14,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:11:14,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1695015053, now seen corresponding path program 1 times [2022-11-20 20:11:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:14,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053696908] [2022-11-20 20:11:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:14,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:11:14,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:14,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053696908] [2022-11-20 20:11:14,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053696908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:14,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:11:14,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:11:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181509227] [2022-11-20 20:11:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:14,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:11:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:11:14,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:11:14,996 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:15,050 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2022-11-20 20:11:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:11:15,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-20 20:11:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:15,051 INFO L225 Difference]: With dead ends: 116 [2022-11-20 20:11:15,051 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 20:11:15,052 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 20:11:15,053 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:15,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:11:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 20:11:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2022-11-20 20:11:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 68 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-11-20 20:11:15,071 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 31 [2022-11-20 20:11:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:15,073 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-11-20 20:11:15,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-11-20 20:11:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 20:11:15,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:15,076 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:15,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 20:11:15,077 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1010689408, now seen corresponding path program 1 times [2022-11-20 20:11:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:15,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580926457] [2022-11-20 20:11:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:11:15,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:15,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580926457] [2022-11-20 20:11:15,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580926457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:15,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:11:15,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:11:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033624732] [2022-11-20 20:11:15,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:15,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:11:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:11:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:11:15,264 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:11:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:15,311 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-11-20 20:11:15,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:11:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-20 20:11:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:15,313 INFO L225 Difference]: With dead ends: 70 [2022-11-20 20:11:15,313 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 20:11:15,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:11:15,314 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 114 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:15,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 74 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:11:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 20:11:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-20 20:11:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 65 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-20 20:11:15,319 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 32 [2022-11-20 20:11:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:15,319 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-20 20:11:15,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:11:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-20 20:11:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 20:11:15,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:15,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:15,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 20:11:15,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1005854102, now seen corresponding path program 1 times [2022-11-20 20:11:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:15,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962491405] [2022-11-20 20:11:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-20 20:11:15,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:15,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962491405] [2022-11-20 20:11:15,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962491405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:15,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:11:15,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:11:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515565911] [2022-11-20 20:11:15,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:15,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:11:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:11:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:11:15,429 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:15,576 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-11-20 20:11:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:11:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-20 20:11:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:15,578 INFO L225 Difference]: With dead ends: 79 [2022-11-20 20:11:15,578 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 20:11:15,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:11:15,578 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:15,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 138 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:11:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 20:11:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-11-20 20:11:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.697674418604651) internal successors, (73), 64 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-11-20 20:11:15,581 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 32 [2022-11-20 20:11:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:15,581 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-11-20 20:11:15,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-11-20 20:11:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 20:11:15,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:15,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:15,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 20:11:15,583 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:15,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1005854101, now seen corresponding path program 1 times [2022-11-20 20:11:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:15,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292294758] [2022-11-20 20:11:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:11:15,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:15,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292294758] [2022-11-20 20:11:15,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292294758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:15,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:11:15,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:11:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558517665] [2022-11-20 20:11:15,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:15,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:11:15,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:15,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:11:15,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:11:15,694 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:11:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:15,739 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-11-20 20:11:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:11:15,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-20 20:11:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:15,740 INFO L225 Difference]: With dead ends: 68 [2022-11-20 20:11:15,740 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 20:11:15,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:11:15,741 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 60 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:15,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 105 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:11:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 20:11:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-20 20:11:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-20 20:11:15,745 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 32 [2022-11-20 20:11:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:15,745 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-20 20:11:15,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:11:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-20 20:11:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 20:11:15,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:15,746 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:15,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 20:11:15,747 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1266439790, now seen corresponding path program 1 times [2022-11-20 20:11:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:15,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779479022] [2022-11-20 20:11:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:15,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:11:15,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:15,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779479022] [2022-11-20 20:11:15,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779479022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:15,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:11:15,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:11:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393243517] [2022-11-20 20:11:15,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:15,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:11:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:15,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:11:15,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:11:15,828 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:15,905 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-11-20 20:11:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:11:15,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-20 20:11:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:15,906 INFO L225 Difference]: With dead ends: 77 [2022-11-20 20:11:15,906 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 20:11:15,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:11:15,907 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 48 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:15,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 80 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:11:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 20:11:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-11-20 20:11:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:15,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-20 20:11:15,911 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 33 [2022-11-20 20:11:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:15,912 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-20 20:11:15,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-20 20:11:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 20:11:15,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:15,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:15,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 20:11:15,913 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:15,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1266439789, now seen corresponding path program 1 times [2022-11-20 20:11:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105653052] [2022-11-20 20:11:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:15,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:11:16,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:16,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105653052] [2022-11-20 20:11:16,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105653052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:16,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:11:16,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:11:16,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803375847] [2022-11-20 20:11:16,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:16,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:11:16,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:16,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:11:16,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:11:16,034 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:16,105 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-11-20 20:11:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:11:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-20 20:11:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:16,107 INFO L225 Difference]: With dead ends: 66 [2022-11-20 20:11:16,107 INFO L226 Difference]: Without dead ends: 66 [2022-11-20 20:11:16,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:11:16,108 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 50 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:16,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 77 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:11:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-20 20:11:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-20 20:11:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 61 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-11-20 20:11:16,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 33 [2022-11-20 20:11:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:16,115 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-11-20 20:11:16,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-11-20 20:11:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 20:11:16,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:16,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:16,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 20:11:16,117 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash -604927796, now seen corresponding path program 1 times [2022-11-20 20:11:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:16,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775070551] [2022-11-20 20:11:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 20:11:16,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:16,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775070551] [2022-11-20 20:11:16,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775070551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:16,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:11:16,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:11:16,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618498326] [2022-11-20 20:11:16,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:16,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:11:16,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:16,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:11:16,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:11:16,341 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:16,462 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-20 20:11:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:11:16,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-11-20 20:11:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:16,463 INFO L225 Difference]: With dead ends: 65 [2022-11-20 20:11:16,463 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 20:11:16,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:11:16,464 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:16,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 139 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:11:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 20:11:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 20:11:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.619047619047619) internal successors, (68), 60 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-11-20 20:11:16,467 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 34 [2022-11-20 20:11:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:16,467 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-11-20 20:11:16,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:11:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-11-20 20:11:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 20:11:16,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:16,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:16,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 20:11:16,468 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash 282835287, now seen corresponding path program 1 times [2022-11-20 20:11:16,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:16,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901225342] [2022-11-20 20:11:16,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:16,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:11:17,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:17,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901225342] [2022-11-20 20:11:17,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901225342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:17,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125175642] [2022-11-20 20:11:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:17,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:11:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:11:17,285 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:11:17,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:11:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:17,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-20 20:11:17,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:11:17,550 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 9 treesize of output 5 [2022-11-20 20:11:17,627 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1142 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1142))) (exists ((v_ArrVal_1141 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1141)))) is different from true [2022-11-20 20:11:17,636 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1143 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1143) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1141 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1141)))) is different from true [2022-11-20 20:11:17,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:17,650 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 16 treesize of output 18 [2022-11-20 20:11:17,665 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:11:17,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-20 20:11:17,799 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:11:17,799 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 31 treesize of output 36 [2022-11-20 20:11:17,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:17,900 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:11:17,900 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 2 case distinctions, treesize of input 34 treesize of output 41 [2022-11-20 20:11:17,921 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 7 treesize of output 3 [2022-11-20 20:11:17,984 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 17 treesize of output 9 [2022-11-20 20:11:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 20:11:18,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:11:18,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125175642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:11:18,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:11:18,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [20] total 30 [2022-11-20 20:11:18,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436814070] [2022-11-20 20:11:18,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:11:18,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 20:11:18,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:18,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 20:11:18,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=736, Unknown=3, NotChecked=110, Total=930 [2022-11-20 20:11:18,016 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:11:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:18,179 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2022-11-20 20:11:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:11:18,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-20 20:11:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:18,180 INFO L225 Difference]: With dead ends: 71 [2022-11-20 20:11:18,181 INFO L226 Difference]: Without dead ends: 71 [2022-11-20 20:11:18,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=788, Unknown=3, NotChecked=114, Total=992 [2022-11-20 20:11:18,182 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:18,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 201 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 191 Invalid, 0 Unknown, 227 Unchecked, 0.1s Time] [2022-11-20 20:11:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-20 20:11:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-11-20 20:11:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.553191489361702) internal successors, (73), 62 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-11-20 20:11:18,185 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 37 [2022-11-20 20:11:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:18,185 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-11-20 20:11:18,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 20:11:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-11-20 20:11:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 20:11:18,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:18,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:18,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:11:18,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 20:11:18,393 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash 282835288, now seen corresponding path program 1 times [2022-11-20 20:11:18,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:18,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069502126] [2022-11-20 20:11:18,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:18,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:11:20,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:20,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069502126] [2022-11-20 20:11:20,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069502126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:20,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730774913] [2022-11-20 20:11:20,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:20,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:11:20,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:11:20,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:11:20,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:11:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:20,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 20:11:20,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:11:20,522 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 20:11:20,865 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 19 treesize of output 11 [2022-11-20 20:11:20,871 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 7 treesize of output 3 [2022-11-20 20:11:21,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:21,169 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 20:11:21,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:21,179 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 25 treesize of output 25 [2022-11-20 20:11:21,190 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:11:21,190 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 15 treesize of output 15 [2022-11-20 20:11:21,198 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 16 treesize of output 18 [2022-11-20 20:11:21,451 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:11:21,451 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 31 treesize of output 36 [2022-11-20 20:11:21,470 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 20:11:21,471 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 21 treesize of output 20 [2022-11-20 20:11:21,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:21,658 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:11:21,659 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 2 case distinctions, treesize of input 61 treesize of output 66 [2022-11-20 20:11:21,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:21,682 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:11:21,682 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 2 case distinctions, treesize of input 66 treesize of output 75 [2022-11-20 20:11:21,725 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 7 treesize of output 3 [2022-11-20 20:11:21,803 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 7 treesize of output 3 [2022-11-20 20:11:21,811 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:11:22,149 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 69 treesize of output 45 [2022-11-20 20:11:22,154 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 20:11:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:11:22,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:11:22,373 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1293 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1294) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 20:11:25,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730774913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1012034993] [2022-11-20 20:11:25,532 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-20 20:11:25,533 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:11:25,533 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:11:25,533 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:11:25,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:11:25,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:11:25,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:11:25,647 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 9 [2022-11-20 20:11:25,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:11:25,658 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 20:11:25,662 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 20:11:25,668 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 19 treesize of output 1 [2022-11-20 20:11:25,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,677 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 25 treesize of output 13 [2022-11-20 20:11:25,683 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 20:11:25,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,689 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 25 treesize of output 13 [2022-11-20 20:11:25,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:25,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:11:25,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:25,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:25,813 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 27 treesize of output 11 [2022-11-20 20:11:25,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:25,822 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 13 [2022-11-20 20:11:25,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:25,839 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 13 [2022-11-20 20:11:25,980 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:11:25,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:11:26,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:26,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:11:26,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:11:26,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:26,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:11:26,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:26,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:26,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:26,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:26,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:26,400 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:11:26,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:11:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:26,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:11:26,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:26,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:26,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:26,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:11:26,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:11:26,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:26,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:26,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:26,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:26,842 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 232 treesize of output 212 [2022-11-20 20:11:26,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:26,856 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:11:26,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:26,868 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 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-20 20:11:27,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:27,041 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 27 treesize of output 11 [2022-11-20 20:11:27,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:27,051 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 13 [2022-11-20 20:11:27,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:27,063 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 13 [2022-11-20 20:11:27,288 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 7 treesize of output 3 [2022-11-20 20:11:27,310 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 7 treesize of output 3 [2022-11-20 20:11:27,413 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 7 treesize of output 3 [2022-11-20 20:11:27,426 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 7 treesize of output 3 [2022-11-20 20:11:28,094 INFO L321 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-11-20 20:11:28,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 269 treesize of output 303 [2022-11-20 20:11:28,202 INFO L321 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-11-20 20:11:28,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 293 [2022-11-20 20:11:33,770 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:11:34,024 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:34,039 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:11:34,050 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:34,207 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:11:34,367 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:11:44,116 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3915#(and (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (not (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= 0 (+ |ULTIMATE.start_sll_insert_~index#1| 1)) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))' at error location [2022-11-20 20:11:44,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:11:44,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:11:44,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 36 [2022-11-20 20:11:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649173324] [2022-11-20 20:11:44,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:11:44,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 20:11:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:11:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 20:11:44,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3536, Unknown=8, NotChecked=120, Total=3906 [2022-11-20 20:11:44,121 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 37 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 20:11:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:11:46,051 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-11-20 20:11:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:11:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-11-20 20:11:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:11:46,053 INFO L225 Difference]: With dead ends: 67 [2022-11-20 20:11:46,053 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 20:11:46,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=372, Invalid=5171, Unknown=11, NotChecked=146, Total=5700 [2022-11-20 20:11:46,055 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:11:46,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 582 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 744 Invalid, 0 Unknown, 151 Unchecked, 0.7s Time] [2022-11-20 20:11:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 20:11:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-20 20:11:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 62 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:11:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-11-20 20:11:46,059 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 37 [2022-11-20 20:11:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:11:46,060 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-11-20 20:11:46,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 20:11:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-11-20 20:11:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 20:11:46,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:11:46,061 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:11:46,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 20:11:46,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:11:46,262 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:11:46,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:11:46,263 INFO L85 PathProgramCache]: Analyzing trace with hash 282839364, now seen corresponding path program 1 times [2022-11-20 20:11:46,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:11:46,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349495879] [2022-11-20 20:11:46,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:11:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:11:47,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:11:47,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349495879] [2022-11-20 20:11:47,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349495879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:47,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389850464] [2022-11-20 20:11:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:11:47,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:11:47,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:11:47,598 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:11:47,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 20:11:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:11:47,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 20:11:47,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:11:48,093 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 8 treesize of output 4 [2022-11-20 20:11:48,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:48,265 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 15 treesize of output 17 [2022-11-20 20:11:48,513 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:11:48,514 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 22 treesize of output 31 [2022-11-20 20:11:50,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:50,646 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:11:50,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2022-11-20 20:11:50,667 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 7 treesize of output 3 [2022-11-20 20:11:50,723 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 16 treesize of output 8 [2022-11-20 20:11:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:11:50,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:11:50,829 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1446 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (<= 1 |c_ULTIMATE.start_main_~mid_index~0#1|)) is different from false [2022-11-20 20:11:55,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389850464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:11:55,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98916371] [2022-11-20 20:11:55,187 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-20 20:11:55,187 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:11:55,187 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:11:55,188 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:11:55,188 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:11:55,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:11:55,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:11:55,258 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 9 [2022-11-20 20:11:55,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:11:55,271 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 19 treesize of output 1 [2022-11-20 20:11:55,276 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 20:11:55,281 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 20:11:55,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,292 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 25 treesize of output 13 [2022-11-20 20:11:55,299 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 20:11:55,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,306 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 25 treesize of output 13 [2022-11-20 20:11:55,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:55,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:11:55,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:55,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,438 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 27 treesize of output 11 [2022-11-20 20:11:55,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:55,452 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 13 [2022-11-20 20:11:55,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:55,463 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 13 [2022-11-20 20:11:55,584 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:11:55,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:11:55,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:11:55,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:55,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:11:55,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:55,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:11:55,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:55,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:55,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:56,053 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:11:56,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:11:56,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:11:56,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:56,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:11:56,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:11:56,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:56,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:11:56,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:56,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:56,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:11:56,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:56,464 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 229 treesize of output 209 [2022-11-20 20:11:56,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:56,484 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:11:56,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:56,498 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 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-20 20:11:56,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:56,643 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 13 [2022-11-20 20:11:56,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:11:56,666 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 13 [2022-11-20 20:11:56,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:11:56,679 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 27 treesize of output 11 [2022-11-20 20:11:56,862 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 7 treesize of output 3 [2022-11-20 20:11:56,873 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 7 treesize of output 3 [2022-11-20 20:11:56,935 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 7 treesize of output 3 [2022-11-20 20:11:56,946 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 7 treesize of output 3 [2022-11-20 20:11:57,202 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:11:57,212 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:57,225 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:11:57,296 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:11:57,296 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 23 treesize of output 30 [2022-11-20 20:11:57,313 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:11:57,349 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:11:57,349 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 23 treesize of output 30 [2022-11-20 20:11:57,495 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:11:57,664 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:12:07,003 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4282#(and (or (and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 0 |ULTIMATE.start_main_~ptr~0#1.base|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_main_~count~0#1| 0) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|)) (and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_main_~count~0#1| 0) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_main_~mid_index~0#1|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_main_~mid_index~0#1| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))))' at error location [2022-11-20 20:12:07,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:12:07,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:12:07,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2022-11-20 20:12:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696722821] [2022-11-20 20:12:07,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:12:07,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:12:07,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:12:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:12:07,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=3278, Unknown=14, NotChecked=116, Total=3660 [2022-11-20 20:12:07,007 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:12:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:12:12,313 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-11-20 20:12:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:12:12,314 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-11-20 20:12:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:12:12,315 INFO L225 Difference]: With dead ends: 114 [2022-11-20 20:12:12,315 INFO L226 Difference]: Without dead ends: 114 [2022-11-20 20:12:12,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=347, Invalid=4473, Unknown=14, NotChecked=136, Total=4970 [2022-11-20 20:12:12,317 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 137 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:12:12,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 687 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 728 Invalid, 0 Unknown, 25 Unchecked, 0.6s Time] [2022-11-20 20:12:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-20 20:12:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 67. [2022-11-20 20:12:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 62 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:12:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-20 20:12:12,321 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 37 [2022-11-20 20:12:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:12:12,321 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-20 20:12:12,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:12:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-20 20:12:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 20:12:12,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:12:12,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:12:12,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:12:12,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:12:12,523 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:12:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:12:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash 430598647, now seen corresponding path program 1 times [2022-11-20 20:12:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:12:12,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610856998] [2022-11-20 20:12:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:12:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:12:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:12:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:12:12,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:12:12,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610856998] [2022-11-20 20:12:12,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610856998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:12:12,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145493590] [2022-11-20 20:12:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:12:12,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:12:12,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:12:12,829 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:12:12,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 20:12:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:12:13,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 20:12:13,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:12:13,075 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 20:12:13,113 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1588 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1588))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-20 20:12:13,137 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 20:12:13,159 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_1589 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1589))))) is different from true [2022-11-20 20:12:13,182 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 20:12:13,203 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1590 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1590))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-20 20:12:13,229 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 20:12:13,239 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 7 treesize of output 3 [2022-11-20 20:12:13,294 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:12:13,295 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 20:12:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2022-11-20 20:12:13,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:12:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:12:13,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145493590] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:12:13,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [307162611] [2022-11-20 20:12:13,702 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-20 20:12:13,702 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:12:13,703 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:12:13,703 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:12:13,703 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:12:13,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:12:13,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:12:13,769 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 9 [2022-11-20 20:12:13,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:12:13,781 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 20:12:13,786 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 19 treesize of output 1 [2022-11-20 20:12:13,791 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 20:12:13,799 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 20:12:13,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,806 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 25 treesize of output 13 [2022-11-20 20:12:13,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,814 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 25 treesize of output 13 [2022-11-20 20:12:13,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:13,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:12:13,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:13,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:13,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:13,989 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:12:14,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:14,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:12:14,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:14,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:12:14,173 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:12:14,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:12:14,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:14,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:12:14,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:14,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:14,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:14,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:14,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:14,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:12:14,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:14,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:12:14,642 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:12:14,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:12:14,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:14,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:12:14,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:14,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:12:14,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:12:14,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:14,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:14,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:14,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:14,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:15,045 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:12:15,056 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:15,067 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:15,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:15,219 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 13 [2022-11-20 20:12:15,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:15,230 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 13 [2022-11-20 20:12:15,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:15,244 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 27 treesize of output 11 [2022-11-20 20:12:15,435 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 7 treesize of output 3 [2022-11-20 20:12:15,458 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 7 treesize of output 3 [2022-11-20 20:12:15,519 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 7 treesize of output 3 [2022-11-20 20:12:15,532 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 7 treesize of output 3 [2022-11-20 20:12:15,815 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:12:15,830 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:12:15,861 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 20:12:15,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:15,883 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 20:12:15,896 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:12:15,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:15,910 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 20:12:15,968 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:12:16,118 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:12:22,000 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4738#(and (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|)) (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (not (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= (+ |ULTIMATE.start_sll_insert_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|) |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:12:22,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:12:22,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:12:22,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 17 [2022-11-20 20:12:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284207498] [2022-11-20 20:12:22,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:12:22,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 20:12:22,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:12:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 20:12:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1045, Unknown=3, NotChecked=204, Total=1406 [2022-11-20 20:12:22,003 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 20:12:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:12:22,311 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-11-20 20:12:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:12:22,312 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-11-20 20:12:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:12:22,314 INFO L225 Difference]: With dead ends: 63 [2022-11-20 20:12:22,315 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 20:12:22,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=212, Invalid=1437, Unknown=3, NotChecked=240, Total=1892 [2022-11-20 20:12:22,317 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 197 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:12:22,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 113 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 127 Invalid, 0 Unknown, 175 Unchecked, 0.1s Time] [2022-11-20 20:12:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 20:12:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 20:12:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 58 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:12:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-11-20 20:12:22,322 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 37 [2022-11-20 20:12:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:12:22,322 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-11-20 20:12:22,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 20:12:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-11-20 20:12:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 20:12:22,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:12:22,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:12:22,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:12:22,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:12:22,524 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:12:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:12:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash 177962891, now seen corresponding path program 1 times [2022-11-20 20:12:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:12:22,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925496423] [2022-11-20 20:12:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:12:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:12:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:12:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:12:23,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:12:23,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925496423] [2022-11-20 20:12:23,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925496423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:12:23,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821274838] [2022-11-20 20:12:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:12:23,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:12:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:12:23,725 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:12:23,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 20:12:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:12:23,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 20:12:23,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:12:24,160 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 7 treesize of output 3 [2022-11-20 20:12:24,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:24,344 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 20:12:24,481 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 20:12:24,482 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 21 treesize of output 20 [2022-11-20 20:12:28,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:28,563 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:12:28,564 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 2 case distinctions, treesize of input 23 treesize of output 32 [2022-11-20 20:12:28,587 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 20:12:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:12:28,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:12:28,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821274838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:12:28,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:12:28,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 33 [2022-11-20 20:12:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720592741] [2022-11-20 20:12:28,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:12:28,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 20:12:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:12:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 20:12:28,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1012, Unknown=4, NotChecked=0, Total=1122 [2022-11-20 20:12:28,599 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 20:12:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:12:30,996 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-20 20:12:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 20:12:30,997 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-11-20 20:12:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:12:30,998 INFO L225 Difference]: With dead ends: 69 [2022-11-20 20:12:30,998 INFO L226 Difference]: Without dead ends: 69 [2022-11-20 20:12:30,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=135, Invalid=1343, Unknown=4, NotChecked=0, Total=1482 [2022-11-20 20:12:30,999 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 82 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:12:30,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 442 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 25 Unchecked, 0.2s Time] [2022-11-20 20:12:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-20 20:12:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-11-20 20:12:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.5) internal successors, (66), 59 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:12:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-11-20 20:12:31,002 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 38 [2022-11-20 20:12:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:12:31,003 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-11-20 20:12:31,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 20:12:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-11-20 20:12:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 20:12:31,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:12:31,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:12:31,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-20 20:12:31,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:12:31,211 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:12:31,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:12:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash -776352684, now seen corresponding path program 1 times [2022-11-20 20:12:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:12:31,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99683072] [2022-11-20 20:12:31,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:12:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:12:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:12:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:12:33,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:12:33,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99683072] [2022-11-20 20:12:33,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99683072] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:12:33,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774742317] [2022-11-20 20:12:33,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:12:33,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:12:33,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:12:33,655 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:12:33,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 20:12:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:12:33,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-20 20:12:33,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:12:33,998 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:12:34,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:34,212 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 20:12:34,419 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 30 treesize of output 18 [2022-11-20 20:12:34,424 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 5 treesize of output 3 [2022-11-20 20:12:34,432 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 7 treesize of output 3 [2022-11-20 20:12:34,437 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 7 treesize of output 3 [2022-11-20 20:12:34,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:34,858 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 36 treesize of output 34 [2022-11-20 20:12:34,876 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:12:34,876 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 15 treesize of output 15 [2022-11-20 20:12:34,886 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 20:12:34,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:34,899 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 14 treesize of output 16 [2022-11-20 20:12:35,503 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:12:35,504 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 89 treesize of output 80 [2022-11-20 20:12:35,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:35,514 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 37 treesize of output 32 [2022-11-20 20:12:35,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:35,529 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2022-11-20 20:12:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:35,663 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 52 treesize of output 48 [2022-11-20 20:12:35,673 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 20:12:35,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:35,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:35,681 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 31 treesize of output 34 [2022-11-20 20:12:35,787 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 45 treesize of output 29 [2022-11-20 20:12:35,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:35,793 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2022-11-20 20:12:35,888 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 20:12:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:12:35,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:12:35,986 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1894) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-20 20:12:36,005 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1891 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_1891)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1894) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 20:12:36,045 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1891 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 v_ArrVal_1891)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1894) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 20:12:36,063 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1891 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1891)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1894) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1887) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 20:12:36,077 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1891 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1891)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1894) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1887) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-20 20:12:36,252 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1891 Int) (v_ArrVal_1894 (Array Int Int)) (v_ArrVal_1893 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39| v_ArrVal_1906)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39| v_ArrVal_1905))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (+ (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39| v_ArrVal_1904))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1891))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39| v_ArrVal_1894) (select (select (store (store .cse3 .cse1 v_ArrVal_1887) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39| v_ArrVal_1892) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39| v_ArrVal_1893) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_39| |c_#StackHeapBarrier|)))) is different from false [2022-11-20 20:12:36,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774742317] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:12:36,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [112137323] [2022-11-20 20:12:36,258 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-20 20:12:36,259 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:12:36,259 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:12:36,259 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:12:36,259 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:12:36,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:12:36,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:12:36,369 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 9 [2022-11-20 20:12:36,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:12:36,381 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 19 treesize of output 1 [2022-11-20 20:12:36,386 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 20:12:36,392 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 20:12:36,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,403 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 25 treesize of output 13 [2022-11-20 20:12:36,409 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 20:12:36,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,417 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 25 treesize of output 13 [2022-11-20 20:12:36,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:36,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:12:36,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:36,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:36,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,587 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:12:36,602 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:36,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:12:36,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:36,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:12:36,766 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:12:36,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:12:36,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:36,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:12:37,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:37,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:37,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:37,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:12:37,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:12:37,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:37,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:37,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:37,231 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:12:37,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:12:37,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:37,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:12:37,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:37,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:12:37,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:37,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:37,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:12:37,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:37,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:37,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:37,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:37,665 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 232 treesize of output 212 [2022-11-20 20:12:37,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:37,680 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:12:37,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:37,699 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 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-20 20:12:37,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:37,864 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 13 [2022-11-20 20:12:37,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:37,873 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 13 [2022-11-20 20:12:37,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:37,888 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 27 treesize of output 11 [2022-11-20 20:12:38,107 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 7 treesize of output 3 [2022-11-20 20:12:38,117 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 7 treesize of output 3 [2022-11-20 20:12:38,184 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 7 treesize of output 3 [2022-11-20 20:12:38,205 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 7 treesize of output 3 [2022-11-20 20:12:38,453 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:12:38,463 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:38,473 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:38,518 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:12:38,518 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 23 treesize of output 30 [2022-11-20 20:12:38,558 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:12:38,558 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 23 treesize of output 30 [2022-11-20 20:12:38,572 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:12:38,678 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:12:38,822 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:12:47,368 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5392#(and (= 1 (select |#valid| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (or (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (and (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (or (and (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)))) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (not (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~temp~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_insert_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (or (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~2#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))' at error location [2022-11-20 20:12:47,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:12:47,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:12:47,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 40 [2022-11-20 20:12:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107796652] [2022-11-20 20:12:47,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:12:47,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 20:12:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:12:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 20:12:47,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3548, Unknown=8, NotChecked=750, Total=4556 [2022-11-20 20:12:47,371 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 40 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:12:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:12:49,338 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-11-20 20:12:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:12:49,339 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-11-20 20:12:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:12:49,339 INFO L225 Difference]: With dead ends: 65 [2022-11-20 20:12:49,339 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 20:12:49,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=378, Invalid=5185, Unknown=11, NotChecked=906, Total=6480 [2022-11-20 20:12:49,342 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 155 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:12:49,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 584 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 871 Invalid, 0 Unknown, 77 Unchecked, 0.9s Time] [2022-11-20 20:12:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 20:12:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 20:12:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.488888888888889) internal successors, (67), 60 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:12:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-11-20 20:12:49,345 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 40 [2022-11-20 20:12:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:12:49,345 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-11-20 20:12:49,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:12:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-11-20 20:12:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 20:12:49,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:12:49,346 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:12:49,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 20:12:49,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 20:12:49,553 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:12:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:12:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1702869937, now seen corresponding path program 1 times [2022-11-20 20:12:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:12:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166862352] [2022-11-20 20:12:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:12:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:12:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:12:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:12:51,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:12:51,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166862352] [2022-11-20 20:12:51,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166862352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:12:51,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833359858] [2022-11-20 20:12:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:12:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:12:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:12:51,411 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:12:51,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 20:12:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:12:51,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 20:12:51,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:12:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:12:51,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:12:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 20:12:52,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833359858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:12:52,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1178209350] [2022-11-20 20:12:52,309 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-20 20:12:52,309 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:12:52,310 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:12:52,310 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:12:52,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:12:52,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:12:52,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:12:52,378 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 9 [2022-11-20 20:12:52,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:12:52,389 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 20:12:52,393 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 20:12:52,398 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 19 treesize of output 1 [2022-11-20 20:12:52,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 11 treesize of output 7 [2022-11-20 20:12:52,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,417 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 25 treesize of output 13 [2022-11-20 20:12:52,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,425 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 25 treesize of output 13 [2022-11-20 20:12:52,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:52,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:12:52,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:52,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:52,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,585 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:12:52,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:52,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:12:52,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:52,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:12:52,772 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:12:52,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:12:52,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:52,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:12:53,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:53,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:53,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:53,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:12:53,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:53,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:53,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:12:53,232 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:12:53,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:12:53,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:53,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:12:53,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:12:53,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:53,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:12:53,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:12:53,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:53,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:53,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:53,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:12:53,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:53,624 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 240 treesize of output 220 [2022-11-20 20:12:53,635 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 0 case distinctions, treesize of input 234 treesize of output 218 [2022-11-20 20:12:53,649 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 0 case distinctions, treesize of input 234 treesize of output 218 [2022-11-20 20:12:53,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:53,788 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 13 [2022-11-20 20:12:53,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:12:53,796 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 27 treesize of output 11 [2022-11-20 20:12:53,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:12:53,807 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 13 [2022-11-20 20:12:53,980 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 7 treesize of output 3 [2022-11-20 20:12:53,992 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 7 treesize of output 3 [2022-11-20 20:12:54,051 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 7 treesize of output 3 [2022-11-20 20:12:54,063 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 7 treesize of output 3 [2022-11-20 20:12:54,307 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:54,321 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:12:54,332 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:12:54,393 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:12:54,393 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 23 treesize of output 30 [2022-11-20 20:12:54,412 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:12:54,447 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:12:54,448 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 23 treesize of output 30 [2022-11-20 20:12:54,712 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:12:54,867 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:13:03,152 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5845#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (not (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))' at error location [2022-11-20 20:13:03,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:13:03,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:13:03,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8, 8] total 35 [2022-11-20 20:13:03,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138281100] [2022-11-20 20:13:03,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:13:03,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:13:03,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:13:03,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:13:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2954, Unknown=0, NotChecked=0, Total=3192 [2022-11-20 20:13:03,155 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 35 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 20:13:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:13:06,127 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-11-20 20:13:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 20:13:06,128 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-11-20 20:13:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:13:06,129 INFO L225 Difference]: With dead ends: 72 [2022-11-20 20:13:06,129 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 20:13:06,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=505, Invalid=5347, Unknown=0, NotChecked=0, Total=5852 [2022-11-20 20:13:06,131 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 456 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:13:06,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 360 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 20:13:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 20:13:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2022-11-20 20:13:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.380952380952381) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:13:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-20 20:13:06,135 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 41 [2022-11-20 20:13:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:13:06,136 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-20 20:13:06,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 20:13:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-20 20:13:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 20:13:06,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:13:06,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:13:06,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 20:13:06,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:13:06,343 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:13:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:13:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1702874014, now seen corresponding path program 1 times [2022-11-20 20:13:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:13:06,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159792639] [2022-11-20 20:13:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:13:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:13:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:13:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:13:09,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:13:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159792639] [2022-11-20 20:13:09,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159792639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:13:09,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560555945] [2022-11-20 20:13:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:13:09,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:13:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:13:09,870 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:13:09,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 20:13:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:13:10,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-20 20:13:10,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:13:10,694 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 19 treesize of output 11 [2022-11-20 20:13:10,698 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 5 treesize of output 3 [2022-11-20 20:13:10,704 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 7 treesize of output 3 [2022-11-20 20:13:10,774 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 20:13:11,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:11,107 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 20:13:11,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:11,126 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 25 treesize of output 25 [2022-11-20 20:13:11,142 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:13:11,142 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 15 treesize of output 15 [2022-11-20 20:13:11,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:11,767 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 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-20 20:13:11,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:11,776 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-11-20 20:13:11,927 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 20:13:11,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 72 [2022-11-20 20:13:11,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:11,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:11,940 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 33 treesize of output 38 [2022-11-20 20:13:12,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:13:12,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:12,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:13:12,228 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 89 treesize of output 45 [2022-11-20 20:13:12,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:12,239 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 20:13:12,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-20 20:13:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:13:12,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:13:12,839 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (<= (+ 4 (select (select .cse0 .cse1) .cse2)) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse6 4)))) (not (<= 0 .cse6))))))) is different from false [2022-11-20 20:13:12,864 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select .cse0 (select (select (store .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse2 4)))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2189))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse8 (store .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2188))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ .cse4 4))) (<= (+ (select (select .cse5 .cse6) .cse7) 4) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))))))) is different from false [2022-11-20 20:13:14,078 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse10 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| .cse9 (store (select |c_#memory_$Pointer$.offset| .cse9) .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (and (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2189))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2188))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 .cse4))) (<= (+ (select (select .cse0 .cse1) .cse2) 4) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_2189 (Array Int Int))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2189))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2188 (Array Int Int))) (<= 0 (select (select .cse7 (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse8)))) (not (<= 0 .cse8))))))))) is different from false [2022-11-20 20:13:14,210 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 927 treesize of output 791 [2022-11-20 20:13:16,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560555945] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:13:16,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [686047489] [2022-11-20 20:13:16,989 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-20 20:13:16,989 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:13:16,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:13:16,989 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:13:16,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:13:17,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:13:17,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:13:17,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:13:17,062 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 9 [2022-11-20 20:13:17,068 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 19 treesize of output 1 [2022-11-20 20:13:17,072 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 20:13:17,076 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 20:13:17,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,086 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 25 treesize of output 13 [2022-11-20 20:13:17,096 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 20:13:17,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,104 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 25 treesize of output 13 [2022-11-20 20:13:17,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:13:17,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:13:17,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:13:17,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,236 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 27 treesize of output 11 [2022-11-20 20:13:17,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:13:17,247 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 13 [2022-11-20 20:13:17,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:13:17,256 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 13 [2022-11-20 20:13:17,361 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:13:17,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:13:17,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:13:17,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:13:17,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:13:17,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:13:17,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:13:17,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:13:17,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:13:17,779 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:13:17,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:13:17,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:17,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:13:18,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:13:18,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:13:18,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:13:18,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:13:18,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:13:18,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:18,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:18,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:13:18,139 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:13:18,147 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:13:18,154 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:13:18,266 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:13:18,272 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:13:18,280 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:13:18,464 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 7 treesize of output 3 [2022-11-20 20:13:18,474 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 7 treesize of output 3 [2022-11-20 20:13:18,543 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 7 treesize of output 3 [2022-11-20 20:13:18,556 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 7 treesize of output 3 [2022-11-20 20:13:19,061 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:13:19,178 INFO L321 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-11-20 20:13:19,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 269 treesize of output 303 [2022-11-20 20:13:19,275 INFO L321 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-11-20 20:13:19,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 293 [2022-11-20 20:13:21,031 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:13:21,070 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:13:21,081 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:13:21,422 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:13:21,573 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:13:32,409 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6268#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= 0 (+ |ULTIMATE.start_sll_insert_~index#1| 1)) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))' at error location [2022-11-20 20:13:32,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:13:32,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:13:32,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 22] total 51 [2022-11-20 20:13:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501937079] [2022-11-20 20:13:32,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:13:32,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 20:13:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:13:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 20:13:32,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6464, Unknown=32, NotChecked=492, Total=7310 [2022-11-20 20:13:32,414 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 52 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 20:13:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:13:36,145 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-20 20:13:36,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 20:13:36,146 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-11-20 20:13:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:13:36,147 INFO L225 Difference]: With dead ends: 61 [2022-11-20 20:13:36,147 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 20:13:36,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3071 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=543, Invalid=9739, Unknown=32, NotChecked=606, Total=10920 [2022-11-20 20:13:36,153 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 147 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:13:36,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 564 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1006 Invalid, 0 Unknown, 75 Unchecked, 0.9s Time] [2022-11-20 20:13:36,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 20:13:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-11-20 20:13:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:13:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-20 20:13:36,156 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 41 [2022-11-20 20:13:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:13:36,157 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-20 20:13:36,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 20:13:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-20 20:13:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 20:13:36,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:13:36,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:13:36,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 20:13:36,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 20:13:36,365 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:13:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:13:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash 79388924, now seen corresponding path program 1 times [2022-11-20 20:13:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:13:36,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399842217] [2022-11-20 20:13:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:13:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:13:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:13:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:13:39,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:13:39,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399842217] [2022-11-20 20:13:39,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399842217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:13:39,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609798035] [2022-11-20 20:13:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:13:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:13:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:13:39,074 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:13:39,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 20:13:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:13:39,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-20 20:13:39,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:13:39,792 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 19 treesize of output 11 [2022-11-20 20:13:39,797 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 7 treesize of output 3 [2022-11-20 20:13:39,801 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 5 treesize of output 3 [2022-11-20 20:13:39,949 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:13:40,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:40,055 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 25 treesize of output 25 [2022-11-20 20:13:40,070 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:13:40,070 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 15 treesize of output 15 [2022-11-20 20:13:40,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:40,080 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 14 treesize of output 16 [2022-11-20 20:13:40,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:40,655 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 0 case distinctions, treesize of input 78 treesize of output 56 [2022-11-20 20:13:40,662 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 20:13:40,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:40,672 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-11-20 20:13:40,822 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 20:13:40,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 103 [2022-11-20 20:13:40,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:40,834 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 61 treesize of output 52 [2022-11-20 20:13:40,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:40,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:40,840 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 56 treesize of output 55 [2022-11-20 20:13:41,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:13:41,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:41,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:13:41,083 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 99 treesize of output 51 [2022-11-20 20:13:41,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:13:41,094 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 20:13:41,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 23 [2022-11-20 20:13:41,179 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 20:13:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:13:41,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:13:41,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2348 Int) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2350))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2349))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_2348)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_main_~uneq~0#1|) (not (<= 0 .cse4)))))) is different from false [2022-11-20 20:13:42,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:13:42,774 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 319 treesize of output 312 [2022-11-20 20:13:42,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:13:42,808 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 4984 treesize of output 4708 [2022-11-20 20:13:42,836 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 5116 treesize of output 4436 [2022-11-20 20:13:43,183 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 855 treesize of output 719 [2022-11-20 20:13:43,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:13:43,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2537 treesize of output 4079 [2022-11-20 20:16:47,388 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse160 (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_insert_~data#1|))) (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse6 (store (store .cse9 .cse0 (store (select .cse9 .cse0) .cse8 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (store .cse7 .cse0 (store (select .cse7 .cse0) .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3 (+ .cse4 4))) (or (not (= .cse0 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1 (store .cse2 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse4)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse5 (select (select .cse6 (select (select (store .cse2 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3))) (or (= .cse5 (select (select .cse6 (select (select (store .cse2 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)) (= (select (select .cse6 (select (select (store .cse2 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3) .cse5) (= .cse5 (select (select .cse6 (select (select (store .cse2 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)) (= .cse5 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse19 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse20 (+ (select (select .cse21 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse10 (store (store .cse21 .cse18 (store (select .cse21 .cse18) .cse20 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse13 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (+ .cse13 4)) (.cse11 (store .cse19 .cse18 (store (select .cse19 .cse18) .cse20 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (= (select (select .cse10 (select (select (store .cse11 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse12) 0) (not (<= 0 .cse13)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse16 (store .cse11 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (select (select .cse10 .cse17) .cse12)) (.cse15 (select (select .cse10 (select (select (store .cse11 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse12))) (or (not (= .cse14 4)) (= .cse15 0) (= (select (select .cse10 (select (select (store .cse11 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse12) .cse14) (= .cse14 .cse15) (not (= (select (select .cse16 .cse17) .cse12) .cse18)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse33 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse34 (+ (select (select .cse35 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse26 (store (store .cse35 .cse31 (store (select .cse35 .cse31) .cse34 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse32 (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse27 (store .cse33 .cse31 (store (select .cse33 .cse31) .cse34 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse28 (+ .cse32 4))) (let ((.cse22 (select (select .cse26 (select (select (store .cse27 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse28))) (or (= .cse22 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse23 (select (select .cse26 (select (select (store .cse27 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse28))) (or (= .cse23 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse29 (store .cse27 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse24 (select (select .cse26 .cse30) .cse28))) (or (= .cse23 .cse24) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse25 (select (select .cse26 (select (select (store .cse27 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse28))) (or (= .cse23 .cse25) (= .cse25 0) (= .cse24 .cse25)))) (not (= (select (select .cse29 .cse30) .cse28) .cse31)) (= .cse24 0)))))) (= .cse23 .cse22)))))))) (not (<= 0 .cse32)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse36 (select (select .cse44 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse36 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse45 (+ (select (select .cse46 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse43 (store (store .cse46 .cse36 (store (select .cse46 .cse36) .cse45 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse37 (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (store .cse44 .cse36 (store (select .cse44 .cse36) .cse45 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse40 (+ .cse37 4))) (or (not (<= 0 .cse37)) (not (= (select (let ((.cse38 (store .cse39 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse40) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse41 (select (select .cse43 (select (select (store .cse39 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse40))) (or (= .cse41 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse42 (select (select .cse43 (select (select (store .cse39 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse40))) (or (= .cse42 .cse41) (forall ((v_prenex_39 (Array Int Int))) (= .cse42 (select (select .cse43 (select (select (store .cse39 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse40)))))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse56 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse57 (select (select .cse56 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse58 (+ (select (select .cse59 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse54 (store (store .cse59 .cse57 (store (select .cse59 .cse57) .cse58 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse47 (select (select .cse54 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse47)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse55 (store .cse56 .cse57 (store (select .cse56 .cse57) .cse58 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse51 (store .cse55 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse52 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse53 (+ .cse47 4))) (let ((.cse48 (select (select .cse54 .cse52) .cse53)) (.cse49 (select (select .cse54 (select (select (store .cse55 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse53)) (.cse50 (select (select .cse54 (select (select (store .cse55 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse53))) (or (= .cse48 .cse49) (= .cse50 .cse48) (not (= (select (select .cse51 .cse52) .cse53) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse54 (select (select (store .cse55 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse53) .cse48) (= .cse48 0) (= .cse50 .cse49) (= .cse50 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse69 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse70 (select (select .cse69 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse71 (+ (select (select .cse72 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse67 (store (store .cse72 .cse70 (store (select .cse72 .cse70) .cse71 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse60 (select (select .cse67 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse60)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse68 (store .cse69 .cse70 (store (select .cse69 .cse70) .cse71 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse65 (+ .cse60 4))) (let ((.cse66 (select (select .cse67 (select (select (store .cse68 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse65)) (.cse61 (select (select .cse67 (select (select (store .cse68 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse65))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse63 (store .cse68 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse64 (select (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse62 (select (select .cse67 .cse64) .cse65))) (or (= .cse61 .cse62) (not (= (select (select .cse63 .cse64) .cse65) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse66 .cse62) (not (= .cse62 4))))))) (= .cse66 .cse61) (= .cse61 0))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse81 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse82 (select (select .cse81 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse83 (+ (select (select .cse84 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse75 (store (store .cse84 .cse82 (store (select .cse84 .cse82) .cse83 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse80 (select (select .cse75 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse76 (store .cse81 .cse82 (store (select .cse81 .cse82) .cse83 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse77 (+ .cse80 4))) (let ((.cse73 (select (select .cse75 (select (select (store .cse76 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse77))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse78 (store .cse76 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse79 (select (select .cse78 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse74 (select (select .cse75 .cse79) .cse77))) (or (= .cse73 .cse74) (= (select (select .cse75 (select (select (store .cse76 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse77) .cse74) (= .cse74 0) (= (select (select .cse75 (select (select (store .cse76 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse77) .cse74) (= (select (select .cse78 .cse79) .cse77) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (= .cse73 0))))) (not (<= 0 .cse80)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse96 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse93 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse94 (select (select .cse93 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse95 (+ (select (select .cse96 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse89 (store (store .cse96 .cse94 (store (select .cse96 .cse94) .cse95 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse92 (select (select .cse89 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse90 (store .cse93 .cse94 (store (select .cse93 .cse94) .cse95 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse91 (+ .cse92 4))) (let ((.cse86 (select (select .cse89 (select (select (store .cse90 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse91)) (.cse85 (select (select .cse89 (select (select (store .cse90 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse91)) (.cse88 (select (select .cse89 (select (select (store .cse90 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse91)) (.cse87 (select (select .cse89 (select (select (store .cse90 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse91))) (or (= .cse85 0) (= .cse86 .cse87) (= .cse85 .cse86) (= .cse85 .cse88) (= .cse88 .cse87))))) (not (<= 0 .cse92)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse110 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse108 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse107 (select (select .cse108 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse109 (+ (select (select .cse110 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse102 (store (store .cse110 .cse107 (store (select .cse110 .cse107) .cse109 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse97 (select (select .cse102 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse97)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse103 (store .cse108 .cse107 (store (select .cse108 .cse107) .cse109 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse104 (+ .cse97 4))) (let ((.cse98 (select (select .cse102 (select (select (store .cse103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse104))) (or (= .cse98 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse99 (select (select .cse102 (select (select (store .cse103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse104))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse105 (store .cse103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse106 (select (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse100 (select (select .cse102 .cse106) .cse104))) (or (= .cse99 .cse100) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse101 (select (select .cse102 (select (select (store .cse103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse104))) (or (= .cse99 .cse101) (= .cse101 0) (= .cse100 .cse101)))) (not (= (select (select .cse105 .cse106) .cse104) .cse107)) (= .cse100 0)))))) (= .cse99 .cse98)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse122 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse120 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse118 (select (select .cse120 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse121 (+ (select (select .cse122 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse113 (store (store .cse122 .cse118 (store (select .cse122 .cse118) .cse121 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse119 (select (select .cse113 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse114 (store .cse120 .cse118 (store (select .cse120 .cse118) .cse121 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse116 (store .cse114 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse117 (select (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse115 (+ .cse119 4))) (let ((.cse111 (select (select .cse113 .cse117) .cse115))) (or (not (= .cse111 4)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse112 (select (select .cse113 (select (select (store .cse114 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse115))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse112 (select (select .cse113 (select (select (store .cse114 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse115))) (= .cse111 .cse112)))) (not (= (select (select .cse116 .cse117) .cse115) .cse118)))))))) (not (<= 0 .cse119)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse131 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse123 (select (select .cse131 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse123 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse133 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse132 (+ (select (select .cse133 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse124 (store (store .cse133 .cse123 (store (select .cse133 .cse123) .cse132 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse129 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse125 (store .cse131 .cse123 (store (select .cse131 .cse123) .cse132 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse126 (+ .cse129 4))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse127 (select (select .cse124 (select (select (store .cse125 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse126))) (or (= (select (select .cse124 (select (select (store .cse125 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse126) .cse127) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse128 (select (select .cse124 (select (select (store .cse125 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse126))) (or (= .cse128 (select (select .cse124 (select (select (store .cse125 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse126)) (= .cse128 .cse127))))))) (not (<= 0 .cse129)) (not (= (select (let ((.cse130 (store .cse125 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse130 (select (select .cse130 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse126) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse145 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse143 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse142 (select (select .cse143 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse144 (+ (select (select .cse145 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse136 (store (store .cse145 .cse142 (store (select .cse145 .cse142) .cse144 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse134 (select (select .cse136 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse134)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse137 (store .cse143 .cse142 (store (select .cse143 .cse142) .cse144 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse140 (store .cse137 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse141 (select (select .cse140 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse138 (+ .cse134 4))) (let ((.cse135 (select (select .cse136 (select (select (store .cse137 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse138)) (.cse139 (select (select .cse136 .cse141) .cse138))) (or (= .cse135 (select (select .cse136 (select (select (store .cse137 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse138)) (not (= .cse139 4)) (= .cse139 .cse135) (= .cse135 0) (= (select (select .cse136 (select (select (store .cse137 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse138) .cse139) (not (= (select (select .cse140 .cse141) .cse138) .cse142)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse159 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse156 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse157 (select (select .cse156 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse158 (+ (select (select .cse159 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse154 (store (store .cse159 .cse157 (store (select .cse159 .cse157) .cse158 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse146 (select (select .cse154 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse146)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse155 (store .cse156 .cse157 (store (select .cse156 .cse157) .cse158 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse153 (+ .cse146 4))) (let ((.cse147 (select (select .cse154 (select (select (store .cse155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse153))) (or (= .cse147 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse148 (select (select .cse154 (select (select (store .cse155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse153))) (or (= .cse148 .cse147) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse151 (store .cse155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse152 (select (select .cse151 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse149 (select (select .cse154 .cse152) .cse153)) (.cse150 (select (select .cse154 (select (select (store .cse155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse153))) (or (= .cse148 .cse149) (= .cse149 0) (= .cse148 .cse150) (= .cse150 .cse149) (= .cse150 0) (= (select (select .cse151 .cse152) .cse153) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (or .cse160 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int) (v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse171 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse169 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse168 (select (select .cse169 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse170 (+ (select (select .cse171 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse161 (store (store .cse171 .cse168 (store (select .cse171 .cse168) .cse170 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse165 (select (select .cse161 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse162 (store .cse169 .cse168 (store (select .cse169 .cse168) .cse170 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse166 (store .cse162 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32)) (.cse163 (+ .cse165 4))) (let ((.cse164 (select (select .cse161 (select (select (store .cse162 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse163)) (.cse167 (select (select .cse166 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse161 (select (select (store .cse162 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse163) 0) (= .cse164 (select (select .cse161 (select (select (store .cse162 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse163)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (= .cse164 0) (not (<= 0 .cse165)) (not (= (select (select .cse166 .cse167) .cse163) .cse168)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (= (select (select .cse161 .cse167) .cse163) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse180 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse178 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse177 (select (select .cse178 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse179 (+ (select (select .cse180 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse173 (store (store .cse180 .cse177 (store (select .cse180 .cse177) .cse179 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse172 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse172)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse176 (store (store .cse178 .cse177 (store (select .cse178 .cse177) .cse179 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse174 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse175 (+ .cse172 4))) (or (not (= (select (select .cse173 .cse174) .cse175) 4)) (not (= (select (select .cse176 .cse174) .cse175) .cse177)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse190 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse192 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse187 (select (select .cse192 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse191 (+ (select (select .cse190 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse182 (store .cse192 .cse187 (store (select .cse192 .cse187) .cse191 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse181 (store (store .cse190 .cse187 (store (select .cse190 .cse187) .cse191 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse184 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse185 (store .cse182 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse186 (select (select .cse185 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse183 (+ .cse184 4))) (or (= (select (select .cse181 (select (select (store .cse182 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse183) 0) (not (<= 0 .cse184)) (not (= (select (select .cse185 .cse186) .cse183) .cse187)) (= (select (select .cse181 .cse186) .cse183) 0) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse188 (select (select .cse181 (select (select (store .cse182 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse183)) (.cse189 (select (select .cse181 (select (select (store .cse182 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse183))) (or (= .cse188 .cse189) (= .cse188 0) (= .cse189 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse205 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse202 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse203 (select (select .cse202 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse204 (+ (select (select .cse205 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse193 (store (store .cse205 .cse203 (store (select .cse205 .cse203) .cse204 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse196 (select (select .cse193 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse194 (store .cse202 .cse203 (store (select .cse202 .cse203) .cse204 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse195 (+ .cse196 4))) (or (= (select (select .cse193 (select (select (store .cse194 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse195) 0) (not (<= 0 .cse196)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse197 (select (select .cse193 (select (select (store .cse194 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse195))) (or (= .cse197 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse200 (store .cse194 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse201 (select (select .cse200 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse199 (select (select .cse193 .cse201) .cse195)) (.cse198 (select (select .cse193 (select (select (store .cse194 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse195))) (or (= .cse198 .cse199) (not (= (select (select .cse200 .cse201) .cse195) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse199 0) (= .cse197 .cse198) (= .cse198 0)))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse218 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse216 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse215 (select (select .cse216 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse217 (+ (select (select .cse218 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse208 (store (store .cse218 .cse215 (store (select .cse218 .cse215) .cse217 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse206 (select (select .cse208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse206)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse209 (store .cse216 .cse215 (store (select .cse216 .cse215) .cse217 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse210 (+ .cse206 4))) (let ((.cse211 (select (select .cse208 (select (select (store .cse209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse210))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse207 (select (select .cse208 (select (select (store .cse209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse210))) (or (= .cse207 (select (select .cse208 (select (select (store .cse209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse210)) (= .cse211 .cse207)))) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse213 (store .cse209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse214 (select (select .cse213 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse212 (select (select .cse208 .cse214) .cse210))) (or (not (= .cse212 4)) (= .cse211 .cse212) (not (= (select (select .cse213 .cse214) .cse210) .cse215))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse226 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse219 (select (select .cse226 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse219 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse228 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse227 (+ (select (select .cse228 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse221 (store (store .cse228 .cse219 (store (select .cse228 .cse219) .cse227 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse224 (select (select .cse221 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse222 (store .cse226 .cse219 (store (select .cse226 .cse219) .cse227 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse223 (+ .cse224 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse220 (select (select .cse221 (select (select (store .cse222 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse223))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse220 (select (select .cse221 (select (select (store .cse222 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse223))) (= (select (select .cse221 (select (select (store .cse222 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse223) .cse220) (= .cse220 0)))) (not (<= 0 .cse224)) (not (= (select (let ((.cse225 (store .cse222 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse225 (select (select .cse225 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse223) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse237 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse229 (select (select .cse237 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse229 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse239 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse238 (+ (select (select .cse239 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse232 (store (store .cse239 .cse229 (store (select .cse239 .cse229) .cse238 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse235 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse233 (store .cse237 .cse229 (store (select .cse237 .cse229) .cse238 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse234 (+ .cse235 4))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse230 (select (select .cse232 (select (select (store .cse233 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse234))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse231 (select (select .cse232 (select (select (store .cse233 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse234))) (or (= .cse230 .cse231) (= .cse231 0)))) (= .cse230 0)))) (not (<= 0 .cse235)) (not (= (select (let ((.cse236 (store .cse233 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse236 (select (select .cse236 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse234) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse253 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse250 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse251 (select (select .cse250 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse252 (+ (select (select .cse253 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse247 (store (store .cse253 .cse251 (store (select .cse253 .cse251) .cse252 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse249 (select (select .cse247 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse248 (store .cse250 .cse251 (store (select .cse250 .cse251) .cse252 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse246 (+ .cse249 4))) (let ((.cse240 (select (select .cse247 (select (select (store .cse248 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse246))) (or (= .cse240 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse241 (select (select .cse247 (select (select (store .cse248 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse246))) (or (= .cse241 0) (= .cse241 .cse240) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse244 (store .cse248 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse245 (select (select .cse244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse243 (select (select .cse247 .cse245) .cse246)) (.cse242 (select (select .cse247 (select (select (store .cse248 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse246))) (or (= .cse242 .cse243) (not (= (select (select .cse244 .cse245) .cse246) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse241 .cse243) (= .cse243 0) (= .cse241 .cse242) (= .cse242 0))))))))))))) (not (<= 0 .cse249)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse260 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse261 (select (select .cse260 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse263 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse262 (+ (select (select .cse263 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse255 (store (store .cse263 .cse261 (store (select .cse263 .cse261) .cse262 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse258 (select (select .cse255 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse256 (store .cse260 .cse261 (store (select .cse260 .cse261) .cse262 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse257 (+ .cse258 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse254 (select (select .cse255 (select (select (store .cse256 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse257))) (or (= .cse254 (select (select .cse255 (select (select (store .cse256 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse257)) (= (select (select .cse255 (select (select (store .cse256 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse257) .cse254)))) (not (<= 0 .cse258)) (not (= (select (let ((.cse259 (store .cse256 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse259 (select (select .cse259 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse257) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse261 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse275 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse272 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse273 (select (select .cse272 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse274 (+ (select (select .cse275 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse269 (store (store .cse275 .cse273 (store (select .cse275 .cse273) .cse274 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse271 (select (select .cse269 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse270 (store .cse272 .cse273 (store (select .cse272 .cse273) .cse274 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse266 (store .cse270 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse267 (select (select .cse266 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse268 (+ .cse271 4))) (let ((.cse265 (select (select .cse269 .cse267) .cse268)) (.cse264 (select (select .cse269 (select (select (store .cse270 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse268))) (or (= .cse264 .cse265) (not (= (select (select .cse266 .cse267) .cse268) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse269 (select (select (store .cse270 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse268) .cse264) (not (= .cse265 4)) (= .cse264 0))))))) (not (<= 0 .cse271)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse289 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse286 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse287 (select (select .cse286 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse288 (+ (select (select .cse289 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse284 (store (store .cse289 .cse287 (store (select .cse289 .cse287) .cse288 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse276 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse276)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse285 (store .cse286 .cse287 (store (select .cse286 .cse287) .cse288 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse281 (store .cse285 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse282 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse283 (+ .cse276 4))) (let ((.cse278 (select (select .cse284 (select (select (store .cse285 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse283)) (.cse279 (select (select .cse284 (select (select (store .cse285 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse283)) (.cse280 (select (select .cse284 (select (select (store .cse285 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse283)) (.cse277 (select (select .cse284 .cse282) .cse283))) (or (= .cse277 .cse278) (= .cse279 .cse278) (= .cse280 .cse277) (not (= (select (select .cse281 .cse282) .cse283) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse279 .cse277) (= .cse279 .cse280) (not (= .cse277 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse298 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse290 (select (select .cse298 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse290 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse300 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse299 (+ (select (select .cse300 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse295 (store (store .cse300 .cse290 (store (select .cse300 .cse290) .cse299 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse291 (select (select .cse295 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse293 (store .cse298 .cse290 (store (select .cse298 .cse290) .cse299 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse294 (+ .cse291 4))) (or (not (<= 0 .cse291)) (not (= (select (let ((.cse292 (store .cse293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse292 (select (select .cse292 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse294) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse296 (select (select .cse295 (select (select (store .cse293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse294))) (or (= (select (select .cse295 (select (select (store .cse293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse294) .cse296) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse297 (select (select .cse295 (select (select (store .cse293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse294))) (or (= .cse297 .cse296) (= (select (select .cse295 (select (select (store .cse293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse294) .cse297)))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse311 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse309 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse307 (select (select .cse309 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse310 (+ (select (select .cse311 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse302 (store (store .cse311 .cse307 (store (select .cse311 .cse307) .cse310 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse308 (select (select .cse302 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse303 (store .cse309 .cse307 (store (select .cse309 .cse307) .cse310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse305 (store .cse303 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse306 (select (select .cse305 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse304 (+ .cse308 4))) (let ((.cse301 (select (select .cse302 .cse306) .cse304))) (or (not (= .cse301 4)) (= .cse301 (select (select .cse302 (select (select (store .cse303 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse304)) (= .cse301 (select (select .cse302 (select (select (store .cse303 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse304)) (not (= (select (select .cse305 .cse306) .cse304) .cse307)))))))) (not (<= 0 .cse308)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse321 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse324 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse322 (select (select .cse324 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse323 (+ (select (select .cse321 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse315 (store .cse324 .cse322 (store (select .cse324 .cse322) .cse323 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse314 (store (store .cse321 .cse322 (store (select .cse321 .cse322) .cse323 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse319 (select (select .cse314 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse317 (store .cse315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse318 (select (select .cse317 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse316 (+ .cse319 4))) (let ((.cse312 (select (select .cse314 .cse318) .cse316)) (.cse313 (select (select .cse314 (select (select (store .cse315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse316)) (.cse320 (select (select .cse314 (select (select (store .cse315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse316))) (or (= .cse312 .cse313) (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse314 (select (select (store .cse315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse316) 0)) (not (= (select (select .cse317 .cse318) .cse316) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse312 0) (not (<= 0 .cse319)) (= .cse320 .cse313) (= .cse320 0))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse336 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse333 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse334 (select (select .cse333 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse335 (+ (select (select .cse336 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse325 (store (store .cse336 .cse334 (store (select .cse336 .cse334) .cse335 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse331 (select (select .cse325 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse326 (store .cse333 .cse334 (store (select .cse333 .cse334) .cse335 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse327 (+ .cse331 4))) (let ((.cse328 (select (select .cse325 (select (select (store .cse326 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse327)) (.cse332 (select (select .cse325 (select (select (store .cse326 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse327))) (or (= (select (select .cse325 (select (select (store .cse326 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse327) 0) (= .cse328 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse329 (store .cse326 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse330 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse329 .cse330) .cse327) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= (select (select .cse325 .cse330) .cse327) 4)))))) (not (<= 0 .cse331)) (= .cse332 .cse328) (= .cse332 0))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse346 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse343 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse344 (select (select .cse343 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse345 (+ (select (select .cse346 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse339 (store (store .cse346 .cse344 (store (select .cse346 .cse344) .cse345 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse337 (select (select .cse339 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse337)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse340 (store .cse343 .cse344 (store (select .cse343 .cse344) .cse345 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse341 (+ .cse337 4))) (let ((.cse338 (select (select .cse339 (select (select (store .cse340 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse341)) (.cse342 (select (select .cse339 (select (select (store .cse340 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse341))) (or (= .cse338 0) (= .cse338 (select (select .cse339 (select (select (store .cse340 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse341)) (= .cse338 (select (select .cse339 (select (select (store .cse340 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse341)) (= .cse338 .cse342) (= .cse342 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse356 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse353 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse354 (select (select .cse353 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse355 (+ (select (select .cse356 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse347 (store (store .cse356 .cse354 (store (select .cse356 .cse354) .cse355 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse352 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse348 (store .cse353 .cse354 (store (select .cse353 .cse354) .cse355 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse349 (+ .cse352 4))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse347 (select (select (store .cse348 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse349) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse351 (select (select .cse347 (select (select (store .cse348 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse349)) (.cse350 (select (select .cse347 (select (select (store .cse348 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse349))) (or (= .cse350 (select (select .cse347 (select (select (store .cse348 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse349)) (= .cse351 0) (= .cse350 .cse351) (= .cse350 0)))) (not (<= 0 .cse352))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse368 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse366 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse357 (select (select .cse366 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse367 (+ (select (select .cse368 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse364 (store (store .cse368 .cse357 (store (select .cse368 .cse357) .cse367 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse365 (select (select .cse364 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse359 (store .cse366 .cse357 (store (select .cse366 .cse357) .cse367 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse360 (+ .cse365 4))) (or (not (= .cse357 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse358 (store .cse359 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse358 (select (select .cse358 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse360) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse362 (select (select .cse364 (select (select (store .cse359 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse360)) (.cse361 (select (select .cse364 (select (select (store .cse359 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse360)) (.cse363 (select (select .cse364 (select (select (store .cse359 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse360))) (or (= .cse361 .cse362) (= .cse362 0) (= .cse361 .cse363) (= .cse363 0)))) (not (<= 0 .cse365))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse380 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse378 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse376 (select (select .cse378 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse379 (+ (select (select .cse380 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse371 (store (store .cse380 .cse376 (store (select .cse380 .cse376) .cse379 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse377 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse372 (store .cse378 .cse376 (store (select .cse378 .cse376) .cse379 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse373 (+ .cse377 4))) (let ((.cse370 (select (select .cse371 (select (select (store .cse372 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse373))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse374 (store .cse372 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse375 (select (select .cse374 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse369 (select (select .cse371 .cse375) .cse373))) (or (not (= .cse369 4)) (= .cse370 .cse369) (= .cse369 (select (select .cse371 (select (select (store .cse372 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse373)) (not (= (select (select .cse374 .cse375) .cse373) .cse376))))))) (= .cse370 (select (select .cse371 (select (select (store .cse372 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse373)))))) (not (<= 0 .cse377)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse394 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse391 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse392 (select (select .cse391 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse393 (+ (select (select .cse394 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse389 (store (store .cse394 .cse392 (store (select .cse394 .cse392) .cse393 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse381 (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse381)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse390 (store .cse391 .cse392 (store (select .cse391 .cse392) .cse393 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse386 (store .cse390 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse387 (select (select .cse386 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse388 (+ .cse381 4))) (let ((.cse382 (select (select .cse389 (select (select (store .cse390 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse388)) (.cse385 (select (select .cse389 .cse387) .cse388)) (.cse384 (select (select .cse389 (select (select (store .cse390 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse388)) (.cse383 (select (select .cse389 (select (select (store .cse390 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse388))) (or (= .cse382 .cse383) (= .cse384 .cse385) (not (= (select (select .cse386 .cse387) .cse388) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse382 .cse385) (= .cse382 .cse384) (not (= .cse385 4)) (= .cse384 .cse383))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse406 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse404 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse403 (select (select .cse404 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse405 (+ (select (select .cse406 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse398 (store (store .cse406 .cse403 (store (select .cse406 .cse403) .cse405 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse395 (select (select .cse398 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse395)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse399 (store .cse404 .cse403 (store (select .cse404 .cse403) .cse405 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse400 (+ .cse395 4))) (let ((.cse396 (select (select .cse398 (select (select (store .cse399 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse400))) (or (= .cse396 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse401 (store .cse399 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse402 (select (select .cse401 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse397 (select (select .cse398 .cse402) .cse400))) (or (not (= .cse397 4)) (= .cse397 .cse396) (forall ((v_prenex_39 (Array Int Int))) (= .cse397 (select (select .cse398 (select (select (store .cse399 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse400))) (not (= (select (select .cse401 .cse402) .cse400) .cse403))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse417 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse415 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse412 (select (select .cse415 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse416 (+ (select (select .cse417 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse408 (store (store .cse417 .cse412 (store (select .cse417 .cse412) .cse416 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse414 (select (select .cse408 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse409 (store .cse415 .cse412 (store (select .cse415 .cse412) .cse416 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse410 (+ .cse414 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse407 (select (select .cse408 (select (select (store .cse409 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse410)) (.cse411 (select (select .cse408 (select (select (store .cse409 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse410))) (or (= .cse407 (select (select .cse408 (select (select (store .cse409 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse410)) (= .cse411 .cse407) (= (select (select .cse408 (select (select (store .cse409 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse410) .cse411)))) (not (= .cse412 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse413 (store .cse409 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse413 (select (select .cse413 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse410) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse414))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse430 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse427 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse428 (select (select .cse427 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse429 (+ (select (select .cse430 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse425 (store (store .cse430 .cse428 (store (select .cse430 .cse428) .cse429 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse418 (select (select .cse425 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse418)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse426 (store .cse427 .cse428 (store (select .cse427 .cse428) .cse429 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse419 (store .cse426 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse420 (select (select .cse419 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse421 (+ .cse418 4))) (let ((.cse422 (select (select .cse425 (select (select (store .cse426 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse421)) (.cse423 (select (select .cse425 .cse420) .cse421)) (.cse424 (select (select .cse425 (select (select (store .cse426 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse421))) (or (not (= (select (select .cse419 .cse420) .cse421) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse422 .cse423) (= .cse422 .cse424) (not (= .cse423 4)) (= .cse424 (select (select .cse425 (select (select (store .cse426 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse421)) (= .cse424 0))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse442 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse439 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse440 (select (select .cse439 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse441 (+ (select (select .cse442 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse431 (store (store .cse442 .cse440 (store (select .cse442 .cse440) .cse441 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse438 (select (select .cse431 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse432 (store .cse439 .cse440 (store (select .cse439 .cse440) .cse441 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse436 (store .cse432 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse437 (select (select .cse436 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse433 (+ .cse438 4))) (let ((.cse434 (select (select .cse431 .cse437) .cse433)) (.cse435 (select (select .cse431 (select (select (store .cse432 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse433))) (or (= (select (select .cse431 (select (select (store .cse432 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse433) .cse434) (= .cse435 (select (select .cse431 (select (select (store .cse432 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse433)) (= .cse434 0) (= .cse435 .cse434) (= .cse435 0) (= (select (select .cse436 .cse437) .cse433) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))) (not (<= 0 .cse438)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse455 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse452 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse453 (select (select .cse452 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse454 (+ (select (select .cse455 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse446 (store (store .cse455 .cse453 (store (select .cse455 .cse453) .cse454 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse448 (select (select .cse446 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse447 (store .cse452 .cse453 (store (select .cse452 .cse453) .cse454 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse445 (+ .cse448 4))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse443 (store .cse447 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse444 (select (select .cse443 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse443 .cse444) .cse445) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse446 .cse444) .cse445) 0))))) (not (<= 0 .cse448)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse449 (select (select .cse446 (select (select (store .cse447 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse445)) (.cse450 (select (select .cse446 (select (select (store .cse447 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse445)) (.cse451 (select (select .cse446 (select (select (store .cse447 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse445))) (or (= .cse449 0) (= .cse450 0) (= .cse449 .cse451) (= .cse451 .cse450) (= .cse451 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (or .cse160 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int) (v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse462 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse465 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse463 (select (select .cse465 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse464 (+ (select (select .cse462 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse461 (store .cse465 .cse463 (store (select .cse465 .cse463) .cse464 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse459 (store (store .cse462 .cse463 (store (select .cse462 .cse463) .cse464 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse460 (select (select .cse459 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse456 (store .cse461 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse457 (select (select .cse456 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse458 (+ .cse460 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (= (select (select .cse456 .cse457) .cse458) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse459 .cse457) .cse458) 0) (not (<= 0 .cse460)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (= (select (select .cse459 (select (select (store .cse461 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse458) 0))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse475 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse472 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse473 (select (select .cse472 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse474 (+ (select (select .cse475 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse466 (store (store .cse475 .cse473 (store (select .cse475 .cse473) .cse474 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse471 (select (select .cse466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse467 (store .cse472 .cse473 (store (select .cse472 .cse473) .cse474 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse468 (+ .cse471 4))) (or (= (select (select .cse466 (select (select (store .cse467 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse468) 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse469 (store .cse467 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse470 (select (select .cse469 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse469 .cse470) .cse468) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= (select (select .cse466 .cse470) .cse468) 4)))))) (not (<= 0 .cse471)) (= (select (select .cse466 (select (select (store .cse467 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse468) 0)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse484 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse476 (select (select .cse484 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse476 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse486 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse485 (+ (select (select .cse486 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse478 (store (store .cse486 .cse476 (store (select .cse486 .cse476) .cse485 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse482 (select (select .cse478 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse479 (store .cse484 .cse476 (store (select .cse484 .cse476) .cse485 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse480 (+ .cse482 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse477 (select (select .cse478 (select (select (store .cse479 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse480)) (.cse481 (select (select .cse478 (select (select (store .cse479 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse480))) (or (= .cse477 (select (select .cse478 (select (select (store .cse479 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse480)) (= .cse481 .cse477) (= .cse477 0) (= (select (select .cse478 (select (select (store .cse479 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse480) .cse481)))) (not (<= 0 .cse482)) (not (= (select (let ((.cse483 (store .cse479 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse483 (select (select .cse483 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse480) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse494 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse495 (select (select .cse494 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse497 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse496 (+ (select (select .cse497 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse488 (store (store .cse497 .cse495 (store (select .cse497 .cse495) .cse496 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse492 (select (select .cse488 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse489 (store .cse494 .cse495 (store (select .cse494 .cse495) .cse496 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse490 (+ .cse492 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse491 (select (select .cse488 (select (select (store .cse489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse490)) (.cse487 (select (select .cse488 (select (select (store .cse489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse490))) (or (= .cse487 (select (select .cse488 (select (select (store .cse489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse490)) (= .cse491 0) (= .cse487 .cse491) (= .cse487 0)))) (not (<= 0 .cse492)) (not (= (select (let ((.cse493 (store .cse489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse493 (select (select .cse493 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse490) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse495 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse510 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse508 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse504 (select (select .cse508 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse509 (+ (select (select .cse510 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse505 (store (store .cse510 .cse504 (store (select .cse510 .cse504) .cse509 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse507 (select (select .cse505 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse506 (store .cse508 .cse504 (store (select .cse508 .cse504) .cse509 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse501 (store .cse506 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse502 (select (select .cse501 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse503 (+ .cse507 4))) (let ((.cse498 (select (select .cse505 (select (select (store .cse506 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse503)) (.cse500 (select (select .cse505 .cse502) .cse503)) (.cse499 (select (select .cse505 (select (select (store .cse506 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse503))) (or (= .cse498 .cse499) (not (= .cse500 4)) (= .cse500 .cse498) (= .cse498 0) (= .cse500 .cse499) (not (= (select (select .cse501 .cse502) .cse503) .cse504)))))))) (not (<= 0 .cse507)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse522 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse520 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse511 (select (select .cse520 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse521 (+ (select (select .cse522 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse519 (store (store .cse522 .cse511 (store (select .cse522 .cse511) .cse521 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse515 (select (select .cse519 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse513 (store .cse520 .cse511 (store (select .cse520 .cse511) .cse521 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse514 (+ .cse515 4))) (or (not (= .cse511 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse512 (store .cse513 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse512 (select (select .cse512 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse514) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse515)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse516 (select (select .cse519 (select (select (store .cse513 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse514)) (.cse517 (select (select .cse519 (select (select (store .cse513 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse514)) (.cse518 (select (select .cse519 (select (select (store .cse513 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse514))) (or (= .cse516 .cse517) (= .cse516 0) (= .cse518 .cse517) (= .cse518 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse535 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse532 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse533 (select (select .cse532 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse534 (+ (select (select .cse535 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse529 (store (store .cse535 .cse533 (store (select .cse535 .cse533) .cse534 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse531 (select (select .cse529 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse530 (store .cse532 .cse533 (store (select .cse532 .cse533) .cse534 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse527 (+ .cse531 4))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse524 (select (select .cse529 (select (select (store .cse530 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse527))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse523 (select (select .cse529 (select (select (store .cse530 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse527))) (or (= .cse523 0) (= .cse523 .cse524) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse525 (store .cse530 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse526 (select (select .cse525 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse528 (select (select .cse529 .cse526) .cse527))) (or (not (= (select (select .cse525 .cse526) .cse527) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse523 .cse528) (= .cse528 0))))))))) (= .cse524 0)))) (= (select (select .cse529 (select (select (store .cse530 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse527) 0) (not (<= 0 .cse531))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse548 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse545 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse546 (select (select .cse545 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse547 (+ (select (select .cse548 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse537 (store (store .cse548 .cse546 (store (select .cse548 .cse546) .cse547 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse544 (select (select .cse537 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse538 (store .cse545 .cse546 (store (select .cse545 .cse546) .cse547 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse539 (+ .cse544 4))) (let ((.cse536 (select (select .cse537 (select (select (store .cse538 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse539))) (or (= .cse536 (select (select .cse537 (select (select (store .cse538 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse539)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse542 (store .cse538 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse543 (select (select .cse542 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse541 (select (select .cse537 .cse543) .cse539)) (.cse540 (select (select .cse537 (select (select (store .cse538 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse539))) (or (= .cse540 .cse541) (not (= (select (select .cse542 .cse543) .cse539) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse536 .cse540) (not (= .cse541 4)) (= .cse540 0)))))))))) (not (<= 0 .cse544)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse556 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse549 (select (select .cse556 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse549 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse558 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse557 (+ (select (select .cse558 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse550 (store (store .cse558 .cse549 (store (select .cse558 .cse549) .cse557 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse554 (select (select .cse550 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse551 (store .cse556 .cse549 (store (select .cse556 .cse549) .cse557 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse552 (+ .cse554 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse553 (select (select .cse550 (select (select (store .cse551 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse552))) (or (= (select (select .cse550 (select (select (store .cse551 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse552) .cse553) (= .cse553 (select (select .cse550 (select (select (store .cse551 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse552))))) (not (<= 0 .cse554)) (not (= (select (let ((.cse555 (store .cse551 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse555 (select (select .cse555 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse552) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse571 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse568 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse569 (select (select .cse568 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse570 (+ (select (select .cse571 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse559 (store (store .cse571 .cse569 (store (select .cse571 .cse569) .cse570 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse567 (select (select .cse559 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse560 (store .cse568 .cse569 (store (select .cse568 .cse569) .cse570 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse561 (+ .cse567 4))) (or (= (select (select .cse559 (select (select (store .cse560 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse561) 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse562 (select (select .cse559 (select (select (store .cse560 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse561))) (or (= .cse562 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse563 (select (select .cse559 (select (select (store .cse560 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse561))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse565 (store .cse560 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse566 (select (select .cse565 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse564 (select (select .cse559 .cse566) .cse561))) (or (= .cse563 .cse564) (not (= (select (select .cse565 .cse566) .cse561) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse562 .cse564) (= .cse564 0)))))) (= .cse563 0))))))) (not (<= 0 .cse567))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse582 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse572 (select (select .cse582 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse572 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse584 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse583 (+ (select (select .cse584 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse577 (store (store .cse584 .cse572 (store (select .cse584 .cse572) .cse583 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse580 (select (select .cse577 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse578 (store .cse582 .cse572 (store (select .cse582 .cse572) .cse583 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse579 (+ .cse580 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse574 (select (select .cse577 (select (select (store .cse578 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse579)) (.cse573 (select (select .cse577 (select (select (store .cse578 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse579)) (.cse575 (select (select .cse577 (select (select (store .cse578 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse579)) (.cse576 (select (select .cse577 (select (select (store .cse578 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse579))) (or (= .cse573 .cse574) (= .cse575 .cse574) (= .cse576 .cse573) (= .cse575 .cse573) (= .cse573 0) (= .cse575 .cse576)))) (not (<= 0 .cse580)) (not (= (select (let ((.cse581 (store .cse578 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse581 (select (select .cse581 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse579) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse598 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse596 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse591 (select (select .cse596 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse597 (+ (select (select .cse598 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse593 (store (store .cse598 .cse591 (store (select .cse598 .cse591) .cse597 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse595 (select (select .cse593 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse594 (store .cse596 .cse591 (store (select .cse596 .cse591) .cse597 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse590 (+ .cse595 4))) (let ((.cse586 (select (select .cse593 (select (select (store .cse594 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse590)) (.cse585 (select (select .cse593 (select (select (store .cse594 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse590))) (or (= .cse585 .cse586) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse588 (store .cse594 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse589 (select (select .cse588 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse587 (select (select .cse593 .cse589) .cse590))) (or (not (= .cse587 4)) (= .cse587 .cse586) (not (= (select (select .cse588 .cse589) .cse590) .cse591)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse592 (select (select .cse593 (select (select (store .cse594 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse590))) (or (= .cse585 .cse592) (= .cse587 .cse592))))))))))))) (not (<= 0 .cse595)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse612 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse609 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse610 (select (select .cse609 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse611 (+ (select (select .cse612 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse606 (store (store .cse612 .cse610 (store (select .cse612 .cse610) .cse611 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse608 (select (select .cse606 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse607 (store .cse609 .cse610 (store (select .cse609 .cse610) .cse611 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse603 (store .cse607 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse604 (select (select .cse603 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse605 (+ .cse608 4))) (let ((.cse600 (select (select .cse606 (select (select (store .cse607 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse605)) (.cse599 (select (select .cse606 .cse604) .cse605)) (.cse601 (select (select .cse606 (select (select (store .cse607 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse605)) (.cse602 (select (select .cse606 (select (select (store .cse607 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse605))) (or (= .cse599 .cse600) (= .cse601 .cse600) (= .cse602 .cse599) (not (= (select (select .cse603 .cse604) .cse605) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse601 .cse599) (= .cse599 0) (= .cse601 .cse602))))))) (not (<= 0 .cse608)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse621 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse622 (select (select .cse621 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse624 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse623 (+ (select (select .cse624 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse615 (store (store .cse624 .cse622 (store (select .cse624 .cse622) .cse623 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse619 (select (select .cse615 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse616 (store .cse621 .cse622 (store (select .cse621 .cse622) .cse623 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse617 (+ .cse619 4))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse613 (select (select .cse615 (select (select (store .cse616 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse617))) (or (= .cse613 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse614 (select (select .cse615 (select (select (store .cse616 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse617))) (or (= .cse614 .cse613) (= (select (select .cse615 (select (select (store .cse616 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse617) .cse614) (= .cse614 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse618 (select (select .cse615 (select (select (store .cse616 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse617))) (or (= .cse618 .cse614) (= .cse618 .cse613)))))))))) (not (<= 0 .cse619)) (not (= (select (let ((.cse620 (store .cse616 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse620 (select (select .cse620 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse617) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse622 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse634 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse625 (select (select .cse634 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse625 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse636 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse635 (+ (select (select .cse636 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse626 (store (store .cse636 .cse625 (store (select .cse636 .cse625) .cse635 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse632 (select (select .cse626 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse627 (store .cse634 .cse625 (store (select .cse634 .cse625) .cse635 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse628 (+ .cse632 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse629 (select (select .cse626 (select (select (store .cse627 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse628))) (or (= (select (select .cse626 (select (select (store .cse627 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse628) .cse629) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse630 (select (select .cse626 (select (select (store .cse627 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse628))) (or (= .cse630 .cse629) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse631 (select (select .cse626 (select (select (store .cse627 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse628))) (or (= .cse629 .cse631) (= .cse630 .cse631))))))) (= .cse629 0)))) (not (<= 0 .cse632)) (not (= (select (let ((.cse633 (store .cse627 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse633 (select (select .cse633 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse628) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse648 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse645 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse646 (select (select .cse645 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse647 (+ (select (select .cse648 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse643 (store (store .cse648 .cse646 (store (select .cse648 .cse646) .cse647 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse637 (select (select .cse643 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse637)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse644 (store .cse645 .cse646 (store (select .cse645 .cse646) .cse647 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse638 (store .cse644 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse639 (select (select .cse638 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse640 (+ .cse637 4))) (let ((.cse641 (select (select .cse643 .cse639) .cse640))) (or (not (= (select (select .cse638 .cse639) .cse640) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse641 4)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse642 (select (select .cse643 (select (select (store .cse644 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse640))) (or (= .cse642 .cse641) (forall ((v_prenex_39 (Array Int Int))) (= .cse642 (select (select .cse643 (select (select (store .cse644 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse640)))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse661 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse658 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse659 (select (select .cse658 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse660 (+ (select (select .cse661 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse651 (store (store .cse661 .cse659 (store (select .cse661 .cse659) .cse660 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse649 (select (select .cse651 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse649)) (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse652 (store .cse658 .cse659 (store (select .cse658 .cse659) .cse660 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse653 (+ .cse649 4))) (let ((.cse650 (select (select .cse651 (select (select (store .cse652 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse653))) (or (= .cse650 0) (= .cse650 (select (select .cse651 (select (select (store .cse652 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse653)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse656 (store .cse652 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse657 (select (select .cse656 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse655 (select (select .cse651 .cse657) .cse653)) (.cse654 (select (select .cse651 (select (select (store .cse652 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse653))) (or (= .cse654 .cse655) (not (= (select (select .cse656 .cse657) .cse653) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse650 .cse654) (not (= .cse655 4)) (= .cse654 0)))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse670 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse662 (select (select .cse670 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse662 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse672 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse671 (+ (select (select .cse672 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse663 (store (store .cse672 .cse662 (store (select .cse672 .cse662) .cse671 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse668 (select (select .cse663 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse664 (store .cse670 .cse662 (store (select .cse670 .cse662) .cse671 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse665 (+ .cse668 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse666 (select (select .cse663 (select (select (store .cse664 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse665)) (.cse667 (select (select .cse663 (select (select (store .cse664 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse665))) (or (= (select (select .cse663 (select (select (store .cse664 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse665) .cse666) (= .cse667 (select (select .cse663 (select (select (store .cse664 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse665)) (= .cse667 .cse666) (= .cse667 0)))) (not (<= 0 .cse668)) (not (= (select (let ((.cse669 (store .cse664 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse669 (select (select .cse669 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse665) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse685 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse682 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse683 (select (select .cse682 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse684 (+ (select (select .cse685 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse673 (store (store .cse685 .cse683 (store (select .cse685 .cse683) .cse684 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse676 (select (select .cse673 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse675 (+ .cse676 4)) (.cse674 (store .cse682 .cse683 (store (select .cse682 .cse683) .cse684 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse673 (select (select (store .cse674 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse675) 0)) (not (<= 0 .cse676)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse680 (store .cse674 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse681 (select (select .cse680 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse677 (select (select .cse673 .cse681) .cse675)) (.cse678 (select (select .cse673 (select (select (store .cse674 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse675)) (.cse679 (select (select .cse673 (select (select (store .cse674 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse675))) (or (= .cse677 .cse678) (= .cse679 .cse677) (not (= (select (select .cse680 .cse681) .cse675) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse677 0) (= .cse678 0) (= .cse679 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (or .cse160 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse695 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse697 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse694 (select (select .cse697 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse696 (+ (select (select .cse695 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse689 (store .cse697 .cse694 (store (select .cse697 .cse694) .cse696 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse688 (store (store .cse695 .cse694 (store (select .cse695 .cse694) .cse696 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse691 (select (select .cse688 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse692 (store .cse689 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse693 (select (select .cse692 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse690 (+ .cse691 4))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse686 (select (select .cse688 (select (select (store .cse689 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse690))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse687 (select (select .cse688 (select (select (store .cse689 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse690))) (or (= .cse686 .cse687) (= .cse687 0)))) (= .cse686 0)))) (not (<= 0 .cse691)) (not (= (select (select .cse692 .cse693) .cse690) .cse694)) (= (select (select .cse688 .cse693) .cse690) 0)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse706 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse708 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse705 (select (select .cse708 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse707 (+ (select (select .cse706 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse700 (store .cse708 .cse705 (store (select .cse708 .cse705) .cse707 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse699 (store (store .cse706 .cse705 (store (select .cse706 .cse705) .cse707 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse702 (select (select .cse699 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse703 (store .cse700 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse704 (select (select .cse703 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse701 (+ .cse702 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse698 (select (select .cse699 (select (select (store .cse700 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse701))) (or (= .cse698 (select (select .cse699 (select (select (store .cse700 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse701)) (= .cse698 0)))) (not (<= 0 .cse702)) (not (= (select (select .cse703 .cse704) .cse701) .cse705)) (= (select (select .cse699 .cse704) .cse701) 0)))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse719 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse716 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse717 (select (select .cse716 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse718 (+ (select (select .cse719 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse711 (store (store .cse719 .cse717 (store (select .cse719 .cse717) .cse718 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse709 (select (select .cse711 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse709)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse712 (store .cse716 .cse717 (store (select .cse716 .cse717) .cse718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse714 (store .cse712 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse715 (select (select .cse714 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse713 (+ .cse709 4))) (let ((.cse710 (select (select .cse711 .cse715) .cse713))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse710 (select (select .cse711 (select (select (store .cse712 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse713))) (= (select (select .cse711 (select (select (store .cse712 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse713) .cse710) (not (= (select (select .cse714 .cse715) .cse713) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse710 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse731 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse728 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse729 (select (select .cse728 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse730 (+ (select (select .cse731 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse720 (store (store .cse731 .cse729 (store (select .cse731 .cse729) .cse730 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse727 (select (select .cse720 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse721 (store .cse728 .cse729 (store (select .cse728 .cse729) .cse730 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse722 (+ .cse727 4))) (let ((.cse723 (select (select .cse720 (select (select (store .cse721 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse722))) (or (= (select (select .cse720 (select (select (store .cse721 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse722) .cse723) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse725 (store .cse721 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse726 (select (select .cse725 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse724 (select (select .cse720 .cse726) .cse722))) (or (= .cse723 .cse724) (not (= (select (select .cse725 .cse726) .cse722) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse724 4))))))))))) (not (<= 0 .cse727)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse744 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse741 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse742 (select (select .cse741 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse743 (+ (select (select .cse744 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse738 (store (store .cse744 .cse742 (store (select .cse744 .cse742) .cse743 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse740 (select (select .cse738 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse739 (store .cse741 .cse742 (store (select .cse741 .cse742) .cse743 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse735 (store .cse739 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse736 (select (select .cse735 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse737 (+ .cse740 4))) (let ((.cse732 (select (select .cse738 .cse736) .cse737)) (.cse734 (select (select .cse738 (select (select (store .cse739 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse737)) (.cse733 (select (select .cse738 (select (select (store .cse739 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse737))) (or (= .cse732 .cse733) (= .cse734 .cse732) (not (= (select (select .cse735 .cse736) .cse737) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse732 4)) (= .cse734 .cse733))))))) (not (<= 0 .cse740)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse757 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse754 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse755 (select (select .cse754 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse756 (+ (select (select .cse757 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse745 (store (store .cse757 .cse755 (store (select .cse757 .cse755) .cse756 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse753 (select (select .cse745 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse747 (+ .cse753 4)) (.cse746 (store .cse754 .cse755 (store (select .cse754 .cse755) .cse756 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse745 (select (select (store .cse746 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse747) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse751 (store .cse746 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse752 (select (select .cse751 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse748 (select (select .cse745 .cse752) .cse747)) (.cse749 (select (select .cse745 (select (select (store .cse746 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse747)) (.cse750 (select (select .cse745 (select (select (store .cse746 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse747))) (or (= .cse748 .cse749) (= .cse750 .cse748) (not (= (select (select .cse751 .cse752) .cse747) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse748 0) (= .cse750 .cse749) (= .cse750 0)))))) (not (<= 0 .cse753))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse770 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse768 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse766 (select (select .cse768 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse769 (+ (select (select .cse770 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse761 (store (store .cse770 .cse766 (store (select .cse770 .cse766) .cse769 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse767 (select (select .cse761 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse762 (store .cse768 .cse766 (store (select .cse768 .cse766) .cse769 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse764 (store .cse762 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse765 (select (select .cse764 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse763 (+ .cse767 4))) (let ((.cse760 (select (select .cse761 (select (select (store .cse762 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse763)) (.cse759 (select (select .cse761 (select (select (store .cse762 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse763)) (.cse758 (select (select .cse761 .cse765) .cse763))) (or (not (= .cse758 4)) (= .cse759 .cse760) (= .cse760 0) (= .cse759 .cse758) (= .cse758 (select (select .cse761 (select (select (store .cse762 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse763)) (not (= (select (select .cse764 .cse765) .cse763) .cse766)))))))) (not (<= 0 .cse767)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse780 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse777 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse778 (select (select .cse777 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse779 (+ (select (select .cse780 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse771 (store (store .cse780 .cse778 (store (select .cse780 .cse778) .cse779 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse776 (select (select .cse771 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse772 (store .cse777 .cse778 (store (select .cse777 .cse778) .cse779 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse773 (+ .cse776 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse771 (select (select (store .cse772 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse773) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse774 (select (select .cse771 (select (select (store .cse772 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse773)) (.cse775 (select (select .cse771 (select (select (store .cse772 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse773))) (or (= .cse774 0) (= .cse774 .cse775) (= .cse775 0)))) (forall ((v_prenex_39 (Array Int Int))) (= (select (select .cse771 (select (select (store .cse772 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse773) 0)) (not (<= 0 .cse776))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse790 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse788 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse786 (select (select .cse788 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse789 (+ (select (select .cse790 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse781 (store (store .cse790 .cse786 (store (select .cse790 .cse786) .cse789 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse787 (select (select .cse781 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse783 (+ .cse787 4)) (.cse782 (store .cse788 .cse786 (store (select .cse788 .cse786) .cse789 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse781 (select (select (store .cse782 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse783) 0)) (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse781 (select (select (store .cse782 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse783) 0)) (forall ((v_prenex_39 (Array Int Int))) (= (select (select .cse781 (select (select (store .cse782 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse783) 0)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse784 (store .cse782 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse785 (select (select .cse784 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse784 .cse785) .cse783) .cse786)) (= (select (select .cse781 .cse785) .cse783) 0))))) (not (<= 0 .cse787))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse802 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse799 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse800 (select (select .cse799 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse801 (+ (select (select .cse802 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse796 (store (store .cse802 .cse800 (store (select .cse802 .cse800) .cse801 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse791 (select (select .cse796 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse791)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse797 (store .cse799 .cse800 (store (select .cse799 .cse800) .cse801 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse798 (+ .cse791 4))) (let ((.cse794 (select (select .cse796 (select (select (store .cse797 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse798)) (.cse793 (select (select .cse796 (select (select (store .cse797 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse798)) (.cse792 (select (select .cse796 (select (select (store .cse797 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse798)) (.cse795 (select (select .cse796 (select (select (store .cse797 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse798))) (or (= .cse792 0) (= .cse793 .cse794) (= .cse792 .cse794) (= .cse795 .cse793) (= .cse792 .cse793) (= .cse792 .cse795))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse811 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse803 (select (select .cse811 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse803 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse813 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse812 (+ (select (select .cse813 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse804 (store (store .cse813 .cse803 (store (select .cse813 .cse803) .cse812 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse809 (select (select .cse804 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse805 (store .cse811 .cse803 (store (select .cse811 .cse803) .cse812 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse806 (+ .cse809 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse807 (select (select .cse804 (select (select (store .cse805 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse806))) (or (= (select (select .cse804 (select (select (store .cse805 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse806) .cse807) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse808 (select (select .cse804 (select (select (store .cse805 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse806))) (or (= .cse807 .cse808) (= .cse808 0)))) (= .cse807 0)))) (not (<= 0 .cse809)) (not (= (select (let ((.cse810 (store .cse805 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse810 (select (select .cse810 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse806) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse825 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse822 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse823 (select (select .cse822 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse824 (+ (select (select .cse825 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse815 (store (store .cse825 .cse823 (store (select .cse825 .cse823) .cse824 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse821 (select (select .cse815 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse816 (store .cse822 .cse823 (store (select .cse822 .cse823) .cse824 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse817 (+ .cse821 4))) (let ((.cse818 (select (select .cse815 (select (select (store .cse816 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse817))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse819 (store .cse816 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse820 (select (select .cse819 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse814 (select (select .cse815 .cse820) .cse817))) (or (= .cse814 (select (select .cse815 (select (select (store .cse816 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse817)) (= .cse818 .cse814) (not (= (select (select .cse819 .cse820) .cse817) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse814 4))))))) (= (select (select .cse815 (select (select (store .cse816 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse817) .cse818) (= .cse818 0))))) (not (<= 0 .cse821)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse839 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse837 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse829 (select (select .cse837 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse838 (+ (select (select .cse839 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse833 (store (store .cse839 .cse829 (store (select .cse839 .cse829) .cse838 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse836 (select (select .cse833 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse834 (store .cse837 .cse829 (store (select .cse837 .cse829) .cse838 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse828 (+ .cse836 4))) (let ((.cse835 (select (select .cse833 (select (select (store .cse834 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse828))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse826 (store .cse834 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse827 (select (select .cse826 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse830 (select (select .cse833 .cse827) .cse828))) (or (not (= (select (select .cse826 .cse827) .cse828) .cse829)) (= .cse830 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse831 (select (select .cse833 (select (select (store .cse834 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse828))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse832 (select (select .cse833 (select (select (store .cse834 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse828))) (or (= .cse831 .cse832) (= .cse832 0)))) (= .cse831 .cse835) (= .cse831 .cse830))))))))) (= .cse835 0))))) (not (<= 0 .cse836)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse850 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse847 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse848 (select (select .cse847 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse849 (+ (select (select .cse850 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse841 (store (store .cse850 .cse848 (store (select .cse850 .cse848) .cse849 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse840 (select (select .cse841 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse840)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse842 (store .cse847 .cse848 (store (select .cse847 .cse848) .cse849 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse845 (store .cse842 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse846 (select (select .cse845 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse843 (+ .cse840 4))) (let ((.cse844 (select (select .cse841 .cse846) .cse843))) (or (= (select (select .cse841 (select (select (store .cse842 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse843) .cse844) (not (= (select (select .cse845 .cse846) .cse843) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse844 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse863 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse861 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse857 (select (select .cse861 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse862 (+ (select (select .cse863 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse858 (store (store .cse863 .cse857 (store (select .cse863 .cse857) .cse862 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse860 (select (select .cse858 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse859 (store .cse861 .cse857 (store (select .cse861 .cse857) .cse862 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse854 (store .cse859 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse855 (select (select .cse854 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse856 (+ .cse860 4))) (let ((.cse852 (select (select .cse858 (select (select (store .cse859 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse856)) (.cse853 (select (select .cse858 (select (select (store .cse859 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse856)) (.cse851 (select (select .cse858 .cse855) .cse856))) (or (not (= .cse851 4)) (= .cse851 .cse852) (= .cse853 .cse852) (= .cse852 0) (= .cse853 .cse851) (not (= (select (select .cse854 .cse855) .cse856) .cse857)))))))) (not (<= 0 .cse860)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse876 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse874 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse870 (select (select .cse874 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse875 (+ (select (select .cse876 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse871 (store (store .cse876 .cse870 (store (select .cse876 .cse870) .cse875 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse873 (select (select .cse871 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse872 (store .cse874 .cse870 (store (select .cse874 .cse870) .cse875 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse869 (+ .cse873 4))) (let ((.cse865 (select (select .cse871 (select (select (store .cse872 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse869))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse867 (store .cse872 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse868 (select (select .cse867 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse864 (select (select .cse871 .cse868) .cse869)) (.cse866 (select (select .cse871 (select (select (store .cse872 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse869))) (or (not (= .cse864 4)) (= .cse865 .cse866) (= .cse865 .cse864) (= .cse864 .cse866) (not (= (select (select .cse867 .cse868) .cse869) .cse870))))))) (= .cse865 (select (select .cse871 (select (select (store .cse872 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse869)))))) (not (<= 0 .cse873)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse888 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse886 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse884 (select (select .cse886 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse887 (+ (select (select .cse888 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse878 (store (store .cse888 .cse884 (store (select .cse888 .cse884) .cse887 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse885 (select (select .cse878 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse879 (store .cse886 .cse884 (store (select .cse886 .cse884) .cse887 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse880 (+ .cse885 4))) (let ((.cse877 (select (select .cse878 (select (select (store .cse879 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse880))) (or (= .cse877 (select (select .cse878 (select (select (store .cse879 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse880)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse882 (store .cse879 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse883 (select (select .cse882 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse881 (select (select .cse878 .cse883) .cse880))) (or (not (= .cse881 4)) (= .cse881 .cse877) (= (select (select .cse878 (select (select (store .cse879 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse880) .cse881) (not (= (select (select .cse882 .cse883) .cse880) .cse884))))))))))) (not (<= 0 .cse885)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse897 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse895 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse892 (select (select .cse895 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse896 (+ (select (select .cse897 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse889 (store (store .cse897 .cse892 (store (select .cse897 .cse892) .cse896 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse894 (select (select .cse889 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse890 (store .cse895 .cse892 (store (select .cse895 .cse892) .cse896 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse891 (+ .cse894 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse889 (select (select (store .cse890 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse891) 0)) (not (= .cse892 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse893 (store .cse890 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse893 (select (select .cse893 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse891) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse894))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse909 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse907 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse905 (select (select .cse907 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse908 (+ (select (select .cse909 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse900 (store (store .cse909 .cse905 (store (select .cse909 .cse905) .cse908 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse906 (select (select .cse900 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse901 (store .cse907 .cse905 (store (select .cse907 .cse905) .cse908 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse903 (store .cse901 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse904 (select (select .cse903 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse902 (+ .cse906 4))) (let ((.cse899 (select (select .cse900 (select (select (store .cse901 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse902)) (.cse898 (select (select .cse900 .cse904) .cse902))) (or (not (= .cse898 4)) (= .cse899 (select (select .cse900 (select (select (store .cse901 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse902)) (= .cse899 .cse898) (not (= (select (select .cse903 .cse904) .cse902) .cse905)))))))) (not (<= 0 .cse906)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse921 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse919 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse917 (select (select .cse919 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse920 (+ (select (select .cse921 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse912 (store (store .cse921 .cse917 (store (select .cse921 .cse917) .cse920 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse918 (select (select .cse912 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse913 (store .cse919 .cse917 (store (select .cse919 .cse917) .cse920 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse915 (store .cse913 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse916 (select (select .cse915 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse914 (+ .cse918 4))) (let ((.cse911 (select (select .cse912 (select (select (store .cse913 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse914)) (.cse910 (select (select .cse912 .cse916) .cse914))) (or (not (= .cse910 4)) (= .cse910 .cse911) (= (select (select .cse912 (select (select (store .cse913 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse914) .cse911) (= .cse911 0) (= .cse910 (select (select .cse912 (select (select (store .cse913 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse914)) (not (= (select (select .cse915 .cse916) .cse914) .cse917)))))))) (not (<= 0 .cse918)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse931 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse929 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse922 (select (select .cse929 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse930 (+ (select (select .cse931 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse928 (store (store .cse931 .cse922 (store (select .cse931 .cse922) .cse930 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse926 (select (select .cse928 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse924 (store .cse929 .cse922 (store (select .cse929 .cse922) .cse930 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse925 (+ .cse926 4))) (or (not (= .cse922 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse923 (store .cse924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse923 (select (select .cse923 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse925) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse926)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse927 (select (select .cse928 (select (select (store .cse924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse925))) (or (= .cse927 (select (select .cse928 (select (select (store .cse924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse925)) (= (select (select .cse928 (select (select (store .cse924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse925) .cse927) (= .cse927 (select (select .cse928 (select (select (store .cse924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse925)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse940 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse932 (select (select .cse940 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse932 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse942 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse941 (+ (select (select .cse942 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse933 (store (store .cse942 .cse932 (store (select .cse942 .cse932) .cse941 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse936 (select (select .cse933 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse934 (store .cse940 .cse932 (store (select .cse940 .cse932) .cse941 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse935 (+ .cse936 4))) (or (= (select (select .cse933 (select (select (store .cse934 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse935) 0) (not (<= 0 .cse936)) (not (= (select (let ((.cse937 (store .cse934 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse937 (select (select .cse937 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse935) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse938 (select (select .cse933 (select (select (store .cse934 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse935)) (.cse939 (select (select .cse933 (select (select (store .cse934 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse935))) (or (= .cse938 0) (= (select (select .cse933 (select (select (store .cse934 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse935) .cse939) (= .cse939 .cse938) (= .cse939 0))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse956 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse954 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse950 (select (select .cse954 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse955 (+ (select (select .cse956 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse951 (store (store .cse956 .cse950 (store (select .cse956 .cse950) .cse955 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse953 (select (select .cse951 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse952 (store .cse954 .cse950 (store (select .cse954 .cse950) .cse955 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse947 (store .cse952 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse948 (select (select .cse947 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse949 (+ .cse953 4))) (let ((.cse944 (select (select .cse951 (select (select (store .cse952 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse949)) (.cse943 (select (select .cse951 (select (select (store .cse952 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse949)) (.cse945 (select (select .cse951 (select (select (store .cse952 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse949)) (.cse946 (select (select .cse951 .cse948) .cse949))) (or (= .cse943 0) (= .cse944 .cse945) (= .cse943 .cse945) (= .cse944 0) (= .cse943 .cse946) (= .cse946 .cse945) (not (= (select (select .cse947 .cse948) .cse949) .cse950)) (= .cse946 0))))))) (not (<= 0 .cse953)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse970 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse967 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse968 (select (select .cse967 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse969 (+ (select (select .cse970 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse965 (store (store .cse970 .cse968 (store (select .cse970 .cse968) .cse969 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse957 (select (select .cse965 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse957)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse966 (store .cse967 .cse968 (store (select .cse967 .cse968) .cse969 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse961 (store .cse966 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse962 (select (select .cse961 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse963 (+ .cse957 4))) (let ((.cse959 (select (select .cse965 .cse962) .cse963)) (.cse958 (select (select .cse965 (select (select (store .cse966 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse963)) (.cse960 (select (select .cse965 (select (select (store .cse966 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse963)) (.cse964 (select (select .cse965 (select (select (store .cse966 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse963))) (or (= .cse958 0) (= .cse959 .cse960) (not (= (select (select .cse961 .cse962) .cse963) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse959 0) (= .cse958 .cse964) (= .cse964 .cse960) (= .cse964 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse984 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse981 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse982 (select (select .cse981 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse983 (+ (select (select .cse984 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse978 (store (store .cse984 .cse982 (store (select .cse984 .cse982) .cse983 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse980 (select (select .cse978 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse979 (store .cse981 .cse982 (store (select .cse981 .cse982) .cse983 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse975 (store .cse979 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse976 (select (select .cse975 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse977 (+ .cse980 4))) (let ((.cse971 (select (select .cse978 (select (select (store .cse979 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse977)) (.cse974 (select (select .cse978 .cse976) .cse977)) (.cse972 (select (select .cse978 (select (select (store .cse979 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse977)) (.cse973 (select (select .cse978 (select (select (store .cse979 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse977))) (or (= .cse971 .cse972) (= .cse973 .cse974) (not (= (select (select .cse975 .cse976) .cse977) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse971 .cse974) (not (= .cse974 4)) (= .cse973 .cse972) (= .cse973 0))))))) (not (<= 0 .cse980)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse995 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse992 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse993 (select (select .cse992 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse994 (+ (select (select .cse995 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse985 (store (store .cse995 .cse993 (store (select .cse995 .cse993) .cse994 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse991 (select (select .cse985 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse986 (store .cse992 .cse993 (store (select .cse992 .cse993) .cse994 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse987 (+ .cse991 4))) (or (= (select (select .cse985 (select (select (store .cse986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse987) 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse989 (select (select .cse985 (select (select (store .cse986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse987))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse990 (select (select .cse985 (select (select (store .cse986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse987))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse988 (select (select .cse985 (select (select (store .cse986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse987))) (or (= .cse988 0) (= .cse988 .cse989) (= .cse988 .cse990)))) (= .cse990 0)))) (= .cse989 0)))) (not (<= 0 .cse991))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1009 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1006 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1007 (select (select .cse1006 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1008 (+ (select (select .cse1009 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1003 (store (store .cse1009 .cse1007 (store (select .cse1009 .cse1007) .cse1008 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1005 (select (select .cse1003 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1004 (store .cse1006 .cse1007 (store (select .cse1006 .cse1007) .cse1008 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1002 (+ .cse1005 4))) (let ((.cse997 (select (select .cse1003 (select (select (store .cse1004 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1002))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse998 (select (select .cse1003 (select (select (store .cse1004 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1002))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse996 (select (select .cse1003 (select (select (store .cse1004 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1002))) (or (= .cse996 .cse997) (= .cse996 .cse998) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1000 (store .cse1004 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse1001 (select (select .cse1000 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse999 (select (select .cse1003 .cse1001) .cse1002))) (or (= .cse996 .cse999) (= .cse999 0) (= (select (select .cse1000 .cse1001) .cse1002) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (= .cse998 0)))) (= .cse997 0))))) (not (<= 0 .cse1005)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1018 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1016 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1013 (select (select .cse1016 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1017 (+ (select (select .cse1018 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1010 (store (store .cse1018 .cse1013 (store (select .cse1018 .cse1013) .cse1017 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1015 (select (select .cse1010 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1011 (store .cse1016 .cse1013 (store (select .cse1016 .cse1013) .cse1017 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1012 (+ .cse1015 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse1010 (select (select (store .cse1011 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1012) 0)) (not (= .cse1013 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1014 (store .cse1011 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1014 (select (select .cse1014 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1012) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse1015)) (forall ((v_prenex_32 (Array Int Int))) (= (select (select .cse1010 (select (select (store .cse1011 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1012) 0))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1026 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1019 (select (select .cse1026 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse1019 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1028 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1027 (+ (select (select .cse1028 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1021 (store (store .cse1028 .cse1019 (store (select .cse1028 .cse1019) .cse1027 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1024 (select (select .cse1021 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1022 (store .cse1026 .cse1019 (store (select .cse1026 .cse1019) .cse1027 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1023 (+ .cse1024 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1020 (select (select .cse1021 (select (select (store .cse1022 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1023))) (or (= .cse1020 (select (select .cse1021 (select (select (store .cse1022 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1023)) (= .cse1020 (select (select .cse1021 (select (select (store .cse1022 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1023))))) (not (<= 0 .cse1024)) (not (= (select (let ((.cse1025 (store .cse1022 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1025 (select (select .cse1025 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1023) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1042 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1039 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1040 (select (select .cse1039 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1041 (+ (select (select .cse1042 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1036 (store (store .cse1042 .cse1040 (store (select .cse1042 .cse1040) .cse1041 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1038 (select (select .cse1036 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1037 (store .cse1039 .cse1040 (store (select .cse1039 .cse1040) .cse1041 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1032 (store .cse1037 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1033 (select (select .cse1032 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1034 (+ .cse1038 4))) (let ((.cse1031 (select (select .cse1036 .cse1033) .cse1034)) (.cse1029 (select (select .cse1036 (select (select (store .cse1037 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1034)) (.cse1030 (select (select .cse1036 (select (select (store .cse1037 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1034)) (.cse1035 (select (select .cse1036 (select (select (store .cse1037 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1034))) (or (= .cse1029 0) (= .cse1030 .cse1031) (not (= (select (select .cse1032 .cse1033) .cse1034) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1029 .cse1031) (= .cse1031 0) (= .cse1035 0) (= .cse1029 .cse1030) (= .cse1030 .cse1035))))))) (not (<= 0 .cse1038)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1056 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1054 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1051 (select (select .cse1054 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1055 (+ (select (select .cse1056 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1052 (store (store .cse1056 .cse1051 (store (select .cse1056 .cse1051) .cse1055 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1043 (select (select .cse1052 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1043)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1053 (store .cse1054 .cse1051 (store (select .cse1054 .cse1051) .cse1055 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1048 (store .cse1053 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1049 (select (select .cse1048 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1050 (+ .cse1043 4))) (let ((.cse1045 (select (select .cse1052 (select (select (store .cse1053 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1050)) (.cse1044 (select (select .cse1052 (select (select (store .cse1053 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1050)) (.cse1047 (select (select .cse1052 (select (select (store .cse1053 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1050)) (.cse1046 (select (select .cse1052 .cse1049) .cse1050))) (or (= .cse1044 .cse1045) (not (= .cse1046 4)) (= .cse1047 .cse1045) (= .cse1046 .cse1044) (= .cse1047 .cse1044) (= .cse1044 0) (= .cse1047 .cse1046) (not (= (select (select .cse1048 .cse1049) .cse1050) .cse1051)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1066 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1057 (select (select .cse1066 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse1057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1068 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1067 (+ (select (select .cse1068 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1061 (store (store .cse1068 .cse1057 (store (select .cse1068 .cse1057) .cse1067 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1064 (select (select .cse1061 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1062 (store .cse1066 .cse1057 (store (select .cse1066 .cse1057) .cse1067 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1063 (+ .cse1064 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1059 (select (select .cse1061 (select (select (store .cse1062 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1063)) (.cse1058 (select (select .cse1061 (select (select (store .cse1062 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1063)) (.cse1060 (select (select .cse1061 (select (select (store .cse1062 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1063))) (or (= .cse1058 .cse1059) (= .cse1059 0) (= .cse1058 .cse1060) (= .cse1060 (select (select .cse1061 (select (select (store .cse1062 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1063)) (= .cse1060 0)))) (not (<= 0 .cse1064)) (not (= (select (let ((.cse1065 (store .cse1062 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1065 (select (select .cse1065 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1063) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1080 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1077 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1078 (select (select .cse1077 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1079 (+ (select (select .cse1080 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1074 (store (store .cse1080 .cse1078 (store (select .cse1080 .cse1078) .cse1079 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1076 (select (select .cse1074 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1075 (store .cse1077 .cse1078 (store (select .cse1077 .cse1078) .cse1079 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1071 (store .cse1075 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1072 (select (select .cse1071 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1073 (+ .cse1076 4))) (let ((.cse1070 (select (select .cse1074 .cse1072) .cse1073)) (.cse1069 (select (select .cse1074 (select (select (store .cse1075 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1073))) (or (= .cse1069 .cse1070) (not (= (select (select .cse1071 .cse1072) .cse1073) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1074 (select (select (store .cse1075 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1073) .cse1070) (not (= .cse1070 4)) (= .cse1069 0))))))) (not (<= 0 .cse1076)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1087 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1088 (select (select .cse1087 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1090 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1089 (+ (select (select .cse1090 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1085 (store (store .cse1090 .cse1088 (store (select .cse1090 .cse1088) .cse1089 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1081 (select (select .cse1085 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1083 (store .cse1087 .cse1088 (store (select .cse1087 .cse1088) .cse1089 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1084 (+ .cse1081 4))) (or (not (<= 0 .cse1081)) (not (= (select (let ((.cse1082 (store .cse1083 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1082 (select (select .cse1082 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1084) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1086 (select (select .cse1085 (select (select (store .cse1083 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1084))) (or (= (select (select .cse1085 (select (select (store .cse1083 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1084) .cse1086) (= (select (select .cse1085 (select (select (store .cse1083 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1084) .cse1086))))))))))) (not (= .cse1088 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1103 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1101 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1099 (select (select .cse1101 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1102 (+ (select (select .cse1103 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1091 (store (store .cse1103 .cse1099 (store (select .cse1103 .cse1099) .cse1102 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1100 (select (select .cse1091 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1093 (+ .cse1100 4)) (.cse1092 (store .cse1101 .cse1099 (store (select .cse1101 .cse1099) .cse1102 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse1091 (select (select (store .cse1092 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1093) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1097 (store .cse1092 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1098 (select (select .cse1097 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1094 (select (select .cse1091 (select (select (store .cse1092 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1093)) (.cse1095 (select (select .cse1091 (select (select (store .cse1092 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1093)) (.cse1096 (select (select .cse1091 .cse1098) .cse1093))) (or (= .cse1094 .cse1095) (= .cse1094 0) (= .cse1096 .cse1095) (not (= (select (select .cse1097 .cse1098) .cse1093) .cse1099)) (= .cse1096 0)))))) (not (<= 0 .cse1100))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1115 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1112 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1113 (select (select .cse1112 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1114 (+ (select (select .cse1115 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1105 (store (store .cse1115 .cse1113 (store (select .cse1115 .cse1113) .cse1114 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1111 (select (select .cse1105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1106 (store .cse1112 .cse1113 (store (select .cse1112 .cse1113) .cse1114 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1109 (store .cse1106 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1110 (select (select .cse1109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1107 (+ .cse1111 4))) (let ((.cse1108 (select (select .cse1105 (select (select (store .cse1106 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1107)) (.cse1104 (select (select .cse1105 .cse1110) .cse1107))) (or (= .cse1104 (select (select .cse1105 (select (select (store .cse1106 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1107)) (= .cse1108 .cse1104) (not (= (select (select .cse1109 .cse1110) .cse1107) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1105 (select (select (store .cse1106 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1107) .cse1108) (not (= .cse1104 4)))))))) (not (<= 0 .cse1111)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1127 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1124 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1125 (select (select .cse1124 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1126 (+ (select (select .cse1127 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1116 (store (store .cse1127 .cse1125 (store (select .cse1127 .cse1125) .cse1126 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1123 (select (select .cse1116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1117 (store .cse1124 .cse1125 (store (select .cse1124 .cse1125) .cse1126 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1118 (+ .cse1123 4))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse1116 (select (select (store .cse1117 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1118) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse1121 (store .cse1117 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1122 (select (select .cse1121 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1120 (select (select .cse1116 .cse1122) .cse1118)) (.cse1119 (select (select .cse1116 (select (select (store .cse1117 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1118))) (or (= .cse1119 .cse1120) (not (= (select (select .cse1121 .cse1122) .cse1118) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1120 0) (= .cse1119 0)))))) (= (select (select .cse1116 (select (select (store .cse1117 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1118) 0) (not (<= 0 .cse1123))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1139 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1136 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1137 (select (select .cse1136 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1138 (+ (select (select .cse1139 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1129 (store (store .cse1139 .cse1137 (store (select .cse1139 .cse1137) .cse1138 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1128 (select (select .cse1129 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1128)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1130 (store .cse1136 .cse1137 (store (select .cse1136 .cse1137) .cse1138 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1131 (+ .cse1128 4))) (let ((.cse1133 (select (select .cse1129 (select (select (store .cse1130 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1131))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1134 (store .cse1130 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse1135 (select (select .cse1134 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1132 (select (select .cse1129 .cse1135) .cse1131))) (or (= (select (select .cse1129 (select (select (store .cse1130 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1131) .cse1132) (= (select (select .cse1129 (select (select (store .cse1130 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1131) .cse1132) (= .cse1132 0) (= .cse1133 .cse1132) (= (select (select .cse1134 .cse1135) .cse1131) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (= .cse1133 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1151 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1149 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1146 (select (select .cse1149 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1150 (+ (select (select .cse1151 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1143 (store (store .cse1151 .cse1146 (store (select .cse1151 .cse1146) .cse1150 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1148 (select (select .cse1143 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1144 (store .cse1149 .cse1146 (store (select .cse1149 .cse1146) .cse1150 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1145 (+ .cse1148 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1141 (select (select .cse1143 (select (select (store .cse1144 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1145)) (.cse1142 (select (select .cse1143 (select (select (store .cse1144 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1145)) (.cse1140 (select (select .cse1143 (select (select (store .cse1144 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1145))) (or (= .cse1140 .cse1141) (= .cse1142 .cse1141) (= .cse1142 .cse1140)))) (not (= .cse1146 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1147 (store .cse1144 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1147 (select (select .cse1147 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1145) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse1148))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1159 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1152 (select (select .cse1159 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse1152 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1161 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1160 (+ (select (select .cse1161 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1154 (store (store .cse1161 .cse1152 (store (select .cse1161 .cse1152) .cse1160 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1157 (select (select .cse1154 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1155 (store .cse1159 .cse1152 (store (select .cse1159 .cse1152) .cse1160 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1156 (+ .cse1157 4))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1153 (select (select .cse1154 (select (select (store .cse1155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1156))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse1153 (select (select .cse1154 (select (select (store .cse1155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1156))) (= .cse1153 0)))) (not (<= 0 .cse1157)) (not (= (select (let ((.cse1158 (store .cse1155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1158 (select (select .cse1158 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1156) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1174 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1171 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1172 (select (select .cse1171 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1173 (+ (select (select .cse1174 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1163 (store (store .cse1174 .cse1172 (store (select .cse1174 .cse1172) .cse1173 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1170 (select (select .cse1163 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1164 (store .cse1171 .cse1172 (store (select .cse1171 .cse1172) .cse1173 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1167 (store .cse1164 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1168 (select (select .cse1167 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1165 (+ .cse1170 4))) (let ((.cse1162 (select (select .cse1163 .cse1168) .cse1165)) (.cse1169 (select (select .cse1163 (select (select (store .cse1164 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1165)) (.cse1166 (select (select .cse1163 (select (select (store .cse1164 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1165))) (or (= .cse1162 (select (select .cse1163 (select (select (store .cse1164 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1165)) (= .cse1166 .cse1162) (not (= (select (select .cse1167 .cse1168) .cse1165) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1169 .cse1162) (= .cse1162 0) (= .cse1169 .cse1166))))))) (not (<= 0 .cse1170)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1186 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1184 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1183 (select (select .cse1184 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1185 (+ (select (select .cse1186 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1175 (store (store .cse1186 .cse1183 (store (select .cse1186 .cse1183) .cse1185 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1178 (select (select .cse1175 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1177 (+ .cse1178 4)) (.cse1176 (store .cse1184 .cse1183 (store (select .cse1184 .cse1183) .cse1185 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_39 (Array Int Int))) (= (select (select .cse1175 (select (select (store .cse1176 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1177) 0)) (not (<= 0 .cse1178)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1181 (store .cse1176 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1182 (select (select .cse1181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1179 (select (select .cse1175 (select (select (store .cse1176 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1177)) (.cse1180 (select (select .cse1175 .cse1182) .cse1177))) (or (= .cse1179 0) (= .cse1180 (select (select .cse1175 (select (select (store .cse1176 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1177)) (= .cse1179 .cse1180) (not (= (select (select .cse1181 .cse1182) .cse1177) .cse1183)) (= .cse1180 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1197 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1195 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1187 (select (select .cse1195 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1196 (+ (select (select .cse1197 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1192 (store (store .cse1197 .cse1187 (store (select .cse1197 .cse1187) .cse1196 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1191 (select (select .cse1192 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1189 (store .cse1195 .cse1187 (store (select .cse1195 .cse1187) .cse1196 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1190 (+ .cse1191 4))) (or (not (= .cse1187 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1188 (store .cse1189 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1188 (select (select .cse1188 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1190) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse1191)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1193 (select (select .cse1192 (select (select (store .cse1189 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1190)) (.cse1194 (select (select .cse1192 (select (select (store .cse1189 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1190))) (or (= (select (select .cse1192 (select (select (store .cse1189 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1190) .cse1193) (= .cse1194 .cse1193) (= .cse1194 (select (select .cse1192 (select (select (store .cse1189 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1190)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1211 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1208 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1209 (select (select .cse1208 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1210 (+ (select (select .cse1211 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1205 (store (store .cse1211 .cse1209 (store (select .cse1211 .cse1209) .cse1210 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1198 (select (select .cse1205 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1198)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse1206 (store .cse1208 .cse1209 (store (select .cse1208 .cse1209) .cse1210 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1202 (+ .cse1198 4))) (let ((.cse1207 (select (select .cse1205 (select (select (store .cse1206 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1202))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1199 (select (select .cse1205 (select (select (store .cse1206 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1202))) (or (= .cse1199 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse1203 (select (select .cse1205 (select (select (store .cse1206 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1202))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1200 (store .cse1206 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1201 (select (select .cse1200 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1204 (select (select .cse1205 .cse1201) .cse1202))) (or (not (= (select (select .cse1200 .cse1201) .cse1202) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1203 .cse1204) (not (= .cse1204 4))))))) (= .cse1203 .cse1199) (= .cse1203 .cse1207))))))) (= .cse1207 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1225 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1222 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1223 (select (select .cse1222 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1224 (+ (select (select .cse1225 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1220 (store (store .cse1225 .cse1223 (store (select .cse1225 .cse1223) .cse1224 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1212 (select (select .cse1220 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1212)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1221 (store .cse1222 .cse1223 (store (select .cse1222 .cse1223) .cse1224 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1216 (store .cse1221 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1217 (select (select .cse1216 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1218 (+ .cse1212 4))) (let ((.cse1215 (select (select .cse1220 .cse1217) .cse1218)) (.cse1213 (select (select .cse1220 (select (select (store .cse1221 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1218)) (.cse1214 (select (select .cse1220 (select (select (store .cse1221 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1218)) (.cse1219 (select (select .cse1220 (select (select (store .cse1221 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1218))) (or (= .cse1213 0) (= .cse1214 .cse1215) (not (= (select (select .cse1216 .cse1217) .cse1218) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1215 0) (= .cse1219 0) (= .cse1213 .cse1214) (= .cse1214 .cse1219))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1237 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1234 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1235 (select (select .cse1234 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1236 (+ (select (select .cse1237 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1231 (store (store .cse1237 .cse1235 (store (select .cse1237 .cse1235) .cse1236 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1233 (select (select .cse1231 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1232 (store .cse1234 .cse1235 (store (select .cse1234 .cse1235) .cse1236 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1230 (+ .cse1233 4))) (let ((.cse1226 (select (select .cse1231 (select (select (store .cse1232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1230))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1228 (store .cse1232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1229 (select (select .cse1228 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1227 (select (select .cse1231 .cse1229) .cse1230))) (or (= .cse1226 .cse1227) (not (= (select (select .cse1228 .cse1229) .cse1230) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1231 (select (select (store .cse1232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1230) .cse1227) (not (= .cse1227 4))))))) (= .cse1226 (select (select .cse1231 (select (select (store .cse1232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1230)) (= .cse1226 0))))) (not (<= 0 .cse1233)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1250 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1247 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1248 (select (select .cse1247 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1249 (+ (select (select .cse1250 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1238 (store (store .cse1250 .cse1248 (store (select .cse1250 .cse1248) .cse1249 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1246 (select (select .cse1238 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1239 (store .cse1247 .cse1248 (store (select .cse1247 .cse1248) .cse1249 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1244 (store .cse1239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1245 (select (select .cse1244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1240 (+ .cse1246 4))) (let ((.cse1243 (select (select .cse1238 .cse1245) .cse1240)) (.cse1241 (select (select .cse1238 (select (select (store .cse1239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1240)) (.cse1242 (select (select .cse1238 (select (select (store .cse1239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1240))) (or (= (select (select .cse1238 (select (select (store .cse1239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1240) .cse1241) (= .cse1242 .cse1243) (not (= (select (select .cse1244 .cse1245) .cse1240) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse1243 4)) (= .cse1242 .cse1241) (= .cse1242 0))))))) (not (<= 0 .cse1246)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1261 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1251 (select (select .cse1261 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse1251 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1263 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1262 (+ (select (select .cse1263 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1256 (store (store .cse1263 .cse1251 (store (select .cse1263 .cse1251) .cse1262 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1259 (select (select .cse1256 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1257 (store .cse1261 .cse1251 (store (select .cse1261 .cse1251) .cse1262 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1258 (+ .cse1259 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1252 (select (select .cse1256 (select (select (store .cse1257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1258)) (.cse1254 (select (select .cse1256 (select (select (store .cse1257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1258)) (.cse1255 (select (select .cse1256 (select (select (store .cse1257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1258)) (.cse1253 (select (select .cse1256 (select (select (store .cse1257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1258))) (or (= .cse1252 .cse1253) (= .cse1254 .cse1252) (= .cse1254 .cse1255) (= .cse1255 .cse1253)))) (not (<= 0 .cse1259)) (not (= (select (let ((.cse1260 (store .cse1257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1260 (select (select .cse1260 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1258) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1275 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1272 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1273 (select (select .cse1272 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1274 (+ (select (select .cse1275 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1264 (store (store .cse1275 .cse1273 (store (select .cse1275 .cse1273) .cse1274 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1271 (select (select .cse1264 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1265 (store .cse1272 .cse1273 (store (select .cse1272 .cse1273) .cse1274 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1266 (+ .cse1271 4))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse1264 (select (select (store .cse1265 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1266) 0)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1269 (store .cse1265 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse1270 (select (select .cse1269 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1267 (select (select .cse1264 (select (select (store .cse1265 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1266)) (.cse1268 (select (select .cse1264 .cse1270) .cse1266))) (or (= .cse1267 .cse1268) (= .cse1267 0) (= .cse1268 0) (= (select (select .cse1269 .cse1270) .cse1266) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (<= 0 .cse1271)) (forall ((v_prenex_32 (Array Int Int))) (= (select (select .cse1264 (select (select (store .cse1265 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1266) 0))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1286 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1284 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1282 (select (select .cse1284 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1285 (+ (select (select .cse1286 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1277 (store (store .cse1286 .cse1282 (store (select .cse1286 .cse1282) .cse1285 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1283 (select (select .cse1277 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1278 (store .cse1284 .cse1282 (store (select .cse1284 .cse1282) .cse1285 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1280 (store .cse1278 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1281 (select (select .cse1280 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1279 (+ .cse1283 4))) (let ((.cse1276 (select (select .cse1277 .cse1281) .cse1279))) (or (= .cse1276 (select (select .cse1277 (select (select (store .cse1278 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1279)) (= (select (select .cse1277 (select (select (store .cse1278 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1279) .cse1276) (= .cse1276 (select (select .cse1277 (select (select (store .cse1278 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1279)) (not (= (select (select .cse1280 .cse1281) .cse1279) .cse1282)) (= .cse1276 0))))))) (not (<= 0 .cse1283)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1295 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1292 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1293 (select (select .cse1292 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1294 (+ (select (select .cse1295 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1290 (store (store .cse1295 .cse1293 (store (select .cse1295 .cse1293) .cse1294 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1291 (select (select .cse1290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1287 (store (store .cse1292 .cse1293 (store (select .cse1292 .cse1293) .cse1294 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1288 (select (select .cse1287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1289 (+ .cse1291 4))) (or (not (= (select (select .cse1287 .cse1288) .cse1289) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= (select (select .cse1290 .cse1288) .cse1289) 4)))))) (not (<= 0 .cse1291)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1303 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1296 (select (select .cse1303 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse1296 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1305 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1304 (+ (select (select .cse1305 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1297 (store (store .cse1305 .cse1296 (store (select .cse1305 .cse1296) .cse1304 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1301 (select (select .cse1297 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1298 (store .cse1303 .cse1296 (store (select .cse1303 .cse1296) .cse1304 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1299 (+ .cse1301 4))) (or (= (select (select .cse1297 (select (select (store .cse1298 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1299) 0) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1300 (select (select .cse1297 (select (select (store .cse1298 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1299))) (or (= .cse1300 (select (select .cse1297 (select (select (store .cse1298 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1299)) (= .cse1300 0)))) (not (<= 0 .cse1301)) (not (= (select (let ((.cse1302 (store .cse1298 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1302 (select (select .cse1302 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1299) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1297 (select (select (store .cse1298 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1299) 0)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1314 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1315 (select (select .cse1314 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1317 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1316 (+ (select (select .cse1317 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1309 (store (store .cse1317 .cse1315 (store (select .cse1317 .cse1315) .cse1316 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1312 (select (select .cse1309 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1310 (store .cse1314 .cse1315 (store (select .cse1314 .cse1315) .cse1316 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1311 (+ .cse1312 4))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1307 (select (select .cse1309 (select (select (store .cse1310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1311)) (.cse1306 (select (select .cse1309 (select (select (store .cse1310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1311))) (or (= .cse1306 .cse1307) (= .cse1307 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse1308 (select (select .cse1309 (select (select (store .cse1310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1311))) (or (= .cse1308 .cse1307) (= (select (select .cse1309 (select (select (store .cse1310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1311) .cse1308) (= .cse1306 .cse1308) (= .cse1308 0))))))) (not (<= 0 .cse1312)) (not (= (select (let ((.cse1313 (store .cse1310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1313 (select (select .cse1313 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1311) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse1315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1329 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1326 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1327 (select (select .cse1326 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1328 (+ (select (select .cse1329 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1322 (store (store .cse1329 .cse1327 (store (select .cse1329 .cse1327) .cse1328 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1324 (select (select .cse1322 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1323 (store .cse1326 .cse1327 (store (select .cse1326 .cse1327) .cse1328 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1321 (+ .cse1324 4))) (let ((.cse1318 (select (select .cse1322 (select (select (store .cse1323 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1321)) (.cse1325 (select (select .cse1322 (select (select (store .cse1323 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1321))) (or (= .cse1318 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1319 (store .cse1323 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1320 (select (select .cse1319 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1319 .cse1320) .cse1321) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= (select (select .cse1322 .cse1320) .cse1321) 4)))))) (not (<= 0 .cse1324)) (= .cse1325 .cse1318) (= .cse1325 0))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1341 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1339 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1338 (select (select .cse1339 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1340 (+ (select (select .cse1341 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1330 (store (store .cse1341 .cse1338 (store (select .cse1341 .cse1338) .cse1340 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1333 (select (select .cse1330 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1332 (+ .cse1333 4)) (.cse1331 (store .cse1339 .cse1338 (store (select .cse1339 .cse1338) .cse1340 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (= (select (select .cse1330 (select (select (store .cse1331 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1332) 0) (not (<= 0 .cse1333)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1336 (store .cse1331 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1337 (select (select .cse1336 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1334 (select (select .cse1330 .cse1337) .cse1332)) (.cse1335 (select (select .cse1330 (select (select (store .cse1331 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1332))) (or (not (= .cse1334 4)) (= .cse1335 0) (= .cse1334 .cse1335) (not (= (select (select .cse1336 .cse1337) .cse1332) .cse1338)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1354 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1352 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1350 (select (select .cse1352 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1353 (+ (select (select .cse1354 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1345 (store (store .cse1354 .cse1350 (store (select .cse1354 .cse1350) .cse1353 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1351 (select (select .cse1345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1346 (store .cse1352 .cse1350 (store (select .cse1352 .cse1350) .cse1353 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1348 (store .cse1346 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1349 (select (select .cse1348 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1347 (+ .cse1351 4))) (let ((.cse1342 (select (select .cse1345 (select (select (store .cse1346 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1347)) (.cse1344 (select (select .cse1345 .cse1349) .cse1347)) (.cse1343 (select (select .cse1345 (select (select (store .cse1346 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1347))) (or (= .cse1342 .cse1343) (not (= .cse1344 4)) (= .cse1344 .cse1342) (= (select (select .cse1345 (select (select (store .cse1346 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1347) .cse1342) (= .cse1342 0) (= .cse1344 .cse1343) (not (= (select (select .cse1348 .cse1349) .cse1347) .cse1350)))))))) (not (<= 0 .cse1351)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1366 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1363 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1364 (select (select .cse1363 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1365 (+ (select (select .cse1366 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1356 (store (store .cse1366 .cse1364 (store (select .cse1366 .cse1364) .cse1365 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1362 (select (select .cse1356 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1357 (store .cse1363 .cse1364 (store (select .cse1363 .cse1364) .cse1365 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1358 (+ .cse1362 4))) (let ((.cse1355 (select (select .cse1356 (select (select (store .cse1357 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1358))) (or (= .cse1355 (select (select .cse1356 (select (select (store .cse1357 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1358)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1360 (store .cse1357 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1361 (select (select .cse1360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1359 (select (select .cse1356 .cse1361) .cse1358))) (or (= .cse1359 (select (select .cse1356 (select (select (store .cse1357 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1358)) (not (= (select (select .cse1360 .cse1361) .cse1358) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1355 .cse1359) (not (= .cse1359 4))))))))))) (not (<= 0 .cse1362)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1376 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1373 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1374 (select (select .cse1373 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1375 (+ (select (select .cse1376 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1367 (store (store .cse1376 .cse1374 (store (select .cse1376 .cse1374) .cse1375 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1372 (select (select .cse1367 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1368 (store .cse1373 .cse1374 (store (select .cse1373 .cse1374) .cse1375 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1369 (+ .cse1372 4))) (or (= (select (select .cse1367 (select (select (store .cse1368 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1369) 0) (= (select (select .cse1367 (select (select (store .cse1368 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1369) 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1370 (store .cse1368 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1371 (select (select .cse1370 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1370 .cse1371) .cse1369) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= (select (select .cse1367 .cse1371) .cse1369) 4)))))) (not (<= 0 .cse1372)) (= (select (select .cse1367 (select (select (store .cse1368 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1369) 0)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1384 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1385 (select (select .cse1384 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1387 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1386 (+ (select (select .cse1387 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1379 (store (store .cse1387 .cse1385 (store (select .cse1387 .cse1385) .cse1386 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1382 (select (select .cse1379 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1380 (store .cse1384 .cse1385 (store (select .cse1384 .cse1385) .cse1386 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1381 (+ .cse1382 4))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1377 (select (select .cse1379 (select (select (store .cse1380 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1381))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1378 (select (select .cse1379 (select (select (store .cse1380 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1381))) (or (= .cse1377 .cse1378) (= .cse1378 0)))) (= .cse1377 0)))) (not (<= 0 .cse1382)) (not (= (select (let ((.cse1383 (store .cse1380 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1383 (select (select .cse1383 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1381) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1379 (select (select (store .cse1380 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1381) 0)))))))) (not (= .cse1385 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1394 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1395 (select (select .cse1394 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1397 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1396 (+ (select (select .cse1397 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1388 (store (store .cse1397 .cse1395 (store (select .cse1397 .cse1395) .cse1396 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1392 (select (select .cse1388 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1389 (store .cse1394 .cse1395 (store (select .cse1394 .cse1395) .cse1396 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1390 (+ .cse1392 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1391 (select (select .cse1388 (select (select (store .cse1389 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1390))) (or (= (select (select .cse1388 (select (select (store .cse1389 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1390) .cse1391) (= .cse1391 (select (select .cse1388 (select (select (store .cse1389 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1390)) (= .cse1391 0)))) (= (select (select .cse1388 (select (select (store .cse1389 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1390) 0) (not (<= 0 .cse1392)) (not (= (select (let ((.cse1393 (store .cse1389 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1393 (select (select .cse1393 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1390) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse1395 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1410 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1407 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1408 (select (select .cse1407 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1409 (+ (select (select .cse1410 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1402 (store (store .cse1410 .cse1408 (store (select .cse1410 .cse1408) .cse1409 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1398 (select (select .cse1402 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1398)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1403 (store .cse1407 .cse1408 (store (select .cse1407 .cse1408) .cse1409 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1404 (+ .cse1398 4))) (let ((.cse1400 (select (select .cse1402 (select (select (store .cse1403 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1404)) (.cse1399 (select (select .cse1402 (select (select (store .cse1403 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1404))) (or (= .cse1399 .cse1400) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1405 (store .cse1403 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse1406 (select (select .cse1405 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1401 (select (select .cse1402 .cse1406) .cse1404))) (or (= .cse1400 .cse1401) (= (select (select .cse1402 (select (select (store .cse1403 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1404) .cse1401) (= .cse1401 0) (= .cse1399 .cse1401) (= (select (select .cse1405 .cse1406) .cse1404) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1416 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1412 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1413 (select (select .cse1412 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1414 (+ (select (select .cse1416 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1415 (select (select (store (store .cse1416 .cse1413 (store (select .cse1416 .cse1413) .cse1414 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_37 (Array Int Int))) (= (select (let ((.cse1411 (store (store .cse1412 .cse1413 (store (select .cse1412 .cse1413) .cse1414 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_37))) (select .cse1411 (select (select .cse1411 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse1415 4)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (<= 0 .cse1415))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1427 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1425 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1417 (select (select .cse1425 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1426 (+ (select (select .cse1427 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1424 (store (store .cse1427 .cse1417 (store (select .cse1427 .cse1417) .cse1426 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1421 (select (select .cse1424 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1419 (store .cse1425 .cse1417 (store (select .cse1425 .cse1417) .cse1426 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1420 (+ .cse1421 4))) (or (not (= .cse1417 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1418 (store .cse1419 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1418 (select (select .cse1418 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1420) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse1421)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1423 (select (select .cse1424 (select (select (store .cse1419 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1420)) (.cse1422 (select (select .cse1424 (select (select (store .cse1419 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1420))) (or (= .cse1422 .cse1423) (= .cse1423 0) (= (select (select .cse1424 (select (select (store .cse1419 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1420) .cse1422))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1436 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1437 (select (select .cse1436 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1439 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1438 (+ (select (select .cse1439 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1429 (store (store .cse1439 .cse1437 (store (select .cse1439 .cse1437) .cse1438 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1434 (select (select .cse1429 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1430 (store .cse1436 .cse1437 (store (select .cse1436 .cse1437) .cse1438 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1431 (+ .cse1434 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1428 (select (select .cse1429 (select (select (store .cse1430 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1431)) (.cse1433 (select (select .cse1429 (select (select (store .cse1430 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1431)) (.cse1432 (select (select .cse1429 (select (select (store .cse1430 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1431))) (or (= .cse1428 (select (select .cse1429 (select (select (store .cse1430 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1431)) (= .cse1432 .cse1428) (= .cse1433 .cse1428) (= .cse1428 0) (= .cse1433 .cse1432)))) (not (<= 0 .cse1434)) (not (= (select (let ((.cse1435 (store .cse1430 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1435 (select (select .cse1435 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1431) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse1437 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1453 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1451 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1447 (select (select .cse1451 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1452 (+ (select (select .cse1453 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1448 (store (store .cse1453 .cse1447 (store (select .cse1453 .cse1447) .cse1452 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1450 (select (select .cse1448 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1449 (store .cse1451 .cse1447 (store (select .cse1451 .cse1447) .cse1452 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1444 (store .cse1449 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1445 (select (select .cse1444 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1446 (+ .cse1450 4))) (let ((.cse1441 (select (select .cse1448 (select (select (store .cse1449 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1446)) (.cse1440 (select (select .cse1448 (select (select (store .cse1449 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1446)) (.cse1443 (select (select .cse1448 (select (select (store .cse1449 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1446)) (.cse1442 (select (select .cse1448 .cse1445) .cse1446))) (or (= .cse1440 .cse1441) (not (= .cse1442 4)) (= .cse1443 .cse1441) (= .cse1442 .cse1440) (= .cse1443 .cse1440) (= .cse1443 .cse1442) (not (= (select (select .cse1444 .cse1445) .cse1446) .cse1447)))))))) (not (<= 0 .cse1450)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1462 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1463 (select (select .cse1462 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1465 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1464 (+ (select (select .cse1465 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1461 (store (store .cse1465 .cse1463 (store (select .cse1465 .cse1463) .cse1464 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1454 (select (select .cse1461 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1456 (store .cse1462 .cse1463 (store (select .cse1462 .cse1463) .cse1464 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1457 (+ .cse1454 4))) (or (not (<= 0 .cse1454)) (not (= (select (let ((.cse1455 (store .cse1456 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1455 (select (select .cse1455 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1457) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1458 (select (select .cse1461 (select (select (store .cse1456 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1457)) (.cse1460 (select (select .cse1461 (select (select (store .cse1456 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1457)) (.cse1459 (select (select .cse1461 (select (select (store .cse1456 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1457))) (or (= .cse1458 .cse1459) (= .cse1458 .cse1460) (= .cse1460 .cse1459))))))))))) (not (= .cse1463 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1479 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1476 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1477 (select (select .cse1476 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1478 (+ (select (select .cse1479 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1470 (store (store .cse1479 .cse1477 (store (select .cse1479 .cse1477) .cse1478 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1475 (select (select .cse1470 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1471 (store .cse1476 .cse1477 (store (select .cse1476 .cse1477) .cse1478 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1472 (+ .cse1475 4))) (let ((.cse1468 (select (select .cse1470 (select (select (store .cse1471 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1472))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1473 (store .cse1471 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse1474 (select (select .cse1473 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1466 (select (select .cse1470 .cse1474) .cse1472))) (or (= .cse1466 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse1469 (select (select .cse1470 (select (select (store .cse1471 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1472))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse1467 (select (select .cse1470 (select (select (store .cse1471 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1472))) (or (= .cse1467 0) (= .cse1467 .cse1468) (= .cse1467 .cse1469)))) (= .cse1469 .cse1466) (= .cse1469 0)))) (= (select (select .cse1473 .cse1474) .cse1472) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (= .cse1468 0))))) (not (<= 0 .cse1475)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1492 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1489 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1490 (select (select .cse1489 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1491 (+ (select (select .cse1492 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1486 (store (store .cse1492 .cse1490 (store (select .cse1492 .cse1490) .cse1491 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1488 (select (select .cse1486 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1487 (store .cse1489 .cse1490 (store (select .cse1489 .cse1490) .cse1491 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1483 (store .cse1487 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1484 (select (select .cse1483 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1485 (+ .cse1488 4))) (let ((.cse1481 (select (select .cse1486 (select (select (store .cse1487 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1485)) (.cse1480 (select (select .cse1486 .cse1484) .cse1485)) (.cse1482 (select (select .cse1486 (select (select (store .cse1487 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1485))) (or (= .cse1480 .cse1481) (= .cse1482 .cse1480) (not (= (select (select .cse1483 .cse1484) .cse1485) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1481 0) (not (= .cse1480 4)) (= .cse1482 0))))))) (not (<= 0 .cse1488)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1502 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1500 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1493 (select (select .cse1500 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1501 (+ (select (select .cse1502 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1495 (store (store .cse1502 .cse1493 (store (select .cse1502 .cse1493) .cse1501 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1499 (select (select .cse1495 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1496 (store .cse1500 .cse1493 (store (select .cse1500 .cse1493) .cse1501 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1497 (+ .cse1499 4))) (or (not (= .cse1493 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1494 (select (select .cse1495 (select (select (store .cse1496 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1497))) (or (= .cse1494 (select (select .cse1495 (select (select (store .cse1496 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1497)) (= (select (select .cse1495 (select (select (store .cse1496 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1497) .cse1494) (= .cse1494 0)))) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1498 (store .cse1496 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1498 (select (select .cse1498 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1497) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse1499))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1516 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1514 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1510 (select (select .cse1514 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1515 (+ (select (select .cse1516 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1511 (store (store .cse1516 .cse1510 (store (select .cse1516 .cse1510) .cse1515 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1513 (select (select .cse1511 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1512 (store .cse1514 .cse1510 (store (select .cse1514 .cse1510) .cse1515 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1507 (store .cse1512 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1508 (select (select .cse1507 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1509 (+ .cse1513 4))) (let ((.cse1503 (select (select .cse1511 (select (select (store .cse1512 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1509)) (.cse1505 (select (select .cse1511 (select (select (store .cse1512 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1509)) (.cse1504 (select (select .cse1511 (select (select (store .cse1512 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1509)) (.cse1506 (select (select .cse1511 .cse1508) .cse1509))) (or (= .cse1503 .cse1504) (= .cse1505 .cse1504) (= .cse1505 .cse1503) (= .cse1503 0) (= .cse1505 .cse1506) (= .cse1506 .cse1504) (not (= (select (select .cse1507 .cse1508) .cse1509) .cse1510)) (= .cse1506 0))))))) (not (<= 0 .cse1513)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1529 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1526 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1527 (select (select .cse1526 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1528 (+ (select (select .cse1529 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1523 (store (store .cse1529 .cse1527 (store (select .cse1529 .cse1527) .cse1528 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1525 (select (select .cse1523 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1524 (store .cse1526 .cse1527 (store (select .cse1526 .cse1527) .cse1528 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1522 (+ .cse1525 4))) (let ((.cse1519 (select (select .cse1523 (select (select (store .cse1524 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1522)) (.cse1518 (select (select .cse1523 (select (select (store .cse1524 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1522))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1520 (store .cse1524 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1521 (select (select .cse1520 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1517 (select (select .cse1523 .cse1521) .cse1522))) (or (= .cse1517 .cse1518) (= .cse1519 .cse1517) (not (= (select (select .cse1520 .cse1521) .cse1522) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse1517 4))))))) (= (select (select .cse1523 (select (select (store .cse1524 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1522) .cse1519) (= .cse1519 .cse1518))))) (not (<= 0 .cse1525)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1541 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1538 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1539 (select (select .cse1538 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1540 (+ (select (select .cse1541 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1530 (store (store .cse1541 .cse1539 (store (select .cse1541 .cse1539) .cse1540 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1537 (select (select .cse1530 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1534 (store .cse1538 .cse1539 (store (select .cse1538 .cse1539) .cse1540 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1532 (+ .cse1537 4))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1533 (store .cse1534 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse1531 (select (select .cse1533 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse1530 .cse1531) .cse1532) 0) (= (select (select .cse1533 .cse1531) .cse1532) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1535 (select (select .cse1530 (select (select (store .cse1534 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1532)) (.cse1536 (select (select .cse1530 (select (select (store .cse1534 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1532))) (or (= .cse1535 0) (= .cse1536 (select (select .cse1530 (select (select (store .cse1534 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1532)) (= .cse1535 .cse1536) (= .cse1536 0)))) (not (<= 0 .cse1537))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1553 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1550 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1551 (select (select .cse1550 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1552 (+ (select (select .cse1553 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1548 (store (store .cse1553 .cse1551 (store (select .cse1553 .cse1551) .cse1552 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1542 (select (select .cse1548 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1542)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1549 (store .cse1550 .cse1551 (store (select .cse1550 .cse1551) .cse1552 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1545 (+ .cse1542 4))) (let ((.cse1546 (select (select .cse1548 (select (select (store .cse1549 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1545))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1543 (store .cse1549 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1544 (select (select .cse1543 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1547 (select (select .cse1548 .cse1544) .cse1545))) (or (not (= (select (select .cse1543 .cse1544) .cse1545) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1546 .cse1547) (not (= .cse1547 4))))))) (= .cse1546 (select (select .cse1548 (select (select (store .cse1549 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1545)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1566 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1564 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1560 (select (select .cse1564 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1565 (+ (select (select .cse1566 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1561 (store (store .cse1566 .cse1560 (store (select .cse1566 .cse1560) .cse1565 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1563 (select (select .cse1561 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1562 (store .cse1564 .cse1560 (store (select .cse1564 .cse1560) .cse1565 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1557 (store .cse1562 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1558 (select (select .cse1557 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1559 (+ .cse1563 4))) (let ((.cse1556 (select (select .cse1561 (select (select (store .cse1562 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1559)) (.cse1555 (select (select .cse1561 (select (select (store .cse1562 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1559)) (.cse1554 (select (select .cse1561 .cse1558) .cse1559))) (or (not (= .cse1554 4)) (= .cse1555 .cse1556) (= .cse1556 0) (= .cse1555 .cse1554) (not (= (select (select .cse1557 .cse1558) .cse1559) .cse1560)))))))) (not (<= 0 .cse1563)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1580 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1578 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1574 (select (select .cse1578 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1579 (+ (select (select .cse1580 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1575 (store (store .cse1580 .cse1574 (store (select .cse1580 .cse1574) .cse1579 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1577 (select (select .cse1575 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1576 (store .cse1578 .cse1574 (store (select .cse1578 .cse1574) .cse1579 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1571 (store .cse1576 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1572 (select (select .cse1571 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1573 (+ .cse1577 4))) (let ((.cse1568 (select (select .cse1575 (select (select (store .cse1576 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1573)) (.cse1567 (select (select .cse1575 (select (select (store .cse1576 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1573)) (.cse1570 (select (select .cse1575 (select (select (store .cse1576 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1573)) (.cse1569 (select (select .cse1575 .cse1572) .cse1573))) (or (= .cse1567 .cse1568) (not (= .cse1569 4)) (= .cse1570 .cse1568) (= .cse1570 .cse1567) (= .cse1570 .cse1569) (not (= (select (select .cse1571 .cse1572) .cse1573) .cse1574)))))))) (not (<= 0 .cse1577)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1593 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1591 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1590 (select (select .cse1591 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1592 (+ (select (select .cse1593 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1585 (store (store .cse1593 .cse1590 (store (select .cse1593 .cse1590) .cse1592 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1581 (select (select .cse1585 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1581)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse1586 (store .cse1591 .cse1590 (store (select .cse1591 .cse1590) .cse1592 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1588 (store .cse1586 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1589 (select (select .cse1588 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1587 (+ .cse1581 4))) (let ((.cse1582 (select (select .cse1585 .cse1589) .cse1587))) (or (not (= .cse1582 4)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1583 (select (select .cse1585 (select (select (store .cse1586 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1587))) (or (= .cse1582 .cse1583) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1584 (select (select .cse1585 (select (select (store .cse1586 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1587))) (or (= .cse1583 .cse1584) (= .cse1584 0))))))) (not (= (select (select .cse1588 .cse1589) .cse1587) .cse1590)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1605 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1602 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1603 (select (select .cse1602 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1604 (+ (select (select .cse1605 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1599 (store (store .cse1605 .cse1603 (store (select .cse1605 .cse1603) .cse1604 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1601 (select (select .cse1599 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1600 (store .cse1602 .cse1603 (store (select .cse1602 .cse1603) .cse1604 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1596 (store .cse1600 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1597 (select (select .cse1596 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1598 (+ .cse1601 4))) (let ((.cse1595 (select (select .cse1599 .cse1597) .cse1598)) (.cse1594 (select (select .cse1599 (select (select (store .cse1600 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1598))) (or (= .cse1594 .cse1595) (not (= (select (select .cse1596 .cse1597) .cse1598) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1599 (select (select (store .cse1600 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1598) .cse1595) (not (= .cse1595 4)) (= .cse1594 (select (select .cse1599 (select (select (store .cse1600 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1598)) (= .cse1594 0))))))) (not (<= 0 .cse1601)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1617 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1614 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1615 (select (select .cse1614 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1616 (+ (select (select .cse1617 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1612 (store (store .cse1617 .cse1615 (store (select .cse1617 .cse1615) .cse1616 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1606 (select (select .cse1612 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1613 (store .cse1614 .cse1615 (store (select .cse1614 .cse1615) .cse1616 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1609 (+ .cse1606 4))) (or (not (<= 0 .cse1606)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1607 (store .cse1613 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1608 (select (select .cse1607 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1610 (select (select .cse1612 .cse1608) .cse1609))) (or (not (= (select (select .cse1607 .cse1608) .cse1609) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1611 (select (select .cse1612 (select (select (store .cse1613 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1609))) (or (= .cse1610 .cse1611) (= .cse1611 0)))) (not (= .cse1610 4))))))) (= (select (select .cse1612 (select (select (store .cse1613 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1609) 0)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1630 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1628 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1627 (select (select .cse1628 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1629 (+ (select (select .cse1630 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1620 (store (store .cse1630 .cse1627 (store (select .cse1630 .cse1627) .cse1629 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1618 (select (select .cse1620 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1618)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1621 (store .cse1628 .cse1627 (store (select .cse1628 .cse1627) .cse1629 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1625 (store .cse1621 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1626 (select (select .cse1625 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1622 (+ .cse1618 4))) (let ((.cse1619 (select (select .cse1620 (select (select (store .cse1621 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1622)) (.cse1624 (select (select .cse1620 (select (select (store .cse1621 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1622)) (.cse1623 (select (select .cse1620 .cse1626) .cse1622))) (or (= .cse1619 (select (select .cse1620 (select (select (store .cse1621 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1622)) (not (= .cse1623 4)) (= .cse1623 .cse1619) (= .cse1624 .cse1619) (= .cse1624 .cse1623) (not (= (select (select .cse1625 .cse1626) .cse1622) .cse1627)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1644 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1641 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1642 (select (select .cse1641 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1643 (+ (select (select .cse1644 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1638 (store (store .cse1644 .cse1642 (store (select .cse1644 .cse1642) .cse1643 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1640 (select (select .cse1638 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1639 (store .cse1641 .cse1642 (store (select .cse1641 .cse1642) .cse1643 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1635 (store .cse1639 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1636 (select (select .cse1635 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1637 (+ .cse1640 4))) (let ((.cse1633 (select (select .cse1638 (select (select (store .cse1639 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1637)) (.cse1632 (select (select .cse1638 .cse1636) .cse1637)) (.cse1631 (select (select .cse1638 (select (select (store .cse1639 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1637)) (.cse1634 (select (select .cse1638 (select (select (store .cse1639 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1637))) (or (= .cse1631 0) (= .cse1632 .cse1633) (= .cse1631 .cse1633) (= .cse1634 .cse1632) (not (= (select (select .cse1635 .cse1636) .cse1637) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1632 0) (= .cse1631 .cse1634))))))) (not (<= 0 .cse1640)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1655 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1645 (select (select .cse1655 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse1645 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1657 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1656 (+ (select (select .cse1657 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1654 (store (store .cse1657 .cse1645 (store (select .cse1657 .cse1645) .cse1656 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1646 (select (select .cse1654 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1648 (store .cse1655 .cse1645 (store (select .cse1655 .cse1645) .cse1656 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1649 (+ .cse1646 4))) (or (not (<= 0 .cse1646)) (not (= (select (let ((.cse1647 (store .cse1648 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1647 (select (select .cse1647 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1649) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1651 (select (select .cse1654 (select (select (store .cse1648 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1649)) (.cse1650 (select (select .cse1654 (select (select (store .cse1648 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1649)) (.cse1652 (select (select .cse1654 (select (select (store .cse1648 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1649)) (.cse1653 (select (select .cse1654 (select (select (store .cse1648 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1649))) (or (= .cse1650 .cse1651) (= .cse1652 .cse1651) (= .cse1653 .cse1650) (= .cse1650 0) (= .cse1652 .cse1653))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1671 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1668 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1669 (select (select .cse1668 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1670 (+ (select (select .cse1671 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1665 (store (store .cse1671 .cse1669 (store (select .cse1671 .cse1669) .cse1670 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1667 (select (select .cse1665 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1666 (store .cse1668 .cse1669 (store (select .cse1668 .cse1669) .cse1670 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1662 (store .cse1666 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1663 (select (select .cse1662 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1664 (+ .cse1667 4))) (let ((.cse1661 (select (select .cse1665 .cse1663) .cse1664)) (.cse1658 (select (select .cse1665 (select (select (store .cse1666 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1664)) (.cse1660 (select (select .cse1665 (select (select (store .cse1666 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1664)) (.cse1659 (select (select .cse1665 (select (select (store .cse1666 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1664))) (or (= .cse1658 .cse1659) (= .cse1660 .cse1661) (not (= (select (select .cse1662 .cse1663) .cse1664) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1658 .cse1661) (= .cse1661 0) (= .cse1659 0) (= .cse1658 .cse1660) (= .cse1660 .cse1659))))))) (not (<= 0 .cse1667)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1682 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1679 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1680 (select (select .cse1679 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1681 (+ (select (select .cse1682 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1674 (store (store .cse1682 .cse1680 (store (select .cse1682 .cse1680) .cse1681 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1678 (select (select .cse1674 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1675 (store .cse1679 .cse1680 (store (select .cse1679 .cse1680) .cse1681 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1676 (+ .cse1678 4))) (let ((.cse1672 (select (select .cse1674 (select (select (store .cse1675 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1676)) (.cse1677 (select (select .cse1674 (select (select (store .cse1675 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1676)) (.cse1673 (select (select .cse1674 (select (select (store .cse1675 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1676))) (or (= .cse1672 0) (= .cse1672 .cse1673) (= .cse1672 (select (select .cse1674 (select (select (store .cse1675 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1676)) (= .cse1672 .cse1677) (= .cse1677 .cse1673))))) (not (<= 0 .cse1678)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1695 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1693 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1692 (select (select .cse1693 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1694 (+ (select (select .cse1695 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1687 (store (store .cse1695 .cse1692 (store (select .cse1695 .cse1692) .cse1694 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1683 (select (select .cse1687 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1683)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse1688 (store .cse1693 .cse1692 (store (select .cse1693 .cse1692) .cse1694 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1690 (store .cse1688 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1691 (select (select .cse1690 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1689 (+ .cse1683 4))) (let ((.cse1684 (select (select .cse1687 .cse1691) .cse1689))) (or (not (= .cse1684 4)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1685 (select (select .cse1687 (select (select (store .cse1688 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1689))) (or (= .cse1684 .cse1685) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1686 (select (select .cse1687 (select (select (store .cse1688 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1689))) (or (= .cse1685 .cse1686) (= .cse1686 0)))) (= .cse1685 0)))) (not (= (select (select .cse1690 .cse1691) .cse1689) .cse1692)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1706 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1703 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1704 (select (select .cse1703 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1705 (+ (select (select .cse1706 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1699 (store (store .cse1706 .cse1704 (store (select .cse1706 .cse1704) .cse1705 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1702 (select (select .cse1699 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse1700 (store .cse1703 .cse1704 (store (select .cse1703 .cse1704) .cse1705 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1701 (+ .cse1702 4))) (let ((.cse1697 (select (select .cse1699 (select (select (store .cse1700 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1701)) (.cse1696 (select (select .cse1699 (select (select (store .cse1700 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1701))) (or (= .cse1696 .cse1697) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse1698 (select (select .cse1699 (select (select (store .cse1700 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1701))) (or (= .cse1698 0) (= .cse1698 .cse1697) (forall ((v_prenex_39 (Array Int Int))) (= .cse1698 (select (select .cse1699 (select (select (store .cse1700 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1701))) (= .cse1698 .cse1696)))))))) (not (<= 0 .cse1702)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1715 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1713 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1707 (select (select .cse1713 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1714 (+ (select (select .cse1715 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1712 (store (store .cse1715 .cse1707 (store (select .cse1715 .cse1707) .cse1714 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1711 (select (select .cse1712 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1709 (store .cse1713 .cse1707 (store (select .cse1713 .cse1707) .cse1714 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1710 (+ .cse1711 4))) (or (not (= .cse1707 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1708 (store .cse1709 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1708 (select (select .cse1708 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1710) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse1711)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (= (select (select .cse1712 (select (select (store .cse1709 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1710) (select (select .cse1712 (select (select (store .cse1709 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1710)))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1727 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1724 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1725 (select (select .cse1724 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1726 (+ (select (select .cse1727 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1717 (store (store .cse1727 .cse1725 (store (select .cse1727 .cse1725) .cse1726 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1723 (select (select .cse1717 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1718 (store .cse1724 .cse1725 (store (select .cse1724 .cse1725) .cse1726 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1719 (+ .cse1723 4))) (let ((.cse1720 (select (select .cse1717 (select (select (store .cse1718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1719))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1721 (store .cse1718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1722 (select (select .cse1721 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1716 (select (select .cse1717 .cse1722) .cse1719))) (or (= .cse1716 (select (select .cse1717 (select (select (store .cse1718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1719)) (= .cse1720 .cse1716) (not (= (select (select .cse1721 .cse1722) .cse1719) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse1716 4))))))) (= .cse1720 0))))) (not (<= 0 .cse1723)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1737 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1734 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1735 (select (select .cse1734 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1736 (+ (select (select .cse1737 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1730 (store (store .cse1737 .cse1735 (store (select .cse1737 .cse1735) .cse1736 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1733 (select (select .cse1730 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1731 (store .cse1734 .cse1735 (store (select .cse1734 .cse1735) .cse1736 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1732 (+ .cse1733 4))) (let ((.cse1728 (select (select .cse1730 (select (select (store .cse1731 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1732)) (.cse1729 (select (select .cse1730 (select (select (store .cse1731 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1732))) (or (= .cse1728 0) (= .cse1729 (select (select .cse1730 (select (select (store .cse1731 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1732)) (= .cse1728 .cse1729) (= .cse1729 (select (select .cse1730 (select (select (store .cse1731 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1732)))))) (not (<= 0 .cse1733)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1748 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1745 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1746 (select (select .cse1745 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1747 (+ (select (select .cse1748 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1740 (store (store .cse1748 .cse1746 (store (select .cse1748 .cse1746) .cse1747 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1738 (select (select .cse1740 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1738)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1741 (store .cse1745 .cse1746 (store (select .cse1745 .cse1746) .cse1747 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1743 (store .cse1741 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1744 (select (select .cse1743 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1742 (+ .cse1738 4))) (let ((.cse1739 (select (select .cse1740 .cse1744) .cse1742))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse1739 (select (select .cse1740 (select (select (store .cse1741 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1742))) (= (select (select .cse1740 (select (select (store .cse1741 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1742) .cse1739) (not (= (select (select .cse1743 .cse1744) .cse1742) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1740 (select (select (store .cse1741 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1742) .cse1739) (= .cse1739 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1761 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1758 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1759 (select (select .cse1758 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1760 (+ (select (select .cse1761 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1755 (store (store .cse1761 .cse1759 (store (select .cse1761 .cse1759) .cse1760 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1757 (select (select .cse1755 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse1756 (store .cse1758 .cse1759 (store (select .cse1758 .cse1759) .cse1760 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1754 (+ .cse1757 4))) (let ((.cse1749 (select (select .cse1755 (select (select (store .cse1756 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1754))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1750 (select (select .cse1755 (select (select (store .cse1756 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1754))) (or (= .cse1749 .cse1750) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1752 (store .cse1756 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1753 (select (select .cse1752 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1751 (select (select .cse1755 .cse1753) .cse1754))) (or (= .cse1751 .cse1750) (not (= (select (select .cse1752 .cse1753) .cse1754) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse1751 4)))))))))) (= .cse1749 0))))) (not (<= 0 .cse1757)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse1768 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1762 (select (select .cse1768 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse1762 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse1770 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse1769 (+ (select (select .cse1770 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1767 (store (store .cse1770 .cse1762 (store (select .cse1770 .cse1762) .cse1769 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1763 (select (select .cse1767 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1765 (store .cse1768 .cse1762 (store (select .cse1768 .cse1762) .cse1769 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1766 (+ .cse1763 4))) (or (not (<= 0 .cse1763)) (not (= (select (let ((.cse1764 (store .cse1765 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1764 (select (select .cse1764 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1766) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1767 (select (select (store .cse1765 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1766) 0) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (= (select (select .cse1767 (select (select (store .cse1765 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1766) (select (select .cse1767 (select (select (store .cse1765 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1766)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1781 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1779 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1777 (select (select .cse1779 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1780 (+ (select (select .cse1781 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1772 (store (store .cse1781 .cse1777 (store (select .cse1781 .cse1777) .cse1780 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1778 (select (select .cse1772 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1773 (store .cse1779 .cse1777 (store (select .cse1779 .cse1777) .cse1780 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1775 (store .cse1773 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1776 (select (select .cse1775 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1774 (+ .cse1778 4))) (let ((.cse1771 (select (select .cse1772 .cse1776) .cse1774))) (or (not (= .cse1771 4)) (= .cse1771 (select (select .cse1772 (select (select (store .cse1773 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1774)) (not (= (select (select .cse1775 .cse1776) .cse1774) .cse1777)))))))) (not (<= 0 .cse1778)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1790 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1788 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1782 (select (select .cse1788 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1789 (+ (select (select .cse1790 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1787 (store (store .cse1790 .cse1782 (store (select .cse1790 .cse1782) .cse1789 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1786 (select (select .cse1787 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1784 (store .cse1788 .cse1782 (store (select .cse1788 .cse1782) .cse1789 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1785 (+ .cse1786 4))) (or (not (= .cse1782 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1783 (store .cse1784 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1783 (select (select .cse1783 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1785) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse1786)) (forall ((v_prenex_32 (Array Int Int))) (= (select (select .cse1787 (select (select (store .cse1784 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1785) 0))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1803 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1801 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1800 (select (select .cse1801 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1802 (+ (select (select .cse1803 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1791 (store (store .cse1803 .cse1800 (store (select .cse1803 .cse1800) .cse1802 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1794 (select (select .cse1791 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1793 (+ .cse1794 4)) (.cse1792 (store .cse1801 .cse1800 (store (select .cse1801 .cse1800) .cse1802 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse1791 (select (select (store .cse1792 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1793) 0)) (not (<= 0 .cse1794)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1798 (store .cse1792 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1799 (select (select .cse1798 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1795 (select (select .cse1791 (select (select (store .cse1792 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1793)) (.cse1796 (select (select .cse1791 (select (select (store .cse1792 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1793)) (.cse1797 (select (select .cse1791 .cse1799) .cse1793))) (or (= .cse1795 0) (= .cse1796 0) (= .cse1795 .cse1797) (= .cse1797 .cse1796) (not (= (select (select .cse1798 .cse1799) .cse1793) .cse1800)) (= .cse1797 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1816 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1814 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1812 (select (select .cse1814 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1815 (+ (select (select .cse1816 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1805 (store (store .cse1816 .cse1812 (store (select .cse1816 .cse1812) .cse1815 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1813 (select (select .cse1805 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse1806 (store .cse1814 .cse1812 (store (select .cse1814 .cse1812) .cse1815 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1810 (store .cse1806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1811 (select (select .cse1810 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1807 (+ .cse1813 4))) (let ((.cse1804 (select (select .cse1805 .cse1811) .cse1807))) (or (= .cse1804 (select (select .cse1805 (select (select (store .cse1806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1807)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse1808 (select (select .cse1805 (select (select (store .cse1806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1807))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1809 (select (select .cse1805 (select (select (store .cse1806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1807))) (or (= .cse1808 .cse1809) (= .cse1809 0)))) (= .cse1808 .cse1804)))) (not (= (select (select .cse1810 .cse1811) .cse1807) .cse1812)) (= .cse1804 0))))))) (not (<= 0 .cse1813)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1827 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1825 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1823 (select (select .cse1825 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1826 (+ (select (select .cse1827 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1817 (store (store .cse1827 .cse1823 (store (select .cse1827 .cse1823) .cse1826 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1824 (select (select .cse1817 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1819 (+ .cse1824 4)) (.cse1818 (store .cse1825 .cse1823 (store (select .cse1825 .cse1823) .cse1826 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (= (select (select .cse1817 (select (select (store .cse1818 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1819) 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1821 (store .cse1818 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1822 (select (select .cse1821 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1820 (select (select .cse1817 .cse1822) .cse1819))) (or (not (= .cse1820 4)) (= (select (select .cse1817 (select (select (store .cse1818 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1819) .cse1820) (= .cse1820 (select (select .cse1817 (select (select (store .cse1818 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1819)) (not (= (select (select .cse1821 .cse1822) .cse1819) .cse1823))))))) (not (<= 0 .cse1824))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1841 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1839 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1835 (select (select .cse1839 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1840 (+ (select (select .cse1841 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1836 (store (store .cse1841 .cse1835 (store (select .cse1841 .cse1835) .cse1840 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1838 (select (select .cse1836 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1837 (store .cse1839 .cse1835 (store (select .cse1839 .cse1835) .cse1840 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1834 (+ .cse1838 4))) (let ((.cse1828 (select (select .cse1836 (select (select (store .cse1837 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1834))) (or (= .cse1828 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse1829 (select (select .cse1836 (select (select (store .cse1837 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1834))) (or (= .cse1829 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1832 (store .cse1837 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1833 (select (select .cse1832 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1830 (select (select .cse1836 (select (select (store .cse1837 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1834)) (.cse1831 (select (select .cse1836 .cse1833) .cse1834))) (or (= .cse1830 0) (= .cse1829 .cse1831) (= .cse1831 .cse1830) (not (= (select (select .cse1832 .cse1833) .cse1834) .cse1835)) (= .cse1831 0)))))) (= .cse1829 .cse1828)))))))) (not (<= 0 .cse1838)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1853 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1851 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1846 (select (select .cse1851 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1852 (+ (select (select .cse1853 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1848 (store (store .cse1853 .cse1846 (store (select .cse1853 .cse1846) .cse1852 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1850 (select (select .cse1848 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1849 (store .cse1851 .cse1846 (store (select .cse1851 .cse1846) .cse1852 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1843 (store .cse1849 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1844 (select (select .cse1843 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1845 (+ .cse1850 4))) (let ((.cse1842 (select (select .cse1848 .cse1844) .cse1845))) (or (not (= .cse1842 4)) (not (= (select (select .cse1843 .cse1844) .cse1845) .cse1846)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1847 (select (select .cse1848 (select (select (store .cse1849 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1845))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse1847 (select (select .cse1848 (select (select (store .cse1849 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1845))) (= .cse1842 .cse1847) (= (select (select .cse1848 (select (select (store .cse1849 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1845) .cse1847) (= .cse1847 0)))))))))) (not (<= 0 .cse1850)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1865 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1863 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1862 (select (select .cse1863 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1864 (+ (select (select .cse1865 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1855 (store (store .cse1865 .cse1862 (store (select .cse1865 .cse1862) .cse1864 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1854 (select (select .cse1855 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1854)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1856 (store .cse1863 .cse1862 (store (select .cse1863 .cse1862) .cse1864 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1857 (+ .cse1854 4))) (let ((.cse1858 (select (select .cse1855 (select (select (store .cse1856 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1857))) (or (= (select (select .cse1855 (select (select (store .cse1856 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1857) .cse1858) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse1860 (store .cse1856 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1861 (select (select .cse1860 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1859 (select (select .cse1855 .cse1861) .cse1857))) (or (not (= .cse1859 4)) (= .cse1859 .cse1858) (forall ((v_prenex_39 (Array Int Int))) (= .cse1859 (select (select .cse1855 (select (select (store .cse1856 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1857))) (not (= (select (select .cse1860 .cse1861) .cse1857) .cse1862))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1879 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1876 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1877 (select (select .cse1876 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1878 (+ (select (select .cse1879 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1873 (store (store .cse1879 .cse1877 (store (select .cse1879 .cse1877) .cse1878 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1875 (select (select .cse1873 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1874 (store .cse1876 .cse1877 (store (select .cse1876 .cse1877) .cse1878 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1869 (store .cse1874 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1870 (select (select .cse1869 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1871 (+ .cse1875 4))) (let ((.cse1872 (select (select .cse1873 (select (select (store .cse1874 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1871)) (.cse1866 (select (select .cse1873 .cse1870) .cse1871)) (.cse1868 (select (select .cse1873 (select (select (store .cse1874 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1871)) (.cse1867 (select (select .cse1873 (select (select (store .cse1874 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1871))) (or (= .cse1866 .cse1867) (= .cse1868 .cse1866) (not (= (select (select .cse1869 .cse1870) .cse1871) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1872 .cse1866) (= .cse1872 .cse1868) (not (= .cse1866 4)) (= .cse1868 .cse1867))))))) (not (<= 0 .cse1875)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1893 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1890 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1891 (select (select .cse1890 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1892 (+ (select (select .cse1893 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1887 (store (store .cse1893 .cse1891 (store (select .cse1893 .cse1891) .cse1892 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1889 (select (select .cse1887 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1888 (store .cse1890 .cse1891 (store (select .cse1890 .cse1891) .cse1892 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1880 (store .cse1888 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1881 (select (select .cse1880 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1882 (+ .cse1889 4))) (let ((.cse1884 (select (select .cse1887 .cse1881) .cse1882)) (.cse1883 (select (select .cse1887 (select (select (store .cse1888 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1882))) (or (not (= (select (select .cse1880 .cse1881) .cse1882) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1883 .cse1884) (not (= .cse1884 4)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse1885 (select (select .cse1887 (select (select (store .cse1888 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1882))) (or (= .cse1885 .cse1884) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse1886 (select (select .cse1887 (select (select (store .cse1888 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1882))) (or (= .cse1883 .cse1886) (= .cse1885 .cse1886))))))))))))) (not (<= 0 .cse1889)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1905 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1902 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1903 (select (select .cse1902 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1904 (+ (select (select .cse1905 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1894 (store (store .cse1905 .cse1903 (store (select .cse1905 .cse1903) .cse1904 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1897 (select (select .cse1894 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1896 (+ .cse1897 4)) (.cse1895 (store .cse1902 .cse1903 (store (select .cse1902 .cse1903) .cse1904 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse1894 (select (select (store .cse1895 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1896) 0)) (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse1894 (select (select (store .cse1895 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1896) 0)) (not (<= 0 .cse1897)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1900 (store .cse1895 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse1901 (select (select .cse1900 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1898 (select (select .cse1894 .cse1901) .cse1896)) (.cse1899 (select (select .cse1894 (select (select (store .cse1895 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1896))) (or (= .cse1898 0) (= .cse1899 .cse1898) (= .cse1899 0) (= (select (select .cse1900 .cse1901) .cse1896) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1918 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1915 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1916 (select (select .cse1915 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1917 (+ (select (select .cse1918 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1909 (store (store .cse1918 .cse1916 (store (select .cse1918 .cse1916) .cse1917 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1914 (select (select .cse1909 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1910 (store .cse1915 .cse1916 (store (select .cse1915 .cse1916) .cse1917 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1912 (store .cse1910 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1913 (select (select .cse1912 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1911 (+ .cse1914 4))) (let ((.cse1907 (select (select .cse1909 .cse1913) .cse1911))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse1906 (select (select .cse1909 (select (select (store .cse1910 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1911))) (or (= .cse1906 .cse1907) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1908 (select (select .cse1909 (select (select (store .cse1910 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1911))) (or (= .cse1906 .cse1908) (= .cse1908 (select (select .cse1909 (select (select (store .cse1910 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1911)) (= .cse1908 0))))))) (not (= (select (select .cse1912 .cse1913) .cse1911) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse1907 4)))))))) (not (<= 0 .cse1914)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1932 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1930 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1926 (select (select .cse1930 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1931 (+ (select (select .cse1932 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1927 (store (store .cse1932 .cse1926 (store (select .cse1932 .cse1926) .cse1931 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1929 (select (select .cse1927 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1928 (store .cse1930 .cse1926 (store (select .cse1930 .cse1926) .cse1931 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1923 (store .cse1928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse1924 (select (select .cse1923 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1925 (+ .cse1929 4))) (let ((.cse1920 (select (select .cse1927 (select (select (store .cse1928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1925)) (.cse1919 (select (select .cse1927 (select (select (store .cse1928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1925)) (.cse1922 (select (select .cse1927 (select (select (store .cse1928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1925)) (.cse1921 (select (select .cse1927 .cse1924) .cse1925))) (or (= .cse1919 .cse1920) (not (= .cse1921 4)) (= .cse1922 .cse1920) (= .cse1921 .cse1919) (= .cse1919 0) (= .cse1922 .cse1921) (not (= (select (select .cse1923 .cse1924) .cse1925) .cse1926)))))))) (not (<= 0 .cse1929)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1945 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1942 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1943 (select (select .cse1942 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1944 (+ (select (select .cse1945 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1939 (store (store .cse1945 .cse1943 (store (select .cse1945 .cse1943) .cse1944 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1941 (select (select .cse1939 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1940 (store .cse1942 .cse1943 (store (select .cse1942 .cse1943) .cse1944 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1936 (store .cse1940 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1937 (select (select .cse1936 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1938 (+ .cse1941 4))) (let ((.cse1933 (select (select .cse1939 .cse1937) .cse1938)) (.cse1935 (select (select .cse1939 (select (select (store .cse1940 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1938)) (.cse1934 (select (select .cse1939 (select (select (store .cse1940 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1938))) (or (= .cse1933 .cse1934) (= .cse1935 .cse1933) (not (= (select (select .cse1936 .cse1937) .cse1938) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse1939 (select (select (store .cse1940 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1938) .cse1933) (= .cse1933 0) (= .cse1935 .cse1934))))))) (not (<= 0 .cse1941)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1958 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1955 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1956 (select (select .cse1955 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1957 (+ (select (select .cse1958 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1952 (store (store .cse1958 .cse1956 (store (select .cse1958 .cse1956) .cse1957 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1954 (select (select .cse1952 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1953 (store .cse1955 .cse1956 (store (select .cse1955 .cse1956) .cse1957 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1948 (store .cse1953 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1949 (select (select .cse1948 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1950 (+ .cse1954 4))) (let ((.cse1947 (select (select .cse1952 .cse1949) .cse1950)) (.cse1951 (select (select .cse1952 (select (select (store .cse1953 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1950)) (.cse1946 (select (select .cse1952 (select (select (store .cse1953 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1950))) (or (= .cse1946 .cse1947) (not (= (select (select .cse1948 .cse1949) .cse1950) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1951 0) (not (= .cse1947 4)) (= .cse1946 .cse1951) (= .cse1946 0))))))) (not (<= 0 .cse1954)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1968 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1966 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1959 (select (select .cse1966 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1967 (+ (select (select .cse1968 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1963 (store (store .cse1968 .cse1959 (store (select .cse1968 .cse1959) .cse1967 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1965 (select (select .cse1963 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1961 (store .cse1966 .cse1959 (store (select .cse1966 .cse1959) .cse1967 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1962 (+ .cse1965 4))) (or (not (= .cse1959 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse1960 (store .cse1961 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse1960 (select (select .cse1960 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse1962) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1964 (select (select .cse1963 (select (select (store .cse1961 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1962))) (or (= (select (select .cse1963 (select (select (store .cse1961 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1962) .cse1964) (= .cse1964 0)))) (not (<= 0 .cse1965))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1979 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1976 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1977 (select (select .cse1976 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1978 (+ (select (select .cse1979 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1969 (store (store .cse1979 .cse1977 (store (select .cse1979 .cse1977) .cse1978 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1975 (select (select .cse1969 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1970 (store .cse1976 .cse1977 (store (select .cse1976 .cse1977) .cse1978 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1971 (+ .cse1975 4))) (or (= (select (select .cse1969 (select (select (store .cse1970 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1971) 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse1972 (store .cse1970 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1973 (select (select .cse1972 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1972 .cse1973) .cse1971) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= (select (select .cse1969 .cse1973) .cse1971) 4)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse1974 (select (select .cse1969 (select (select (store .cse1970 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1971))) (or (= (select (select .cse1969 (select (select (store .cse1970 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1971) .cse1974) (= .cse1974 0)))) (not (<= 0 .cse1975))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse1991 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse1988 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse1989 (select (select .cse1988 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1990 (+ (select (select .cse1991 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1985 (store (store .cse1991 .cse1989 (store (select .cse1991 .cse1989) .cse1990 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1987 (select (select .cse1985 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1986 (store .cse1988 .cse1989 (store (select .cse1988 .cse1989) .cse1990 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse1984 (+ .cse1987 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse1982 (store .cse1986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1983 (select (select .cse1982 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1981 (select (select .cse1985 (select (select (store .cse1986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1984)) (.cse1980 (select (select .cse1985 .cse1983) .cse1984))) (or (= .cse1980 .cse1981) (not (= (select (select .cse1982 .cse1983) .cse1984) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1981 0) (not (= .cse1980 4))))))) (not (<= 0 .cse1987)) (= (select (select .cse1985 (select (select (store .cse1986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1984) 0)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2005 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2002 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2003 (select (select .cse2002 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2004 (+ (select (select .cse2005 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2000 (store (store .cse2005 .cse2003 (store (select .cse2005 .cse2003) .cse2004 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse1992 (select (select .cse2000 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse1992)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2001 (store .cse2002 .cse2003 (store (select .cse2002 .cse2003) .cse2004 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse1997 (store .cse2001 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse1998 (select (select .cse1997 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1999 (+ .cse1992 4))) (let ((.cse1994 (select (select .cse2000 .cse1998) .cse1999)) (.cse1993 (select (select .cse2000 (select (select (store .cse2001 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1999)) (.cse1996 (select (select .cse2000 (select (select (store .cse2001 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1999)) (.cse1995 (select (select .cse2000 (select (select (store .cse2001 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1999))) (or (= .cse1993 0) (= .cse1994 .cse1995) (= .cse1996 .cse1994) (not (= (select (select .cse1997 .cse1998) .cse1999) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse1994 0) (= .cse1993 .cse1996) (= .cse1996 .cse1995))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2017 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2014 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2015 (select (select .cse2014 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2016 (+ (select (select .cse2017 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2012 (store (store .cse2017 .cse2015 (store (select .cse2017 .cse2015) .cse2016 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2006 (select (select .cse2012 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2006)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2013 (store .cse2014 .cse2015 (store (select .cse2014 .cse2015) .cse2016 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2009 (store .cse2013 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2010 (select (select .cse2009 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2011 (+ .cse2006 4))) (let ((.cse2008 (select (select .cse2012 .cse2010) .cse2011)) (.cse2007 (select (select .cse2012 (select (select (store .cse2013 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2011))) (or (= .cse2007 .cse2008) (not (= (select (select .cse2009 .cse2010) .cse2011) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2012 (select (select (store .cse2013 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2011) .cse2008) (not (= .cse2008 4)) (= .cse2007 (select (select .cse2012 (select (select (store .cse2013 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2011)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2030 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2027 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2028 (select (select .cse2027 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2029 (+ (select (select .cse2030 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2023 (store (store .cse2030 .cse2028 (store (select .cse2030 .cse2028) .cse2029 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2026 (select (select .cse2023 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2024 (store .cse2027 .cse2028 (store (select .cse2027 .cse2028) .cse2029 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2020 (+ .cse2026 4))) (let ((.cse2025 (select (select .cse2023 (select (select (store .cse2024 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2020))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2021 (select (select .cse2023 (select (select (store .cse2024 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2020))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2018 (store .cse2024 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2019 (select (select .cse2018 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2022 (select (select .cse2023 .cse2019) .cse2020))) (or (not (= (select (select .cse2018 .cse2019) .cse2020) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2021 .cse2022) (not (= .cse2022 4))))))) (= .cse2021 .cse2025)))) (= .cse2025 0))))) (not (<= 0 .cse2026)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2042 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2040 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2038 (select (select .cse2040 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2041 (+ (select (select .cse2042 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2031 (store (store .cse2042 .cse2038 (store (select .cse2042 .cse2038) .cse2041 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2039 (select (select .cse2031 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2032 (store .cse2040 .cse2038 (store (select .cse2040 .cse2038) .cse2041 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2033 (+ .cse2039 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse2031 (select (select (store .cse2032 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2033) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2036 (store .cse2032 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2037 (select (select .cse2036 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2034 (select (select .cse2031 (select (select (store .cse2032 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2033)) (.cse2035 (select (select .cse2031 .cse2037) .cse2033))) (or (= .cse2034 0) (= .cse2034 .cse2035) (not (= (select (select .cse2036 .cse2037) .cse2033) .cse2038)) (= .cse2035 0)))))) (forall ((v_prenex_39 (Array Int Int))) (= (select (select .cse2031 (select (select (store .cse2032 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2033) 0)) (not (<= 0 .cse2039))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2052 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2053 (select (select .cse2052 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2055 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2054 (+ (select (select .cse2055 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2047 (store (store .cse2055 .cse2053 (store (select .cse2055 .cse2053) .cse2054 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2050 (select (select .cse2047 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2048 (store .cse2052 .cse2053 (store (select .cse2052 .cse2053) .cse2054 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2049 (+ .cse2050 4))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2043 (select (select .cse2047 (select (select (store .cse2048 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2049)) (.cse2044 (select (select .cse2047 (select (select (store .cse2048 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2049))) (or (= .cse2043 .cse2044) (= .cse2044 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2045 (select (select .cse2047 (select (select (store .cse2048 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2049))) (or (= .cse2045 .cse2044) (= .cse2043 .cse2045) (= .cse2045 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2046 (select (select .cse2047 (select (select (store .cse2048 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2049))) (or (= .cse2046 .cse2045) (= .cse2046 .cse2044)))))))))) (not (<= 0 .cse2050)) (not (= (select (let ((.cse2051 (store .cse2048 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2051 (select (select .cse2051 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2049) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse2053 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2067 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2065 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2063 (select (select .cse2065 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2066 (+ (select (select .cse2067 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2056 (store (store .cse2067 .cse2063 (store (select .cse2067 .cse2063) .cse2066 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2064 (select (select .cse2056 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2057 (store .cse2065 .cse2063 (store (select .cse2065 .cse2063) .cse2066 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2061 (store .cse2057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2062 (select (select .cse2061 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2058 (+ .cse2064 4))) (let ((.cse2060 (select (select .cse2056 .cse2062) .cse2058)) (.cse2059 (select (select .cse2056 (select (select (store .cse2057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2058))) (or (= (select (select .cse2056 (select (select (store .cse2057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2058) .cse2059) (not (= .cse2060 4)) (= (select (select .cse2056 (select (select (store .cse2057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2058) .cse2060) (= .cse2060 .cse2059) (not (= (select (select .cse2061 .cse2062) .cse2058) .cse2063)))))))) (not (<= 0 .cse2064)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2076 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2073 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2074 (select (select .cse2073 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2075 (+ (select (select .cse2076 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2069 (store (store .cse2076 .cse2074 (store (select .cse2076 .cse2074) .cse2075 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2072 (select (select .cse2069 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2070 (store .cse2073 .cse2074 (store (select .cse2073 .cse2074) .cse2075 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2071 (+ .cse2072 4))) (let ((.cse2068 (select (select .cse2069 (select (select (store .cse2070 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2071))) (or (= .cse2068 0) (= .cse2068 (select (select .cse2069 (select (select (store .cse2070 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2071)) (= .cse2068 (select (select .cse2069 (select (select (store .cse2070 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2071)) (= .cse2068 (select (select .cse2069 (select (select (store .cse2070 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2071)))))) (not (<= 0 .cse2072)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2090 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2087 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2088 (select (select .cse2087 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2089 (+ (select (select .cse2090 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2081 (store (store .cse2090 .cse2088 (store (select .cse2090 .cse2088) .cse2089 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2077 (select (select .cse2081 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2077)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2082 (store .cse2087 .cse2088 (store (select .cse2087 .cse2088) .cse2089 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2085 (store .cse2082 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2086 (select (select .cse2085 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2083 (+ .cse2077 4))) (let ((.cse2084 (select (select .cse2081 .cse2086) .cse2083))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2078 (select (select .cse2081 (select (select (store .cse2082 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2083))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2080 (select (select .cse2081 (select (select (store .cse2082 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2083)) (.cse2079 (select (select .cse2081 (select (select (store .cse2082 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2083))) (or (= .cse2078 .cse2079) (= .cse2078 .cse2080) (= .cse2080 .cse2079)))) (= .cse2078 .cse2084)))) (not (= (select (select .cse2085 .cse2086) .cse2083) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse2084 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2104 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2101 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2102 (select (select .cse2101 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2103 (+ (select (select .cse2104 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2095 (store (store .cse2104 .cse2102 (store (select .cse2104 .cse2102) .cse2103 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2100 (select (select .cse2095 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2096 (store .cse2101 .cse2102 (store (select .cse2101 .cse2102) .cse2103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2098 (store .cse2096 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2099 (select (select .cse2098 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2097 (+ .cse2100 4))) (let ((.cse2091 (select (select .cse2095 (select (select (store .cse2096 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2097)) (.cse2092 (select (select .cse2095 .cse2099) .cse2097))) (or (= .cse2091 .cse2092) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse2093 (select (select .cse2095 (select (select (store .cse2096 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2097)) (.cse2094 (select (select .cse2095 (select (select (store .cse2096 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2097))) (or (= .cse2093 .cse2092) (= .cse2094 .cse2093) (= .cse2091 .cse2093) (= .cse2093 0) (= .cse2094 .cse2092)))) (= .cse2092 0) (= (select (select .cse2098 .cse2099) .cse2097) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))) (not (<= 0 .cse2100)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2117 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2114 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2115 (select (select .cse2114 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2116 (+ (select (select .cse2117 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2105 (store (store .cse2117 .cse2115 (store (select .cse2117 .cse2115) .cse2116 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2113 (select (select .cse2105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2107 (+ .cse2113 4)) (.cse2106 (store .cse2114 .cse2115 (store (select .cse2114 .cse2115) .cse2116 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse2105 (select (select (store .cse2106 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2107) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2111 (store .cse2106 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2112 (select (select .cse2111 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2108 (select (select .cse2105 (select (select (store .cse2106 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2107)) (.cse2109 (select (select .cse2105 .cse2112) .cse2107)) (.cse2110 (select (select .cse2105 (select (select (store .cse2106 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2107))) (or (= .cse2108 0) (= .cse2109 0) (= .cse2108 .cse2110) (= .cse2110 .cse2109) (= .cse2110 0) (= (select (select .cse2111 .cse2112) .cse2107) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (<= 0 .cse2113))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2129 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2126 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2127 (select (select .cse2126 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2128 (+ (select (select .cse2129 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2123 (store (store .cse2129 .cse2127 (store (select .cse2129 .cse2127) .cse2128 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2118 (select (select .cse2123 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2118)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2124 (store .cse2126 .cse2127 (store (select .cse2126 .cse2127) .cse2128 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2125 (+ .cse2118 4))) (let ((.cse2121 (select (select .cse2123 (select (select (store .cse2124 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2125)) (.cse2120 (select (select .cse2123 (select (select (store .cse2124 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2125)) (.cse2119 (select (select .cse2123 (select (select (store .cse2124 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2125)) (.cse2122 (select (select .cse2123 (select (select (store .cse2124 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2125))) (or (= .cse2119 0) (= .cse2120 .cse2121) (= .cse2119 .cse2121) (= .cse2122 .cse2120) (= .cse2119 .cse2120) (= .cse2120 0) (= .cse2119 .cse2122))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2142 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2140 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2139 (select (select .cse2140 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2141 (+ (select (select .cse2142 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2131 (store (store .cse2142 .cse2139 (store (select .cse2142 .cse2139) .cse2141 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2130 (select (select .cse2131 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2130)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2132 (store .cse2140 .cse2139 (store (select .cse2140 .cse2139) .cse2141 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2133 (+ .cse2130 4))) (let ((.cse2135 (select (select .cse2131 (select (select (store .cse2132 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2133))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2134 (select (select .cse2131 (select (select (store .cse2132 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2133))) (or (= (select (select .cse2131 (select (select (store .cse2132 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2133) .cse2134) (= .cse2135 .cse2134)))) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2137 (store .cse2132 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2138 (select (select .cse2137 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2136 (select (select .cse2131 .cse2138) .cse2133))) (or (not (= .cse2136 4)) (= .cse2135 .cse2136) (not (= (select (select .cse2137 .cse2138) .cse2133) .cse2139))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2152 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2150 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2143 (select (select .cse2150 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2151 (+ (select (select .cse2152 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2145 (store (store .cse2152 .cse2143 (store (select .cse2152 .cse2143) .cse2151 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2149 (select (select .cse2145 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2146 (store .cse2150 .cse2143 (store (select .cse2150 .cse2143) .cse2151 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2147 (+ .cse2149 4))) (or (not (= .cse2143 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2144 (select (select .cse2145 (select (select (store .cse2146 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2147))) (or (= .cse2144 (select (select .cse2145 (select (select (store .cse2146 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2147)) (= .cse2144 0)))) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse2148 (store .cse2146 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2148 (select (select .cse2148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2147) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse2149))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2166 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2163 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2164 (select (select .cse2163 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2165 (+ (select (select .cse2166 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2161 (store (store .cse2166 .cse2164 (store (select .cse2166 .cse2164) .cse2165 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2153 (select (select .cse2161 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2153)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2162 (store .cse2163 .cse2164 (store (select .cse2163 .cse2164) .cse2165 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2154 (store .cse2162 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2155 (select (select .cse2154 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2156 (+ .cse2153 4))) (let ((.cse2157 (select (select .cse2161 .cse2155) .cse2156))) (or (not (= (select (select .cse2154 .cse2155) .cse2156) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2157 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2158 (select (select .cse2161 (select (select (store .cse2162 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2156))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2159 (select (select .cse2161 (select (select (store .cse2162 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2156))) (or (= .cse2158 .cse2159) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2160 (select (select .cse2161 (select (select (store .cse2162 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2156))) (or (= .cse2158 .cse2160) (= .cse2160 0) (= .cse2159 .cse2160)))) (= .cse2159 0)))) (= .cse2158 .cse2157)))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2180 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2177 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2178 (select (select .cse2177 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2179 (+ (select (select .cse2180 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2175 (store (store .cse2180 .cse2178 (store (select .cse2180 .cse2178) .cse2179 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2167 (select (select .cse2175 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2167)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2176 (store .cse2177 .cse2178 (store (select .cse2177 .cse2178) .cse2179 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2172 (store .cse2176 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2173 (select (select .cse2172 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2174 (+ .cse2167 4))) (let ((.cse2168 (select (select .cse2175 (select (select (store .cse2176 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2174)) (.cse2170 (select (select .cse2175 (select (select (store .cse2176 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2174)) (.cse2171 (select (select .cse2175 (select (select (store .cse2176 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2174)) (.cse2169 (select (select .cse2175 .cse2173) .cse2174))) (or (= .cse2168 .cse2169) (= .cse2170 .cse2169) (= .cse2170 .cse2168) (= .cse2169 0) (= .cse2170 .cse2171) (= .cse2171 .cse2169) (= (select (select .cse2172 .cse2173) .cse2174) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2191 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2188 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2189 (select (select .cse2188 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2190 (+ (select (select .cse2191 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2183 (store (store .cse2191 .cse2189 (store (select .cse2191 .cse2189) .cse2190 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2187 (select (select .cse2183 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2184 (store .cse2188 .cse2189 (store (select .cse2188 .cse2189) .cse2190 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2185 (+ .cse2187 4))) (let ((.cse2181 (select (select .cse2183 (select (select (store .cse2184 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2185))) (or (= .cse2181 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2186 (select (select .cse2183 (select (select (store .cse2184 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2185))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2182 (select (select .cse2183 (select (select (store .cse2184 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2185))) (or (= .cse2182 0) (= .cse2182 .cse2181) (forall ((v_prenex_39 (Array Int Int))) (= .cse2182 (select (select .cse2183 (select (select (store .cse2184 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2185))) (= .cse2182 .cse2186)))) (= .cse2186 0)))))))) (not (<= 0 .cse2187)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2204 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2201 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2202 (select (select .cse2201 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2203 (+ (select (select .cse2204 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2196 (store (store .cse2204 .cse2202 (store (select .cse2204 .cse2202) .cse2203 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2192 (select (select .cse2196 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2192)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2197 (store .cse2201 .cse2202 (store (select .cse2201 .cse2202) .cse2203 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2199 (store .cse2197 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2200 (select (select .cse2199 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2198 (+ .cse2192 4))) (let ((.cse2194 (select (select .cse2196 .cse2200) .cse2198))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2193 (select (select .cse2196 (select (select (store .cse2197 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2198))) (or (= .cse2193 .cse2194) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2195 (select (select .cse2196 (select (select (store .cse2197 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2198))) (or (= .cse2195 0) (= .cse2193 .cse2195))))))) (not (= (select (select .cse2199 .cse2200) .cse2198) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse2194 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2216 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2214 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2213 (select (select .cse2214 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2215 (+ (select (select .cse2216 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2208 (store (store .cse2216 .cse2213 (store (select .cse2216 .cse2213) .cse2215 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2205 (select (select .cse2208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2205)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2209 (store .cse2214 .cse2213 (store (select .cse2214 .cse2213) .cse2215 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2211 (store .cse2209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2212 (select (select .cse2211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2210 (+ .cse2205 4))) (let ((.cse2206 (select (select .cse2208 .cse2212) .cse2210)) (.cse2207 (select (select .cse2208 (select (select (store .cse2209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2210))) (or (not (= .cse2206 4)) (= .cse2206 .cse2207) (= (select (select .cse2208 (select (select (store .cse2209 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2210) .cse2207) (not (= (select (select .cse2211 .cse2212) .cse2210) .cse2213)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2228 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2225 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2226 (select (select .cse2225 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2227 (+ (select (select .cse2228 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2218 (store (store .cse2228 .cse2226 (store (select .cse2228 .cse2226) .cse2227 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2224 (select (select .cse2218 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2219 (store .cse2225 .cse2226 (store (select .cse2225 .cse2226) .cse2227 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2220 (+ .cse2224 4))) (let ((.cse2221 (select (select .cse2218 (select (select (store .cse2219 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2220))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2222 (store .cse2219 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2223 (select (select .cse2222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2217 (select (select .cse2218 .cse2223) .cse2220))) (or (= .cse2217 (select (select .cse2218 (select (select (store .cse2219 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2220)) (= .cse2221 .cse2217) (not (= (select (select .cse2222 .cse2223) .cse2220) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse2217 4))))))) (= (select (select .cse2218 (select (select (store .cse2219 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2220) .cse2221))))) (not (<= 0 .cse2224)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2237 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2229 (select (select .cse2237 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2229 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2239 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2238 (+ (select (select .cse2239 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2236 (store (store .cse2239 .cse2229 (store (select .cse2239 .cse2229) .cse2238 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2230 (select (select .cse2236 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2232 (store .cse2237 .cse2229 (store (select .cse2237 .cse2229) .cse2238 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2233 (+ .cse2230 4))) (or (not (<= 0 .cse2230)) (not (= (select (let ((.cse2231 (store .cse2232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2231 (select (select .cse2231 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2233) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2235 (select (select .cse2236 (select (select (store .cse2232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2233))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse2234 (select (select .cse2236 (select (select (store .cse2232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2233))) (or (= .cse2234 .cse2235) (= (select (select .cse2236 (select (select (store .cse2232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2233) .cse2234)))) (= .cse2235 0))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2247 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2248 (select (select .cse2247 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2250 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2249 (+ (select (select .cse2250 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2240 (store (store .cse2250 .cse2248 (store (select .cse2250 .cse2248) .cse2249 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2245 (select (select .cse2240 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2241 (store .cse2247 .cse2248 (store (select .cse2247 .cse2248) .cse2249 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2242 (+ .cse2245 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2243 (select (select .cse2240 (select (select (store .cse2241 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2242))) (or (= (select (select .cse2240 (select (select (store .cse2241 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2242) .cse2243) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2244 (select (select .cse2240 (select (select (store .cse2241 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2242))) (or (= .cse2244 .cse2243) (= .cse2244 (select (select .cse2240 (select (select (store .cse2241 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2242)))))))) (not (<= 0 .cse2245)) (not (= (select (let ((.cse2246 (store .cse2241 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2246 (select (select .cse2246 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2242) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse2248 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2257 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2251 (select (select .cse2257 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2251 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2259 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2258 (+ (select (select .cse2259 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2256 (store (store .cse2259 .cse2251 (store (select .cse2259 .cse2251) .cse2258 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2252 (select (select .cse2256 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2254 (store .cse2257 .cse2251 (store (select .cse2257 .cse2251) .cse2258 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2255 (+ .cse2252 4))) (or (not (<= 0 .cse2252)) (not (= (select (let ((.cse2253 (store .cse2254 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2253 (select (select .cse2253 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2255) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (= (select (select .cse2256 (select (select (store .cse2254 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2255) (select (select .cse2256 (select (select (store .cse2254 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2255)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2267 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2260 (select (select .cse2267 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2260 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2269 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2268 (+ (select (select .cse2269 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2266 (store (store .cse2269 .cse2260 (store (select .cse2269 .cse2260) .cse2268 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2261 (select (select .cse2266 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2263 (store .cse2267 .cse2260 (store (select .cse2267 .cse2260) .cse2268 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2264 (+ .cse2261 4))) (or (not (<= 0 .cse2261)) (not (= (select (let ((.cse2262 (store .cse2263 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2262 (select (select .cse2262 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2264) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse2265 (select (select .cse2266 (select (select (store .cse2263 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2264))) (or (= .cse2265 (select (select .cse2266 (select (select (store .cse2263 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2264)) (= .cse2265 0))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2282 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2279 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2280 (select (select .cse2279 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2281 (+ (select (select .cse2282 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2276 (store (store .cse2282 .cse2280 (store (select .cse2282 .cse2280) .cse2281 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2278 (select (select .cse2276 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2277 (store .cse2279 .cse2280 (store (select .cse2279 .cse2280) .cse2281 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2273 (store .cse2277 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2274 (select (select .cse2273 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2275 (+ .cse2278 4))) (let ((.cse2270 (select (select .cse2276 .cse2274) .cse2275)) (.cse2272 (select (select .cse2276 (select (select (store .cse2277 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2275)) (.cse2271 (select (select .cse2276 (select (select (store .cse2277 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2275))) (or (= .cse2270 .cse2271) (= .cse2272 .cse2270) (not (= (select (select .cse2273 .cse2274) .cse2275) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2276 (select (select (store .cse2277 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2275) .cse2272) (not (= .cse2270 4)) (= .cse2272 .cse2271))))))) (not (<= 0 .cse2278)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2296 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2293 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2294 (select (select .cse2293 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2295 (+ (select (select .cse2296 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2290 (store (store .cse2296 .cse2294 (store (select .cse2296 .cse2294) .cse2295 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2292 (select (select .cse2290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2291 (store .cse2293 .cse2294 (store (select .cse2293 .cse2294) .cse2295 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2289 (+ .cse2292 4))) (let ((.cse2284 (select (select .cse2290 (select (select (store .cse2291 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2289))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2283 (select (select .cse2290 (select (select (store .cse2291 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2289))) (or (= .cse2283 0) (= .cse2283 .cse2284) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse2287 (store .cse2291 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2288 (select (select .cse2287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2286 (select (select .cse2290 .cse2288) .cse2289)) (.cse2285 (select (select .cse2290 (select (select (store .cse2291 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2289))) (or (= .cse2285 .cse2286) (not (= (select (select .cse2287 .cse2288) .cse2289) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2286 0) (= .cse2283 .cse2285) (= .cse2285 0))))))))) (= .cse2284 0))))) (not (<= 0 .cse2292)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2307 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2304 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2305 (select (select .cse2304 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2306 (+ (select (select .cse2307 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2298 (store (store .cse2307 .cse2305 (store (select .cse2307 .cse2305) .cse2306 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2303 (select (select .cse2298 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2299 (store .cse2304 .cse2305 (store (select .cse2304 .cse2305) .cse2306 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2300 (+ .cse2303 4))) (let ((.cse2302 (select (select .cse2298 (select (select (store .cse2299 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2300)) (.cse2297 (select (select .cse2298 (select (select (store .cse2299 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2300)) (.cse2301 (select (select .cse2298 (select (select (store .cse2299 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2300))) (or (= .cse2297 0) (= .cse2297 (select (select .cse2298 (select (select (store .cse2299 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2300)) (= .cse2301 .cse2302) (= .cse2297 .cse2302) (= .cse2302 0) (= .cse2297 .cse2301))))) (not (<= 0 .cse2303)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2319 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2316 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2317 (select (select .cse2316 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2318 (+ (select (select .cse2319 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2309 (store (store .cse2319 .cse2317 (store (select .cse2319 .cse2317) .cse2318 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2315 (select (select .cse2309 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2310 (store .cse2316 .cse2317 (store (select .cse2316 .cse2317) .cse2318 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2313 (store .cse2310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2314 (select (select .cse2313 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2311 (+ .cse2315 4))) (let ((.cse2308 (select (select .cse2309 .cse2314) .cse2311)) (.cse2312 (select (select .cse2309 (select (select (store .cse2310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2311))) (or (= .cse2308 (select (select .cse2309 (select (select (store .cse2310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2311)) (= .cse2312 .cse2308) (not (= (select (select .cse2313 .cse2314) .cse2311) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2309 (select (select (store .cse2310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2311) .cse2308) (not (= .cse2308 4)) (= .cse2312 0))))))) (not (<= 0 .cse2315)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2329 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2326 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2327 (select (select .cse2326 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2328 (+ (select (select .cse2329 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2320 (store (store .cse2329 .cse2327 (store (select .cse2329 .cse2327) .cse2328 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2325 (select (select .cse2320 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2321 (store .cse2326 .cse2327 (store (select .cse2326 .cse2327) .cse2328 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2322 (+ .cse2325 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse2320 (select (select (store .cse2321 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2322) 0)) (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse2320 (select (select (store .cse2321 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2322) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2323 (select (select .cse2320 (select (select (store .cse2321 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2322)) (.cse2324 (select (select .cse2320 (select (select (store .cse2321 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2322))) (or (= .cse2323 0) (= .cse2324 .cse2323) (= .cse2324 0)))) (not (<= 0 .cse2325))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2339 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2336 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2337 (select (select .cse2336 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2338 (+ (select (select .cse2339 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2332 (store (store .cse2339 .cse2337 (store (select .cse2339 .cse2337) .cse2338 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2330 (select (select .cse2332 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2330)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse2333 (store .cse2336 .cse2337 (store (select .cse2336 .cse2337) .cse2338 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2334 (+ .cse2330 4))) (let ((.cse2331 (select (select .cse2332 (select (select (store .cse2333 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2334))) (or (= .cse2331 (select (select .cse2332 (select (select (store .cse2333 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2334)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2335 (select (select .cse2332 (select (select (store .cse2333 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2334))) (or (= .cse2335 0) (forall ((v_prenex_39 (Array Int Int))) (= .cse2335 (select (select .cse2332 (select (select (store .cse2333 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2334))) (= .cse2335 .cse2331)))) (= .cse2331 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2352 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2349 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2350 (select (select .cse2349 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2351 (+ (select (select .cse2352 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2341 (store (store .cse2352 .cse2350 (store (select .cse2352 .cse2350) .cse2351 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2348 (select (select .cse2341 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2342 (store .cse2349 .cse2350 (store (select .cse2349 .cse2350) .cse2351 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2346 (store .cse2342 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2347 (select (select .cse2346 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2343 (+ .cse2348 4))) (let ((.cse2340 (select (select .cse2341 (select (select (store .cse2342 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2343)) (.cse2344 (select (select .cse2341 .cse2347) .cse2343)) (.cse2345 (select (select .cse2341 (select (select (store .cse2342 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2343))) (or (= .cse2340 0) (= (select (select .cse2341 (select (select (store .cse2342 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2343) .cse2344) (= .cse2344 0) (= .cse2340 .cse2345) (= .cse2345 .cse2344) (= .cse2345 0) (= (select (select .cse2346 .cse2347) .cse2343) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))) (not (<= 0 .cse2348)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2364 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2361 (select (select .cse2362 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2363 (+ (select (select .cse2364 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2353 (store (store .cse2364 .cse2361 (store (select .cse2364 .cse2361) .cse2363 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2356 (select (select .cse2353 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2355 (+ .cse2356 4)) (.cse2354 (store .cse2362 .cse2361 (store (select .cse2362 .cse2361) .cse2363 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse2353 (select (select (store .cse2354 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2355) 0)) (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse2353 (select (select (store .cse2354 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2355) 0)) (not (<= 0 .cse2356)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2359 (store .cse2354 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2360 (select (select .cse2359 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2357 (select (select .cse2353 (select (select (store .cse2354 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2355)) (.cse2358 (select (select .cse2353 .cse2360) .cse2355))) (or (= .cse2357 0) (= .cse2358 .cse2357) (not (= (select (select .cse2359 .cse2360) .cse2355) .cse2361)) (= .cse2358 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2375 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2372 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2373 (select (select .cse2372 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2374 (+ (select (select .cse2375 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2366 (store (store .cse2375 .cse2373 (store (select .cse2375 .cse2373) .cse2374 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2365 (select (select .cse2366 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2368 (+ .cse2365 4)) (.cse2367 (store .cse2372 .cse2373 (store (select .cse2372 .cse2373) .cse2374 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (not (<= 0 .cse2365)) (= (select (select .cse2366 (select (select (store .cse2367 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2368) 0) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2370 (store .cse2367 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2371 (select (select .cse2370 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2369 (select (select .cse2366 .cse2371) .cse2368))) (or (= .cse2369 (select (select .cse2366 (select (select (store .cse2367 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2368)) (not (= (select (select .cse2370 .cse2371) .cse2368) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse2369 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2386 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2376 (select (select .cse2386 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2376 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2388 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2387 (+ (select (select .cse2388 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2381 (store (store .cse2388 .cse2376 (store (select .cse2388 .cse2376) .cse2387 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2384 (select (select .cse2381 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2382 (store .cse2386 .cse2376 (store (select .cse2386 .cse2376) .cse2387 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2383 (+ .cse2384 4))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2377 (select (select .cse2381 (select (select (store .cse2382 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2383)) (.cse2378 (select (select .cse2381 (select (select (store .cse2382 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2383))) (or (= .cse2377 .cse2378) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2379 (select (select .cse2381 (select (select (store .cse2382 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2383))) (or (= .cse2377 .cse2379) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2380 (select (select .cse2381 (select (select (store .cse2382 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2383))) (or (= .cse2380 .cse2379) (= .cse2380 .cse2378)))))))))) (not (<= 0 .cse2384)) (not (= (select (let ((.cse2385 (store .cse2382 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2385 (select (select .cse2385 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2383) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2402 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2400 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2396 (select (select .cse2400 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2401 (+ (select (select .cse2402 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2397 (store (store .cse2402 .cse2396 (store (select .cse2402 .cse2396) .cse2401 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2399 (select (select .cse2397 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2398 (store .cse2400 .cse2396 (store (select .cse2400 .cse2396) .cse2401 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2393 (store .cse2398 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2394 (select (select .cse2393 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2395 (+ .cse2399 4))) (let ((.cse2390 (select (select .cse2397 (select (select (store .cse2398 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2395)) (.cse2389 (select (select .cse2397 (select (select (store .cse2398 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2395)) (.cse2391 (select (select .cse2397 (select (select (store .cse2398 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2395)) (.cse2392 (select (select .cse2397 .cse2394) .cse2395))) (or (= .cse2389 0) (= .cse2390 .cse2391) (= .cse2390 0) (= .cse2391 0) (= .cse2389 .cse2392) (= .cse2392 .cse2391) (not (= (select (select .cse2393 .cse2394) .cse2395) .cse2396)) (= .cse2392 0))))))) (not (<= 0 .cse2399)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2412 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2410 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2406 (select (select .cse2410 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2411 (+ (select (select .cse2412 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2403 (store (store .cse2412 .cse2406 (store (select .cse2412 .cse2406) .cse2411 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2409 (select (select .cse2403 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2404 (store .cse2410 .cse2406 (store (select .cse2410 .cse2406) .cse2411 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2405 (+ .cse2409 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse2403 (select (select (store .cse2404 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2405) 0)) (not (= .cse2406 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse2407 (store .cse2404 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2407 (select (select .cse2407 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2405) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2408 (select (select .cse2403 (select (select (store .cse2404 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2405))) (or (= (select (select .cse2403 (select (select (store .cse2404 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2405) .cse2408) (= .cse2408 0)))) (not (<= 0 .cse2409))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2424 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2421 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2422 (select (select .cse2421 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2423 (+ (select (select .cse2424 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2417 (store (store .cse2424 .cse2422 (store (select .cse2424 .cse2422) .cse2423 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2420 (select (select .cse2417 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2418 (store .cse2421 .cse2422 (store (select .cse2421 .cse2422) .cse2423 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2416 (+ .cse2420 4))) (let ((.cse2413 (select (select .cse2417 (select (select (store .cse2418 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2416)) (.cse2419 (select (select .cse2417 (select (select (store .cse2418 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2416))) (or (= .cse2413 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2414 (store .cse2418 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2415 (select (select .cse2414 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse2414 .cse2415) .cse2416) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2417 .cse2415) .cse2416) 0))))) (= (select (select .cse2417 (select (select (store .cse2418 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2416) 0) (= .cse2413 .cse2419) (not (<= 0 .cse2420)) (= .cse2419 0))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2432 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2425 (select (select .cse2432 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2425 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2434 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2433 (+ (select (select .cse2434 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2430 (store (store .cse2434 .cse2425 (store (select .cse2434 .cse2425) .cse2433 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2426 (select (select .cse2430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2428 (store .cse2432 .cse2425 (store (select .cse2432 .cse2425) .cse2433 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2429 (+ .cse2426 4))) (or (not (<= 0 .cse2426)) (not (= (select (let ((.cse2427 (store .cse2428 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2427 (select (select .cse2427 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2429) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse2431 (select (select .cse2430 (select (select (store .cse2428 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2429))) (or (= (select (select .cse2430 (select (select (store .cse2428 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2429) .cse2431) (= .cse2431 0))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2448 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2445 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2446 (select (select .cse2445 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2447 (+ (select (select .cse2448 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2442 (store (store .cse2448 .cse2446 (store (select .cse2448 .cse2446) .cse2447 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2444 (select (select .cse2442 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2443 (store .cse2445 .cse2446 (store (select .cse2445 .cse2446) .cse2447 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2439 (store .cse2443 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2440 (select (select .cse2439 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2441 (+ .cse2444 4))) (let ((.cse2435 (select (select .cse2442 (select (select (store .cse2443 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2441)) (.cse2438 (select (select .cse2442 .cse2440) .cse2441)) (.cse2436 (select (select .cse2442 (select (select (store .cse2443 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2441)) (.cse2437 (select (select .cse2442 (select (select (store .cse2443 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2441))) (or (= .cse2435 .cse2436) (= .cse2437 .cse2438) (not (= (select (select .cse2439 .cse2440) .cse2441) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2435 .cse2438) (= .cse2438 0) (= .cse2436 0) (= .cse2437 .cse2436) (= .cse2437 0))))))) (not (<= 0 .cse2444)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2461 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2459 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2454 (select (select .cse2459 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2460 (+ (select (select .cse2461 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2456 (store (store .cse2461 .cse2454 (store (select .cse2461 .cse2454) .cse2460 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2458 (select (select .cse2456 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2457 (store .cse2459 .cse2454 (store (select .cse2459 .cse2454) .cse2460 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2451 (store .cse2457 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2452 (select (select .cse2451 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2453 (+ .cse2458 4))) (let ((.cse2450 (select (select .cse2456 (select (select (store .cse2457 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2453)) (.cse2449 (select (select .cse2456 .cse2452) .cse2453))) (or (not (= .cse2449 4)) (= .cse2450 .cse2449) (not (= (select (select .cse2451 .cse2452) .cse2453) .cse2454)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2455 (select (select .cse2456 (select (select (store .cse2457 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2453))) (or (= .cse2450 .cse2455) (= .cse2449 .cse2455)))))))))) (not (<= 0 .cse2458)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2472 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2470 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2468 (select (select .cse2470 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2471 (+ (select (select .cse2472 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2463 (store (store .cse2472 .cse2468 (store (select .cse2472 .cse2468) .cse2471 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2469 (select (select .cse2463 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2464 (store .cse2470 .cse2468 (store (select .cse2470 .cse2468) .cse2471 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2466 (store .cse2464 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2467 (select (select .cse2466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2465 (+ .cse2469 4))) (let ((.cse2462 (select (select .cse2463 .cse2467) .cse2465))) (or (not (= .cse2462 4)) (= (select (select .cse2463 (select (select (store .cse2464 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2465) .cse2462) (= .cse2462 (select (select .cse2463 (select (select (store .cse2464 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2465)) (not (= (select (select .cse2466 .cse2467) .cse2465) .cse2468)))))))) (not (<= 0 .cse2469)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2484 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2482 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2480 (select (select .cse2482 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2483 (+ (select (select .cse2484 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2475 (store (store .cse2484 .cse2480 (store (select .cse2484 .cse2480) .cse2483 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2473 (select (select .cse2475 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2473)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2476 (store .cse2482 .cse2480 (store (select .cse2482 .cse2480) .cse2483 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2478 (store .cse2476 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2479 (select (select .cse2478 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2477 (+ .cse2473 4))) (let ((.cse2474 (select (select .cse2475 .cse2479) .cse2477))) (or (not (= .cse2474 4)) (= .cse2474 (select (select .cse2475 (select (select (store .cse2476 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2477)) (not (= (select (select .cse2478 .cse2479) .cse2477) .cse2480)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2481 (select (select .cse2475 (select (select (store .cse2476 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2477))) (or (= (select (select .cse2475 (select (select (store .cse2476 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2477) .cse2481) (= .cse2474 .cse2481)))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2497 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2494 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2495 (select (select .cse2494 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2496 (+ (select (select .cse2497 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2488 (store (store .cse2497 .cse2495 (store (select .cse2497 .cse2495) .cse2496 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2493 (select (select .cse2488 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2489 (store .cse2494 .cse2495 (store (select .cse2494 .cse2495) .cse2496 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2491 (store .cse2489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2492 (select (select .cse2491 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2490 (+ .cse2493 4))) (let ((.cse2485 (select (select .cse2488 (select (select (store .cse2489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2490)) (.cse2487 (select (select .cse2488 (select (select (store .cse2489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2490)) (.cse2486 (select (select .cse2488 .cse2492) .cse2490))) (or (= .cse2485 .cse2486) (= .cse2487 (select (select .cse2488 (select (select (store .cse2489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2490)) (= .cse2486 0) (= .cse2485 .cse2487) (= .cse2487 .cse2486) (= (select (select .cse2491 .cse2492) .cse2490) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))) (not (<= 0 .cse2493)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2509 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2506 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2507 (select (select .cse2506 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2508 (+ (select (select .cse2509 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2503 (store (store .cse2509 .cse2507 (store (select .cse2509 .cse2507) .cse2508 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2505 (select (select .cse2503 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2504 (store .cse2506 .cse2507 (store (select .cse2506 .cse2507) .cse2508 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2502 (+ .cse2505 4))) (let ((.cse2498 (select (select .cse2503 (select (select (store .cse2504 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2502))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2500 (store .cse2504 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2501 (select (select .cse2500 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2499 (select (select .cse2503 .cse2501) .cse2502))) (or (= .cse2498 .cse2499) (not (= (select (select .cse2500 .cse2501) .cse2502) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2503 (select (select (store .cse2504 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2502) .cse2499) (not (= .cse2499 4))))))) (= .cse2498 0))))) (not (<= 0 .cse2505)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2521 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2518 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2519 (select (select .cse2518 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2520 (+ (select (select .cse2521 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2510 (store (store .cse2521 .cse2519 (store (select .cse2521 .cse2519) .cse2520 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2516 (select (select .cse2510 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2511 (store .cse2518 .cse2519 (store (select .cse2518 .cse2519) .cse2520 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2512 (+ .cse2516 4))) (let ((.cse2515 (select (select .cse2510 (select (select (store .cse2511 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2512)) (.cse2517 (select (select .cse2510 (select (select (store .cse2511 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2512))) (or (= (select (select .cse2510 (select (select (store .cse2511 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2512) 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2513 (store .cse2511 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2514 (select (select .cse2513 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse2513 .cse2514) .cse2512) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2510 .cse2514) .cse2512) 0))))) (= .cse2515 0) (not (<= 0 .cse2516)) (= .cse2517 .cse2515) (= .cse2517 0))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2535 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2532 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2533 (select (select .cse2532 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2534 (+ (select (select .cse2535 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2528 (store (store .cse2535 .cse2533 (store (select .cse2535 .cse2533) .cse2534 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2531 (select (select .cse2528 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2529 (store .cse2532 .cse2533 (store (select .cse2532 .cse2533) .cse2534 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2526 (+ .cse2531 4))) (let ((.cse2530 (select (select .cse2528 (select (select (store .cse2529 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2526))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2522 (select (select .cse2528 (select (select (store .cse2529 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2526))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2524 (store .cse2529 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2525 (select (select .cse2524 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2523 (select (select .cse2528 .cse2525) .cse2526))) (or (= .cse2522 .cse2523) (not (= (select (select .cse2524 .cse2525) .cse2526) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2523 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2527 (select (select .cse2528 (select (select (store .cse2529 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2526))) (or (= .cse2527 0) (= .cse2527 .cse2523))))))))) (= .cse2522 .cse2530) (= .cse2522 0)))) (= .cse2530 0))))) (not (<= 0 .cse2531)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2547 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2544 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2545 (select (select .cse2544 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2546 (+ (select (select .cse2547 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2537 (store (store .cse2547 .cse2545 (store (select .cse2547 .cse2545) .cse2546 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2543 (select (select .cse2537 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2538 (store .cse2544 .cse2545 (store (select .cse2544 .cse2545) .cse2546 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2539 (+ .cse2543 4))) (let ((.cse2536 (select (select .cse2537 (select (select (store .cse2538 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2539)) (.cse2540 (select (select .cse2537 (select (select (store .cse2538 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2539))) (or (= .cse2536 0) (= (select (select .cse2537 (select (select (store .cse2538 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2539) 0) (= .cse2536 .cse2540) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2541 (store .cse2538 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2542 (select (select .cse2541 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse2541 .cse2542) .cse2539) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= (select (select .cse2537 .cse2542) .cse2539) 4)))))) (not (<= 0 .cse2543)) (= .cse2540 0))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2559 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2557 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2556 (select (select .cse2557 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2558 (+ (select (select .cse2559 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2551 (store (store .cse2559 .cse2556 (store (select .cse2559 .cse2556) .cse2558 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2548 (select (select .cse2551 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2548)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2552 (store .cse2557 .cse2556 (store (select .cse2557 .cse2556) .cse2558 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2554 (store .cse2552 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2555 (select (select .cse2554 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2553 (+ .cse2548 4))) (let ((.cse2549 (select (select .cse2551 .cse2555) .cse2553)) (.cse2550 (select (select .cse2551 (select (select (store .cse2552 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2553))) (or (not (= .cse2549 4)) (= .cse2549 .cse2550) (= (select (select .cse2551 (select (select (store .cse2552 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2553) .cse2550) (= .cse2550 0) (not (= (select (select .cse2554 .cse2555) .cse2553) .cse2556)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2572 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2569 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2570 (select (select .cse2569 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2571 (+ (select (select .cse2572 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2562 (store (store .cse2572 .cse2570 (store (select .cse2572 .cse2570) .cse2571 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2568 (select (select .cse2562 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2563 (store .cse2569 .cse2570 (store (select .cse2569 .cse2570) .cse2571 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2566 (store .cse2563 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2567 (select (select .cse2566 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2564 (+ .cse2568 4))) (let ((.cse2560 (select (select .cse2562 (select (select (store .cse2563 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2564)) (.cse2561 (select (select .cse2562 .cse2567) .cse2564)) (.cse2565 (select (select .cse2562 (select (select (store .cse2563 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2564))) (or (= .cse2560 .cse2561) (= (select (select .cse2562 (select (select (store .cse2563 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2564) .cse2561) (= .cse2560 0) (= .cse2561 0) (= .cse2565 .cse2561) (= .cse2565 0) (= (select (select .cse2566 .cse2567) .cse2564) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))) (not (<= 0 .cse2568)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2581 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2573 (select (select .cse2581 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2573 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2583 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2582 (+ (select (select .cse2583 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2576 (store (store .cse2583 .cse2573 (store (select .cse2583 .cse2573) .cse2582 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2579 (select (select .cse2576 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2577 (store .cse2581 .cse2573 (store (select .cse2581 .cse2573) .cse2582 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2578 (+ .cse2579 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2575 (select (select .cse2576 (select (select (store .cse2577 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2578)) (.cse2574 (select (select .cse2576 (select (select (store .cse2577 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2578))) (or (= .cse2574 .cse2575) (= (select (select .cse2576 (select (select (store .cse2577 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2578) .cse2575) (= .cse2575 0) (= .cse2574 (select (select .cse2576 (select (select (store .cse2577 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2578))))) (not (<= 0 .cse2579)) (not (= (select (let ((.cse2580 (store .cse2577 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2580 (select (select .cse2580 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2578) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2590 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2591 (select (select .cse2590 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2593 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2592 (+ (select (select .cse2593 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2588 (store (store .cse2593 .cse2591 (store (select .cse2593 .cse2591) .cse2592 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2584 (select (select .cse2588 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2586 (store .cse2590 .cse2591 (store (select .cse2590 .cse2591) .cse2592 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2587 (+ .cse2584 4))) (or (not (<= 0 .cse2584)) (not (= (select (let ((.cse2585 (store .cse2586 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2585 (select (select .cse2585 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2587) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2589 (select (select .cse2588 (select (select (store .cse2586 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2587))) (or (= (select (select .cse2588 (select (select (store .cse2586 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2587) .cse2589) (= (select (select .cse2588 (select (select (store .cse2586 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2587) .cse2589) (= .cse2589 0))))))))))) (not (= .cse2591 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2606 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2604 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2603 (select (select .cse2604 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2605 (+ (select (select .cse2606 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2596 (store (store .cse2606 .cse2603 (store (select .cse2606 .cse2603) .cse2605 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2594 (select (select .cse2596 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2594)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2597 (store .cse2604 .cse2603 (store (select .cse2604 .cse2603) .cse2605 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2601 (store .cse2597 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2602 (select (select .cse2601 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2598 (+ .cse2594 4))) (let ((.cse2595 (select (select .cse2596 (select (select (store .cse2597 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2598)) (.cse2600 (select (select .cse2596 (select (select (store .cse2597 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2598)) (.cse2599 (select (select .cse2596 .cse2602) .cse2598))) (or (= .cse2595 (select (select .cse2596 (select (select (store .cse2597 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2598)) (not (= .cse2599 4)) (= .cse2599 .cse2595) (= .cse2600 .cse2595) (= .cse2595 0) (= .cse2600 .cse2599) (not (= (select (select .cse2601 .cse2602) .cse2598) .cse2603)))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2617 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2615 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2613 (select (select .cse2615 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2616 (+ (select (select .cse2617 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2608 (store (store .cse2617 .cse2613 (store (select .cse2617 .cse2613) .cse2616 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2614 (select (select .cse2608 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse2609 (store .cse2615 .cse2613 (store (select .cse2615 .cse2613) .cse2616 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2611 (store .cse2609 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2612 (select (select .cse2611 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2610 (+ .cse2614 4))) (let ((.cse2607 (select (select .cse2608 .cse2612) .cse2610))) (or (not (= .cse2607 4)) (= .cse2607 (select (select .cse2608 (select (select (store .cse2609 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2610)) (forall ((v_prenex_39 (Array Int Int))) (= .cse2607 (select (select .cse2608 (select (select (store .cse2609 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2610))) (not (= (select (select .cse2611 .cse2612) .cse2610) .cse2613)))))))) (not (<= 0 .cse2614)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2630 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2627 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2628 (select (select .cse2627 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2629 (+ (select (select .cse2630 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2618 (store (store .cse2630 .cse2628 (store (select .cse2630 .cse2628) .cse2629 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2621 (select (select .cse2618 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2620 (+ .cse2621 4)) (.cse2619 (store .cse2627 .cse2628 (store (select .cse2627 .cse2628) .cse2629 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse2618 (select (select (store .cse2619 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2620) 0)) (not (<= 0 .cse2621)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2624 (store .cse2619 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2625 (select (select .cse2624 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2623 (select (select .cse2618 .cse2625) .cse2620)) (.cse2626 (select (select .cse2618 (select (select (store .cse2619 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2620)) (.cse2622 (select (select .cse2618 (select (select (store .cse2619 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2620))) (or (= .cse2622 .cse2623) (not (= (select (select .cse2624 .cse2625) .cse2620) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2623 0) (= .cse2626 0) (= .cse2622 .cse2626) (= .cse2622 0))))))))))))))) (or .cse160 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int) (v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2641 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2638 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2639 (select (select .cse2638 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2640 (+ (select (select .cse2641 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2633 (store (store .cse2641 .cse2639 (store (select .cse2641 .cse2639) .cse2640 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2637 (select (select .cse2633 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2634 (store .cse2638 .cse2639 (store (select .cse2638 .cse2639) .cse2640 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2635 (+ .cse2637 4))) (let ((.cse2632 (select (select .cse2633 (select (select (store .cse2634 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2635)) (.cse2631 (select (select .cse2633 (select (select (store .cse2634 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2635)) (.cse2636 (select (select .cse2633 (select (select (store .cse2634 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2635))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (= .cse2631 .cse2632) (= .cse2632 0) (= (select (select .cse2633 (select (select (store .cse2634 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2635) 0) (= .cse2631 .cse2636) (not (<= 0 .cse2637)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (= .cse2636 0)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2655 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2652 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2653 (select (select .cse2652 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2654 (+ (select (select .cse2655 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2649 (store (store .cse2655 .cse2653 (store (select .cse2655 .cse2653) .cse2654 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2651 (select (select .cse2649 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2650 (store .cse2652 .cse2653 (store (select .cse2652 .cse2653) .cse2654 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2647 (+ .cse2651 4))) (let ((.cse2644 (select (select .cse2649 (select (select (store .cse2650 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2647))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2642 (select (select .cse2649 (select (select (store .cse2650 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2647))) (or (= .cse2642 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2643 (select (select .cse2649 (select (select (store .cse2650 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2647))) (or (= .cse2643 .cse2642) (= .cse2643 .cse2644) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2645 (store .cse2650 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2646 (select (select .cse2645 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2648 (select (select .cse2649 .cse2646) .cse2647))) (or (not (= (select (select .cse2645 .cse2646) .cse2647) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2643 .cse2648) (= .cse2648 0)))))))))))) (= .cse2644 0))))) (not (<= 0 .cse2651)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2667 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2664 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2665 (select (select .cse2664 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2666 (+ (select (select .cse2667 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2656 (store (store .cse2667 .cse2665 (store (select .cse2667 .cse2665) .cse2666 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2663 (select (select .cse2656 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2658 (+ .cse2663 4)) (.cse2657 (store .cse2664 .cse2665 (store (select .cse2664 .cse2665) .cse2666 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse2656 (select (select (store .cse2657 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2658) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2661 (store .cse2657 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2662 (select (select .cse2661 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2660 (select (select .cse2656 .cse2662) .cse2658)) (.cse2659 (select (select .cse2656 (select (select (store .cse2657 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2658))) (or (= .cse2659 (select (select .cse2656 (select (select (store .cse2657 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2658)) (= .cse2660 0) (= .cse2659 .cse2660) (= .cse2659 0) (= (select (select .cse2661 .cse2662) .cse2658) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (<= 0 .cse2663))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2675 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2672 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2673 (select (select .cse2672 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2674 (+ (select (select .cse2675 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2668 (store (store .cse2675 .cse2673 (store (select .cse2675 .cse2673) .cse2674 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2671 (select (select .cse2668 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2669 (store .cse2672 .cse2673 (store (select .cse2672 .cse2673) .cse2674 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2670 (+ .cse2671 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse2668 (select (select (store .cse2669 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2670) 0)) (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse2668 (select (select (store .cse2669 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2670) 0)) (forall ((v_prenex_39 (Array Int Int))) (= (select (select .cse2668 (select (select (store .cse2669 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2670) 0)) (not (<= 0 .cse2671)) (forall ((v_prenex_32 (Array Int Int))) (= (select (select .cse2668 (select (select (store .cse2669 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2670) 0))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2689 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2686 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2687 (select (select .cse2686 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2688 (+ (select (select .cse2689 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2683 (store (store .cse2689 .cse2687 (store (select .cse2689 .cse2687) .cse2688 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2685 (select (select .cse2683 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2684 (store .cse2686 .cse2687 (store (select .cse2686 .cse2687) .cse2688 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2682 (+ .cse2685 4))) (let ((.cse2677 (select (select .cse2683 (select (select (store .cse2684 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2682)) (.cse2676 (select (select .cse2683 (select (select (store .cse2684 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2682))) (or (= .cse2676 .cse2677) (= .cse2677 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2678 (select (select .cse2683 (select (select (store .cse2684 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2682))) (or (= .cse2678 .cse2677) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2680 (store .cse2684 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2681 (select (select .cse2680 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2679 (select (select .cse2683 .cse2681) .cse2682))) (or (= .cse2676 .cse2679) (= .cse2679 0) (= .cse2678 .cse2679) (= (select (select .cse2680 .cse2681) .cse2682) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (<= 0 .cse2685)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2701 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2698 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2699 (select (select .cse2698 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2700 (+ (select (select .cse2701 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2694 (store (store .cse2701 .cse2699 (store (select .cse2701 .cse2699) .cse2700 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2690 (select (select .cse2694 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2690)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2695 (store .cse2698 .cse2699 (store (select .cse2698 .cse2699) .cse2700 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2691 (store .cse2695 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2692 (select (select .cse2691 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2693 (+ .cse2690 4))) (let ((.cse2696 (select (select .cse2694 .cse2692) .cse2693))) (or (not (= (select (select .cse2691 .cse2692) .cse2693) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2694 (select (select (store .cse2695 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2693) .cse2696) (not (= .cse2696 4)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2697 (select (select .cse2694 (select (select (store .cse2695 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2693))) (or (= .cse2697 .cse2696) (forall ((v_prenex_39 (Array Int Int))) (= .cse2697 (select (select .cse2694 (select (select (store .cse2695 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2693)))))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2712 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2702 (select (select .cse2712 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2702 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2714 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2713 (+ (select (select .cse2714 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2711 (store (store .cse2714 .cse2702 (store (select .cse2714 .cse2702) .cse2713 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2703 (select (select .cse2711 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2705 (store .cse2712 .cse2702 (store (select .cse2712 .cse2702) .cse2713 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2706 (+ .cse2703 4))) (or (not (<= 0 .cse2703)) (not (= (select (let ((.cse2704 (store .cse2705 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2704 (select (select .cse2704 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2706) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2707 (select (select .cse2711 (select (select (store .cse2705 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2706)) (.cse2708 (select (select .cse2711 (select (select (store .cse2705 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2706))) (or (= .cse2707 .cse2708) (= .cse2708 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2710 (select (select .cse2711 (select (select (store .cse2705 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2706))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2709 (select (select .cse2711 (select (select (store .cse2705 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2706))) (or (= .cse2708 .cse2709) (= .cse2707 .cse2709) (= .cse2710 .cse2709)))) (= .cse2710 .cse2708)))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2722 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2715 (select (select .cse2722 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2715 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2724 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2723 (+ (select (select .cse2724 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2717 (store (store .cse2724 .cse2715 (store (select .cse2724 .cse2715) .cse2723 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2720 (select (select .cse2717 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2718 (store .cse2722 .cse2715 (store (select .cse2722 .cse2715) .cse2723 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2719 (+ .cse2720 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2716 (select (select .cse2717 (select (select (store .cse2718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2719))) (or (= .cse2716 (select (select .cse2717 (select (select (store .cse2718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2719)) (= .cse2716 0)))) (not (<= 0 .cse2720)) (not (= (select (let ((.cse2721 (store .cse2718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2721 (select (select .cse2721 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2719) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2717 (select (select (store .cse2718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2719) 0)))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2738 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2735 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2736 (select (select .cse2735 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2737 (+ (select (select .cse2738 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2728 (store (store .cse2738 .cse2736 (store (select .cse2738 .cse2736) .cse2737 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2734 (select (select .cse2728 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2729 (store .cse2735 .cse2736 (store (select .cse2735 .cse2736) .cse2737 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2732 (store .cse2729 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2733 (select (select .cse2732 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2730 (+ .cse2734 4))) (let ((.cse2731 (select (select .cse2728 .cse2733) .cse2730))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2725 (select (select .cse2728 (select (select (store .cse2729 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2730))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2726 (select (select .cse2728 (select (select (store .cse2729 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2730)) (.cse2727 (select (select .cse2728 (select (select (store .cse2729 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2730))) (or (= .cse2725 .cse2726) (= .cse2725 .cse2727) (= .cse2727 .cse2726) (= .cse2727 0)))) (= .cse2725 .cse2731)))) (not (= (select (select .cse2732 .cse2733) .cse2730) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse2731 4)))))))) (not (<= 0 .cse2734)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2752 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2749 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2750 (select (select .cse2749 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2751 (+ (select (select .cse2752 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2747 (store (store .cse2752 .cse2750 (store (select .cse2752 .cse2750) .cse2751 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2739 (select (select .cse2747 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2739)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2748 (store .cse2749 .cse2750 (store (select .cse2749 .cse2750) .cse2751 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2740 (store .cse2748 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2741 (select (select .cse2740 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2742 (+ .cse2739 4))) (let ((.cse2743 (select (select .cse2747 .cse2741) .cse2742))) (or (not (= (select (select .cse2740 .cse2741) .cse2742) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2743 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2744 (select (select .cse2747 (select (select (store .cse2748 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2742))) (or (= .cse2744 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2745 (select (select .cse2747 (select (select (store .cse2748 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2742))) (or (= .cse2744 .cse2745) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2746 (select (select .cse2747 (select (select (store .cse2748 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2742))) (or (= .cse2744 .cse2746) (= .cse2746 0) (= .cse2745 .cse2746)))) (= .cse2745 0)))) (= .cse2744 .cse2743)))))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2765 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2762 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2763 (select (select .cse2762 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2764 (+ (select (select .cse2765 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2760 (store (store .cse2765 .cse2763 (store (select .cse2765 .cse2763) .cse2764 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2753 (select (select .cse2760 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2753)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2761 (store .cse2762 .cse2763 (store (select .cse2762 .cse2763) .cse2764 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2757 (store .cse2761 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2758 (select (select .cse2757 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2759 (+ .cse2753 4))) (let ((.cse2754 (select (select .cse2760 .cse2758) .cse2759)) (.cse2755 (select (select .cse2760 (select (select (store .cse2761 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2759)) (.cse2756 (select (select .cse2760 (select (select (store .cse2761 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2759))) (or (= .cse2754 .cse2755) (= .cse2756 .cse2754) (not (= (select (select .cse2757 .cse2758) .cse2759) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse2754 4)) (= .cse2756 .cse2755) (= .cse2756 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2775 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2772 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2773 (select (select .cse2772 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2774 (+ (select (select .cse2775 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2766 (store (store .cse2775 .cse2773 (store (select .cse2775 .cse2773) .cse2774 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2771 (select (select .cse2766 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2767 (store .cse2772 .cse2773 (store (select .cse2772 .cse2773) .cse2774 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2768 (+ .cse2771 4))) (or (forall ((v_prenex_39 (Array Int Int))) (= (select (select .cse2766 (select (select (store .cse2767 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2768) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2769 (select (select .cse2766 (select (select (store .cse2767 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2768)) (.cse2770 (select (select .cse2766 (select (select (store .cse2767 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2768))) (or (= .cse2769 0) (= .cse2770 (select (select .cse2766 (select (select (store .cse2767 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2768)) (= .cse2769 .cse2770) (= .cse2770 0)))) (not (<= 0 .cse2771))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2788 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2785 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2786 (select (select .cse2785 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2787 (+ (select (select .cse2788 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2778 (store (store .cse2788 .cse2786 (store (select .cse2788 .cse2786) .cse2787 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2784 (select (select .cse2778 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2779 (store .cse2785 .cse2786 (store (select .cse2785 .cse2786) .cse2787 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2782 (store .cse2779 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2783 (select (select .cse2782 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2780 (+ .cse2784 4))) (let ((.cse2776 (select (select .cse2778 (select (select (store .cse2779 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2780)) (.cse2777 (select (select .cse2778 (select (select (store .cse2779 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2780)) (.cse2781 (select (select .cse2778 .cse2783) .cse2780))) (or (= .cse2776 0) (= .cse2777 (select (select .cse2778 (select (select (store .cse2779 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2780)) (= .cse2781 0) (= .cse2776 .cse2777) (= .cse2777 .cse2781) (= (select (select .cse2782 .cse2783) .cse2780) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))) (not (<= 0 .cse2784)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2800 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2797 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2798 (select (select .cse2797 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2799 (+ (select (select .cse2800 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2789 (store (store .cse2800 .cse2798 (store (select .cse2800 .cse2798) .cse2799 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2796 (select (select .cse2789 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse2790 (store .cse2797 .cse2798 (store (select .cse2797 .cse2798) .cse2799 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2793 (store .cse2790 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2794 (select (select .cse2793 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2791 (+ .cse2796 4))) (let ((.cse2792 (select (select .cse2789 .cse2794) .cse2791))) (or (= (select (select .cse2789 (select (select (store .cse2790 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2791) .cse2792) (not (= (select (select .cse2793 .cse2794) .cse2791) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2795 (select (select .cse2789 (select (select (store .cse2790 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2791))) (or (= .cse2792 .cse2795) (= .cse2795 0)))) (not (= .cse2792 4)))))))) (not (<= 0 .cse2796)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2812 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2809 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2810 (select (select .cse2809 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2811 (+ (select (select .cse2812 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2801 (store (store .cse2812 .cse2810 (store (select .cse2812 .cse2810) .cse2811 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2808 (select (select .cse2801 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2803 (+ .cse2808 4)) (.cse2802 (store .cse2809 .cse2810 (store (select .cse2809 .cse2810) .cse2811 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse2801 (select (select (store .cse2802 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2803) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2804 (select (select .cse2801 (select (select (store .cse2802 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2803)) (.cse2805 (select (select .cse2801 (select (select (store .cse2802 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2803))) (or (= .cse2804 0) (= .cse2804 .cse2805) (= .cse2805 0)))) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2807 (store .cse2802 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2806 (select (select .cse2807 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse2801 .cse2806) .cse2803) 0) (= (select (select .cse2807 .cse2806) .cse2803) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))) (not (<= 0 .cse2808))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2824 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2822 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2819 (select (select .cse2822 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2823 (+ (select (select .cse2824 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2816 (store (store .cse2824 .cse2819 (store (select .cse2824 .cse2819) .cse2823 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2821 (select (select .cse2816 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2817 (store .cse2822 .cse2819 (store (select .cse2822 .cse2819) .cse2823 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2818 (+ .cse2821 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2814 (select (select .cse2816 (select (select (store .cse2817 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2818)) (.cse2813 (select (select .cse2816 (select (select (store .cse2817 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2818)) (.cse2815 (select (select .cse2816 (select (select (store .cse2817 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2818))) (or (= .cse2813 .cse2814) (= .cse2815 .cse2814) (= .cse2815 .cse2813) (= .cse2815 (select (select .cse2816 (select (select (store .cse2817 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2818))))) (not (= .cse2819 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse2820 (store .cse2817 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2820 (select (select .cse2820 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2818) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse2821))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2835 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2833 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2831 (select (select .cse2833 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2834 (+ (select (select .cse2835 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2826 (store (store .cse2835 .cse2831 (store (select .cse2835 .cse2831) .cse2834 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2832 (select (select .cse2826 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2827 (store .cse2833 .cse2831 (store (select .cse2833 .cse2831) .cse2834 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2829 (store .cse2827 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2830 (select (select .cse2829 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2828 (+ .cse2832 4))) (let ((.cse2825 (select (select .cse2826 .cse2830) .cse2828))) (or (not (= .cse2825 4)) (= .cse2825 (select (select .cse2826 (select (select (store .cse2827 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2828)) (= (select (select .cse2826 (select (select (store .cse2827 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2828) .cse2825) (not (= (select (select .cse2829 .cse2830) .cse2828) .cse2831)))))))) (not (<= 0 .cse2832)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2847 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2844 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2845 (select (select .cse2844 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2846 (+ (select (select .cse2847 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2841 (store (store .cse2847 .cse2845 (store (select .cse2847 .cse2845) .cse2846 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2843 (select (select .cse2841 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2842 (store .cse2844 .cse2845 (store (select .cse2844 .cse2845) .cse2846 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2838 (store .cse2842 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2839 (select (select .cse2838 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2840 (+ .cse2843 4))) (let ((.cse2837 (select (select .cse2841 .cse2839) .cse2840)) (.cse2836 (select (select .cse2841 (select (select (store .cse2842 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2840))) (or (= .cse2836 .cse2837) (not (= (select (select .cse2838 .cse2839) .cse2840) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse2837 4)) (= .cse2836 (select (select .cse2841 (select (select (store .cse2842 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2840)) (= .cse2836 0))))))) (not (<= 0 .cse2843)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2861 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2858 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2859 (select (select .cse2858 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2860 (+ (select (select .cse2861 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2855 (store (store .cse2861 .cse2859 (store (select .cse2861 .cse2859) .cse2860 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2848 (select (select .cse2855 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2848)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2856 (store .cse2858 .cse2859 (store (select .cse2858 .cse2859) .cse2860 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2849 (store .cse2856 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2850 (select (select .cse2849 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2851 (+ .cse2848 4))) (let ((.cse2857 (select (select .cse2855 .cse2850) .cse2851))) (or (not (= (select (select .cse2849 .cse2850) .cse2851) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse2852 (select (select .cse2855 (select (select (store .cse2856 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2851))) (or (= .cse2852 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2853 (select (select .cse2855 (select (select (store .cse2856 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2851)) (.cse2854 (select (select .cse2855 (select (select (store .cse2856 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2851))) (or (= .cse2853 0) (= .cse2852 .cse2854) (= .cse2854 .cse2853) (= .cse2854 0)))) (= .cse2852 .cse2857)))) (= .cse2857 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2870 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2862 (select (select .cse2870 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2862 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2872 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2871 (+ (select (select .cse2872 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2863 (store (store .cse2872 .cse2862 (store (select .cse2872 .cse2862) .cse2871 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2868 (select (select .cse2863 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2864 (store .cse2870 .cse2862 (store (select .cse2870 .cse2862) .cse2871 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2865 (+ .cse2868 4))) (or (= (select (select .cse2863 (select (select (store .cse2864 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2865) 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse2866 (select (select .cse2863 (select (select (store .cse2864 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2865))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2867 (select (select .cse2863 (select (select (store .cse2864 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2865))) (or (= .cse2866 .cse2867) (= .cse2867 0)))) (= .cse2866 0)))) (not (<= 0 .cse2868)) (not (= (select (let ((.cse2869 (store .cse2864 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2869 (select (select .cse2869 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2865) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2863 (select (select (store .cse2864 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2865) 0)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2886 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2883 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2884 (select (select .cse2883 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2885 (+ (select (select .cse2886 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2881 (store (store .cse2886 .cse2884 (store (select .cse2886 .cse2884) .cse2885 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2873 (select (select .cse2881 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2873)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2882 (store .cse2883 .cse2884 (store (select .cse2883 .cse2884) .cse2885 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2876 (store .cse2882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2877 (select (select .cse2876 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2878 (+ .cse2873 4))) (let ((.cse2879 (select (select .cse2881 (select (select (store .cse2882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2878)) (.cse2874 (select (select .cse2881 .cse2877) .cse2878)) (.cse2880 (select (select .cse2881 (select (select (store .cse2882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2878)) (.cse2875 (select (select .cse2881 (select (select (store .cse2882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2878))) (or (= .cse2874 .cse2875) (not (= (select (select .cse2876 .cse2877) .cse2878) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse2879 .cse2874) (= .cse2879 .cse2880) (not (= .cse2874 4)) (= .cse2880 .cse2875))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2900 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2898 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2894 (select (select .cse2898 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2899 (+ (select (select .cse2900 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2895 (store (store .cse2900 .cse2894 (store (select .cse2900 .cse2894) .cse2899 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2897 (select (select .cse2895 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2896 (store .cse2898 .cse2894 (store (select .cse2898 .cse2894) .cse2899 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2891 (store .cse2896 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse2892 (select (select .cse2891 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2893 (+ .cse2897 4))) (let ((.cse2887 (select (select .cse2895 (select (select (store .cse2896 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2893)) (.cse2889 (select (select .cse2895 (select (select (store .cse2896 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2893)) (.cse2888 (select (select .cse2895 (select (select (store .cse2896 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2893)) (.cse2890 (select (select .cse2895 .cse2892) .cse2893))) (or (= .cse2887 .cse2888) (= .cse2889 .cse2887) (= .cse2887 0) (= .cse2888 0) (= .cse2889 .cse2890) (= .cse2890 .cse2888) (not (= (select (select .cse2891 .cse2892) .cse2893) .cse2894)) (= .cse2890 0))))))) (not (<= 0 .cse2897)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2910 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2901 (select (select .cse2910 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse2901 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2912 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2911 (+ (select (select .cse2912 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2905 (store (store .cse2912 .cse2901 (store (select .cse2912 .cse2901) .cse2911 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2908 (select (select .cse2905 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2906 (store .cse2910 .cse2901 (store (select .cse2910 .cse2901) .cse2911 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2907 (+ .cse2908 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2902 (select (select .cse2905 (select (select (store .cse2906 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2907)) (.cse2904 (select (select .cse2905 (select (select (store .cse2906 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2907)) (.cse2903 (select (select .cse2905 (select (select (store .cse2906 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2907))) (or (= .cse2902 .cse2903) (= .cse2904 .cse2902) (= .cse2902 0) (= .cse2904 .cse2903)))) (not (<= 0 .cse2908)) (not (= (select (let ((.cse2909 (store .cse2906 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2909 (select (select .cse2909 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2907) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2923 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2920 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2921 (select (select .cse2920 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2922 (+ (select (select .cse2923 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2914 (store (store .cse2923 .cse2921 (store (select .cse2923 .cse2921) .cse2922 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2913 (select (select .cse2914 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2916 (+ .cse2913 4)) (.cse2915 (store .cse2920 .cse2921 (store (select .cse2920 .cse2921) .cse2922 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (not (<= 0 .cse2913)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (= (select (select .cse2914 (select (select (store .cse2915 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2916) (select (select .cse2914 (select (select (store .cse2915 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2916))) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2918 (store .cse2915 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2919 (select (select .cse2918 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2917 (select (select .cse2914 .cse2919) .cse2916))) (or (= .cse2917 (select (select .cse2914 (select (select (store .cse2915 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2916)) (not (= (select (select .cse2918 .cse2919) .cse2916) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse2917 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (or .cse160 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int) (v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2934 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2931 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2932 (select (select .cse2931 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2933 (+ (select (select .cse2934 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2927 (store (store .cse2934 .cse2932 (store (select .cse2934 .cse2932) .cse2933 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2928 (store .cse2931 .cse2932 (store (select .cse2931 .cse2932) .cse2933 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2930 (select (select .cse2927 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2926 (+ .cse2930 4)) (.cse2924 (store .cse2928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2925 (select (select .cse2924 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2929 (select (select .cse2927 (select (select (store .cse2928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2926))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (= (select (select .cse2924 .cse2925) .cse2926) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2927 .cse2925) .cse2926) 0) (= (select (select .cse2927 (select (select (store .cse2928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2926) 0) (= (select (select .cse2927 (select (select (store .cse2928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2926) .cse2929) (not (<= 0 .cse2930)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (= .cse2929 0)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2946 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2944 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2941 (select (select .cse2944 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2945 (+ (select (select .cse2946 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2938 (store (store .cse2946 .cse2941 (store (select .cse2946 .cse2941) .cse2945 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2943 (select (select .cse2938 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2939 (store .cse2944 .cse2941 (store (select .cse2944 .cse2941) .cse2945 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2940 (+ .cse2943 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2936 (select (select .cse2938 (select (select (store .cse2939 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2940)) (.cse2937 (select (select .cse2938 (select (select (store .cse2939 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2940)) (.cse2935 (select (select .cse2938 (select (select (store .cse2939 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2940))) (or (= .cse2935 .cse2936) (= .cse2937 .cse2936) (= .cse2936 0) (= .cse2937 .cse2935)))) (not (= .cse2941 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse2942 (store .cse2939 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2942 (select (select .cse2942 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2940) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse2943))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2959 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2956 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2957 (select (select .cse2956 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2958 (+ (select (select .cse2959 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2952 (store (store .cse2959 .cse2957 (store (select .cse2959 .cse2957) .cse2958 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2955 (select (select .cse2952 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2953 (store .cse2956 .cse2957 (store (select .cse2956 .cse2957) .cse2958 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2949 (store .cse2953 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse2950 (select (select .cse2949 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2951 (+ .cse2955 4))) (let ((.cse2947 (select (select .cse2952 .cse2950) .cse2951)) (.cse2948 (select (select .cse2952 (select (select (store .cse2953 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2951)) (.cse2954 (select (select .cse2952 (select (select (store .cse2953 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2951))) (or (= .cse2947 .cse2948) (not (= (select (select .cse2949 .cse2950) .cse2951) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse2952 (select (select (store .cse2953 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2951) .cse2954) (not (= .cse2947 4)) (= .cse2954 .cse2948) (= .cse2954 0))))))) (not (<= 0 .cse2955)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2972 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2969 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2970 (select (select .cse2969 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2971 (+ (select (select .cse2972 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2963 (store (store .cse2972 .cse2970 (store (select .cse2972 .cse2970) .cse2971 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2968 (select (select .cse2963 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2964 (store .cse2969 .cse2970 (store (select .cse2969 .cse2970) .cse2971 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2965 (+ .cse2968 4))) (let ((.cse2960 (select (select .cse2963 (select (select (store .cse2964 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2965))) (or (= .cse2960 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse2961 (select (select .cse2963 (select (select (store .cse2964 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2965))) (or (= .cse2961 .cse2960) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse2966 (store .cse2964 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse2967 (select (select .cse2966 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2962 (select (select .cse2963 .cse2967) .cse2965))) (or (= .cse2960 .cse2962) (= (select (select .cse2963 (select (select (store .cse2964 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2965) .cse2962) (= .cse2962 0) (= .cse2961 .cse2962) (= (select (select .cse2966 .cse2967) .cse2965) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (<= 0 .cse2968)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse2982 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2983 (select (select .cse2982 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse2985 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse2984 (+ (select (select .cse2985 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2977 (store (store .cse2985 .cse2983 (store (select .cse2985 .cse2983) .cse2984 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2980 (select (select .cse2977 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2978 (store .cse2982 .cse2983 (store (select .cse2982 .cse2983) .cse2984 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2979 (+ .cse2980 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse2974 (select (select .cse2977 (select (select (store .cse2978 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2979)) (.cse2973 (select (select .cse2977 (select (select (store .cse2978 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2979)) (.cse2975 (select (select .cse2977 (select (select (store .cse2978 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2979)) (.cse2976 (select (select .cse2977 (select (select (store .cse2978 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2979))) (or (= .cse2973 .cse2974) (= .cse2975 .cse2974) (= .cse2976 .cse2973) (= .cse2975 .cse2973) (= .cse2975 .cse2976)))) (not (<= 0 .cse2980)) (not (= (select (let ((.cse2981 (store .cse2978 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2981 (select (select .cse2981 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2979) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse2983 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse2995 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse2993 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse2990 (select (select .cse2993 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2994 (+ (select (select .cse2995 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse2987 (store (store .cse2995 .cse2990 (store (select .cse2995 .cse2990) .cse2994 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2992 (select (select .cse2987 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2988 (store .cse2993 .cse2990 (store (select .cse2993 .cse2990) .cse2994 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse2989 (+ .cse2992 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2986 (select (select .cse2987 (select (select (store .cse2988 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2989))) (or (= .cse2986 (select (select .cse2987 (select (select (store .cse2988 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2989)) (= .cse2986 (select (select .cse2987 (select (select (store .cse2988 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2989))))) (not (= .cse2990 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse2991 (store .cse2988 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse2991 (select (select .cse2991 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse2989) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse2992))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3009 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3006 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3007 (select (select .cse3006 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3008 (+ (select (select .cse3009 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3004 (store (store .cse3009 .cse3007 (store (select .cse3009 .cse3007) .cse3008 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse2996 (select (select .cse3004 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2996)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3005 (store .cse3006 .cse3007 (store (select .cse3006 .cse3007) .cse3008 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse2999 (store .cse3005 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3000 (select (select .cse2999 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3001 (+ .cse2996 4))) (let ((.cse2997 (select (select .cse3004 .cse3000) .cse3001)) (.cse3002 (select (select .cse3004 (select (select (store .cse3005 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3001)) (.cse2998 (select (select .cse3004 (select (select (store .cse3005 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3001)) (.cse3003 (select (select .cse3004 (select (select (store .cse3005 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3001))) (or (= .cse2997 .cse2998) (not (= (select (select .cse2999 .cse3000) .cse3001) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3002 .cse2997) (= .cse2997 0) (= .cse3002 .cse3003) (= .cse3003 .cse2998) (= .cse3003 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3022 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3019 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3020 (select (select .cse3019 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3021 (+ (select (select .cse3022 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3016 (store (store .cse3022 .cse3020 (store (select .cse3022 .cse3020) .cse3021 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3018 (select (select .cse3016 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3017 (store .cse3019 .cse3020 (store (select .cse3019 .cse3020) .cse3021 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3012 (store .cse3017 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3013 (select (select .cse3012 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3014 (+ .cse3018 4))) (let ((.cse3010 (select (select .cse3016 .cse3013) .cse3014)) (.cse3011 (select (select .cse3016 (select (select (store .cse3017 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3014)) (.cse3015 (select (select .cse3016 (select (select (store .cse3017 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3014))) (or (= .cse3010 .cse3011) (not (= (select (select .cse3012 .cse3013) .cse3014) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3010 4)) (= .cse3015 .cse3011) (= .cse3015 0))))))) (not (<= 0 .cse3018)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3031 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3028 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3029 (select (select .cse3028 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3030 (+ (select (select .cse3031 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3023 (store (store .cse3031 .cse3029 (store (select .cse3031 .cse3029) .cse3030 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3026 (select (select .cse3023 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3024 (store .cse3028 .cse3029 (store (select .cse3028 .cse3029) .cse3030 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3025 (+ .cse3026 4))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse3023 (select (select (store .cse3024 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3025) 0)) (forall ((v_prenex_39 (Array Int Int))) (= (select (select .cse3023 (select (select (store .cse3024 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3025) 0)) (not (<= 0 .cse3026)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse3027 (select (select .cse3023 (select (select (store .cse3024 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3025))) (or (= .cse3027 (select (select .cse3023 (select (select (store .cse3024 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3025)) (= .cse3027 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3044 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3041 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3042 (select (select .cse3041 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3043 (+ (select (select .cse3044 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3037 (store (store .cse3044 .cse3042 (store (select .cse3044 .cse3042) .cse3043 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3040 (select (select .cse3037 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3038 (store .cse3041 .cse3042 (store (select .cse3041 .cse3042) .cse3043 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3032 (store .cse3038 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3033 (select (select .cse3032 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3034 (+ .cse3040 4))) (let ((.cse3035 (select (select .cse3037 .cse3033) .cse3034))) (or (not (= (select (select .cse3032 .cse3033) .cse3034) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3035 4)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3036 (select (select .cse3037 (select (select (store .cse3038 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3034))) (or (= .cse3036 .cse3035) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3039 (select (select .cse3037 (select (select (store .cse3038 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3034))) (or (= (select (select .cse3037 (select (select (store .cse3038 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3034) .cse3039) (= .cse3036 .cse3039))))))))))))) (not (<= 0 .cse3040)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3054 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3052 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3045 (select (select .cse3052 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3053 (+ (select (select .cse3054 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3050 (store (store .cse3054 .cse3045 (store (select .cse3054 .cse3045) .cse3053 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3049 (select (select .cse3050 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3047 (store .cse3052 .cse3045 (store (select .cse3052 .cse3045) .cse3053 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3048 (+ .cse3049 4))) (or (not (= .cse3045 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3046 (store .cse3047 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3046 (select (select .cse3046 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3048) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse3049)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3051 (select (select .cse3050 (select (select (store .cse3047 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3048))) (or (= (select (select .cse3050 (select (select (store .cse3047 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3048) .cse3051) (= (select (select .cse3050 (select (select (store .cse3047 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3048) .cse3051))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3065 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3063 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3055 (select (select .cse3063 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3064 (+ (select (select .cse3065 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3061 (store (store .cse3065 .cse3055 (store (select .cse3065 .cse3055) .cse3064 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3062 (select (select .cse3061 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3057 (store .cse3063 .cse3055 (store (select .cse3063 .cse3055) .cse3064 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3058 (+ .cse3062 4))) (or (not (= .cse3055 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3056 (store .cse3057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3056 (select (select .cse3056 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3058) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3059 (select (select .cse3061 (select (select (store .cse3057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3058)) (.cse3060 (select (select .cse3061 (select (select (store .cse3057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3058))) (or (= .cse3059 .cse3060) (= .cse3059 0) (= (select (select .cse3061 (select (select (store .cse3057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3058) .cse3060)))) (not (<= 0 .cse3062))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3077 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3074 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3075 (select (select .cse3074 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3076 (+ (select (select .cse3077 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3070 (store (store .cse3077 .cse3075 (store (select .cse3077 .cse3075) .cse3076 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3073 (select (select .cse3070 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3071 (store .cse3074 .cse3075 (store (select .cse3074 .cse3075) .cse3076 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3072 (+ .cse3073 4))) (let ((.cse3068 (select (select .cse3070 (select (select (store .cse3071 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3072)) (.cse3067 (select (select .cse3070 (select (select (store .cse3071 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3072)) (.cse3066 (select (select .cse3070 (select (select (store .cse3071 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3072)) (.cse3069 (select (select .cse3070 (select (select (store .cse3071 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3072))) (or (= .cse3066 0) (= .cse3067 .cse3068) (= .cse3066 .cse3068) (= .cse3069 .cse3067) (= .cse3067 0) (= .cse3066 .cse3069))))) (not (<= 0 .cse3073)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3089 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3086 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3087 (select (select .cse3086 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3088 (+ (select (select .cse3089 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3078 (store (store .cse3089 .cse3087 (store (select .cse3089 .cse3087) .cse3088 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3085 (select (select .cse3078 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3079 (store .cse3086 .cse3087 (store (select .cse3086 .cse3087) .cse3088 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3080 (+ .cse3085 4))) (let ((.cse3081 (select (select .cse3078 (select (select (store .cse3079 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3080))) (or (= (select (select .cse3078 (select (select (store .cse3079 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3080) .cse3081) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3083 (store .cse3079 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3084 (select (select .cse3083 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3082 (select (select .cse3078 .cse3084) .cse3080))) (or (= .cse3082 .cse3081) (not (= (select (select .cse3083 .cse3084) .cse3080) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3082 4))))))))))) (not (<= 0 .cse3085)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3100 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3098 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3096 (select (select .cse3098 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3099 (+ (select (select .cse3100 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3091 (store (store .cse3100 .cse3096 (store (select .cse3100 .cse3096) .cse3099 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3097 (select (select .cse3091 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3092 (store .cse3098 .cse3096 (store (select .cse3098 .cse3096) .cse3099 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3094 (store .cse3092 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse3095 (select (select .cse3094 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3093 (+ .cse3097 4))) (let ((.cse3090 (select (select .cse3091 .cse3095) .cse3093))) (or (not (= .cse3090 4)) (= (select (select .cse3091 (select (select (store .cse3092 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3093) .cse3090) (not (= (select (select .cse3094 .cse3095) .cse3093) .cse3096)))))))) (not (<= 0 .cse3097)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3111 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3108 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3109 (select (select .cse3108 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3110 (+ (select (select .cse3111 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3102 (store (store .cse3111 .cse3109 (store (select .cse3111 .cse3109) .cse3110 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3107 (select (select .cse3102 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3103 (store .cse3108 .cse3109 (store (select .cse3108 .cse3109) .cse3110 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3104 (+ .cse3107 4))) (let ((.cse3101 (select (select .cse3102 (select (select (store .cse3103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3104))) (or (= .cse3101 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3106 (select (select .cse3102 (select (select (store .cse3103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3104))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3105 (select (select .cse3102 (select (select (store .cse3103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3104))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse3102 (select (select (store .cse3103 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3104) .cse3105)) (= .cse3106 .cse3105)))) (= .cse3101 .cse3106) (= .cse3106 0)))))))) (not (<= 0 .cse3107)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3124 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3122 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3120 (select (select .cse3122 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3123 (+ (select (select .cse3124 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3115 (store (store .cse3124 .cse3120 (store (select .cse3124 .cse3120) .cse3123 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3121 (select (select .cse3115 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3116 (store .cse3122 .cse3120 (store (select .cse3122 .cse3120) .cse3123 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3118 (store .cse3116 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse3119 (select (select .cse3118 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3117 (+ .cse3121 4))) (let ((.cse3112 (select (select .cse3115 .cse3119) .cse3117))) (or (not (= .cse3112 4)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3113 (select (select .cse3115 (select (select (store .cse3116 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3117))) (or (= .cse3112 .cse3113) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3114 (select (select .cse3115 (select (select (store .cse3116 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3117))) (or (= .cse3113 .cse3114) (= .cse3114 0)))) (= (select (select .cse3115 (select (select (store .cse3116 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3117) .cse3113) (= .cse3113 0)))) (not (= (select (select .cse3118 .cse3119) .cse3117) .cse3120)))))))) (not (<= 0 .cse3121)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3134 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3132 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3125 (select (select .cse3132 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3133 (+ (select (select .cse3134 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3131 (store (store .cse3134 .cse3125 (store (select .cse3134 .cse3125) .cse3133 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3129 (select (select .cse3131 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3127 (store .cse3132 .cse3125 (store (select .cse3132 .cse3125) .cse3133 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3128 (+ .cse3129 4))) (or (not (= .cse3125 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3126 (store .cse3127 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3126 (select (select .cse3126 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3128) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse3129)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3130 (select (select .cse3131 (select (select (store .cse3127 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3128))) (or (= .cse3130 (select (select .cse3131 (select (select (store .cse3127 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3128)) (= (select (select .cse3131 (select (select (store .cse3127 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3128) .cse3130))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3147 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3144 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3145 (select (select .cse3144 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3146 (+ (select (select .cse3147 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3141 (store (store .cse3147 .cse3145 (store (select .cse3147 .cse3145) .cse3146 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3143 (select (select .cse3141 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3142 (store .cse3144 .cse3145 (store (select .cse3144 .cse3145) .cse3146 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3135 (store .cse3142 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3136 (select (select .cse3135 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3137 (+ .cse3143 4))) (let ((.cse3138 (select (select .cse3141 .cse3136) .cse3137))) (or (not (= (select (select .cse3135 .cse3136) .cse3137) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3138 4)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3139 (select (select .cse3141 (select (select (store .cse3142 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3137))) (or (= .cse3139 .cse3138) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3140 (select (select .cse3141 (select (select (store .cse3142 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3137))) (or (= .cse3139 .cse3140) (= .cse3140 (select (select .cse3141 (select (select (store .cse3142 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3137)))))))))))))) (not (<= 0 .cse3143)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3160 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3157 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3158 (select (select .cse3157 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3159 (+ (select (select .cse3160 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3150 (store (store .cse3160 .cse3158 (store (select .cse3160 .cse3158) .cse3159 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3156 (select (select .cse3150 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3151 (store .cse3157 .cse3158 (store (select .cse3157 .cse3158) .cse3159 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3154 (store .cse3151 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3155 (select (select .cse3154 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3152 (+ .cse3156 4))) (let ((.cse3149 (select (select .cse3150 .cse3155) .cse3152)) (.cse3148 (select (select .cse3150 (select (select (store .cse3151 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3152)) (.cse3153 (select (select .cse3150 (select (select (store .cse3151 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3152))) (or (= .cse3148 0) (= .cse3149 (select (select .cse3150 (select (select (store .cse3151 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3152)) (= .cse3153 .cse3149) (not (= (select (select .cse3154 .cse3155) .cse3152) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3149 0) (= .cse3148 .cse3153) (= .cse3153 0))))))) (not (<= 0 .cse3156)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3167 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3161 (select (select .cse3167 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3161 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3169 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3168 (+ (select (select .cse3169 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3166 (store (store .cse3169 .cse3161 (store (select .cse3169 .cse3161) .cse3168 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3162 (select (select .cse3166 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3164 (store .cse3167 .cse3161 (store (select .cse3167 .cse3161) .cse3168 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3165 (+ .cse3162 4))) (or (not (<= 0 .cse3162)) (not (= (select (let ((.cse3163 (store .cse3164 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3163 (select (select .cse3163 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3165) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (= (select (select .cse3166 (select (select (store .cse3164 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3165) (select (select .cse3166 (select (select (store .cse3164 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3165)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3183 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3180 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3181 (select (select .cse3180 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3182 (+ (select (select .cse3183 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3178 (store (store .cse3183 .cse3181 (store (select .cse3183 .cse3181) .cse3182 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3170 (select (select .cse3178 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3170)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3179 (store .cse3180 .cse3181 (store (select .cse3180 .cse3181) .cse3182 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3177 (+ .cse3170 4))) (let ((.cse3171 (select (select .cse3178 (select (select (store .cse3179 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3177))) (or (= .cse3171 0) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3172 (select (select .cse3178 (select (select (store .cse3179 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3177))) (or (= .cse3172 .cse3171) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse3175 (store .cse3179 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3176 (select (select .cse3175 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3174 (select (select .cse3178 .cse3176) .cse3177)) (.cse3173 (select (select .cse3178 (select (select (store .cse3179 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3177))) (or (= .cse3173 .cse3174) (not (= (select (select .cse3175 .cse3176) .cse3177) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3172 .cse3174) (= .cse3174 0) (= .cse3172 .cse3173) (= .cse3173 0))))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3192 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3190 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3184 (select (select .cse3190 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3191 (+ (select (select .cse3192 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3189 (store (store .cse3192 .cse3184 (store (select .cse3192 .cse3184) .cse3191 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3188 (select (select .cse3189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3186 (store .cse3190 .cse3184 (store (select .cse3190 .cse3184) .cse3191 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3187 (+ .cse3188 4))) (or (not (= .cse3184 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3185 (store .cse3186 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3185 (select (select .cse3185 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3187) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse3188)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (= (select (select .cse3189 (select (select (store .cse3186 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3187) (select (select .cse3189 (select (select (store .cse3186 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3187))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (= (select (select .cse3189 (select (select (store .cse3186 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3187) (select (select .cse3189 (select (select (store .cse3186 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3187)))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3205 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3202 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3203 (select (select .cse3202 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3204 (+ (select (select .cse3205 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3199 (store (store .cse3205 .cse3203 (store (select .cse3205 .cse3203) .cse3204 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3201 (select (select .cse3199 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3200 (store .cse3202 .cse3203 (store (select .cse3202 .cse3203) .cse3204 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3196 (store .cse3200 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3197 (select (select .cse3196 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3198 (+ .cse3201 4))) (let ((.cse3193 (select (select .cse3199 .cse3197) .cse3198)) (.cse3194 (select (select .cse3199 (select (select (store .cse3200 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3198)) (.cse3195 (select (select .cse3199 (select (select (store .cse3200 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3198))) (or (= .cse3193 .cse3194) (= .cse3195 .cse3193) (not (= (select (select .cse3196 .cse3197) .cse3198) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse3199 (select (select (store .cse3200 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3198) .cse3193) (not (= .cse3193 4)) (= .cse3195 .cse3194) (= .cse3195 0))))))) (not (<= 0 .cse3201)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3218 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3215 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3216 (select (select .cse3215 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3217 (+ (select (select .cse3218 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3212 (store (store .cse3218 .cse3216 (store (select .cse3218 .cse3216) .cse3217 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3214 (select (select .cse3212 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3213 (store .cse3215 .cse3216 (store (select .cse3215 .cse3216) .cse3217 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3211 (+ .cse3214 4))) (let ((.cse3208 (select (select .cse3212 (select (select (store .cse3213 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3211))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3209 (store .cse3213 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3210 (select (select .cse3209 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3207 (select (select .cse3212 (select (select (store .cse3213 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3211)) (.cse3206 (select (select .cse3212 .cse3210) .cse3211))) (or (= .cse3206 .cse3207) (= .cse3208 .cse3207) (not (= (select (select .cse3209 .cse3210) .cse3211) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3206 4))))))) (forall ((v_prenex_32 (Array Int Int))) (= .cse3208 (select (select .cse3212 (select (select (store .cse3213 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3211))))))) (not (<= 0 .cse3214)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3229 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3226 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3227 (select (select .cse3226 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3228 (+ (select (select .cse3229 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3221 (store (store .cse3229 .cse3227 (store (select .cse3229 .cse3227) .cse3228 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3219 (select (select .cse3221 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3219)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3222 (store .cse3226 .cse3227 (store (select .cse3226 .cse3227) .cse3228 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3224 (store .cse3222 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3225 (select (select .cse3224 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3223 (+ .cse3219 4))) (let ((.cse3220 (select (select .cse3221 .cse3225) .cse3223))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse3220 (select (select .cse3221 (select (select (store .cse3222 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3223))) (not (= (select (select .cse3224 .cse3225) .cse3223) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3220 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3243 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3240 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3241 (select (select .cse3240 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3242 (+ (select (select .cse3243 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3238 (store (store .cse3243 .cse3241 (store (select .cse3243 .cse3241) .cse3242 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3230 (select (select .cse3238 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3230)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3239 (store .cse3240 .cse3241 (store (select .cse3240 .cse3241) .cse3242 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3235 (store .cse3239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse3236 (select (select .cse3235 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3237 (+ .cse3230 4))) (let ((.cse3232 (select (select .cse3238 (select (select (store .cse3239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3237)) (.cse3231 (select (select .cse3238 (select (select (store .cse3239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3237)) (.cse3234 (select (select .cse3238 (select (select (store .cse3239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3237)) (.cse3233 (select (select .cse3238 .cse3236) .cse3237))) (or (= .cse3231 0) (= .cse3232 .cse3233) (= .cse3231 .cse3232) (= .cse3233 0) (= .cse3231 .cse3234) (= .cse3234 .cse3233) (= (select (select .cse3235 .cse3236) .cse3237) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3254 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3251 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3252 (select (select .cse3251 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3253 (+ (select (select .cse3254 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3244 (store (store .cse3254 .cse3252 (store (select .cse3254 .cse3252) .cse3253 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3247 (select (select .cse3244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3245 (store .cse3251 .cse3252 (store (select .cse3251 .cse3252) .cse3253 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3246 (+ .cse3247 4))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse3244 (select (select (store .cse3245 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3246) 0)) (not (<= 0 .cse3247)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3248 (select (select .cse3244 (select (select (store .cse3245 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3246)) (.cse3249 (select (select .cse3244 (select (select (store .cse3245 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3246)) (.cse3250 (select (select .cse3244 (select (select (store .cse3245 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3246))) (or (= .cse3248 .cse3249) (= .cse3248 0) (= .cse3250 .cse3249) (= .cse3250 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3265 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3263 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3255 (select (select .cse3263 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3264 (+ (select (select .cse3265 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3261 (store (store .cse3265 .cse3255 (store (select .cse3265 .cse3255) .cse3264 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3259 (select (select .cse3261 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3257 (store .cse3263 .cse3255 (store (select .cse3263 .cse3255) .cse3264 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3258 (+ .cse3259 4))) (or (not (= .cse3255 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3256 (store .cse3257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3256 (select (select .cse3256 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3258) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse3259)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3260 (select (select .cse3261 (select (select (store .cse3257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3258)) (.cse3262 (select (select .cse3261 (select (select (store .cse3257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3258))) (or (= .cse3260 (select (select .cse3261 (select (select (store .cse3257 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3258)) (= .cse3260 .cse3262) (= .cse3262 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3276 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3274 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3266 (select (select .cse3274 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3275 (+ (select (select .cse3276 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3270 (store (store .cse3276 .cse3266 (store (select .cse3276 .cse3266) .cse3275 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3273 (select (select .cse3270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3268 (store .cse3274 .cse3266 (store (select .cse3274 .cse3266) .cse3275 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3269 (+ .cse3273 4))) (or (not (= .cse3266 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3267 (store .cse3268 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3267 (select (select .cse3267 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3269) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3271 (select (select .cse3270 (select (select (store .cse3268 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3269)) (.cse3272 (select (select .cse3270 (select (select (store .cse3268 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3269))) (or (= (select (select .cse3270 (select (select (store .cse3268 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3269) .cse3271) (= .cse3272 .cse3271) (= .cse3272 0)))) (not (<= 0 .cse3273))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3286 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3277 (select (select .cse3286 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3277 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3288 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3287 (+ (select (select .cse3288 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3281 (store (store .cse3288 .cse3277 (store (select .cse3288 .cse3277) .cse3287 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3284 (select (select .cse3281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3282 (store .cse3286 .cse3277 (store (select .cse3286 .cse3277) .cse3287 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3283 (+ .cse3284 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3278 (select (select .cse3281 (select (select (store .cse3282 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3283)) (.cse3279 (select (select .cse3281 (select (select (store .cse3282 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3283))) (or (= .cse3278 .cse3279) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3280 (select (select .cse3281 (select (select (store .cse3282 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3283))) (or (= .cse3280 .cse3278) (= .cse3280 .cse3279))))))) (not (<= 0 .cse3284)) (not (= (select (let ((.cse3285 (store .cse3282 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3285 (select (select .cse3285 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3283) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3299 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3296 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3297 (select (select .cse3296 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3298 (+ (select (select .cse3299 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3292 (store (store .cse3299 .cse3297 (store (select .cse3299 .cse3297) .cse3298 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3295 (select (select .cse3292 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3293 (store .cse3296 .cse3297 (store (select .cse3296 .cse3297) .cse3298 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3294 (+ .cse3295 4))) (let ((.cse3291 (select (select .cse3292 (select (select (store .cse3293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3294)) (.cse3290 (select (select .cse3292 (select (select (store .cse3293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3294)) (.cse3289 (select (select .cse3292 (select (select (store .cse3293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3294))) (or (= .cse3289 0) (= .cse3290 .cse3291) (= .cse3289 .cse3291) (= .cse3289 .cse3290) (= .cse3289 (select (select .cse3292 (select (select (store .cse3293 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3294)))))) (not (<= 0 .cse3295)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3311 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3308 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3309 (select (select .cse3308 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3310 (+ (select (select .cse3311 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3305 (store (store .cse3311 .cse3309 (store (select .cse3311 .cse3309) .cse3310 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3307 (select (select .cse3305 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3306 (store .cse3308 .cse3309 (store (select .cse3308 .cse3309) .cse3310 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3304 (+ .cse3307 4))) (let ((.cse3300 (select (select .cse3305 (select (select (store .cse3306 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3304))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3302 (store .cse3306 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3303 (select (select .cse3302 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3301 (select (select .cse3305 .cse3303) .cse3304))) (or (= .cse3300 .cse3301) (not (= (select (select .cse3302 .cse3303) .cse3304) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3301 4))))))) (= .cse3300 0))))) (not (<= 0 .cse3307)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3319 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3312 (select (select .cse3319 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3312 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3321 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3320 (+ (select (select .cse3321 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3314 (store (store .cse3321 .cse3312 (store (select .cse3321 .cse3312) .cse3320 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3317 (select (select .cse3314 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3315 (store .cse3319 .cse3312 (store (select .cse3319 .cse3312) .cse3320 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3316 (+ .cse3317 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3313 (select (select .cse3314 (select (select (store .cse3315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3316))) (or (= .cse3313 (select (select .cse3314 (select (select (store .cse3315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3316)) (= (select (select .cse3314 (select (select (store .cse3315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3316) .cse3313) (= (select (select .cse3314 (select (select (store .cse3315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3316) .cse3313) (= .cse3313 0)))) (not (<= 0 .cse3317)) (not (= (select (let ((.cse3318 (store .cse3315 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3318 (select (select .cse3318 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3316) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3334 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3331 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3332 (select (select .cse3331 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3333 (+ (select (select .cse3334 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3323 (store (store .cse3334 .cse3332 (store (select .cse3334 .cse3332) .cse3333 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3330 (select (select .cse3323 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3324 (store .cse3331 .cse3332 (store (select .cse3331 .cse3332) .cse3333 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3325 (+ .cse3330 4))) (let ((.cse3322 (select (select .cse3323 (select (select (store .cse3324 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3325))) (or (= .cse3322 0) (= .cse3322 (select (select .cse3323 (select (select (store .cse3324 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3325)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3326 (select (select .cse3323 (select (select (store .cse3324 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3325))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3328 (store .cse3324 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3329 (select (select .cse3328 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3327 (select (select .cse3323 .cse3329) .cse3325))) (or (= .cse3326 .cse3327) (not (= (select (select .cse3328 .cse3329) .cse3325) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3322 .cse3327) (not (= .cse3327 4))))))) (= .cse3322 .cse3326) (= .cse3326 0)))))))) (not (<= 0 .cse3330)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3348 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3345 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3346 (select (select .cse3345 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3347 (+ (select (select .cse3348 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3342 (store (store .cse3348 .cse3346 (store (select .cse3348 .cse3346) .cse3347 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3344 (select (select .cse3342 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3343 (store .cse3345 .cse3346 (store (select .cse3345 .cse3346) .cse3347 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3338 (store .cse3343 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3339 (select (select .cse3338 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3340 (+ .cse3344 4))) (let ((.cse3335 (select (select .cse3342 .cse3339) .cse3340)) (.cse3341 (select (select .cse3342 (select (select (store .cse3343 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3340)) (.cse3337 (select (select .cse3342 (select (select (store .cse3343 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3340)) (.cse3336 (select (select .cse3342 (select (select (store .cse3343 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3340))) (or (= .cse3335 .cse3336) (= .cse3337 .cse3335) (not (= (select (select .cse3338 .cse3339) .cse3340) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3341 .cse3335) (= .cse3335 0) (= .cse3341 .cse3337) (= .cse3337 .cse3336))))))) (not (<= 0 .cse3344)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3358 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3355 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3356 (select (select .cse3355 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3357 (+ (select (select .cse3358 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3349 (store (store .cse3358 .cse3356 (store (select .cse3358 .cse3356) .cse3357 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3354 (select (select .cse3349 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3350 (store .cse3355 .cse3356 (store (select .cse3355 .cse3356) .cse3357 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3351 (+ .cse3354 4))) (or (= (select (select .cse3349 (select (select (store .cse3350 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3351) 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3352 (store .cse3350 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3353 (select (select .cse3352 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse3352 .cse3353) .cse3351) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse3349 .cse3353) .cse3351) 0))))) (= (select (select .cse3349 (select (select (store .cse3350 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3351) 0) (not (<= 0 .cse3354)) (= (select (select .cse3349 (select (select (store .cse3350 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3351) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3366 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3359 (select (select .cse3366 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3359 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3368 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3367 (+ (select (select .cse3368 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3361 (store (store .cse3368 .cse3359 (store (select .cse3368 .cse3359) .cse3367 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3364 (select (select .cse3361 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3362 (store .cse3366 .cse3359 (store (select .cse3366 .cse3359) .cse3367 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3363 (+ .cse3364 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3360 (select (select .cse3361 (select (select (store .cse3362 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3363))) (or (= .cse3360 (select (select .cse3361 (select (select (store .cse3362 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3363)) (= .cse3360 (select (select .cse3361 (select (select (store .cse3362 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3363)) (= .cse3360 0)))) (not (<= 0 .cse3364)) (not (= (select (let ((.cse3365 (store .cse3362 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3365 (select (select .cse3365 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3363) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3381 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3379 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3375 (select (select .cse3379 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3380 (+ (select (select .cse3381 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3376 (store (store .cse3381 .cse3375 (store (select .cse3381 .cse3375) .cse3380 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3378 (select (select .cse3376 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3377 (store .cse3379 .cse3375 (store (select .cse3379 .cse3375) .cse3380 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3372 (store .cse3377 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse3373 (select (select .cse3372 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3374 (+ .cse3378 4))) (let ((.cse3369 (select (select .cse3376 (select (select (store .cse3377 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3374)) (.cse3371 (select (select .cse3376 .cse3373) .cse3374)) (.cse3370 (select (select .cse3376 (select (select (store .cse3377 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3374))) (or (= .cse3369 .cse3370) (not (= .cse3371 4)) (= .cse3369 0) (= .cse3371 .cse3370) (not (= (select (select .cse3372 .cse3373) .cse3374) .cse3375)))))))) (not (<= 0 .cse3378)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3395 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3393 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3389 (select (select .cse3393 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3394 (+ (select (select .cse3395 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3390 (store (store .cse3395 .cse3389 (store (select .cse3395 .cse3389) .cse3394 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3392 (select (select .cse3390 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3391 (store .cse3393 .cse3389 (store (select .cse3393 .cse3389) .cse3394 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3386 (store .cse3391 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse3387 (select (select .cse3386 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3388 (+ .cse3392 4))) (let ((.cse3382 (select (select .cse3390 (select (select (store .cse3391 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3388)) (.cse3385 (select (select .cse3390 (select (select (store .cse3391 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3388)) (.cse3384 (select (select .cse3390 .cse3387) .cse3388)) (.cse3383 (select (select .cse3390 (select (select (store .cse3391 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3388))) (or (= .cse3382 .cse3383) (not (= .cse3384 4)) (= .cse3385 .cse3382) (= .cse3385 .cse3384) (= .cse3384 .cse3383) (not (= (select (select .cse3386 .cse3387) .cse3388) .cse3389)))))))) (not (<= 0 .cse3392)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3409 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3407 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3403 (select (select .cse3407 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3408 (+ (select (select .cse3409 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3404 (store (store .cse3409 .cse3403 (store (select .cse3409 .cse3403) .cse3408 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3406 (select (select .cse3404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3405 (store .cse3407 .cse3403 (store (select .cse3407 .cse3403) .cse3408 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3400 (store .cse3405 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse3401 (select (select .cse3400 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3402 (+ .cse3406 4))) (let ((.cse3396 (select (select .cse3404 (select (select (store .cse3405 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3402)) (.cse3398 (select (select .cse3404 (select (select (store .cse3405 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3402)) (.cse3397 (select (select .cse3404 (select (select (store .cse3405 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3402)) (.cse3399 (select (select .cse3404 .cse3401) .cse3402))) (or (= .cse3396 .cse3397) (= .cse3398 .cse3396) (= .cse3396 0) (= .cse3398 .cse3399) (= .cse3399 .cse3397) (not (= (select (select .cse3400 .cse3401) .cse3402) .cse3403)) (= .cse3399 0))))))) (not (<= 0 .cse3406)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3419 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3410 (select (select .cse3419 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3410 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3421 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3420 (+ (select (select .cse3421 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3418 (store (store .cse3421 .cse3410 (store (select .cse3421 .cse3410) .cse3420 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3411 (select (select .cse3418 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3413 (store .cse3419 .cse3410 (store (select .cse3419 .cse3410) .cse3420 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3414 (+ .cse3411 4))) (or (not (<= 0 .cse3411)) (not (= (select (let ((.cse3412 (store .cse3413 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3412 (select (select .cse3412 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3414) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3415 (select (select .cse3418 (select (select (store .cse3413 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3414))) (or (= .cse3415 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse3416 (select (select .cse3418 (select (select (store .cse3413 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3414)) (.cse3417 (select (select .cse3418 (select (select (store .cse3413 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3414))) (or (= .cse3416 .cse3415) (= .cse3417 .cse3416) (= .cse3417 .cse3415)))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3434 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3431 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3432 (select (select .cse3431 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3433 (+ (select (select .cse3434 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3428 (store (store .cse3434 .cse3432 (store (select .cse3434 .cse3432) .cse3433 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3430 (select (select .cse3428 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3429 (store .cse3431 .cse3432 (store (select .cse3431 .cse3432) .cse3433 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3427 (+ .cse3430 4))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3422 (select (select .cse3428 (select (select (store .cse3429 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3427))) (or (= .cse3422 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3423 (select (select .cse3428 (select (select (store .cse3429 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3427))) (or (= .cse3422 .cse3423) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3425 (store .cse3429 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3426 (select (select .cse3425 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3424 (select (select .cse3428 .cse3426) .cse3427))) (or (= .cse3423 .cse3424) (not (= (select (select .cse3425 .cse3426) .cse3427) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3422 .cse3424) (= .cse3424 0)))))) (= .cse3423 0))))))) (= (select (select .cse3428 (select (select (store .cse3429 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3427) 0) (not (<= 0 .cse3430))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3446 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3443 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3444 (select (select .cse3443 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3445 (+ (select (select .cse3446 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3441 (store (store .cse3446 .cse3444 (store (select .cse3446 .cse3444) .cse3445 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3435 (select (select .cse3441 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3435)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3442 (store .cse3443 .cse3444 (store (select .cse3443 .cse3444) .cse3445 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3436 (store .cse3442 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3437 (select (select .cse3436 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3438 (+ .cse3435 4))) (let ((.cse3439 (select (select .cse3441 .cse3437) .cse3438))) (or (not (= (select (select .cse3436 .cse3437) .cse3438) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3440 (select (select .cse3441 (select (select (store .cse3442 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3438))) (or (= .cse3439 .cse3440) (= .cse3440 0)))) (not (= .cse3439 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3459 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3456 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3457 (select (select .cse3456 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3458 (+ (select (select .cse3459 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3447 (store (store .cse3459 .cse3457 (store (select .cse3459 .cse3457) .cse3458 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3455 (select (select .cse3447 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3448 (store .cse3456 .cse3457 (store (select .cse3456 .cse3457) .cse3458 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3453 (store .cse3448 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse3454 (select (select .cse3453 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3449 (+ .cse3455 4))) (let ((.cse3451 (select (select .cse3447 (select (select (store .cse3448 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3449)) (.cse3452 (select (select .cse3447 (select (select (store .cse3448 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3449)) (.cse3450 (select (select .cse3447 .cse3454) .cse3449))) (or (= (select (select .cse3447 (select (select (store .cse3448 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3449) .cse3450) (= .cse3451 .cse3450) (= .cse3450 0) (= .cse3451 .cse3452) (= .cse3452 .cse3450) (= (select (select .cse3453 .cse3454) .cse3449) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))) (not (<= 0 .cse3455)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (or (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int) (v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3466 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3469 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3467 (select (select .cse3469 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3468 (+ (select (select .cse3466 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3464 (store .cse3469 .cse3467 (store (select .cse3469 .cse3467) .cse3468 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3463 (store (store .cse3466 .cse3467 (store (select .cse3466 .cse3467) .cse3468 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3465 (select (select .cse3463 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3460 (store .cse3464 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3461 (select (select .cse3460 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3462 (+ .cse3465 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (= (select (select .cse3460 .cse3461) .cse3462) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse3463 .cse3461) .cse3462) 0) (= (select (select .cse3463 (select (select (store .cse3464 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3462) 0) (not (<= 0 .cse3465)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (= (select (select .cse3463 (select (select (store .cse3464 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3462) 0)))))))) .cse160) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3478 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3479 (select (select .cse3478 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3481 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3480 (+ (select (select .cse3481 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3475 (store (store .cse3481 .cse3479 (store (select .cse3481 .cse3479) .cse3480 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3470 (select (select .cse3475 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3472 (store .cse3478 .cse3479 (store (select .cse3478 .cse3479) .cse3480 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3473 (+ .cse3470 4))) (or (not (<= 0 .cse3470)) (not (= (select (let ((.cse3471 (store .cse3472 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3471 (select (select .cse3471 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3473) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3474 (select (select .cse3475 (select (select (store .cse3472 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3473)) (.cse3477 (select (select .cse3475 (select (select (store .cse3472 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3473)) (.cse3476 (select (select .cse3475 (select (select (store .cse3472 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3473))) (or (= .cse3474 (select (select .cse3475 (select (select (store .cse3472 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3473)) (= .cse3476 .cse3474) (= .cse3477 .cse3474) (= .cse3477 .cse3476))))))))))) (not (= .cse3479 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3494 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3491 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3492 (select (select .cse3491 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3493 (+ (select (select .cse3494 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3482 (store (store .cse3494 .cse3492 (store (select .cse3494 .cse3492) .cse3493 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3490 (select (select .cse3482 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3486 (store .cse3491 .cse3492 (store (select .cse3491 .cse3492) .cse3493 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3484 (+ .cse3490 4))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3485 (store .cse3486 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse3483 (select (select .cse3485 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse3482 .cse3483) .cse3484) 0) (= (select (select .cse3485 .cse3483) .cse3484) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3488 (select (select .cse3482 (select (select (store .cse3486 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3484)) (.cse3487 (select (select .cse3482 (select (select (store .cse3486 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3484)) (.cse3489 (select (select .cse3482 (select (select (store .cse3486 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3484))) (or (= .cse3487 0) (= .cse3487 .cse3488) (= .cse3488 0) (= .cse3487 .cse3489) (= .cse3489 0)))) (not (<= 0 .cse3490))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3505 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3503 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3501 (select (select .cse3503 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3504 (+ (select (select .cse3505 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3496 (store (store .cse3505 .cse3501 (store (select .cse3505 .cse3501) .cse3504 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3502 (select (select .cse3496 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3497 (store .cse3503 .cse3501 (store (select .cse3503 .cse3501) .cse3504 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3498 (+ .cse3502 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3499 (store .cse3497 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse3500 (select (select .cse3499 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3495 (select (select .cse3496 .cse3500) .cse3498))) (or (not (= .cse3495 4)) (= .cse3495 (select (select .cse3496 (select (select (store .cse3497 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3498)) (not (= (select (select .cse3499 .cse3500) .cse3498) .cse3501))))))) (= (select (select .cse3496 (select (select (store .cse3497 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3498) 0) (not (<= 0 .cse3502))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3516 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3513 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3514 (select (select .cse3513 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3515 (+ (select (select .cse3516 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3507 (store (store .cse3516 .cse3514 (store (select .cse3516 .cse3514) .cse3515 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3506 (select (select .cse3507 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3509 (+ .cse3506 4)) (.cse3508 (store .cse3513 .cse3514 (store (select .cse3513 .cse3514) .cse3515 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (not (<= 0 .cse3506)) (= (select (select .cse3507 (select (select (store .cse3508 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3509) 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3511 (store .cse3508 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3512 (select (select .cse3511 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3510 (select (select .cse3507 .cse3512) .cse3509))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse3510 (select (select .cse3507 (select (select (store .cse3508 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3509))) (not (= (select (select .cse3511 .cse3512) .cse3509) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3510 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3524 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3525 (select (select .cse3524 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3527 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3526 (+ (select (select .cse3527 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3517 (store (store .cse3527 .cse3525 (store (select .cse3527 .cse3525) .cse3526 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3522 (select (select .cse3517 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3518 (store .cse3524 .cse3525 (store (select .cse3524 .cse3525) .cse3526 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3519 (+ .cse3522 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3521 (select (select .cse3517 (select (select (store .cse3518 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3519)) (.cse3520 (select (select .cse3517 (select (select (store .cse3518 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3519))) (or (= (select (select .cse3517 (select (select (store .cse3518 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3519) .cse3520) (= (select (select .cse3517 (select (select (store .cse3518 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3519) .cse3521) (= .cse3521 .cse3520)))) (not (<= 0 .cse3522)) (not (= (select (let ((.cse3523 (store .cse3518 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3523 (select (select .cse3523 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3519) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse3525 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3538 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3535 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3536 (select (select .cse3535 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3537 (+ (select (select .cse3538 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3528 (store (store .cse3538 .cse3536 (store (select .cse3538 .cse3536) .cse3537 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3531 (select (select .cse3528 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3529 (store .cse3535 .cse3536 (store (select .cse3535 .cse3536) .cse3537 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3530 (+ .cse3531 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse3528 (select (select (store .cse3529 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3530) 0)) (not (<= 0 .cse3531)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3532 (select (select .cse3528 (select (select (store .cse3529 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3530)) (.cse3533 (select (select .cse3528 (select (select (store .cse3529 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3530)) (.cse3534 (select (select .cse3528 (select (select (store .cse3529 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3530))) (or (= .cse3532 0) (= .cse3533 0) (= .cse3532 .cse3534) (= .cse3534 .cse3533) (= .cse3534 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3551 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3548 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3549 (select (select .cse3548 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3550 (+ (select (select .cse3551 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3546 (store (store .cse3551 .cse3549 (store (select .cse3551 .cse3549) .cse3550 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3539 (select (select .cse3546 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3539)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3547 (store .cse3548 .cse3549 (store (select .cse3548 .cse3549) .cse3550 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3540 (store .cse3547 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3541 (select (select .cse3540 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3542 (+ .cse3539 4))) (let ((.cse3543 (select (select .cse3546 (select (select (store .cse3547 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3542)) (.cse3544 (select (select .cse3546 .cse3541) .cse3542)) (.cse3545 (select (select .cse3546 (select (select (store .cse3547 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3542))) (or (not (= (select (select .cse3540 .cse3541) .cse3542) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3543 .cse3544) (= .cse3543 .cse3545) (not (= .cse3544 4)) (= .cse3545 0))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3560 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3552 (select (select .cse3560 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3552 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3562 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3561 (+ (select (select .cse3562 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3557 (store (store .cse3562 .cse3552 (store (select .cse3562 .cse3552) .cse3561 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3553 (select (select .cse3557 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3555 (store .cse3560 .cse3552 (store (select .cse3560 .cse3552) .cse3561 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3556 (+ .cse3553 4))) (or (not (<= 0 .cse3553)) (not (= (select (let ((.cse3554 (store .cse3555 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3554 (select (select .cse3554 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3556) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3558 (select (select .cse3557 (select (select (store .cse3555 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3556)) (.cse3559 (select (select .cse3557 (select (select (store .cse3555 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3556))) (or (= (select (select .cse3557 (select (select (store .cse3555 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3556) .cse3558) (= (select (select .cse3557 (select (select (store .cse3555 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3556) .cse3559) (= .cse3559 .cse3558) (= .cse3559 0))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3575 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3572 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3573 (select (select .cse3572 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3574 (+ (select (select .cse3575 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3569 (store (store .cse3575 .cse3573 (store (select .cse3575 .cse3573) .cse3574 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3571 (select (select .cse3569 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3570 (store .cse3572 .cse3573 (store (select .cse3572 .cse3573) .cse3574 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3566 (store .cse3570 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3567 (select (select .cse3566 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3568 (+ .cse3571 4))) (let ((.cse3563 (select (select .cse3569 .cse3567) .cse3568)) (.cse3564 (select (select .cse3569 (select (select (store .cse3570 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3568)) (.cse3565 (select (select .cse3569 (select (select (store .cse3570 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3568))) (or (= .cse3563 .cse3564) (= .cse3565 .cse3563) (not (= (select (select .cse3566 .cse3567) .cse3568) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse3569 (select (select (store .cse3570 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3568) .cse3563) (= .cse3563 0) (= .cse3564 0) (= .cse3565 0))))))) (not (<= 0 .cse3571)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3584 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3582 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3576 (select (select .cse3582 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3583 (+ (select (select .cse3584 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3581 (store (store .cse3584 .cse3576 (store (select .cse3584 .cse3576) .cse3583 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3580 (select (select .cse3581 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3578 (store .cse3582 .cse3576 (store (select .cse3582 .cse3576) .cse3583 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3579 (+ .cse3580 4))) (or (not (= .cse3576 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3577 (store .cse3578 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3577 (select (select .cse3577 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3579) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse3580)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (= (select (select .cse3581 (select (select (store .cse3578 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3579) (select (select .cse3581 (select (select (store .cse3578 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3579)))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3596 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3593 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3594 (select (select .cse3593 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3595 (+ (select (select .cse3596 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3586 (store (store .cse3596 .cse3594 (store (select .cse3596 .cse3594) .cse3595 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3592 (select (select .cse3586 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3587 (store .cse3593 .cse3594 (store (select .cse3593 .cse3594) .cse3595 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3590 (store .cse3587 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3591 (select (select .cse3590 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3588 (+ .cse3592 4))) (let ((.cse3585 (select (select .cse3586 .cse3591) .cse3588)) (.cse3589 (select (select .cse3586 (select (select (store .cse3587 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3588))) (or (= .cse3585 (select (select .cse3586 (select (select (store .cse3587 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3588)) (= .cse3589 .cse3585) (not (= (select (select .cse3590 .cse3591) .cse3588) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse3586 (select (select (store .cse3587 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3588) .cse3585) (= .cse3585 0) (= .cse3589 0))))))) (not (<= 0 .cse3592)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3603 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3604 (select (select .cse3603 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3606 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3605 (+ (select (select .cse3606 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3597 (store (store .cse3606 .cse3604 (store (select .cse3606 .cse3604) .cse3605 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3601 (select (select .cse3597 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3598 (store .cse3603 .cse3604 (store (select .cse3603 .cse3604) .cse3605 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3599 (+ .cse3601 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3600 (select (select .cse3597 (select (select (store .cse3598 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3599))) (or (= (select (select .cse3597 (select (select (store .cse3598 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3599) .cse3600) (= .cse3600 0)))) (not (<= 0 .cse3601)) (not (= (select (let ((.cse3602 (store .cse3598 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3602 (select (select .cse3602 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3599) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse3597 (select (select (store .cse3598 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3599) 0)))))))) (not (= .cse3604 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3619 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3616 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3617 (select (select .cse3616 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3618 (+ (select (select .cse3619 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3613 (store (store .cse3619 .cse3617 (store (select .cse3619 .cse3617) .cse3618 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3615 (select (select .cse3613 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3614 (store .cse3616 .cse3617 (store (select .cse3616 .cse3617) .cse3618 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3612 (+ .cse3615 4))) (let ((.cse3607 (select (select .cse3613 (select (select (store .cse3614 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3612))) (or (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3608 (select (select .cse3613 (select (select (store .cse3614 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3612))) (or (= .cse3607 .cse3608) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3610 (store .cse3614 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3611 (select (select .cse3610 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3609 (select (select .cse3613 .cse3611) .cse3612))) (or (= .cse3609 .cse3608) (not (= (select (select .cse3610 .cse3611) .cse3612) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3609 4)))))))))) (= (select (select .cse3613 (select (select (store .cse3614 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3612) .cse3607))))) (not (<= 0 .cse3615)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3632 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3629 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3630 (select (select .cse3629 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3631 (+ (select (select .cse3632 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3621 (store (store .cse3632 .cse3630 (store (select .cse3632 .cse3630) .cse3631 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3620 (select (select .cse3621 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3620)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3622 (store .cse3629 .cse3630 (store (select .cse3629 .cse3630) .cse3631 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3627 (store .cse3622 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse3628 (select (select .cse3627 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3623 (+ .cse3620 4))) (let ((.cse3625 (select (select .cse3621 (select (select (store .cse3622 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3623)) (.cse3624 (select (select .cse3621 .cse3628) .cse3623)) (.cse3626 (select (select .cse3621 (select (select (store .cse3622 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3623))) (or (= (select (select .cse3621 (select (select (store .cse3622 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3623) .cse3624) (= .cse3625 .cse3624) (= .cse3624 0) (= .cse3625 .cse3626) (= .cse3626 .cse3624) (= .cse3626 0) (= (select (select .cse3627 .cse3628) .cse3623) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3644 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3642 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3638 (select (select .cse3642 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3643 (+ (select (select .cse3644 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3639 (store (store .cse3644 .cse3638 (store (select .cse3644 .cse3638) .cse3643 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3641 (select (select .cse3639 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse3640 (store .cse3642 .cse3638 (store (select .cse3642 .cse3638) .cse3643 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3635 (store .cse3640 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse3636 (select (select .cse3635 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3637 (+ .cse3641 4))) (let ((.cse3633 (select (select .cse3639 .cse3636) .cse3637)) (.cse3634 (select (select .cse3639 (select (select (store .cse3640 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3637))) (or (not (= .cse3633 4)) (= .cse3633 .cse3634) (= .cse3634 0) (not (= (select (select .cse3635 .cse3636) .cse3637) .cse3638)))))))) (not (<= 0 .cse3641)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3657 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3654 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3655 (select (select .cse3654 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3656 (+ (select (select .cse3657 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3645 (store (store .cse3657 .cse3655 (store (select .cse3657 .cse3655) .cse3656 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3653 (select (select .cse3645 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3646 (store .cse3654 .cse3655 (store (select .cse3654 .cse3655) .cse3656 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3647 (+ .cse3653 4))) (or (= (select (select .cse3645 (select (select (store .cse3646 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3647) 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3652 (select (select .cse3645 (select (select (store .cse3646 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3647))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3650 (select (select .cse3645 (select (select (store .cse3646 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3647))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3648 (store .cse3646 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3649 (select (select .cse3648 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3651 (select (select .cse3645 .cse3649) .cse3647))) (or (not (= (select (select .cse3648 .cse3649) .cse3647) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3650 .cse3651) (not (= .cse3651 4))))))) (= .cse3650 .cse3652)))) (= .cse3652 0)))) (not (<= 0 .cse3653))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3670 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3667 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3668 (select (select .cse3667 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3669 (+ (select (select .cse3670 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3664 (store (store .cse3670 .cse3668 (store (select .cse3670 .cse3668) .cse3669 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3666 (select (select .cse3664 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3665 (store .cse3667 .cse3668 (store (select .cse3667 .cse3668) .cse3669 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3660 (store .cse3665 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3661 (select (select .cse3660 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3662 (+ .cse3666 4))) (let ((.cse3659 (select (select .cse3664 .cse3661) .cse3662)) (.cse3658 (select (select .cse3664 (select (select (store .cse3665 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3662)) (.cse3663 (select (select .cse3664 (select (select (store .cse3665 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3662))) (or (= .cse3658 .cse3659) (not (= (select (select .cse3660 .cse3661) .cse3662) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3663 0) (= (select (select .cse3664 (select (select (store .cse3665 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3662) .cse3658) (not (= .cse3659 4)) (= .cse3658 .cse3663))))))) (not (<= 0 .cse3666)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3683 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3680 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3681 (select (select .cse3680 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3682 (+ (select (select .cse3683 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3677 (store (store .cse3683 .cse3681 (store (select .cse3683 .cse3681) .cse3682 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3679 (select (select .cse3677 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3678 (store .cse3680 .cse3681 (store (select .cse3680 .cse3681) .cse3682 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3673 (store .cse3678 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3674 (select (select .cse3673 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3675 (+ .cse3679 4))) (let ((.cse3676 (select (select .cse3677 (select (select (store .cse3678 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3675)) (.cse3672 (select (select .cse3677 .cse3674) .cse3675)) (.cse3671 (select (select .cse3677 (select (select (store .cse3678 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3675))) (or (= .cse3671 .cse3672) (not (= (select (select .cse3673 .cse3674) .cse3675) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3676 .cse3672) (= .cse3676 .cse3671) (not (= .cse3672 4)) (= .cse3671 0))))))) (not (<= 0 .cse3679)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3694 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3692 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3689 (select (select .cse3692 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3693 (+ (select (select .cse3694 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3685 (store (store .cse3694 .cse3689 (store (select .cse3694 .cse3689) .cse3693 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3691 (select (select .cse3685 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3686 (store .cse3692 .cse3689 (store (select .cse3692 .cse3689) .cse3693 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3687 (+ .cse3691 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3684 (select (select .cse3685 (select (select (store .cse3686 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3687)) (.cse3688 (select (select .cse3685 (select (select (store .cse3686 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3687))) (or (= .cse3684 (select (select .cse3685 (select (select (store .cse3686 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3687)) (= .cse3688 .cse3684) (= .cse3688 (select (select .cse3685 (select (select (store .cse3686 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3687))))) (not (= .cse3689 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3690 (store .cse3686 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3690 (select (select .cse3690 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3687) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse3691))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3707 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3704 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3705 (select (select .cse3704 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3706 (+ (select (select .cse3707 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3696 (store (store .cse3707 .cse3705 (store (select .cse3707 .cse3705) .cse3706 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3703 (select (select .cse3696 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3697 (store .cse3704 .cse3705 (store (select .cse3704 .cse3705) .cse3706 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3700 (store .cse3697 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3701 (select (select .cse3700 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3698 (+ .cse3703 4))) (let ((.cse3702 (select (select .cse3696 (select (select (store .cse3697 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3698)) (.cse3699 (select (select .cse3696 (select (select (store .cse3697 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3698)) (.cse3695 (select (select .cse3696 .cse3701) .cse3698))) (or (= .cse3695 (select (select .cse3696 (select (select (store .cse3697 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3698)) (= .cse3699 .cse3695) (not (= (select (select .cse3700 .cse3701) .cse3698) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3702 .cse3695) (= .cse3702 .cse3699) (not (= .cse3695 4)))))))) (not (<= 0 .cse3703)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3717 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3708 (select (select .cse3717 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3708 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3719 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3718 (+ (select (select .cse3719 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3716 (store (store .cse3719 .cse3708 (store (select .cse3719 .cse3708) .cse3718 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3709 (select (select .cse3716 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3711 (store .cse3717 .cse3708 (store (select .cse3717 .cse3708) .cse3718 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3712 (+ .cse3709 4))) (or (not (<= 0 .cse3709)) (not (= (select (let ((.cse3710 (store .cse3711 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3710 (select (select .cse3710 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3712) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3713 (select (select .cse3716 (select (select (store .cse3711 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3712)) (.cse3714 (select (select .cse3716 (select (select (store .cse3711 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3712))) (or (= .cse3713 .cse3714) (= .cse3714 0) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3715 (select (select .cse3716 (select (select (store .cse3711 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3712))) (or (= .cse3713 .cse3715) (= .cse3714 .cse3715)))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3732 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3730 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3726 (select (select .cse3730 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3731 (+ (select (select .cse3732 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3727 (store (store .cse3732 .cse3726 (store (select .cse3732 .cse3726) .cse3731 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3729 (select (select .cse3727 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3728 (store .cse3730 .cse3726 (store (select .cse3730 .cse3726) .cse3731 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3723 (store .cse3728 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse3724 (select (select .cse3723 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3725 (+ .cse3729 4))) (let ((.cse3721 (select (select .cse3727 (select (select (store .cse3728 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3725)) (.cse3722 (select (select .cse3727 (select (select (store .cse3728 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3725)) (.cse3720 (select (select .cse3727 .cse3724) .cse3725))) (or (not (= .cse3720 4)) (= .cse3720 .cse3721) (= .cse3722 .cse3721) (= .cse3722 .cse3720) (not (= (select (select .cse3723 .cse3724) .cse3725) .cse3726)))))))) (not (<= 0 .cse3729)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3741 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3739 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3736 (select (select .cse3739 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3740 (+ (select (select .cse3741 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3733 (store (store .cse3741 .cse3736 (store (select .cse3741 .cse3736) .cse3740 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3738 (select (select .cse3733 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3734 (store .cse3739 .cse3736 (store (select .cse3739 .cse3736) .cse3740 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3735 (+ .cse3738 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse3733 (select (select (store .cse3734 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3735) 0)) (not (= .cse3736 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3737 (store .cse3734 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3737 (select (select .cse3737 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3735) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse3738)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (= (select (select .cse3733 (select (select (store .cse3734 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3735) (select (select .cse3733 (select (select (store .cse3734 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3735)))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3748 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3749 (select (select .cse3748 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3751 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3750 (+ (select (select .cse3751 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3742 (store (store .cse3751 .cse3749 (store (select .cse3751 .cse3749) .cse3750 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3746 (select (select .cse3742 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3743 (store .cse3748 .cse3749 (store (select .cse3748 .cse3749) .cse3750 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3744 (+ .cse3746 4))) (or (= (select (select .cse3742 (select (select (store .cse3743 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3744) 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3745 (select (select .cse3742 (select (select (store .cse3743 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3744))) (or (= .cse3745 (select (select .cse3742 (select (select (store .cse3743 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3744)) (= .cse3745 0)))) (not (<= 0 .cse3746)) (not (= (select (let ((.cse3747 (store .cse3743 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3747 (select (select .cse3747 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3744) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (not (= .cse3749 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3764 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3761 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3762 (select (select .cse3761 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3763 (+ (select (select .cse3764 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3753 (store (store .cse3764 .cse3762 (store (select .cse3764 .cse3762) .cse3763 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3760 (select (select .cse3753 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse3754 (store .cse3761 .cse3762 (store (select .cse3761 .cse3762) .cse3763 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3755 (+ .cse3760 4))) (let ((.cse3752 (select (select .cse3753 (select (select (store .cse3754 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3755))) (or (= .cse3752 (select (select .cse3753 (select (select (store .cse3754 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3755)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3756 (select (select .cse3753 (select (select (store .cse3754 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3755))) (or (= .cse3756 .cse3752) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3758 (store .cse3754 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse3759 (select (select .cse3758 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3757 (select (select .cse3753 .cse3759) .cse3755))) (or (= .cse3756 .cse3757) (= .cse3757 0) (= (select (select .cse3758 .cse3759) .cse3755) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))) (= .cse3752 0))))) (not (<= 0 .cse3760)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3773 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3765 (select (select .cse3773 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3765 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3775 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3774 (+ (select (select .cse3775 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3772 (store (store .cse3775 .cse3765 (store (select .cse3775 .cse3765) .cse3774 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3766 (select (select .cse3772 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3768 (store .cse3773 .cse3765 (store (select .cse3773 .cse3765) .cse3774 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3769 (+ .cse3766 4))) (or (not (<= 0 .cse3766)) (not (= (select (let ((.cse3767 (store .cse3768 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3767 (select (select .cse3767 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3769) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3770 (select (select .cse3772 (select (select (store .cse3768 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3769))) (or (= .cse3770 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse3771 (select (select .cse3772 (select (select (store .cse3768 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3769))) (or (= .cse3771 .cse3770) (= (select (select .cse3772 (select (select (store .cse3768 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3769) .cse3771) (= (select (select .cse3772 (select (select (store .cse3768 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3769) .cse3771) (= .cse3771 0)))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3785 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3776 (select (select .cse3785 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3776 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3787 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3786 (+ (select (select .cse3787 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3780 (store (store .cse3787 .cse3776 (store (select .cse3787 .cse3776) .cse3786 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3783 (select (select .cse3780 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3781 (store .cse3785 .cse3776 (store (select .cse3785 .cse3776) .cse3786 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3782 (+ .cse3783 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3777 (select (select .cse3780 (select (select (store .cse3781 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3782))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3778 (select (select .cse3780 (select (select (store .cse3781 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3782)) (.cse3779 (select (select .cse3780 (select (select (store .cse3781 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3782))) (or (= .cse3777 .cse3778) (= .cse3777 .cse3779) (= .cse3779 .cse3778) (= .cse3779 0)))) (= .cse3777 (select (select .cse3780 (select (select (store .cse3781 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3782))))) (not (<= 0 .cse3783)) (not (= (select (let ((.cse3784 (store .cse3781 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3784 (select (select .cse3784 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3782) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3799 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3796 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3797 (select (select .cse3796 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3798 (+ (select (select .cse3799 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3793 (store (store .cse3799 .cse3797 (store (select .cse3799 .cse3797) .cse3798 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3795 (select (select .cse3793 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse3794 (store .cse3796 .cse3797 (store (select .cse3796 .cse3797) .cse3798 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3790 (store .cse3794 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3791 (select (select .cse3790 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3792 (+ .cse3795 4))) (let ((.cse3789 (select (select .cse3793 .cse3791) .cse3792)) (.cse3788 (select (select .cse3793 (select (select (store .cse3794 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3792))) (or (= .cse3788 .cse3789) (not (= (select (select .cse3790 .cse3791) .cse3792) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3789 4)) (= .cse3788 0))))))) (not (<= 0 .cse3795)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3811 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3808 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3809 (select (select .cse3808 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3810 (+ (select (select .cse3811 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3805 (store (store .cse3811 .cse3809 (store (select .cse3811 .cse3809) .cse3810 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3807 (select (select .cse3805 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3806 (store .cse3808 .cse3809 (store (select .cse3808 .cse3809) .cse3810 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3802 (store .cse3806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3803 (select (select .cse3802 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3804 (+ .cse3807 4))) (let ((.cse3801 (select (select .cse3805 .cse3803) .cse3804)) (.cse3800 (select (select .cse3805 (select (select (store .cse3806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3804))) (or (= .cse3800 .cse3801) (not (= (select (select .cse3802 .cse3803) .cse3804) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse3805 (select (select (store .cse3806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3804) .cse3800) (not (= .cse3801 4)) (= .cse3800 (select (select .cse3805 (select (select (store .cse3806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3804)))))))) (not (<= 0 .cse3807)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (or (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int) (v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3821 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3824 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3822 (select (select .cse3824 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3823 (+ (select (select .cse3821 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3820 (store .cse3824 .cse3822 (store (select .cse3824 .cse3822) .cse3823 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3819 (store (store .cse3821 .cse3822 (store (select .cse3821 .cse3822) .cse3823 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3817 (select (select .cse3819 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3814 (store .cse3820 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3815 (select (select .cse3814 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3816 (+ .cse3817 4))) (let ((.cse3812 (select (select .cse3819 .cse3815) .cse3816)) (.cse3813 (select (select .cse3819 (select (select (store .cse3820 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3816)) (.cse3818 (select (select .cse3819 (select (select (store .cse3820 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3816))) (or (= .cse3812 .cse3813) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (= (select (select .cse3814 .cse3815) .cse3816) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3812 0) (not (<= 0 .cse3817)) (= .cse3818 .cse3813) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (= .cse3818 0))))))))) .cse160) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3835 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3832 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3833 (select (select .cse3832 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3834 (+ (select (select .cse3835 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3828 (store (store .cse3835 .cse3833 (store (select .cse3835 .cse3833) .cse3834 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3825 (select (select .cse3828 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3825)) (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3829 (store .cse3832 .cse3833 (store (select .cse3832 .cse3833) .cse3834 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3830 (+ .cse3825 4))) (let ((.cse3826 (select (select .cse3828 (select (select (store .cse3829 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3830))) (or (= .cse3826 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3827 (select (select .cse3828 (select (select (store .cse3829 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3830))) (or (= .cse3826 .cse3827) (= .cse3827 0)))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3831 (select (select .cse3828 (select (select (store .cse3829 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3830))) (or (= .cse3826 .cse3831) (= .cse3831 (select (select .cse3828 (select (select (store .cse3829 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3830)) (= .cse3831 0)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_prenex_39 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3848 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3845 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3846 (select (select .cse3845 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3847 (+ (select (select .cse3848 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3836 (store (store .cse3848 .cse3846 (store (select .cse3848 .cse3846) .cse3847 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3844 (select (select .cse3836 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3837 (store .cse3845 .cse3846 (store (select .cse3845 .cse3846) .cse3847 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3838 (+ .cse3844 4))) (or (= (select (select .cse3836 (select (select (store .cse3837 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3838) 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3843 (select (select .cse3836 (select (select (store .cse3837 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3838))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse3839 (select (select .cse3836 (select (select (store .cse3837 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3838))) (or (= .cse3839 0) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3840 (store .cse3837 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3841 (select (select .cse3840 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3842 (select (select .cse3836 .cse3841) .cse3838))) (or (not (= (select (select .cse3840 .cse3841) .cse3838) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3839 .cse3842) (not (= .cse3842 4))))))) (= .cse3839 .cse3843)))) (= .cse3843 0)))) (not (<= 0 .cse3844))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (or (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (<= 0 (select (select (store (let ((.cse3850 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3849 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (store .cse3849 .cse3850 (store (select .cse3849 .cse3850) (+ (select (select .cse3849 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) 0))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) .cse160) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3859 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3851 (select (select .cse3859 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3851 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3861 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3860 (+ (select (select .cse3861 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3852 (store (store .cse3861 .cse3851 (store (select .cse3861 .cse3851) .cse3860 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3857 (select (select .cse3852 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3853 (store .cse3859 .cse3851 (store (select .cse3859 .cse3851) .cse3860 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3854 (+ .cse3857 4))) (or (= (select (select .cse3852 (select (select (store .cse3853 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3854) 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3855 (select (select .cse3852 (select (select (store .cse3853 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3854)) (.cse3856 (select (select .cse3852 (select (select (store .cse3853 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3854))) (or (= .cse3855 0) (= .cse3856 .cse3855) (= .cse3856 0)))) (not (<= 0 .cse3857)) (not (= (select (let ((.cse3858 (store .cse3853 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3858 (select (select .cse3858 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3854) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3871 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3868 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3869 (select (select .cse3868 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3870 (+ (select (select .cse3871 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3862 (store (store .cse3871 .cse3869 (store (select .cse3871 .cse3869) .cse3870 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3867 (select (select .cse3862 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3863 (store .cse3868 .cse3869 (store (select .cse3868 .cse3869) .cse3870 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3864 (+ .cse3867 4))) (or (forall ((v_prenex_35 (Array Int Int))) (= (select (select .cse3862 (select (select (store .cse3863 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3864) 0)) (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse3862 (select (select (store .cse3863 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3864) 0)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3866 (store .cse3863 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse3865 (select (select .cse3866 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse3862 .cse3865) .cse3864) 0) (= (select (select .cse3866 .cse3865) .cse3864) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))) (not (<= 0 .cse3867)) (forall ((v_prenex_32 (Array Int Int))) (= (select (select .cse3862 (select (select (store .cse3863 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3864) 0))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3878 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3875 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3873 (select (select .cse3875 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3876 (+ (select (select .cse3878 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3877 (select (select (store (store .cse3878 .cse3873 (store (select .cse3878 .cse3873) .cse3876 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_38 (Array Int Int))) (let ((.cse3872 (select (let ((.cse3874 (store (store .cse3875 .cse3873 (store (select .cse3875 .cse3873) .cse3876 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_38))) (select .cse3874 (select (select .cse3874 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse3877 4)))) (or (= .cse3872 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) (not (= .cse3872 .cse3873))))) (not (<= 0 .cse3877))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3891 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3888 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3889 (select (select .cse3888 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3890 (+ (select (select .cse3891 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3881 (store (store .cse3891 .cse3889 (store (select .cse3891 .cse3889) .cse3890 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3879 (select (select .cse3881 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3879)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3882 (store .cse3888 .cse3889 (store (select .cse3888 .cse3889) .cse3890 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3883 (+ .cse3879 4))) (let ((.cse3880 (select (select .cse3881 (select (select (store .cse3882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3883))) (or (= .cse3880 (select (select .cse3881 (select (select (store .cse3882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3883)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3884 (select (select .cse3881 (select (select (store .cse3882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3883))) (or (= .cse3880 .cse3884) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3886 (store .cse3882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3887 (select (select .cse3886 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3885 (select (select .cse3881 .cse3887) .cse3883))) (or (= .cse3885 .cse3884) (not (= (select (select .cse3886 .cse3887) .cse3883) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3880 .cse3885) (not (= .cse3885 4)))))))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3901 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3892 (select (select .cse3901 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3892 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3903 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3902 (+ (select (select .cse3903 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3893 (store (store .cse3903 .cse3892 (store (select .cse3903 .cse3892) .cse3902 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3899 (select (select .cse3893 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3894 (store .cse3901 .cse3892 (store (select .cse3901 .cse3892) .cse3902 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3895 (+ .cse3899 4))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3896 (select (select .cse3893 (select (select (store .cse3894 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3895))) (or (= (select (select .cse3893 (select (select (store .cse3894 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3895) .cse3896) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3897 (select (select .cse3893 (select (select (store .cse3894 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3895))) (or (= .cse3897 .cse3896) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3898 (select (select .cse3893 (select (select (store .cse3894 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3895))) (or (= .cse3898 .cse3897) (= .cse3898 .cse3896)))))))))) (not (<= 0 .cse3899)) (not (= (select (let ((.cse3900 (store .cse3894 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3900 (select (select .cse3900 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3895) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3913 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3904 (select (select .cse3913 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3904 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3915 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3914 (+ (select (select .cse3915 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3912 (store (store .cse3915 .cse3904 (store (select .cse3915 .cse3904) .cse3914 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3905 (select (select .cse3912 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3907 (store .cse3913 .cse3904 (store (select .cse3913 .cse3904) .cse3914 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3908 (+ .cse3905 4))) (or (not (<= 0 .cse3905)) (not (= (select (let ((.cse3906 (store .cse3907 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3906 (select (select .cse3906 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3908) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3910 (select (select .cse3912 (select (select (store .cse3907 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3908))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3909 (select (select .cse3912 (select (select (store .cse3907 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3908))) (or (= .cse3909 .cse3910) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3911 (select (select .cse3912 (select (select (store .cse3907 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3908))) (or (= .cse3911 0) (= .cse3909 .cse3911))))))) (= .cse3910 0))))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3929 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3926 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3927 (select (select .cse3926 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3928 (+ (select (select .cse3929 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3923 (store (store .cse3929 .cse3927 (store (select .cse3929 .cse3927) .cse3928 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3925 (select (select .cse3923 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3924 (store .cse3926 .cse3927 (store (select .cse3926 .cse3927) .cse3928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3918 (store .cse3924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3919 (select (select .cse3918 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3920 (+ .cse3925 4))) (let ((.cse3921 (select (select .cse3923 (select (select (store .cse3924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3920)) (.cse3916 (select (select .cse3923 .cse3919) .cse3920)) (.cse3917 (select (select .cse3923 (select (select (store .cse3924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3920)) (.cse3922 (select (select .cse3923 (select (select (store .cse3924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3920))) (or (= .cse3916 .cse3917) (not (= (select (select .cse3918 .cse3919) .cse3920) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3921 .cse3916) (= .cse3921 .cse3922) (not (= .cse3916 4)) (= .cse3922 .cse3917) (= .cse3922 0))))))) (not (<= 0 .cse3925)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3941 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3938 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3939 (select (select .cse3938 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3940 (+ (select (select .cse3941 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3931 (store (store .cse3941 .cse3939 (store (select .cse3941 .cse3939) .cse3940 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3930 (select (select .cse3931 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3930)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3932 (store .cse3938 .cse3939 (store (select .cse3938 .cse3939) .cse3940 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse3935 (store .cse3932 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3936 (select (select .cse3935 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3933 (+ .cse3930 4))) (let ((.cse3934 (select (select .cse3931 .cse3936) .cse3933))) (or (= (select (select .cse3931 (select (select (store .cse3932 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3933) .cse3934) (not (= (select (select .cse3935 .cse3936) .cse3933) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3937 (select (select .cse3931 (select (select (store .cse3932 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3933))) (or (= .cse3934 .cse3937) (= .cse3937 0)))) (= (select (select .cse3931 (select (select (store .cse3932 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3933) .cse3934) (= .cse3934 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3947 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3944 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3942 (select (select .cse3944 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3945 (+ (select (select .cse3947 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3946 (select (select (store (store .cse3947 .cse3942 (store (select .cse3947 .cse3942) .cse3945 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3942 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int))) (not (= (select (let ((.cse3943 (store (store .cse3944 .cse3942 (store (select .cse3944 .cse3942) .cse3945 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3943 (select (select .cse3943 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse3946 4)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (not (<= 0 .cse3946))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3957 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3954 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3955 (select (select .cse3954 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3956 (+ (select (select .cse3957 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3951 (store (store .cse3957 .cse3955 (store (select .cse3957 .cse3955) .cse3956 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3953 (select (select .cse3951 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3952 (store .cse3954 .cse3955 (store (select .cse3954 .cse3955) .cse3956 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3950 (+ .cse3953 4))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3948 (store .cse3952 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3949 (select (select .cse3948 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse3948 .cse3949) .cse3950) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= (select (select .cse3951 .cse3949) .cse3950) 4)))))) (not (<= 0 .cse3953)) (= (select (select .cse3951 (select (select (store .cse3952 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3950) 0)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3970 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3967 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3968 (select (select .cse3967 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3969 (+ (select (select .cse3970 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3959 (store (store .cse3970 .cse3968 (store (select .cse3970 .cse3968) .cse3969 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3966 (select (select .cse3959 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3960 (store .cse3967 .cse3968 (store (select .cse3967 .cse3968) .cse3969 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3961 (+ .cse3966 4))) (let ((.cse3958 (select (select .cse3959 (select (select (store .cse3960 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3961))) (or (= .cse3958 (select (select .cse3959 (select (select (store .cse3960 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3961)) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse3962 (select (select .cse3959 (select (select (store .cse3960 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3961))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3964 (store .cse3960 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3965 (select (select .cse3964 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3963 (select (select .cse3959 .cse3965) .cse3961))) (or (= .cse3962 .cse3963) (not (= (select (select .cse3964 .cse3965) .cse3961) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse3958 .cse3963) (not (= .cse3963 4))))))) (= .cse3958 .cse3962) (= .cse3962 0)))))))) (not (<= 0 .cse3966)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse3983 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse3980 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3981 (select (select .cse3980 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3982 (+ (select (select .cse3983 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3978 (store (store .cse3983 .cse3981 (store (select .cse3983 .cse3981) .cse3982 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3971 (select (select .cse3978 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3971)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3979 (store .cse3980 .cse3981 (store (select .cse3980 .cse3981) .cse3982 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3977 (+ .cse3971 4))) (let ((.cse3973 (select (select .cse3978 (select (select (store .cse3979 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3977)) (.cse3974 (select (select .cse3978 (select (select (store .cse3979 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3977))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse3975 (store .cse3979 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse3976 (select (select .cse3975 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3972 (select (select .cse3978 .cse3976) .cse3977))) (or (= .cse3972 .cse3973) (= .cse3974 .cse3972) (not (= (select (select .cse3975 .cse3976) .cse3977) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse3972 4))))))) (= .cse3974 .cse3973) (= .cse3974 0))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse3991 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse3984 (select (select .cse3991 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse3984 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse3993 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse3992 (+ (select (select .cse3993 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3985 (store (store .cse3993 .cse3984 (store (select .cse3993 .cse3984) .cse3992 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3989 (select (select .cse3985 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3986 (store .cse3991 .cse3984 (store (select .cse3991 .cse3984) .cse3992 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3987 (+ .cse3989 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse3988 (select (select .cse3985 (select (select (store .cse3986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3987))) (or (= (select (select .cse3985 (select (select (store .cse3986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3987) .cse3988) (= .cse3988 0)))) (not (<= 0 .cse3989)) (not (= (select (let ((.cse3990 (store .cse3986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse3990 (select (select .cse3990 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3987) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4004 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4001 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4002 (select (select .cse4001 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4003 (+ (select (select .cse4004 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3994 (store (store .cse4004 .cse4002 (store (select .cse4004 .cse4002) .cse4003 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse3999 (select (select .cse3994 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3995 (store .cse4001 .cse4002 (store (select .cse4001 .cse4002) .cse4003 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse3996 (+ .cse3999 4))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse3994 (select (select (store .cse3995 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3996) 0)) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse3998 (store .cse3995 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse3997 (select (select .cse3998 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse3994 .cse3997) .cse3996) 0) (= (select (select .cse3998 .cse3997) .cse3996) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))) (not (<= 0 .cse3999)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse4000 (select (select .cse3994 (select (select (store .cse3995 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3996))) (or (= .cse4000 (select (select .cse3994 (select (select (store .cse3995 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3996)) (= .cse4000 0))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4015 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4012 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4013 (select (select .cse4012 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4014 (+ (select (select .cse4015 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4008 (store (store .cse4015 .cse4013 (store (select .cse4015 .cse4013) .cse4014 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4011 (select (select .cse4008 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_33 (Array Int Int))) (let ((.cse4009 (store .cse4012 .cse4013 (store (select .cse4012 .cse4013) .cse4014 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse4010 (+ .cse4011 4))) (let ((.cse4005 (select (select .cse4008 (select (select (store .cse4009 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4010))) (or (= .cse4005 0) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4006 (select (select .cse4008 (select (select (store .cse4009 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4010)) (.cse4007 (select (select .cse4008 (select (select (store .cse4009 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4010))) (or (= .cse4005 .cse4006) (= .cse4005 .cse4007) (= .cse4007 .cse4006) (= .cse4007 0)))) (forall ((v_prenex_35 (Array Int Int))) (= .cse4005 (select (select .cse4008 (select (select (store .cse4009 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4010))))))) (not (<= 0 .cse4011)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4026 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4023 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4024 (select (select .cse4023 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4025 (+ (select (select .cse4026 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4016 (store (store .cse4026 .cse4024 (store (select .cse4026 .cse4024) .cse4025 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4022 (select (select .cse4016 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse4017 (store .cse4023 .cse4024 (store (select .cse4023 .cse4024) .cse4025 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4020 (store .cse4017 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4021 (select (select .cse4020 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4018 (+ .cse4022 4))) (let ((.cse4019 (select (select .cse4016 .cse4021) .cse4018))) (or (= (select (select .cse4016 (select (select (store .cse4017 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4018) .cse4019) (not (= (select (select .cse4020 .cse4021) .cse4018) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse4016 (select (select (store .cse4017 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4018) .cse4019) (not (= .cse4019 4)))))))) (not (<= 0 .cse4022)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4037 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4034 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4035 (select (select .cse4034 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4036 (+ (select (select .cse4037 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4027 (store (store .cse4037 .cse4035 (store (select .cse4037 .cse4035) .cse4036 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4033 (select (select .cse4027 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4028 (store .cse4034 .cse4035 (store (select .cse4034 .cse4035) .cse4036 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4031 (store .cse4028 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse4032 (select (select .cse4031 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4029 (+ .cse4033 4))) (let ((.cse4030 (select (select .cse4027 .cse4032) .cse4029))) (or (= (select (select .cse4027 (select (select (store .cse4028 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4029) .cse4030) (= (select (select .cse4027 (select (select (store .cse4028 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4029) .cse4030) (= .cse4030 0) (= (select (select .cse4027 (select (select (store .cse4028 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4029) .cse4030) (= (select (select .cse4031 .cse4032) .cse4029) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))) (not (<= 0 .cse4033)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4048 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4045 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4046 (select (select .cse4045 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4047 (+ (select (select .cse4048 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4041 (store (store .cse4048 .cse4046 (store (select .cse4048 .cse4046) .cse4047 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4044 (select (select .cse4041 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4042 (store .cse4045 .cse4046 (store (select .cse4045 .cse4046) .cse4047 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse4043 (+ .cse4044 4))) (let ((.cse4038 (select (select .cse4041 (select (select (store .cse4042 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4043)) (.cse4039 (select (select .cse4041 (select (select (store .cse4042 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4043)) (.cse4040 (select (select .cse4041 (select (select (store .cse4042 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4043))) (or (= .cse4038 0) (= .cse4038 .cse4039) (= .cse4040 (select (select .cse4041 (select (select (store .cse4042 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4043)) (= .cse4040 .cse4039) (= .cse4040 0))))) (not (<= 0 .cse4044)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4062 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4059 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4060 (select (select .cse4059 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4061 (+ (select (select .cse4062 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4056 (store (store .cse4062 .cse4060 (store (select .cse4062 .cse4060) .cse4061 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4058 (select (select .cse4056 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4057 (store .cse4059 .cse4060 (store (select .cse4059 .cse4060) .cse4061 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4053 (store .cse4057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4054 (select (select .cse4053 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4055 (+ .cse4058 4))) (let ((.cse4049 (select (select .cse4056 (select (select (store .cse4057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4055)) (.cse4052 (select (select .cse4056 .cse4054) .cse4055)) (.cse4051 (select (select .cse4056 (select (select (store .cse4057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4055)) (.cse4050 (select (select .cse4056 (select (select (store .cse4057 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4055))) (or (= .cse4049 .cse4050) (= .cse4051 .cse4052) (not (= (select (select .cse4053 .cse4054) .cse4055) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse4049 .cse4052) (= .cse4052 0) (= .cse4050 0) (= .cse4051 .cse4050))))))) (not (<= 0 .cse4058)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse4070 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4063 (select (select .cse4070 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse4063 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse4072 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse4071 (+ (select (select .cse4072 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4064 (store (store .cse4072 .cse4063 (store (select .cse4072 .cse4063) .cse4071 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4068 (select (select .cse4064 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4065 (store .cse4070 .cse4063 (store (select .cse4070 .cse4063) .cse4071 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse4066 (+ .cse4068 4))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4067 (select (select .cse4064 (select (select (store .cse4065 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4066))) (or (= (select (select .cse4064 (select (select (store .cse4065 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4066) .cse4067) (= .cse4067 (select (select .cse4064 (select (select (store .cse4065 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4066)) (= .cse4067 0)))) (not (<= 0 .cse4068)) (not (= (select (let ((.cse4069 (store .cse4065 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse4069 (select (select .cse4069 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse4066) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2360 (Array Int Int))) (let ((.cse4081 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4073 (select (select .cse4081 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= .cse4073 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse4083 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361))) (let ((.cse4082 (+ (select (select .cse4083 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4075 (store (store .cse4083 .cse4073 (store (select .cse4083 .cse4073) .cse4082 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4079 (select (select .cse4075 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4076 (store .cse4081 .cse4073 (store (select .cse4081 .cse4073) .cse4082 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse4077 (+ .cse4079 4))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse4074 (select (select .cse4075 (select (select (store .cse4076 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4077))) (or (= .cse4074 (select (select .cse4075 (select (select (store .cse4076 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4077)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4078 (select (select .cse4075 (select (select (store .cse4076 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4077))) (or (= .cse4074 .cse4078) (= .cse4078 (select (select .cse4075 (select (select (store .cse4076 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4077)) (= .cse4078 0))))))) (not (<= 0 .cse4079)) (not (= (select (let ((.cse4080 (store .cse4076 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2349))) (select .cse4080 (select (select .cse4080 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse4077) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4096 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4094 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4091 (select (select .cse4094 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4095 (+ (select (select .cse4096 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4092 (store (store .cse4096 .cse4091 (store (select .cse4096 .cse4091) .cse4095 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4084 (select (select .cse4092 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4084)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4093 (store .cse4094 .cse4091 (store (select .cse4094 .cse4091) .cse4095 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4088 (store .cse4093 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse4089 (select (select .cse4088 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4090 (+ .cse4084 4))) (let ((.cse4085 (select (select .cse4092 (select (select (store .cse4093 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4090)) (.cse4087 (select (select .cse4092 .cse4089) .cse4090)) (.cse4086 (select (select .cse4092 (select (select (store .cse4093 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4090))) (or (= .cse4085 .cse4086) (not (= .cse4087 4)) (= .cse4087 .cse4085) (= .cse4087 .cse4086) (not (= (select (select .cse4088 .cse4089) .cse4090) .cse4091)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4108 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4106 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4101 (select (select .cse4106 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4107 (+ (select (select .cse4108 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4103 (store (store .cse4108 .cse4101 (store (select .cse4108 .cse4101) .cse4107 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4105 (select (select .cse4103 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse4104 (store .cse4106 .cse4101 (store (select .cse4106 .cse4101) .cse4107 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4098 (store .cse4104 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse4099 (select (select .cse4098 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4100 (+ .cse4105 4))) (let ((.cse4097 (select (select .cse4103 .cse4099) .cse4100))) (or (not (= .cse4097 4)) (not (= (select (select .cse4098 .cse4099) .cse4100) .cse4101)) (forall ((v_prenex_35 (Array Int Int))) (let ((.cse4102 (select (select .cse4103 (select (select (store .cse4104 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4100))) (or (forall ((v_prenex_39 (Array Int Int))) (= .cse4102 (select (select .cse4103 (select (select (store .cse4104 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4100))) (= .cse4097 .cse4102) (= .cse4102 0)))))))))) (not (<= 0 .cse4105)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4120 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4118 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4116 (select (select .cse4118 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4119 (+ (select (select .cse4120 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4109 (store (store .cse4120 .cse4116 (store (select .cse4120 .cse4116) .cse4119 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4117 (select (select .cse4109 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4110 (store .cse4118 .cse4116 (store (select .cse4118 .cse4116) .cse4119 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4114 (store .cse4110 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse4115 (select (select .cse4114 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4111 (+ .cse4117 4))) (let ((.cse4113 (select (select .cse4109 .cse4115) .cse4111)) (.cse4112 (select (select .cse4109 (select (select (store .cse4110 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4111))) (or (= (select (select .cse4109 (select (select (store .cse4110 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4111) .cse4112) (not (= .cse4113 4)) (= .cse4113 .cse4112) (not (= (select (select .cse4114 .cse4115) .cse4111) .cse4116)))))))) (not (<= 0 .cse4117)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4132 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4129 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4130 (select (select .cse4129 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4131 (+ (select (select .cse4132 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4121 (store (store .cse4132 .cse4130 (store (select .cse4132 .cse4130) .cse4131 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4124 (select (select .cse4121 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4123 (+ .cse4124 4)) (.cse4122 (store .cse4129 .cse4130 (store (select .cse4129 .cse4130) .cse4131 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse4121 (select (select (store .cse4122 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4123) 0)) (not (<= 0 .cse4124)) (= (select (select .cse4121 (select (select (store .cse4122 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4123) 0) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4127 (store .cse4122 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4128 (select (select .cse4127 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4125 (select (select .cse4121 .cse4128) .cse4123)) (.cse4126 (select (select .cse4121 (select (select (store .cse4122 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4123))) (or (= .cse4125 .cse4126) (not (= (select (select .cse4127 .cse4128) .cse4123) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse4125 0) (= .cse4126 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4145 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4143 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4141 (select (select .cse4143 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4144 (+ (select (select .cse4145 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4136 (store (store .cse4145 .cse4141 (store (select .cse4145 .cse4141) .cse4144 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4142 (select (select .cse4136 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int))) (let ((.cse4137 (store .cse4143 .cse4141 (store (select .cse4143 .cse4141) .cse4144 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse4138 (+ .cse4142 4))) (let ((.cse4134 (select (select .cse4136 (select (select (store .cse4137 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4138))) (or (forall ((v_prenex_32 (Array Int Int))) (let ((.cse4139 (store .cse4137 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse4140 (select (select .cse4139 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4133 (select (select .cse4136 .cse4140) .cse4138))) (or (not (= .cse4133 4)) (= .cse4133 .cse4134) (forall ((v_prenex_39 (Array Int Int))) (let ((.cse4135 (select (select .cse4136 (select (select (store .cse4137 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4138))) (or (= .cse4135 0) (= .cse4133 .cse4135)))) (not (= (select (select .cse4139 .cse4140) .cse4138) .cse4141))))))) (= .cse4134 0))))) (not (<= 0 .cse4142)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4159 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4156 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4157 (select (select .cse4156 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4158 (+ (select (select .cse4159 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4154 (store (store .cse4159 .cse4157 (store (select .cse4159 .cse4157) .cse4158 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4146 (select (select .cse4154 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4146)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4155 (store .cse4156 .cse4157 (store (select .cse4156 .cse4157) .cse4158 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4151 (store .cse4155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4152 (select (select .cse4151 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4153 (+ .cse4146 4))) (let ((.cse4148 (select (select .cse4154 (select (select (store .cse4155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4153)) (.cse4149 (select (select .cse4154 (select (select (store .cse4155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4153)) (.cse4150 (select (select .cse4154 (select (select (store .cse4155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4153)) (.cse4147 (select (select .cse4154 .cse4152) .cse4153))) (or (= .cse4147 .cse4148) (= .cse4149 .cse4148) (= .cse4150 .cse4147) (not (= (select (select .cse4151 .cse4152) .cse4153) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse4149 .cse4150) (not (= .cse4147 4)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4172 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4169 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4170 (select (select .cse4169 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4171 (+ (select (select .cse4172 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4166 (store (store .cse4172 .cse4170 (store (select .cse4172 .cse4170) .cse4171 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4168 (select (select .cse4166 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse4167 (store .cse4169 .cse4170 (store (select .cse4169 .cse4170) .cse4171 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4162 (store .cse4167 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4163 (select (select .cse4162 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4164 (+ .cse4168 4))) (let ((.cse4165 (select (select .cse4166 (select (select (store .cse4167 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4164)) (.cse4160 (select (select .cse4166 (select (select (store .cse4167 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4164)) (.cse4161 (select (select .cse4166 .cse4163) .cse4164))) (or (= .cse4160 .cse4161) (not (= (select (select .cse4162 .cse4163) .cse4164) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse4165 .cse4161) (= .cse4165 .cse4160) (not (= .cse4161 4)))))))) (not (<= 0 .cse4168)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4184 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4181 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4182 (select (select .cse4181 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4183 (+ (select (select .cse4184 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4174 (store (store .cse4184 .cse4182 (store (select .cse4184 .cse4182) .cse4183 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4180 (select (select .cse4174 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4175 (store .cse4181 .cse4182 (store (select .cse4181 .cse4182) .cse4183 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4178 (store .cse4175 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4179 (select (select .cse4178 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4176 (+ .cse4180 4))) (let ((.cse4173 (select (select .cse4174 .cse4179) .cse4176)) (.cse4177 (select (select .cse4174 (select (select (store .cse4175 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4176))) (or (= .cse4173 (select (select .cse4174 (select (select (store .cse4175 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4176)) (= .cse4177 .cse4173) (not (= (select (select .cse4178 .cse4179) .cse4176) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (not (= .cse4173 4)) (= .cse4177 0))))))) (not (<= 0 .cse4180)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4196 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4193 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4194 (select (select .cse4193 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4195 (+ (select (select .cse4196 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4187 (store (store .cse4196 .cse4194 (store (select .cse4196 .cse4194) .cse4195 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4185 (select (select .cse4187 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4185)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4188 (store .cse4193 .cse4194 (store (select .cse4193 .cse4194) .cse4195 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4191 (store .cse4188 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4192 (select (select .cse4191 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4189 (+ .cse4185 4))) (let ((.cse4186 (select (select .cse4187 .cse4192) .cse4189)) (.cse4190 (select (select .cse4187 (select (select (store .cse4188 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4189))) (or (= .cse4186 (select (select .cse4187 (select (select (store .cse4188 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4189)) (= .cse4190 .cse4186) (not (= (select (select .cse4191 .cse4192) .cse4189) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse4187 (select (select (store .cse4188 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4189) .cse4190) (not (= .cse4186 4)) (= .cse4190 0))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4208 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4206 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4204 (select (select .cse4206 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4207 (+ (select (select .cse4208 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4199 (store (store .cse4208 .cse4204 (store (select .cse4208 .cse4204) .cse4207 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4205 (select (select .cse4199 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse4200 (store .cse4206 .cse4204 (store (select .cse4206 .cse4204) .cse4207 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse4201 (+ .cse4205 4))) (let ((.cse4197 (select (select .cse4199 (select (select (store .cse4200 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4201))) (or (= .cse4197 0) (forall ((v_prenex_32 (Array Int Int))) (let ((.cse4202 (store .cse4200 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse4203 (select (select .cse4202 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4198 (select (select .cse4199 .cse4203) .cse4201))) (or (not (= .cse4198 4)) (= .cse4198 .cse4197) (= (select (select .cse4199 (select (select (store .cse4200 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4201) .cse4198) (not (= (select (select .cse4202 .cse4203) .cse4201) .cse4204))))))))))) (not (<= 0 .cse4205)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4218 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4215 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4216 (select (select .cse4215 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4217 (+ (select (select .cse4218 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4209 (store (store .cse4218 .cse4216 (store (select .cse4218 .cse4216) .cse4217 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4212 (select (select .cse4209 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4210 (store .cse4215 .cse4216 (store (select .cse4215 .cse4216) .cse4217 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))) (.cse4211 (+ .cse4212 4))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse4209 (select (select (store .cse4210 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4211) 0)) (not (<= 0 .cse4212)) (forall ((v_prenex_32 (Array Int Int))) (= (select (select .cse4209 (select (select (store .cse4210 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4211) 0)) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4213 (select (select .cse4209 (select (select (store .cse4210 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4211)) (.cse4214 (select (select .cse4209 (select (select (store .cse4210 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4211))) (or (= .cse4213 .cse4214) (= .cse4213 0) (= .cse4214 0))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4231 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4229 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4228 (select (select .cse4229 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4230 (+ (select (select .cse4231 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4219 (store (store .cse4231 .cse4228 (store (select .cse4231 .cse4228) .cse4230 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4222 (select (select .cse4219 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4221 (+ .cse4222 4)) (.cse4220 (store .cse4229 .cse4228 (store (select .cse4229 .cse4228) .cse4230 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_39 (Array Int Int))) (= (select (select .cse4219 (select (select (store .cse4220 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4221) 0)) (not (<= 0 .cse4222)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse4226 (store .cse4220 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse4227 (select (select .cse4226 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4224 (select (select .cse4219 (select (select (store .cse4220 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4221)) (.cse4223 (select (select .cse4219 (select (select (store .cse4220 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4221)) (.cse4225 (select (select .cse4219 .cse4227) .cse4221))) (or (= .cse4223 0) (= .cse4223 .cse4224) (= .cse4224 0) (= .cse4223 .cse4225) (not (= (select (select .cse4226 .cse4227) .cse4221) .cse4228)) (= .cse4225 0))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4244 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4241 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4242 (select (select .cse4241 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4243 (+ (select (select .cse4244 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4238 (store (store .cse4244 .cse4242 (store (select .cse4244 .cse4242) .cse4243 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4240 (select (select .cse4238 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4239 (store .cse4241 .cse4242 (store (select .cse4241 .cse4242) .cse4243 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4235 (store .cse4239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4236 (select (select .cse4235 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4237 (+ .cse4240 4))) (let ((.cse4233 (select (select .cse4238 (select (select (store .cse4239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4237)) (.cse4232 (select (select .cse4238 .cse4236) .cse4237)) (.cse4234 (select (select .cse4238 (select (select (store .cse4239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4237))) (or (= .cse4232 .cse4233) (= .cse4234 .cse4232) (not (= (select (select .cse4235 .cse4236) .cse4237) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= (select (select .cse4238 (select (select (store .cse4239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4237) .cse4232) (= .cse4233 0) (not (= .cse4232 4)) (= .cse4234 0))))))) (not (<= 0 .cse4240)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4257 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4254 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4255 (select (select .cse4254 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4256 (+ (select (select .cse4257 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4245 (store (store .cse4257 .cse4255 (store (select .cse4257 .cse4255) .cse4256 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4248 (select (select .cse4245 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4247 (+ .cse4248 4)) (.cse4246 (store .cse4254 .cse4255 (store (select .cse4254 .cse4255) .cse4256 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (or (forall ((v_prenex_33 (Array Int Int))) (= (select (select .cse4245 (select (select (store .cse4246 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4247) 0)) (not (<= 0 .cse4248)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4252 (store .cse4246 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39))) (let ((.cse4253 (select (select .cse4252 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4249 (select (select .cse4245 (select (select (store .cse4246 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4247)) (.cse4250 (select (select .cse4245 .cse4253) .cse4247)) (.cse4251 (select (select .cse4245 (select (select (store .cse4246 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4247))) (or (= .cse4249 .cse4250) (= .cse4249 0) (= .cse4250 0) (= .cse4251 .cse4250) (= .cse4251 0) (= (select (select .cse4252 .cse4253) .cse4247) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4270 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4267 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4268 (select (select .cse4267 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4269 (+ (select (select .cse4270 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4259 (store (store .cse4270 .cse4268 (store (select .cse4270 .cse4268) .cse4269 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4266 (select (select .cse4259 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4260 (store .cse4267 .cse4268 (store (select .cse4267 .cse4268) .cse4269 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4263 (store .cse4260 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4264 (select (select .cse4263 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4261 (+ .cse4266 4))) (let ((.cse4265 (select (select .cse4259 (select (select (store .cse4260 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4261)) (.cse4258 (select (select .cse4259 .cse4264) .cse4261)) (.cse4262 (select (select .cse4259 (select (select (store .cse4260 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4261))) (or (= .cse4258 (select (select .cse4259 (select (select (store .cse4260 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4261)) (= .cse4262 .cse4258) (not (= (select (select .cse4263 .cse4264) .cse4261) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse4265 .cse4258) (= .cse4265 .cse4262) (not (= .cse4258 4)) (= .cse4262 0))))))) (not (<= 0 .cse4266)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4283 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4280 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4281 (select (select .cse4280 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4282 (+ (select (select .cse4283 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4272 (store (store .cse4283 .cse4281 (store (select .cse4283 .cse4281) .cse4282 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4279 (select (select .cse4272 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4273 (store .cse4280 .cse4281 (store (select .cse4280 .cse4281) .cse4282 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4276 (store .cse4273 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4277 (select (select .cse4276 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4274 (+ .cse4279 4))) (let ((.cse4271 (select (select .cse4272 .cse4277) .cse4274)) (.cse4278 (select (select .cse4272 (select (select (store .cse4273 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4274)) (.cse4275 (select (select .cse4272 (select (select (store .cse4273 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4274))) (or (= .cse4271 (select (select .cse4272 (select (select (store .cse4273 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4274)) (= .cse4275 .cse4271) (not (= (select (select .cse4276 .cse4277) .cse4274) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse4278 .cse4271) (= .cse4271 0) (= .cse4278 .cse4275) (= .cse4275 0))))))) (not (<= 0 .cse4279)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4296 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4293 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4294 (select (select .cse4293 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4295 (+ (select (select .cse4296 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4291 (store (store .cse4296 .cse4294 (store (select .cse4296 .cse4294) .cse4295 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4284 (select (select .cse4291 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4284)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_33 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse4292 (store .cse4293 .cse4294 (store (select .cse4293 .cse4294) .cse4295 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4287 (store .cse4292 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35))) (let ((.cse4288 (select (select .cse4287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4289 (+ .cse4284 4))) (let ((.cse4290 (select (select .cse4291 (select (select (store .cse4292 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4289)) (.cse4286 (select (select .cse4291 .cse4288) .cse4289)) (.cse4285 (select (select .cse4291 (select (select (store .cse4292 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4289))) (or (= .cse4285 .cse4286) (not (= (select (select .cse4287 .cse4288) .cse4289) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)) (= .cse4290 .cse4286) (= .cse4290 .cse4285) (not (= .cse4286 4)) (= .cse4285 (select (select .cse4291 (select (select (store .cse4292 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_39) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4289)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|) 0)) (forall ((v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2350 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse4307 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2361)) (.cse4305 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2360))) (let ((.cse4304 (select (select .cse4305 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4306 (+ (select (select .cse4307 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse4299 (store (store .cse4307 .cse4304 (store (select .cse4307 .cse4304) .cse4306 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_ArrVal_2350))) (let ((.cse4297 (select (select .cse4299 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4297)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_35 (Array Int Int))) (let ((.cse4300 (store .cse4305 .cse4304 (store (select .cse4305 .cse4304) .cse4306 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51|)))) (let ((.cse4302 (store .cse4300 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_32))) (let ((.cse4303 (select (select .cse4302 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4301 (+ .cse4297 4))) (let ((.cse4298 (select (select .cse4299 .cse4303) .cse4301))) (or (not (= .cse4298 4)) (= .cse4298 (select (select .cse4299 (select (select (store .cse4300 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| v_prenex_35) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4301)) (not (= (select (select .cse4302 .cse4303) .cse4301) .cse4304)))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_51| |c_#StackHeapBarrier|)))))) is different from true WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2022-11-20 20:16:47,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609798035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:16:47,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1903926838] [2022-11-20 20:16:47,606 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-20 20:16:47,606 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:16:47,607 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:16:47,607 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:16:47,607 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:16:47,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:16:47,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:16:47,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:16:47,691 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 9 [2022-11-20 20:16:47,698 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 20:16:47,704 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 20:16:47,709 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 19 treesize of output 1 [2022-11-20 20:16:47,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,720 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 25 treesize of output 13 [2022-11-20 20:16:47,727 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 20:16:47,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,735 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 25 treesize of output 13 [2022-11-20 20:16:47,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:16:47,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:16:47,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:16:47,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:47,866 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 13 [2022-11-20 20:16:47,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:47,881 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 13 [2022-11-20 20:16:47,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:47,894 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 27 treesize of output 11 [2022-11-20 20:16:48,019 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:16:48,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:16:48,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:48,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:16:48,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:16:48,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:16:48,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:16:48,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:16:48,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:16:48,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:48,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:48,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:16:48,527 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:16:48,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 224 [2022-11-20 20:16:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:48,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:16:48,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:48,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:48,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:16:48,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:16:48,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:16:48,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:16:48,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:16:48,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:16:48,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:16:48,930 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:16:48,939 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:16:49,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:16:49,054 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 27 treesize of output 11 [2022-11-20 20:16:49,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:49,065 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 13 [2022-11-20 20:16:49,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:16:49,077 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 13 [2022-11-20 20:16:49,284 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 7 treesize of output 3 [2022-11-20 20:16:49,312 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 7 treesize of output 3 [2022-11-20 20:16:49,393 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 7 treesize of output 3 [2022-11-20 20:16:49,413 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 7 treesize of output 3 [2022-11-20 20:16:49,786 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:16:49,811 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:16:49,826 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:16:49,901 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:16:49,901 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 23 treesize of output 30 [2022-11-20 20:16:49,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:16:49,964 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:16:49,965 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 23 treesize of output 30 [2022-11-20 20:16:50,307 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 49 for LOIs [2022-11-20 20:16:50,445 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:17:02,302 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6683#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (or (and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|)) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (not (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))' at error location [2022-11-20 20:17:02,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:17:02,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:17:02,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24] total 46 [2022-11-20 20:17:02,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205836808] [2022-11-20 20:17:02,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:17:02,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-20 20:17:02,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:17:02,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-20 20:17:02,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=5857, Unknown=7, NotChecked=310, Total=6480 [2022-11-20 20:17:02,305 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 46 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 40 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 20:17:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:17:05,207 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-20 20:17:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 20:17:05,208 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 40 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-11-20 20:17:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:17:05,209 INFO L225 Difference]: With dead ends: 58 [2022-11-20 20:17:05,209 INFO L226 Difference]: Without dead ends: 58 [2022-11-20 20:17:05,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2949 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=496, Invalid=8817, Unknown=7, NotChecked=382, Total=9702 [2022-11-20 20:17:05,210 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 95 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:17:05,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 519 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 815 Invalid, 0 Unknown, 5 Unchecked, 0.8s Time] [2022-11-20 20:17:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-20 20:17:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-11-20 20:17:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:17:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-20 20:17:05,214 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 43 [2022-11-20 20:17:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:17:05,215 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-20 20:17:05,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 40 states have internal predecessors, (65), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 20:17:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-20 20:17:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 20:17:05,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:17:05,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:17:05,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-20 20:17:05,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 20:17:05,419 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:17:05,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:17:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562405, now seen corresponding path program 1 times [2022-11-20 20:17:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:17:05,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888090062] [2022-11-20 20:17:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:17:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:17:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:17:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:17:09,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:17:09,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888090062] [2022-11-20 20:17:09,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888090062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:17:09,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804155602] [2022-11-20 20:17:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:17:09,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:17:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:17:09,290 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:17:09,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 20:17:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:17:09,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-20 20:17:09,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:17:09,665 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 20:17:10,258 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:17:10,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-11-20 20:17:10,519 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:17:10,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:10,834 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2022-11-20 20:17:10,842 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:17:10,843 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 7 [2022-11-20 20:17:10,848 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 7 treesize of output 3 [2022-11-20 20:17:11,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:11,289 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 20:17:11,289 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 2 case distinctions, treesize of input 38 treesize of output 42 [2022-11-20 20:17:11,345 INFO L321 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2022-11-20 20:17:11,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2022-11-20 20:17:11,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:11,367 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 20:17:12,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:12,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:12,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:12,453 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 77 [2022-11-20 20:17:12,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:12,465 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-11-20 20:17:12,684 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-20 20:17:12,685 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 78 [2022-11-20 20:17:12,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:12,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:12,707 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 94 treesize of output 87 [2022-11-20 20:17:13,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:13,201 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 20:17:13,201 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 61 [2022-11-20 20:17:13,732 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:17:13,733 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 43 [2022-11-20 20:17:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:17:13,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:17:15,958 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2523 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55| Int)) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55| v_ArrVal_2524)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55| v_ArrVal_2523))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse7 (+ (select (select .cse10 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3 (store (store .cse10 .cse9 (store (select .cse10 .cse9) .cse7 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55| v_ArrVal_2513))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55| 1) (let ((.cse0 (let ((.cse6 (select .cse8 .cse9))) (let ((.cse5 (store .cse8 .cse9 (store .cse6 .cse7 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55|)))) (store .cse5 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55| (store (select .cse5 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55|) 4 (select .cse6 .cse7))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) 1) (not (<= 0 .cse4)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_55| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-20 20:17:15,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804155602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:17:15,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [220576072] [2022-11-20 20:17:15,965 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 20:17:15,965 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:17:15,965 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:17:15,966 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:17:15,966 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:17:15,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:15,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:15,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:17:16,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:17:16,035 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 9 [2022-11-20 20:17:16,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:17:16,046 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 20:17:16,051 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 20:17:16,056 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 19 treesize of output 1 [2022-11-20 20:17:16,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,066 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 25 treesize of output 13 [2022-11-20 20:17:16,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,073 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 25 treesize of output 13 [2022-11-20 20:17:16,078 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 20:17:16,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:17:16,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:17:16,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:17:16,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:16,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,283 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:17:16,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:16,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:17:16,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:16,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:17:16,471 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:17:16,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:17:16,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:17:16,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:16,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:17:16,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:17:16,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:17:16,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:17:16,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:17:16,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:17:16,938 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:17:16,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:17:17,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:17,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:17:17,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:17:17,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:17:17,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:17:17,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:17:17,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:17:17,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:17,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:17,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:17:17,325 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:17:17,334 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:17:17,345 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:17:17,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:17,477 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 13 [2022-11-20 20:17:17,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:17,487 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 27 treesize of output 11 [2022-11-20 20:17:17,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:17,498 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 13 [2022-11-20 20:17:17,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:17,604 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 13 [2022-11-20 20:17:17,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:17,615 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 13 [2022-11-20 20:17:17,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:17,627 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 27 treesize of output 11 [2022-11-20 20:17:17,795 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:17:17,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 236 [2022-11-20 20:17:17,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:17:18,010 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 5 treesize of output 3 [2022-11-20 20:17:18,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:18,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 205 [2022-11-20 20:17:18,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:18,174 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 161 [2022-11-20 20:17:18,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:18,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:18,208 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 160 treesize of output 144 [2022-11-20 20:17:18,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:17:19,028 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 7 treesize of output 3 [2022-11-20 20:17:19,181 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:17:19,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 236 [2022-11-20 20:17:19,400 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 5 treesize of output 3 [2022-11-20 20:17:19,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:19,483 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 171 [2022-11-20 20:17:19,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:19,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 193 [2022-11-20 20:17:19,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:19,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:19,572 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 160 treesize of output 144 [2022-11-20 20:17:19,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:17:20,309 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 7 treesize of output 3 [2022-11-20 20:17: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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:17:20,642 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:17:20,653 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:17:20,707 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:17:20,708 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 23 treesize of output 30 [2022-11-20 20:17:20,748 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:17:20,795 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:17:20,795 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 23 treesize of output 30 [2022-11-20 20:17:21,200 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:17:21,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 236 [2022-11-20 20:17:21,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:21,681 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 915 treesize of output 929 [2022-11-20 20:17:22,271 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-20 20:17:22,282 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 9 [2022-11-20 20:17:22,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:17:22,311 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 19 treesize of output 1 [2022-11-20 20:17:22,317 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 20:17:22,324 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 20:17:22,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:22,346 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 25 treesize of output 13 [2022-11-20 20:17:22,354 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 20:17:22,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:22,363 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 25 treesize of output 13 [2022-11-20 20:17:22,368 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:17:34,145 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7120#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_55| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_62| Int)) (and (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_55| 8) (select |#length| |v_ULTIMATE.start_main_~ptr~0#1.base_62|)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_62|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_55| 4))) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_62|) |v_ULTIMATE.start_main_~ptr~0#1.offset_55|)) (= (select |#valid| |v_ULTIMATE.start_main_~ptr~0#1.base_62|) 1) (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_55|) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_62|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_55| 4))))) (= (+ |ULTIMATE.start_main_~mid_index~0#1| 1) |ULTIMATE.start_main_~count~0#1|)) (and (= (select |#valid| 0) 1) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| 0) 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| 0) 4)) (<= 8 (select |#length| 0)) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| 0) 4)))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:17:34,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:17:34,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:17:34,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 58 [2022-11-20 20:17:34,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218154475] [2022-11-20 20:17:34,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:17:34,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-20 20:17:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:17:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-20 20:17:34,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=8917, Unknown=14, NotChecked=190, Total=9506 [2022-11-20 20:17:34,148 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 59 states, 50 states have (on average 1.52) internal successors, (76), 50 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:17:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:17:37,374 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-11-20 20:17:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:17:37,375 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 50 states have (on average 1.52) internal successors, (76), 50 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2022-11-20 20:17:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:17:37,375 INFO L225 Difference]: With dead ends: 59 [2022-11-20 20:17:37,375 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 20:17:37,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3899 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=568, Invalid=12304, Unknown=14, NotChecked=224, Total=13110 [2022-11-20 20:17:37,378 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:17:37,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 485 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 618 Invalid, 0 Unknown, 109 Unchecked, 0.7s Time] [2022-11-20 20:17:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 20:17:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-11-20 20:17:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 53 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:17:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-11-20 20:17:37,382 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 45 [2022-11-20 20:17:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:17:37,382 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-11-20 20:17:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 50 states have (on average 1.52) internal successors, (76), 50 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:17:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-11-20 20:17:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 20:17:37,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:17:37,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:17:37,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 20:17:37,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 20:17:37,591 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:17:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:17:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562404, now seen corresponding path program 1 times [2022-11-20 20:17:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:17:37,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882852066] [2022-11-20 20:17:37,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:17:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:17:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:17:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:17:42,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:17:42,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882852066] [2022-11-20 20:17:42,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882852066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:17:42,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859699615] [2022-11-20 20:17:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:17:42,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:17:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:17:42,200 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:17:42,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 20:17:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:17:42,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-20 20:17:42,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:17:43,138 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:17:43,138 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 20:17:43,147 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 14 treesize of output 16 [2022-11-20 20:17:43,399 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:17:43,410 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 20:17:43,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:43,709 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2022-11-20 20:17:43,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:17:43,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:43,722 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:17:44,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:44,136 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 20:17:44,136 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 2 case distinctions, treesize of input 78 treesize of output 66 [2022-11-20 20:17:44,164 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 20:17:44,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 20:17:44,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:44,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:44,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-20 20:17:44,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:17:45,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:45,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:45,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:17:45,254 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 96 [2022-11-20 20:17:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:45,276 INFO L321 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2022-11-20 20:17:45,276 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 2 case distinctions, treesize of input 78 treesize of output 49 [2022-11-20 20:17:45,476 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-20 20:17:45,476 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 88 [2022-11-20 20:17:45,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:45,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:45,487 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 114 [2022-11-20 20:17:46,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:17:46,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:46,798 INFO L321 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2022-11-20 20:17:46,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 253 treesize of output 99 [2022-11-20 20:17:46,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:46,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:17:46,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2022-11-20 20:17:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:17:46,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:18:12,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859699615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:18:12,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1136145544] [2022-11-20 20:18:12,307 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-20 20:18:12,307 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:18:12,307 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:18:12,307 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:18:12,308 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:18:12,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:18:12,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:18:12,376 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 9 [2022-11-20 20:18:12,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:18:12,387 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 20:18:12,392 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 20:18:12,397 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 19 treesize of output 1 [2022-11-20 20:18:12,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,406 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 25 treesize of output 13 [2022-11-20 20:18:12,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,413 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 25 treesize of output 13 [2022-11-20 20:18:12,419 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 20:18:12,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:12,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:18:12,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:12,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:12,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:18:12,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:12,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:18:12,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:12,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:18:12,734 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:12,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:12,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:12,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:12,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:12,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:12,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:12,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:18:12,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:18:13,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:13,118 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:13,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:13,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:13,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:18:13,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:13,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:18:13,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:13,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:13,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:13,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,527 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 232 treesize of output 212 [2022-11-20 20:18:13,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:13,541 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:18:13,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:13,555 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 0 case distinctions, treesize of input 236 treesize of output 224 [2022-11-20 20:18:13,714 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:13,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:13,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:13,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:13,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:13,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:18:13,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:14,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:14,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:14,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:18:14,122 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:14,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:14,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:14,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:14,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:14,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:14,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:14,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:14,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:18:14,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:18:14,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:14,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:14,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:14,526 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 232 treesize of output 212 [2022-11-20 20:18:14,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:14,538 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:18:14,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:14,553 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 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-20 20:18:14,674 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 7 treesize of output 3 [2022-11-20 20:18:14,706 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 7 treesize of output 3 [2022-11-20 20:18:14,787 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 7 treesize of output 3 [2022-11-20 20:18:14,810 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 7 treesize of output 3 [2022-11-20 20:18:15,001 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:18:15,011 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:15,031 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:15,096 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:18:15,097 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 23 treesize of output 30 [2022-11-20 20:18:15,116 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:18:15,153 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:18:15,153 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 23 treesize of output 30 [2022-11-20 20:18:15,644 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:15,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:15,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:15,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:15,824 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 22 for LOIs [2022-11-20 20:18:15,834 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 9 [2022-11-20 20:18:15,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:18:15,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:18:15,863 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 20:18:15,869 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 20:18:15,885 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 20:18:15,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:15,893 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 25 treesize of output 13 [2022-11-20 20:18:15,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:15,900 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 25 treesize of output 13 [2022-11-20 20:18:15,903 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:18:31,900 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7564#(and (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_69| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_62| Int)) (and (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_62| 8) (select |#length| |v_ULTIMATE.start_main_~ptr~0#1.base_69|)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_69|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_62| 4))) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_69|) |v_ULTIMATE.start_main_~ptr~0#1.offset_62|)) (= (select |#valid| |v_ULTIMATE.start_main_~ptr~0#1.base_69|) 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_69|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_62| 4))) (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_62|))) (= (+ |ULTIMATE.start_main_~mid_index~0#1| 1) |ULTIMATE.start_main_~count~0#1|)) (and (= (select |#valid| 0) 1) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| 0) 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| 0) 4)) (<= 8 (select |#length| 0)) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| 0) 4)))) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))' at error location [2022-11-20 20:18:31,900 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:18:31,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:18:31,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 59 [2022-11-20 20:18:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971212418] [2022-11-20 20:18:31,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:18:31,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-20 20:18:31,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:18:31,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-20 20:18:31,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=9522, Unknown=11, NotChecked=0, Total=9900 [2022-11-20 20:18:31,903 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 60 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 51 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:18:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:18:38,457 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-20 20:18:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 20:18:38,458 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 51 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2022-11-20 20:18:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:18:38,459 INFO L225 Difference]: With dead ends: 77 [2022-11-20 20:18:38,459 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 20:18:38,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3991 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=593, Invalid=14648, Unknown=11, NotChecked=0, Total=15252 [2022-11-20 20:18:38,461 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:18:38,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 779 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1071 Invalid, 0 Unknown, 312 Unchecked, 1.2s Time] [2022-11-20 20:18:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 20:18:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2022-11-20 20:18:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:18:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-20 20:18:38,465 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 45 [2022-11-20 20:18:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:18:38,465 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-20 20:18:38,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 51 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:18:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-20 20:18:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 20:18:38,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:18:38,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:18:38,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-20 20:18:38,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 20:18:38,679 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:18:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:18:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1448570570, now seen corresponding path program 1 times [2022-11-20 20:18:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:18:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529611095] [2022-11-20 20:18:38,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:18:38,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:18:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:18:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:18:41,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:18:41,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529611095] [2022-11-20 20:18:41,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529611095] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:18:41,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747625890] [2022-11-20 20:18:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:18:41,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:18:41,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:18:41,647 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:18:41,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 20:18:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:18:41,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-20 20:18:41,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:18:42,502 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 20:18:42,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:18:42,735 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 18 [2022-11-20 20:18:42,739 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 5 treesize of output 3 [2022-11-20 20:18:42,744 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 7 treesize of output 3 [2022-11-20 20:18:42,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:42,949 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 20:18:42,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:42,968 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 20:18:42,968 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 2 case distinctions, treesize of input 37 treesize of output 41 [2022-11-20 20:18:42,983 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:18:42,983 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 15 treesize of output 15 [2022-11-20 20:18:43,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:43,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:43,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:18:43,751 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 67 [2022-11-20 20:18:43,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:43,763 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2022-11-20 20:18:43,942 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-20 20:18:43,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 64 [2022-11-20 20:18:43,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:43,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:43,955 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 59 treesize of output 58 [2022-11-20 20:18:44,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:44,316 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 20:18:44,316 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 34 [2022-11-20 20:18:44,804 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:18:44,804 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 28 [2022-11-20 20:18:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:18:44,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:18:46,709 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2846 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| Int) (v_ArrVal_2837 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_2847)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_2846))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse7 (+ (select (select .cse10 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3 (store (store .cse10 .cse9 (store (select .cse10 .cse9) .cse7 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| v_ArrVal_2837))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|) 0)) (not (= (let ((.cse0 (let ((.cse6 (select .cse8 .cse9))) (let ((.cse5 (store .cse8 .cse9 (store .cse6 .cse7 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|)))) (store .cse5 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63| (store (select .cse5 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_63|) 4 (select .cse6 .cse7))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (not (<= 0 .cse4)))))))) is different from false [2022-11-20 20:18:46,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747625890] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:18:46,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [789024005] [2022-11-20 20:18:46,714 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-20 20:18:46,714 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:18:46,714 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:18:46,715 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:18:46,715 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:18:46,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:18:46,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:18:46,786 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 9 [2022-11-20 20:18:46,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:18:46,798 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 20:18:46,803 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 19 treesize of output 1 [2022-11-20 20:18:46,808 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 20:18:46,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,817 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 25 treesize of output 13 [2022-11-20 20:18:46,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,824 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 25 treesize of output 13 [2022-11-20 20:18:46,829 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 20:18:46,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:46,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:18:46,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:46,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:46,938 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 13 [2022-11-20 20:18:46,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:46,948 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 13 [2022-11-20 20:18:46,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:46,961 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 27 treesize of output 11 [2022-11-20 20:18:47,065 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:47,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:47,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:47,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:47,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:47,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:47,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:47,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:18:47,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:47,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:47,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:47,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:18:47,467 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:47,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:47,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:47,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:47,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:47,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:18:47,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:47,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:18:47,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:47,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:47,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:47,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:47,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:47,837 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 240 treesize of output 220 [2022-11-20 20:18:47,849 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 0 case distinctions, treesize of input 234 treesize of output 218 [2022-11-20 20:18:47,863 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 0 case distinctions, treesize of input 234 treesize of output 218 [2022-11-20 20:18:48,012 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:48,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:48,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:48,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:48,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:18:48,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:48,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:48,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:48,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:18:48,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:48,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:48,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:48,415 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:48,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:48,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:48,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:48,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:48,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:48,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:18:48,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:18:48,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:48,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:18:48,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:48,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:18:48,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:48,836 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 232 treesize of output 212 [2022-11-20 20:18:48,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:48,852 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:18:48,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:18:48,868 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 0 case distinctions, treesize of input 236 treesize of output 224 [2022-11-20 20:18:49,037 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 7 treesize of output 3 [2022-11-20 20:18:49,051 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 7 treesize of output 3 [2022-11-20 20:18:49,148 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 7 treesize of output 3 [2022-11-20 20:18:49,162 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 7 treesize of output 3 [2022-11-20 20:18:49,410 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:49,425 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:18:49,439 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:18:49,479 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:18:49,515 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:18:49,516 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 23 treesize of output 30 [2022-11-20 20:18:49,557 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:18:49,557 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 23 treesize of output 30 [2022-11-20 20:18:50,202 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:18:50,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:18:50,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:50,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:18:50,405 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-20 20:18:50,411 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 9 [2022-11-20 20:18:50,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:18:50,425 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 20:18:50,430 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 20:18:50,436 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 19 treesize of output 1 [2022-11-20 20:18:50,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:50,448 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 25 treesize of output 13 [2022-11-20 20:18:50,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:18:50,455 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 25 treesize of output 13 [2022-11-20 20:18:50,462 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 20:18:50,464 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:19:04,062 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8038#(and (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (not (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_68| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_76| Int)) (and (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_76|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_68| 4))) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_68| 8) (select |#length| |v_ULTIMATE.start_main_~ptr~0#1.base_76|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_76|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_68| 4)) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_76|) |v_ULTIMATE.start_main_~ptr~0#1.offset_68|)) (= (select |#valid| |v_ULTIMATE.start_main_~ptr~0#1.base_76|) 1) (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_68|))) (= (+ |ULTIMATE.start_main_~mid_index~0#1| 1) |ULTIMATE.start_main_~count~0#1|)) (and (= (select |#valid| 0) 1) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| 0) 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| 0) 4)) (<= 8 (select |#length| 0)) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| 0) 4)))) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))' at error location [2022-11-20 20:19:04,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:19:04,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:19:04,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 52 [2022-11-20 20:19:04,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38945545] [2022-11-20 20:19:04,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:19:04,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 20:19:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:19:04,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 20:19:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=7666, Unknown=14, NotChecked=176, Total=8190 [2022-11-20 20:19:04,065 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 52 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:19:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:19:06,042 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-20 20:19:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:19:06,042 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-20 20:19:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:19:06,043 INFO L225 Difference]: With dead ends: 63 [2022-11-20 20:19:06,043 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 20:19:06,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3242 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=481, Invalid=10221, Unknown=14, NotChecked=204, Total=10920 [2022-11-20 20:19:06,045 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:19:06,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 573 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 605 Invalid, 0 Unknown, 78 Unchecked, 0.6s Time] [2022-11-20 20:19:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 20:19:06,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-11-20 20:19:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.288888888888889) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:19:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-20 20:19:06,048 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 46 [2022-11-20 20:19:06,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:19:06,049 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-20 20:19:06,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:19:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-20 20:19:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 20:19:06,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:19:06,050 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:19:06,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-20 20:19:06,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 20:19:06,255 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:19:06,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:19:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash -593465271, now seen corresponding path program 1 times [2022-11-20 20:19:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:19:06,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786637937] [2022-11-20 20:19:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:19:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:19:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:19:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:19:10,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:19:10,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786637937] [2022-11-20 20:19:10,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786637937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:19:10,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716241398] [2022-11-20 20:19:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:19:10,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:19:10,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:19:10,657 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:19:10,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 20:19:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:19:10,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 184 conjunts are in the unsatisfiable core [2022-11-20 20:19:10,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:19:11,117 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:19:11,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:11,382 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 20:19:11,816 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 20:19:11,816 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 19 treesize of output 16 [2022-11-20 20:19:11,831 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 20:19:12,097 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 20:19:12,104 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 20:19:12,114 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:19:12,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:19:12,461 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 37 [2022-11-20 20:19:12,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:19:12,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:12,475 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:19:12,488 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 20:19:13,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:13,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:13,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:13,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:13,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2022-11-20 20:19:13,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:13,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:13,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:13,086 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:19:13,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 67 [2022-11-20 20:19:13,120 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 20:19:13,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 20:19:13,140 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 20:19:14,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:14,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:14,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:14,559 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-20 20:19:14,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 114 [2022-11-20 20:19:14,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:14,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:14,585 INFO L321 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2022-11-20 20:19:14,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 59 [2022-11-20 20:19:14,616 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 18 treesize of output 20 [2022-11-20 20:19:14,900 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 20:19:14,900 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 95 [2022-11-20 20:19:14,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:14,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:14,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:14,928 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 0 case distinctions, treesize of input 67 treesize of output 48 [2022-11-20 20:19:14,945 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 34 treesize of output 36 [2022-11-20 20:19:16,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:16,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:16,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:16,508 INFO L321 Elim1Store]: treesize reduction 49, result has 18.3 percent of original size [2022-11-20 20:19:16,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 198 treesize of output 89 [2022-11-20 20:19:16,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:16,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:16,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:16,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2022-11-20 20:19:16,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:19:16,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:19:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:19:16,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:19:22,784 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 9109 treesize of output 7823 [2022-11-20 20:19:45,452 WARN L233 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:19:45,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716241398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:19:45,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2110856845] [2022-11-20 20:19:45,457 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-20 20:19:45,457 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:19:45,457 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:19:45,457 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:19:45,457 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:19:45,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:19:45,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:19:45,526 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 9 [2022-11-20 20:19:45,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:19:45,536 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 19 treesize of output 1 [2022-11-20 20:19:45,540 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 20:19:45,544 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 20:19:45,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,553 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 25 treesize of output 13 [2022-11-20 20:19:45,558 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 20:19:45,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,565 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 25 treesize of output 13 [2022-11-20 20:19:45,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:19:45,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:19:45,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:19:45,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:45,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:45,718 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:19:45,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:45,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:19:45,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:45,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:19:45,869 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:19:45,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:19:46,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:46,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:19:46,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:19:46,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:19:46,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:19:46,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:19:46,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:19:46,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:46,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:46,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:19:46,286 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:19:46,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:19:46,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:46,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:19:46,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:19:46,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:19:46,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:19:46,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:19:46,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:19:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:46,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:46,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:19:46,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:46,682 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 232 treesize of output 212 [2022-11-20 20:19:46,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:46,694 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:19:46,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:46,707 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 0 case distinctions, treesize of input 236 treesize of output 224 [2022-11-20 20:19:46,846 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:19:46,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:19:47,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:47,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:19:47,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:19:47,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:19:47,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:19:47,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:19:47,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:19:47,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:47,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:47,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:19:47,234 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:19:47,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:19:47,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:47,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:19:47,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:19:47,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:19:47,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:19:47,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:19:47,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:19:47,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:47,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:47,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:19:47,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:47,658 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 232 treesize of output 212 [2022-11-20 20:19:47,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:47,671 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:19:47,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:47,685 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 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-20 20:19:47,829 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 7 treesize of output 3 [2022-11-20 20:19:47,840 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 7 treesize of output 3 [2022-11-20 20:19:47,923 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 7 treesize of output 3 [2022-11-20 20:19:47,942 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 7 treesize of output 3 [2022-11-20 20:19:48,166 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:19:48,189 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:19:48,204 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:19:48,284 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:19:48,284 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 23 treesize of output 30 [2022-11-20 20:19:48,313 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:19:48,372 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:19:48,372 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 23 treesize of output 30 [2022-11-20 20:19:49,239 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:19:49,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:19:49,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:49,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:19:49,440 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 22 for LOIs [2022-11-20 20:19:49,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:19:49,455 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 9 [2022-11-20 20:19:49,473 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 19 treesize of output 1 [2022-11-20 20:19:49,478 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 20:19:49,484 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 20:19:49,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:49,501 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 25 treesize of output 13 [2022-11-20 20:19:49,507 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 20:19:49,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:49,514 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 25 treesize of output 13 [2022-11-20 20:19:49,518 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:20:14,483 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8504#(and (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~3#1.base|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~temp~3#1.offset|) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (or (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_83| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~ptr~0#1.base_83|) 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_83|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_75| 4))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_83|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_75| 4)) |ULTIMATE.start_main_~ptr~0#1.base|) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_75| 8) (select |#length| |v_ULTIMATE.start_main_~ptr~0#1.base_83|)) (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_75|) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_83|) |v_ULTIMATE.start_main_~ptr~0#1.offset_75|)))) (= (+ |ULTIMATE.start_main_~mid_index~0#1| 1) |ULTIMATE.start_main_~count~0#1|)) (and (= (select |#valid| 0) 1) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| 0) 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| 0) 4)) (<= 8 (select |#length| 0)) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| 0) 4)))) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (not (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))' at error location [2022-11-20 20:20:14,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:20:14,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:20:14,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 64 [2022-11-20 20:20:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360302709] [2022-11-20 20:20:14,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:20:14,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-20 20:20:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:20:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-20 20:20:14,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=11205, Unknown=1, NotChecked=0, Total=11556 [2022-11-20 20:20:14,486 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 64 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 55 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:20:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:20:27,422 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-11-20 20:20:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 20:20:27,422 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 55 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2022-11-20 20:20:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:20:27,423 INFO L225 Difference]: With dead ends: 86 [2022-11-20 20:20:27,423 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 20:20:27,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4048 ImplicationChecksByTransitivity, 69.1s TimeCoverageRelationStatistics Valid=507, Invalid=15494, Unknown=1, NotChecked=0, Total=16002 [2022-11-20 20:20:27,425 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:20:27,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 791 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1392 Invalid, 0 Unknown, 165 Unchecked, 1.6s Time] [2022-11-20 20:20:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 20:20:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-11-20 20:20:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 states have internal predecessors, (83), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 20:20:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-11-20 20:20:27,429 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 48 [2022-11-20 20:20:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:20:27,430 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-11-20 20:20:27,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 55 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:20:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-11-20 20:20:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 20:20:27,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:20:27,431 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:20:27,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 20:20:27,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:20:27,638 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:20:27,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:20:27,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1217553700, now seen corresponding path program 1 times [2022-11-20 20:20:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:20:27,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944264912] [2022-11-20 20:20:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:27,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:20:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:20:32,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:20:32,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944264912] [2022-11-20 20:20:32,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944264912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:20:32,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062689021] [2022-11-20 20:20:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:20:32,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:20:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:20:32,876 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:20:32,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 20:20:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:20:33,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 196 conjunts are in the unsatisfiable core [2022-11-20 20:20:33,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:20:33,324 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:20:33,330 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:20:33,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:33,419 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 20:20:33,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:33,425 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 20:20:33,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:33,749 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 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:20:33,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:33,759 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 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:20:34,367 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:20:34,368 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 16 treesize of output 22 [2022-11-20 20:20:34,374 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 7 treesize of output 3 [2022-11-20 20:20:34,393 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:20:34,394 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 16 treesize of output 22 [2022-11-20 20:20:34,401 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 7 treesize of output 3 [2022-11-20 20:20:34,429 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:20:34,429 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 20:20:34,718 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 20:20:34,729 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 27 treesize of output 26 [2022-11-20 20:20:35,103 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:20:35,103 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 41 [2022-11-20 20:20:35,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:35,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:20:35,117 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:20:35,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:20:35,138 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 20:20:35,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:35,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:35,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:35,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:35,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:35,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:20:35,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 59 [2022-11-20 20:20:35,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:35,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:35,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:35,693 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-20 20:20:35,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 80 [2022-11-20 20:20:35,734 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 20:20:35,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 20:20:37,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:37,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:37,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:37,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:37,298 INFO L321 Elim1Store]: treesize reduction 74, result has 21.3 percent of original size [2022-11-20 20:20:37,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 180 treesize of output 123 [2022-11-20 20:20:37,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:37,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:37,331 INFO L321 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2022-11-20 20:20:37,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 71 [2022-11-20 20:20:37,662 INFO L321 Elim1Store]: treesize reduction 116, result has 15.9 percent of original size [2022-11-20 20:20:37,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 214 treesize of output 114 [2022-11-20 20:20:37,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:37,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:37,697 INFO L321 Elim1Store]: treesize reduction 73, result has 8.8 percent of original size [2022-11-20 20:20:37,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 203 treesize of output 144 [2022-11-20 20:20:39,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:39,522 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-20 20:20:40,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:40,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:40,335 INFO L321 Elim1Store]: treesize reduction 174, result has 9.4 percent of original size [2022-11-20 20:20:40,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 252 treesize of output 111 [2022-11-20 20:20:40,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:40,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:40,360 INFO L321 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2022-11-20 20:20:40,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 30 [2022-11-20 20:20:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:20:40,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:20:49,963 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 22405 treesize of output 19833 [2022-11-20 20:20:53,819 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 0)) (forall ((v_ArrVal_3223 Int) (v_ArrVal_3224 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3224))) (.cse13 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3223)))) (let ((.cse8 (+ (select (select .cse13 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse2 (let ((.cse12 (select .cse13 .cse10))) (let ((.cse11 (store .cse13 .cse10 (store .cse12 .cse8 0)))) (store .cse11 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse11 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse12 .cse8))))))) (let ((.cse3 (let ((.cse7 (select .cse9 .cse10))) (let ((.cse6 (store .cse9 .cse10 (store .cse7 .cse8 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))) (store .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse7 .cse8)))))) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse0 4)))) (or (not (<= 0 .cse0)) (forall ((v_subst_3 Int)) (let ((.cse5 (+ 4 v_subst_3))) (let ((.cse1 (select (select .cse2 .cse4) .cse5))) (or (= .cse1 0) (not (<= 0 v_subst_3)) (not (<= 0 .cse1)) (= (select (select .cse2 (select (select .cse3 .cse4) .cse5)) (+ .cse1 4)) 0))))) (= .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| Int)) (or (forall ((v_ArrVal_3223 Int) (v_ArrVal_3224 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3224))) (.cse28 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3223)))) (let ((.cse23 (+ (select (select .cse28 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4)) (.cse25 (select (select .cse24 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse18 (let ((.cse27 (select .cse28 .cse25))) (let ((.cse26 (store .cse28 .cse25 (store .cse27 .cse23 0)))) (store .cse26 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse26 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse27 .cse23))))))) (let ((.cse16 (let ((.cse22 (select .cse24 .cse25))) (let ((.cse21 (store .cse24 .cse25 (store .cse22 .cse23 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))) (store .cse21 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse21 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse22 .cse23)))))) (.cse14 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse14 4)))) (or (not (<= 0 .cse14)) (forall ((v_subst_6 Int)) (let ((.cse20 (+ 4 v_subst_6))) (let ((.cse15 (select (select .cse16 .cse19) .cse20)) (.cse17 (select (select .cse18 .cse19) .cse20))) (or (not (<= 0 v_subst_6)) (= .cse15 0) (= (select (select .cse16 .cse15) (+ .cse17 4)) 0) (not (<= 0 .cse17)))))) (= .cse19 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 0)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| Int)) (or (forall ((v_ArrVal_3223 Int) (v_ArrVal_3224 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3224))) (.cse43 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3223)))) (let ((.cse38 (+ (select (select .cse43 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4)) (.cse40 (select (select .cse39 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse31 (let ((.cse42 (select .cse43 .cse40))) (let ((.cse41 (store .cse43 .cse40 (store .cse42 .cse38 0)))) (store .cse41 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse41 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse42 .cse38))))))) (let ((.cse29 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse29)) (forall ((v_subst_4 Int)) (let ((.cse33 (let ((.cse37 (select .cse39 .cse40))) (let ((.cse36 (store .cse39 .cse40 (store .cse37 .cse38 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))) (store .cse36 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse36 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse37 .cse38))))))) (let ((.cse34 (select (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse29 4))) (.cse35 (+ 4 v_subst_4))) (let ((.cse30 (select (select .cse31 .cse34) .cse35)) (.cse32 (select (select .cse33 .cse34) .cse35))) (or (not (<= 0 .cse30)) (< 0 v_subst_4) (not (<= 0 v_subst_4)) (= (select (select .cse31 .cse32) (+ .cse30 4)) 0) (= .cse32 0)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 0)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| Int)) (or (forall ((v_ArrVal_3223 Int) (v_ArrVal_3224 Int)) (let ((.cse53 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3224))) (.cse57 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3223)))) (let ((.cse52 (+ (select (select .cse57 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4)) (.cse54 (select (select .cse53 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse46 (let ((.cse56 (select .cse57 .cse54))) (let ((.cse55 (store .cse57 .cse54 (store .cse56 .cse52 0)))) (store .cse55 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse55 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse56 .cse52))))))) (let ((.cse44 (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse44)) (forall ((v_subst_3 Int)) (let ((.cse47 (let ((.cse51 (select .cse53 .cse54))) (let ((.cse50 (store .cse53 .cse54 (store .cse51 .cse52 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))) (store .cse50 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse50 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse51 .cse52))))))) (let ((.cse48 (select (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse44 4))) (.cse49 (+ 4 v_subst_3))) (let ((.cse45 (select (select .cse46 .cse48) .cse49))) (or (= .cse45 0) (not (<= 0 v_subst_3)) (not (<= 0 .cse45)) (< 0 v_subst_3) (= (select (select .cse46 (select (select .cse47 .cse48) .cse49)) (+ .cse45 4)) 0)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 0)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| Int)) (or (forall ((v_ArrVal_3223 Int) (v_ArrVal_3224 Int)) (let ((.cse67 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3224))) (.cse71 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3223)))) (let ((.cse66 (+ (select (select .cse71 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4)) (.cse68 (select (select .cse67 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse63 (let ((.cse70 (select .cse71 .cse68))) (let ((.cse69 (store .cse71 .cse68 (store .cse70 .cse66 0)))) (store .cse69 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse69 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse70 .cse66))))))) (let ((.cse58 (select (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse58)) (forall ((v_subst_5 Int)) (let ((.cse60 (let ((.cse65 (select .cse67 .cse68))) (let ((.cse64 (store .cse67 .cse68 (store .cse65 .cse66 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))) (store .cse64 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse64 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse65 .cse66))))))) (let ((.cse61 (select (select .cse60 (select (select .cse60 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse58 4))) (.cse62 (+ 4 v_subst_5))) (let ((.cse59 (select (select .cse63 .cse61) .cse62))) (or (not (<= 0 .cse59)) (< 0 v_subst_5) (= (select (select .cse60 (select (select .cse60 .cse61) .cse62)) (+ .cse59 4)) 0) (not (<= 0 v_subst_5)) (= .cse59 0)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 0)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| Int)) (or (forall ((v_ArrVal_3223 Int) (v_ArrVal_3224 Int)) (let ((.cse82 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3224))) (.cse86 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3223)))) (let ((.cse81 (+ (select (select .cse86 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4)) (.cse83 (select (select .cse82 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse76 (let ((.cse85 (select .cse86 .cse83))) (let ((.cse84 (store .cse86 .cse83 (store .cse85 .cse81 0)))) (store .cse84 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse84 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse85 .cse81))))))) (let ((.cse72 (select (select .cse76 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse72)) (forall ((v_subst_6 Int)) (let ((.cse74 (let ((.cse80 (select .cse82 .cse83))) (let ((.cse79 (store .cse82 .cse83 (store .cse80 .cse81 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))) (store .cse79 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse79 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse80 .cse81))))))) (let ((.cse77 (select (select .cse74 (select (select .cse74 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse72 4))) (.cse78 (+ 4 v_subst_6))) (let ((.cse73 (select (select .cse74 .cse77) .cse78)) (.cse75 (select (select .cse76 .cse77) .cse78))) (or (not (<= 0 v_subst_6)) (= .cse73 0) (= (select (select .cse74 .cse73) (+ .cse75 4)) 0) (< 0 v_subst_6) (not (<= 0 .cse75))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 0)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| Int)) (or (forall ((v_ArrVal_3223 Int) (v_ArrVal_3224 Int)) (let ((.cse97 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3224))) (.cse101 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3223)))) (let ((.cse96 (+ (select (select .cse101 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4)) (.cse98 (select (select .cse97 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse90 (let ((.cse100 (select .cse101 .cse98))) (let ((.cse99 (store .cse101 .cse98 (store .cse100 .cse96 0)))) (store .cse99 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse99 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse100 .cse96))))))) (let ((.cse92 (let ((.cse95 (select .cse97 .cse98))) (let ((.cse94 (store .cse97 .cse98 (store .cse95 .cse96 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))) (store .cse94 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse94 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse95 .cse96)))))) (.cse87 (select (select .cse90 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse88 (select (select .cse92 (select (select .cse92 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse87 4)))) (or (not (<= 0 .cse87)) (= .cse88 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) (forall ((v_subst_4 Int)) (let ((.cse93 (+ 4 v_subst_4))) (let ((.cse89 (select (select .cse90 .cse88) .cse93)) (.cse91 (select (select .cse92 .cse88) .cse93))) (or (not (<= 0 .cse89)) (not (<= 0 v_subst_4)) (= (select (select .cse90 .cse91) (+ .cse89 4)) 0) (= .cse91 0)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 0)))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 0)) (forall ((v_ArrVal_3223 Int) (v_ArrVal_3224 Int)) (let ((.cse111 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3224))) (.cse115 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 0) 0 v_ArrVal_3223)))) (let ((.cse110 (+ (select (select .cse115 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4)) (.cse112 (select (select .cse111 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse106 (let ((.cse114 (select .cse115 .cse112))) (let ((.cse113 (store .cse115 .cse112 (store .cse114 .cse110 0)))) (store .cse113 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse113 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse114 .cse110))))))) (let ((.cse103 (let ((.cse109 (select .cse111 .cse112))) (let ((.cse108 (store .cse111 .cse112 (store .cse109 .cse110 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|)))) (store .cse108 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71| (store (select .cse108 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|) 4 (select .cse109 .cse110)))))) (.cse107 (select (select .cse106 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse104 (select (select .cse103 (select (select .cse103 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse107 4)))) (or (forall ((v_subst_5 Int)) (let ((.cse105 (+ 4 v_subst_5))) (let ((.cse102 (select (select .cse106 .cse104) .cse105))) (or (not (<= 0 .cse102)) (= (select (select .cse103 (select (select .cse103 .cse104) .cse105)) (+ .cse102 4)) 0) (not (<= 0 v_subst_5)) (= .cse102 0))))) (not (<= 0 .cse107)) (= .cse104 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_71|))))))))))) is different from true [2022-11-20 20:20:53,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062689021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:20:53,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1083147738] [2022-11-20 20:20:53,824 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-20 20:20:53,824 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:20:53,824 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:20:53,824 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:20:53,825 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:20:53,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:20:53,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:20:53,888 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 9 [2022-11-20 20:20:53,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:20:53,897 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 20:20:53,902 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 19 treesize of output 1 [2022-11-20 20:20:53,906 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 20:20:53,914 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 20:20:53,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,921 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 25 treesize of output 13 [2022-11-20 20:20:53,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,927 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 25 treesize of output 13 [2022-11-20 20:20:53,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:20:53,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:20:53,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:53,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:20:54,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:54,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:54,065 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:20:54,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:54,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:20:54,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:54,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:20:54,212 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:20:54,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:20:54,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:54,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:20:54,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:20:54,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:20:54,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:20:54,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:20:54,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:20:54,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:54,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:54,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:20:54,633 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:20:54,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:20:54,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:54,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:20:54,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:20:54,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:20:54,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:20:54,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:20:54,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:20:54,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:54,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:54,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:20:55,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:55,018 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 232 treesize of output 212 [2022-11-20 20:20:55,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:55,032 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:20:55,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:55,048 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 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-20 20:20:55,182 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:20:55,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:20:55,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:55,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:20:55,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:55,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:55,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:20:55,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:20:55,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:20:55,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:20:55,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:20:55,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:20:55,614 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:20:55,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:20:55,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:55,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:20:55,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:55,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:55,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:20:55,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:20:55,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:20:55,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:20:55,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:20:55,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:20:56,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:56,034 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 232 treesize of output 212 [2022-11-20 20:20:56,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:56,048 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:20:56,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:20:56,061 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 0 case distinctions, treesize of input 236 treesize of output 224 [2022-11-20 20:20:56,196 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 7 treesize of output 3 [2022-11-20 20:20:56,210 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 7 treesize of output 3 [2022-11-20 20:20:56,309 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 7 treesize of output 3 [2022-11-20 20:20:56,328 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 7 treesize of output 3 [2022-11-20 20:20:56,506 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:20:56,516 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:20:56,526 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:20:56,580 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:20:56,581 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 23 treesize of output 30 [2022-11-20 20:20:56,600 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:20:56,639 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:20:56,639 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 23 treesize of output 30 [2022-11-20 20:20:57,416 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:20:57,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:20:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:57,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:20:57,619 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-20 20:20:57,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:20:57,630 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 9 [2022-11-20 20:20:57,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:20:57,646 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 20:20:57,652 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 20:20:57,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:57,664 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 25 treesize of output 13 [2022-11-20 20:20:57,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:20:57,672 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 25 treesize of output 13 [2022-11-20 20:20:57,679 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 20:20:57,681 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:21:13,142 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9045#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:21:13,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:21:13,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:21:13,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 68 [2022-11-20 20:21:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434912556] [2022-11-20 20:21:13,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:21:13,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-20 20:21:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:13,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-20 20:21:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=12046, Unknown=2, NotChecked=220, Total=12656 [2022-11-20 20:21:13,144 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 68 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:21:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:20,092 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-20 20:21:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 20:21:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2022-11-20 20:21:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:20,094 INFO L225 Difference]: With dead ends: 105 [2022-11-20 20:21:20,094 INFO L226 Difference]: Without dead ends: 105 [2022-11-20 20:21:20,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4882 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=573, Invalid=17518, Unknown=3, NotChecked=266, Total=18360 [2022-11-20 20:21:20,095 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:20,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 808 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1188 Invalid, 0 Unknown, 210 Unchecked, 1.7s Time] [2022-11-20 20:21:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-20 20:21:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2022-11-20 20:21:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.2) internal successors, (84), 79 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 20:21:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-11-20 20:21:20,100 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 49 [2022-11-20 20:21:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:20,101 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-11-20 20:21:20,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 20:21:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-11-20 20:21:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 20:21:20,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:20,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:20,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:20,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-20 20:21:20,311 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:21:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 910633877, now seen corresponding path program 1 times [2022-11-20 20:21:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:20,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726668099] [2022-11-20 20:21:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 20:21:20,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:20,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726668099] [2022-11-20 20:21:20,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726668099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:21:20,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746532826] [2022-11-20 20:21:20,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:20,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:20,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:21:20,489 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:21:20,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 20:21:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:20,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:21:20,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 20:21:20,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:21:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 20:21:21,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746532826] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:21:21,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [220727179] [2022-11-20 20:21:21,054 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-20 20:21:21,055 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:21:21,055 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:21:21,055 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:21:21,056 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:21:21,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:21:21,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:21:21,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:21:21,136 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 9 [2022-11-20 20:21:21,144 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 20:21:21,150 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 19 treesize of output 1 [2022-11-20 20:21:21,155 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 20:21:21,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,167 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 25 treesize of output 13 [2022-11-20 20:21:21,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,174 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 25 treesize of output 13 [2022-11-20 20:21:21,180 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 20:21:21,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:21,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:21:21,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:21,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:21,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,361 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 209 [2022-11-20 20:21:21,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:21,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 209 [2022-11-20 20:21:21,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:21,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 109 [2022-11-20 20:21:21,514 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:21,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:21:21,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:21,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:21,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:21,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:21,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:21,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:21,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:21,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:21,936 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:21,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:21:22,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:22,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:22,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:22,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:22,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:22,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:22,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:22,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:22,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:22,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:22,276 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:22,284 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:22,294 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:21:22,384 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:21:22,391 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:22,401 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:22,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:22,507 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 27 treesize of output 11 [2022-11-20 20:21:22,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:22,537 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 13 [2022-11-20 20:21:22,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:22,546 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 13 [2022-11-20 20:21:22,717 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:21:22,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 236 [2022-11-20 20:21:23,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:23,319 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 934 treesize of output 940 [2022-11-20 20:21:23,621 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 7 treesize of output 3 [2022-11-20 20:21:23,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:23,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 205 [2022-11-20 20:21:23,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:23,706 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 161 [2022-11-20 20:21:23,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:23,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:23,734 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 160 treesize of output 144 [2022-11-20 20:21:23,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:24,700 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:21:24,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 236 [2022-11-20 20:21:25,007 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 5 treesize of output 3 [2022-11-20 20:21:25,125 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 7 treesize of output 3 [2022-11-20 20:21:25,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:25,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 205 [2022-11-20 20:21:25,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:25,213 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 161 [2022-11-20 20:21:25,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:25,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:25,240 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 160 treesize of output 144 [2022-11-20 20:21:25,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:25,673 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:25,689 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:21:25,700 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:25,724 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:21:25,766 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:21:25,766 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 23 treesize of output 30 [2022-11-20 20:21:25,813 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:21:25,813 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 23 treesize of output 30 [2022-11-20 20:21:26,676 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:21:26,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 236 [2022-11-20 20:21:27,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:27,118 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 692 treesize of output 698 [2022-11-20 20:21:27,736 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-20 20:21:27,744 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 9 [2022-11-20 20:21:27,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:21:27,763 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 20:21:27,770 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 19 treesize of output 1 [2022-11-20 20:21:27,777 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 20:21:27,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:27,791 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 25 treesize of output 13 [2022-11-20 20:21:27,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:27,800 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 25 treesize of output 13 [2022-11-20 20:21:27,809 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 20:21:27,811 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:21:34,083 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9617#(and (<= 1 |ULTIMATE.start_main_~count~0#1|) (not (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:21:34,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:21:34,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:21:34,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-20 20:21:34,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556797220] [2022-11-20 20:21:34,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:21:34,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:21:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:34,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:21:34,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1429, Unknown=0, NotChecked=0, Total=1640 [2022-11-20 20:21:34,085 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:21:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:34,248 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-11-20 20:21:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:21:34,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-11-20 20:21:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:34,249 INFO L225 Difference]: With dead ends: 99 [2022-11-20 20:21:34,249 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 20:21:34,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=211, Invalid=1429, Unknown=0, NotChecked=0, Total=1640 [2022-11-20 20:21:34,250 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 95 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:34,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 254 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:21:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 20:21:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2022-11-20 20:21:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 82 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 20:21:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2022-11-20 20:21:34,255 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 50 [2022-11-20 20:21:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:34,255 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2022-11-20 20:21:34,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:21:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2022-11-20 20:21:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 20:21:34,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:34,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:34,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-20 20:21:34,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:34,463 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:21:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1054082416, now seen corresponding path program 1 times [2022-11-20 20:21:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:34,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434924324] [2022-11-20 20:21:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:21:34,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:34,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434924324] [2022-11-20 20:21:34,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434924324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:21:34,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675211266] [2022-11-20 20:21:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:34,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:34,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:21:34,593 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:21:34,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 20:21:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:34,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:21:34,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:34,939 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 17 treesize of output 9 [2022-11-20 20:21:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:21:34,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:21:34,980 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-20 20:21:34,981 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 16 treesize of output 15 [2022-11-20 20:21:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:21:34,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675211266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:21:34,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [516694472] [2022-11-20 20:21:34,998 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-20 20:21:34,998 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:21:34,999 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:21:34,999 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:21:34,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:21:35,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:21:35,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:21:35,069 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 9 [2022-11-20 20:21:35,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:21:35,080 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 20:21:35,085 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 20:21:35,091 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 19 treesize of output 1 [2022-11-20 20:21:35,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,101 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 25 treesize of output 13 [2022-11-20 20:21:35,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,108 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 25 treesize of output 13 [2022-11-20 20:21:35,114 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 20:21:35,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:35,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:21:35,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:35,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:35,232 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 13 [2022-11-20 20:21:35,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,245 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 27 treesize of output 11 [2022-11-20 20:21:35,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:35,257 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 13 [2022-11-20 20:21:35,362 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:35,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:35,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:35,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:35,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:35,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:35,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:35,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:35,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:35,756 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:35,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:35,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:36,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:36,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:36,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:36,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:36,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:36,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,150 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 229 treesize of output 209 [2022-11-20 20:21:36,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:36,163 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:21:36,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:36,178 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 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-20 20:21:36,307 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:36,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:36,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:36,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:36,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:36,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:36,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:36,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:36,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:36,710 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:36,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:36,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:36,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:36,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:36,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:36,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:36,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:36,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:36,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:37,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:37,087 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 229 treesize of output 209 [2022-11-20 20:21:37,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:37,101 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:21:37,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:37,114 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 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-20 20:21:37,236 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 7 treesize of output 3 [2022-11-20 20:21:37,248 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 7 treesize of output 3 [2022-11-20 20:21:37,332 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 7 treesize of output 3 [2022-11-20 20:21:37,351 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 7 treesize of output 3 [2022-11-20 20:21:37,517 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:37,528 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:21:37,541 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:37,601 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:21:37,601 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 23 treesize of output 30 [2022-11-20 20:21:37,617 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:21:37,661 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:21:37,661 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 23 treesize of output 30 [2022-11-20 20:21:38,432 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:38,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:38,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:38,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:38,618 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-20 20:21:38,624 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 9 [2022-11-20 20:21:38,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:21:38,640 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 20:21:38,645 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 19 treesize of output 1 [2022-11-20 20:21:38,650 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 20:21:38,662 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 20:21:38,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:38,669 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 25 treesize of output 13 [2022-11-20 20:21:38,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:38,677 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 25 treesize of output 13 [2022-11-20 20:21:38,679 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:21:46,385 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10147#(and (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_destroy_#in~head#1.offset| |ULTIMATE.start_main_#t~mem22#1.offset|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (= |ULTIMATE.start_main_#t~mem22#1.base| |ULTIMATE.start_sll_destroy_#in~head#1.base|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_destroy_~head#1.base| |ULTIMATE.start_sll_destroy_#in~head#1.base|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (not (= (select |#valid| |ULTIMATE.start_sll_destroy_~head#1.base|) 1)) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_#t~mem22#1.offset|) (or (not (= |ULTIMATE.start_sll_destroy_~head#1.base| 0)) (not (= |ULTIMATE.start_sll_destroy_~head#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_destroy_#in~head#1.offset| |ULTIMATE.start_sll_destroy_~head#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:21:46,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:21:46,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:21:46,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-11-20 20:21:46,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794205027] [2022-11-20 20:21:46,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:21:46,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:21:46,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:46,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:21:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2022-11-20 20:21:46,387 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:21:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:46,534 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-11-20 20:21:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:21:46,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-11-20 20:21:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:46,535 INFO L225 Difference]: With dead ends: 96 [2022-11-20 20:21:46,536 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 20:21:46,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 20:21:46,536 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:46,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 98 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:21:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 20:21:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-20 20:21:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 83 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 20:21:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-11-20 20:21:46,541 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 52 [2022-11-20 20:21:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:46,541 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-11-20 20:21:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:21:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-11-20 20:21:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 20:21:46,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:46,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:46,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:46,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:46,750 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:21:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1054082415, now seen corresponding path program 1 times [2022-11-20 20:21:46,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:46,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263467470] [2022-11-20 20:21:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:21:46,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:46,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263467470] [2022-11-20 20:21:46,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263467470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:21:46,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553373538] [2022-11-20 20:21:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:21:46,981 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:21:46,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 20:21:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:47,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 20:21:47,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:47,402 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 23 treesize of output 15 [2022-11-20 20:21:47,404 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 26 treesize of output 14 [2022-11-20 20:21:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:21:47,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:21:47,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:21:47,554 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 34 treesize of output 38 [2022-11-20 20:21:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:21:47,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553373538] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:21:47,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [523033386] [2022-11-20 20:21:47,623 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-20 20:21:47,623 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:21:47,623 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:21:47,624 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:21:47,624 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:21:47,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:21:47,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:21:47,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:21:47,700 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 9 [2022-11-20 20:21:47,707 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 19 treesize of output 1 [2022-11-20 20:21:47,712 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 20:21:47,716 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 20:21:47,724 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 20:21:47,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,730 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 25 treesize of output 13 [2022-11-20 20:21:47,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,737 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 25 treesize of output 13 [2022-11-20 20:21:47,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:47,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:21:47,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:47,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:47,863 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 13 [2022-11-20 20:21:47,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:47,874 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 27 treesize of output 11 [2022-11-20 20:21:47,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:47,887 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 13 [2022-11-20 20:21:48,000 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:48,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:48,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:48,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:48,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:48,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:48,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:48,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:48,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:48,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:48,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:48,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:48,404 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:48,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:48,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:48,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:48,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:48,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:48,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:48,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:48,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:48,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:48,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:48,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:48,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:48,794 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 229 treesize of output 209 [2022-11-20 20:21:48,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:48,807 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:21:48,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:48,820 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 0 case distinctions, treesize of input 233 treesize of output 221 [2022-11-20 20:21:48,952 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:48,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:49,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:49,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:49,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:49,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:49,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:49,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:49,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:49,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:49,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:49,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:49,331 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:49,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:49,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:49,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:49,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:21:49,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:49,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:49,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:21:49,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:21:49,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:49,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:49,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:21:49,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:49,736 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 229 treesize of output 209 [2022-11-20 20:21:49,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:49,749 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:21:49,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:49,762 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 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-20 20:21:49,876 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 7 treesize of output 3 [2022-11-20 20:21:49,887 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 7 treesize of output 3 [2022-11-20 20:21:49,972 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 7 treesize of output 3 [2022-11-20 20:21:49,983 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 7 treesize of output 3 [2022-11-20 20:21:50,222 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:50,234 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:21:50,246 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:21:50,309 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:21:50,309 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 23 treesize of output 30 [2022-11-20 20:21:50,362 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:21:50,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-11-20 20:21:50,379 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:21:51,451 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:21:51,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:21:51,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:51,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:21:51,637 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-20 20:21:51,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:21:51,648 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 9 [2022-11-20 20:21:51,658 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 19 treesize of output 1 [2022-11-20 20:21:51,664 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 20:21:51,669 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 20:21:51,679 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 20:21:51,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:51,686 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 25 treesize of output 13 [2022-11-20 20:21:51,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:51,693 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 25 treesize of output 13 [2022-11-20 20:21:51,696 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:22:03,584 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10685#(and (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 0 |ULTIMATE.start_sll_insert_~new_node~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_sll_destroy_#in~head#1.offset| |ULTIMATE.start_main_#t~mem22#1.offset|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (= |ULTIMATE.start_main_#t~mem22#1.base| |ULTIMATE.start_sll_destroy_#in~head#1.base|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_destroy_~head#1.base| |ULTIMATE.start_sll_destroy_#in~head#1.base|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (or (not (<= (+ 8 |ULTIMATE.start_sll_destroy_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_destroy_~head#1.base|))) (not (<= 0 (+ |ULTIMATE.start_sll_destroy_~head#1.offset| 4)))) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_#t~mem22#1.offset|) (or (not (= |ULTIMATE.start_sll_destroy_~head#1.base| 0)) (not (= |ULTIMATE.start_sll_destroy_~head#1.offset| 0))) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_destroy_#in~head#1.offset| |ULTIMATE.start_sll_destroy_~head#1.offset|))' at error location [2022-11-20 20:22:03,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:22:03,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:22:03,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 20:22:03,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056604106] [2022-11-20 20:22:03,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:22:03,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:22:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:22:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1714, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 20:22:03,588 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:22:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:03,872 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2022-11-20 20:22:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:22:03,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-11-20 20:22:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:03,873 INFO L225 Difference]: With dead ends: 94 [2022-11-20 20:22:03,874 INFO L226 Difference]: Without dead ends: 94 [2022-11-20 20:22:03,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=210, Invalid=2046, Unknown=0, NotChecked=0, Total=2256 [2022-11-20 20:22:03,874 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 72 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:03,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 91 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:22:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-20 20:22:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-11-20 20:22:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 83 states have internal predecessors, (91), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 20:22:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-11-20 20:22:03,879 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 52 [2022-11-20 20:22:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:03,879 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-11-20 20:22:03,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:22:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-11-20 20:22:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 20:22:03,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:03,881 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:03,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:04,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 20:22:04,087 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:22:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1054080539, now seen corresponding path program 1 times [2022-11-20 20:22:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:04,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427582644] [2022-11-20 20:22:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:22:04,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:04,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427582644] [2022-11-20 20:22:04,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427582644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:04,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345501073] [2022-11-20 20:22:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:04,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:04,213 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:04,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 20:22:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:04,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 20:22:04,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:04,603 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 25 treesize of output 17 [2022-11-20 20:22:04,606 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 21 treesize of output 13 [2022-11-20 20:22:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:22:04,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:22:04,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345501073] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:04,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:22:04,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2022-11-20 20:22:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544949618] [2022-11-20 20:22:04,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:22:04,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:22:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:22:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:22:04,717 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:22:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:04,803 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-11-20 20:22:04,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:22:04,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-11-20 20:22:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:04,807 INFO L225 Difference]: With dead ends: 90 [2022-11-20 20:22:04,807 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 20:22:04,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:22:04,808 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:04,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 68 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:22:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 20:22:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-20 20:22:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.2) internal successors, (90), 83 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 20:22:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-11-20 20:22:04,811 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 52 [2022-11-20 20:22:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:04,811 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-11-20 20:22:04,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 20:22:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-11-20 20:22:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 20:22:04,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:04,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:04,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:05,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:05,023 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:22:05,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1683185234, now seen corresponding path program 1 times [2022-11-20 20:22:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:05,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274239109] [2022-11-20 20:22:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:22:05,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:05,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274239109] [2022-11-20 20:22:05,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274239109] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:05,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263246508] [2022-11-20 20:22:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:05,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:05,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:05,949 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:05,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 20:22:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:06,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-20 20:22:06,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:06,580 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 7 treesize of output 3 [2022-11-20 20:22:06,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:06,768 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 20:22:06,907 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 20:22:06,907 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 21 treesize of output 20 [2022-11-20 20:22:10,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:10,991 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:22:10,991 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 2 case distinctions, treesize of input 23 treesize of output 32 [2022-11-20 20:22:11,028 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 20:22:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 20:22:11,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:22:11,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263246508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:22:11,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:22:11,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [19] total 32 [2022-11-20 20:22:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875977046] [2022-11-20 20:22:11,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:22:11,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 20:22:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:11,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 20:22:11,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=949, Unknown=4, NotChecked=0, Total=1056 [2022-11-20 20:22:11,036 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 18 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 20:22:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:13,301 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-11-20 20:22:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:22:13,302 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-11-20 20:22:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:13,303 INFO L225 Difference]: With dead ends: 91 [2022-11-20 20:22:13,303 INFO L226 Difference]: Without dead ends: 91 [2022-11-20 20:22:13,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=126, Invalid=1202, Unknown=4, NotChecked=0, Total=1332 [2022-11-20 20:22:13,304 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:13,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 277 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2022-11-20 20:22:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-20 20:22:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-20 20:22:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 84 states have internal predecessors, (91), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 20:22:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-11-20 20:22:13,308 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 53 [2022-11-20 20:22:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:13,309 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-11-20 20:22:13,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 20:22:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-11-20 20:22:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 20:22:13,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:13,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:13,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-20 20:22:13,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 20:22:13,519 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:22:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash 639134885, now seen corresponding path program 1 times [2022-11-20 20:22:13,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:13,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392385598] [2022-11-20 20:22:13,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:13,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:22:14,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:14,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392385598] [2022-11-20 20:22:14,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392385598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:14,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267361729] [2022-11-20 20:22:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:14,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:14,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:14,359 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:14,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 20:22:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:14,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 20:22:14,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:14,981 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 9 treesize of output 5 [2022-11-20 20:22:15,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:15,086 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 16 treesize of output 18 [2022-11-20 20:22:15,405 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:22:15,405 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 20 treesize of output 23 [2022-11-20 20:22:15,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:15,465 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 16 treesize of output 18 [2022-11-20 20:22:15,615 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 17 treesize of output 9 [2022-11-20 20:22:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 20:22:15,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:15,713 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4051 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_4051) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-20 20:22:16,014 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_85| Int)) (or (forall ((v_ArrVal_4055 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_85| v_ArrVal_4055) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_85| |c_#StackHeapBarrier|)))) (not (< |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_85| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_85| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4055 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_85| v_ArrVal_4055) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-20 20:22:16,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267361729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:16,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [987649121] [2022-11-20 20:22:16,018 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-20 20:22:16,018 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:22:16,019 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:22:16,019 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:22:16,019 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:22:16,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:22:16,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:22:16,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:22:16,092 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 9 [2022-11-20 20:22:16,098 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 19 treesize of output 1 [2022-11-20 20:22:16,103 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 20:22:16,108 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 20:22:16,116 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 20:22:16,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,122 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 25 treesize of output 13 [2022-11-20 20:22:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,130 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 25 treesize of output 13 [2022-11-20 20:22:16,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:16,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:22:16,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:16,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:16,240 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 13 [2022-11-20 20:22:16,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:16,252 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 13 [2022-11-20 20:22:16,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,265 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 27 treesize of output 11 [2022-11-20 20:22:16,377 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:16,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:16,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:16,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:16,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:16,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:16,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:22:16,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:22:16,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:16,755 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:16,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:16,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:16,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:17,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:22:17,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:17,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:22:17,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:17,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:17,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:17,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,146 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 229 treesize of output 209 [2022-11-20 20:22:17,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:17,158 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:22:17,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:17,173 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 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-20 20:22:17,303 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:17,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:17,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:17,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:17,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:17,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:17,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:17,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:22:17,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:22:17,687 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:17,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:17,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:17,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:22:17,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:17,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:22:17,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:17,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:17,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:18,044 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:18,052 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:18,059 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:22:18,213 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:22:18,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:22:18,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:18,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 337 treesize of output 347 [2022-11-20 20:22:18,559 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 0 case distinctions, treesize of input 155 treesize of output 147 [2022-11-20 20:22:18,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:18,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 180 [2022-11-20 20:22:18,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:18,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:18,639 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 147 treesize of output 131 [2022-11-20 20:22:18,669 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 5 treesize of output 3 [2022-11-20 20:22:19,029 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 7 treesize of output 3 [2022-11-20 20:22:19,164 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:22:19,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:22:19,411 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 5 treesize of output 3 [2022-11-20 20:22:19,421 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:22:19,436 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:22:19,459 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:22:19,526 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 7 treesize of output 3 [2022-11-20 20:22:19,561 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 0 case distinctions, treesize of input 155 treesize of output 147 [2022-11-20 20:22:19,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:19,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 180 [2022-11-20 20:22:19,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:19,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:19,630 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 147 treesize of output 131 [2022-11-20 20:22:19,658 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 5 treesize of output 3 [2022-11-20 20:22:20,180 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:20,191 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:20,203 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:22:20,256 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:22:20,257 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 23 treesize of output 30 [2022-11-20 20:22:20,300 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:22:20,301 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 23 treesize of output 30 [2022-11-20 20:22:20,316 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:22:21,139 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:22:21,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:22:21,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:21,772 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 872 treesize of output 874 [2022-11-20 20:22:22,406 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:22,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:22,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:22,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:22,604 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-20 20:22:22,611 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 9 [2022-11-20 20:22:22,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:22:22,632 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 19 treesize of output 1 [2022-11-20 20:22:22,637 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 20:22:22,642 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 20:22:22,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:22,661 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 25 treesize of output 13 [2022-11-20 20:22:22,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:22,671 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 25 treesize of output 13 [2022-11-20 20:22:22,677 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 20:22:22,679 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:22:33,586 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12066#(and (= (select |#valid| |ULTIMATE.start_sll_destroy_~head#1.base|) 1) (<= (+ 8 |ULTIMATE.start_sll_destroy_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_destroy_~head#1.base|)) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_sll_destroy_~temp~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_destroy_~head#1.base|) (+ |ULTIMATE.start_sll_destroy_~head#1.offset| 4))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_destroy_#in~head#1.offset| |ULTIMATE.start_main_#t~mem22#1.offset|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem22#1.base| |ULTIMATE.start_sll_destroy_#in~head#1.base|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_sll_destroy_~head#1.base| 0)) (= |ULTIMATE.start_sll_destroy_~head#1.base| |ULTIMATE.start_sll_destroy_#in~head#1.base|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (not (< |ULTIMATE.start_sll_destroy_~head#1.base| |#StackHeapBarrier|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_destroy_~temp~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_destroy_~head#1.base|) (+ |ULTIMATE.start_sll_destroy_~head#1.offset| 4))) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_#t~mem22#1.offset|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_destroy_~head#1.offset| 0) (= |ULTIMATE.start_sll_destroy_#in~head#1.offset| |ULTIMATE.start_sll_destroy_~head#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:22:33,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:22:33,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:22:33,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2022-11-20 20:22:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193661233] [2022-11-20 20:22:33,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:22:33,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 20:22:33,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:33,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 20:22:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=4468, Unknown=9, NotChecked=274, Total=5112 [2022-11-20 20:22:33,589 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 32 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 27 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:22:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:34,328 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-11-20 20:22:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:22:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 27 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-20 20:22:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:34,330 INFO L225 Difference]: With dead ends: 92 [2022-11-20 20:22:34,330 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 20:22:34,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=458, Invalid=5393, Unknown=9, NotChecked=302, Total=6162 [2022-11-20 20:22:34,331 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 91 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:34,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 334 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 493 Invalid, 0 Unknown, 3 Unchecked, 0.4s Time] [2022-11-20 20:22:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 20:22:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-20 20:22:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 85 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 20:22:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-20 20:22:34,334 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 54 [2022-11-20 20:22:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:34,335 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-20 20:22:34,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 27 states have internal predecessors, (79), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:22:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-20 20:22:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 20:22:34,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:34,336 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:34,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-20 20:22:34,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-20 20:22:34,544 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:22:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 373430724, now seen corresponding path program 2 times [2022-11-20 20:22:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:34,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14364782] [2022-11-20 20:22:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-20 20:22:34,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14364782] [2022-11-20 20:22:34,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14364782] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612009851] [2022-11-20 20:22:34,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:22:34,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:34,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:34,635 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:34,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 20:22:35,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 20:22:35,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:22:35,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:22:35,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 20:22:35,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:22:35,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612009851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:22:35,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 20:22:35,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-20 20:22:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011844982] [2022-11-20 20:22:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:22:35,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:22:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:35,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:22:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:22:35,621 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 20:22:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:35,669 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-11-20 20:22:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:22:35,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2022-11-20 20:22:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:35,670 INFO L225 Difference]: With dead ends: 55 [2022-11-20 20:22:35,671 INFO L226 Difference]: Without dead ends: 55 [2022-11-20 20:22:35,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:22:35,671 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:35,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 42 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:22:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-20 20:22:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-20 20:22:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.108695652173913) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:22:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-20 20:22:35,674 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 57 [2022-11-20 20:22:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:35,674 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-20 20:22:35,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 20:22:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-20 20:22:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 20:22:35,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:35,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:35,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:35,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-20 20:22:35,876 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:22:35,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:35,876 INFO L85 PathProgramCache]: Analyzing trace with hash 877519255, now seen corresponding path program 1 times [2022-11-20 20:22:35,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:35,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802733479] [2022-11-20 20:22:35,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:22:37,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:37,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802733479] [2022-11-20 20:22:37,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802733479] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:37,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301104685] [2022-11-20 20:22:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:37,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:37,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:37,411 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:37,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 20:22:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:37,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-20 20:22:37,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:37,848 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 20:22:38,196 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 19 treesize of output 11 [2022-11-20 20:22:38,200 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 5 treesize of output 3 [2022-11-20 20:22:38,204 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 7 treesize of output 3 [2022-11-20 20:22:38,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:38,460 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 20:22:38,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:38,469 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 25 treesize of output 25 [2022-11-20 20:22:38,484 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:22:38,484 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 15 treesize of output 15 [2022-11-20 20:22:38,686 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 20:22:38,923 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 0 case distinctions, treesize of input 37 treesize of output 27 [2022-11-20 20:22:39,057 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 20:22:39,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 48 [2022-11-20 20:22:39,904 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 34 treesize of output 22 [2022-11-20 20:22:40,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:40,070 INFO L321 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2022-11-20 20:22:40,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 40 [2022-11-20 20:22:40,175 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 20:22:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:22:40,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:40,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:40,477 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 37 treesize of output 41 [2022-11-20 20:22:40,896 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 51 treesize of output 43 [2022-11-20 20:22:40,968 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4377 (Array Int Int))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_4377))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) 4)))))) is different from false [2022-11-20 20:22:41,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4377 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_4377))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) 4)))))) is different from false [2022-11-20 20:22:41,700 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4385 (Array Int Int)) (v_ArrVal_4386 (Array Int Int)) (v_ArrVal_4377 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_89| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_89|) 0)) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_89| |c_#StackHeapBarrier|)) (not (let ((.cse1 (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_89| v_ArrVal_4385))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_89| v_ArrVal_4386) |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_89|)))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_89| v_ArrVal_4377))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) 4))))))) is different from false [2022-11-20 20:22:41,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301104685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:41,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1270165073] [2022-11-20 20:22:41,703 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-20 20:22:41,704 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:22:41,704 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:22:41,704 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:22:41,704 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:22:41,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:22:41,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:22:41,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:22:41,773 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 9 [2022-11-20 20:22:41,780 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 19 treesize of output 1 [2022-11-20 20:22:41,784 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 20:22:41,789 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 20:22:41,797 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 20:22:41,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,804 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 25 treesize of output 13 [2022-11-20 20:22:41,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,811 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 25 treesize of output 13 [2022-11-20 20:22:41,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:41,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:22:41,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:41,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:41,943 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 13 [2022-11-20 20:22:41,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:41,956 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 13 [2022-11-20 20:22:41,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:41,968 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 27 treesize of output 11 [2022-11-20 20:22:42,115 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:42,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:42,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:42,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:42,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:42,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:42,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:42,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:22:42,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:42,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:22:42,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:42,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:42,563 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:42,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:42,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:42,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:42,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:42,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:42,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:42,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:22:42,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:42,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:22:42,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:42,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:42,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:42,953 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 229 treesize of output 209 [2022-11-20 20:22:42,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:42,966 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:22:42,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:42,983 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 0 case distinctions, treesize of input 227 treesize of output 215 [2022-11-20 20:22:43,123 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:43,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:43,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:43,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:43,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:43,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:22:43,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:22:43,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:43,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:43,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:43,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:43,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:43,503 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:43,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:43,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:43,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:43,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:43,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:43,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:22:43,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:22:43,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:22:43,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:43,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:43,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:22:43,870 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:22:43,877 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:43,884 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:44,094 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:22:44,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:22:44,362 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 5 treesize of output 3 [2022-11-20 20:22:44,373 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 5 treesize of output 3 [2022-11-20 20:22:44,394 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:22:44,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:22:44,430 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 20:22:44,511 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 7 treesize of output 3 [2022-11-20 20:22:44,533 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 0 case distinctions, treesize of input 155 treesize of output 147 [2022-11-20 20:22:44,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:44,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 180 [2022-11-20 20:22:44,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:44,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:44,620 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 147 treesize of output 131 [2022-11-20 20:22:44,655 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 5 treesize of output 3 [2022-11-20 20:22:44,968 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:22:44,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:22:45,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:45,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 339 treesize of output 349 [2022-11-20 20:22:45,334 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 7 treesize of output 3 [2022-11-20 20:22:45,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:45,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 188 [2022-11-20 20:22:45,397 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 0 case distinctions, treesize of input 147 treesize of output 139 [2022-11-20 20:22:45,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:45,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:45,423 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 147 treesize of output 131 [2022-11-20 20:22:45,440 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 5 treesize of output 3 [2022-11-20 20:22:45,816 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:45,829 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:22:45,840 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:22:45,889 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:22:45,890 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 23 treesize of output 30 [2022-11-20 20:22:45,903 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:22:45,942 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:22:45,942 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 23 treesize of output 30 [2022-11-20 20:22:46,701 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:22:46,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:22:46,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 20:22:46,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 20:22:47,038 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:22:47,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:22:47,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:47,506 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 593 treesize of output 607 [2022-11-20 20:22:48,297 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:22:48,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:22:48,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:48,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:22:48,494 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-20 20:22:48,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:22:48,505 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 9 [2022-11-20 20:22:48,515 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 20:22:48,520 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 20:22:48,526 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 19 treesize of output 1 [2022-11-20 20:22:48,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:48,538 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 25 treesize of output 13 [2022-11-20 20:22:48,544 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 20:22:48,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:48,551 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 25 treesize of output 13 [2022-11-20 20:22:48,554 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:23:02,251 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12905#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (<= 3 |ULTIMATE.start_main_~count~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (not (= (select |#valid| |ULTIMATE.start_sll_destroy_~head#1.base|) 1)) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:23:02,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:23:02,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:23:02,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 45 [2022-11-20 20:23:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961805350] [2022-11-20 20:23:02,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:23:02,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-20 20:23:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:23:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-20 20:23:02,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=7589, Unknown=55, NotChecked=534, Total=8556 [2022-11-20 20:23:02,254 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 46 states, 40 states have (on average 2.275) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:23:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:23:05,973 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-11-20 20:23:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 20:23:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 40 states have (on average 2.275) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-11-20 20:23:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:23:05,974 INFO L225 Difference]: With dead ends: 64 [2022-11-20 20:23:05,974 INFO L226 Difference]: Without dead ends: 64 [2022-11-20 20:23:05,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3182 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=637, Invalid=11306, Unknown=59, NotChecked=654, Total=12656 [2022-11-20 20:23:05,976 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 157 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:23:05,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 251 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 951 Invalid, 0 Unknown, 83 Unchecked, 1.0s Time] [2022-11-20 20:23:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-20 20:23:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-11-20 20:23:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:23:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-20 20:23:05,979 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 57 [2022-11-20 20:23:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:23:05,980 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-20 20:23:05,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 40 states have (on average 2.275) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 20:23:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-20 20:23:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 20:23:05,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:23:05,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:23:05,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-20 20:23:06,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-20 20:23:06,188 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:23:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:23:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash 877519256, now seen corresponding path program 1 times [2022-11-20 20:23:06,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:23:06,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955225931] [2022-11-20 20:23:06,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:23:06,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:23:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:23:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:23:08,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:23:08,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955225931] [2022-11-20 20:23:08,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955225931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:23:08,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580452658] [2022-11-20 20:23:08,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:23:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:23:08,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:23:08,312 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:23:08,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 20:23:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:23:08,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 20:23:08,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:23:09,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:09,347 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-11-20 20:23:09,348 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 79 treesize of output 63 [2022-11-20 20:23:09,378 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-11-20 20:23:09,378 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 54 treesize of output 40 [2022-11-20 20:23:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:23:09,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:23:10,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:10,060 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 46 treesize of output 50 [2022-11-20 20:23:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:23:10,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580452658] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:23:10,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953750563] [2022-11-20 20:23:10,674 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-20 20:23:10,675 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:23:10,675 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:23:10,675 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:23:10,675 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:23:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:23:10,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:23:10,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:23:10,746 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 9 [2022-11-20 20:23:10,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:10,756 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 19 treesize of output 1 [2022-11-20 20:23:10,761 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 20:23:10,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,771 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 25 treesize of output 13 [2022-11-20 20:23:10,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,777 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 25 treesize of output 13 [2022-11-20 20:23:10,783 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 20:23:10,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:10,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:23:10,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:10,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:10,897 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 13 [2022-11-20 20:23:10,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:10,908 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 27 treesize of output 11 [2022-11-20 20:23:10,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:10,922 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 13 [2022-11-20 20:23:11,036 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:11,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:23:11,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:11,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:11,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:11,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:11,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:11,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:11,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:23:11,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:11,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:11,436 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:11,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:23:11,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:11,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:11,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:11,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:11,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:11,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:11,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:23:11,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:11,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:11,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:11,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:11,793 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 229 treesize of output 209 [2022-11-20 20:23:11,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:11,807 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 0 case distinctions, treesize of input 223 treesize of output 211 [2022-11-20 20:23:11,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:11,820 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 0 case distinctions, treesize of input 233 treesize of output 221 [2022-11-20 20:23:11,954 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:11,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:23:12,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:12,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:12,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:12,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:12,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:12,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:12,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:23:12,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:12,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:12,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:12,349 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:12,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:23:12,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:12,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:12,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:12,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:12,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:12,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:12,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:23:12,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:12,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:12,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:12,682 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:12,691 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:12,701 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:23:12,853 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:23:12,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:23:13,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:13,294 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 849 treesize of output 859 [2022-11-20 20:23:14,101 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 7 treesize of output 3 [2022-11-20 20:23:14,116 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 0 case distinctions, treesize of input 155 treesize of output 147 [2022-11-20 20:23:14,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:14,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 180 [2022-11-20 20:23:14,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:14,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:14,189 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 147 treesize of output 131 [2022-11-20 20:23:14,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:14,440 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:23:14,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:23:14,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:14,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 420 treesize of output 430 [2022-11-20 20:23:14,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:14,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 188 [2022-11-20 20:23:14,949 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 0 case distinctions, treesize of input 147 treesize of output 139 [2022-11-20 20:23:14,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:14,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:14,974 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 147 treesize of output 131 [2022-11-20 20:23:14,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:15,146 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 7 treesize of output 3 [2022-11-20 20:23:15,310 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:15,323 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:15,335 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:23:15,401 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:23:15,402 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 23 treesize of output 30 [2022-11-20 20:23:15,417 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:23:15,466 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:23:15,466 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 23 treesize of output 30 [2022-11-20 20:23:16,250 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:23:16,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:23:16,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 20:23:16,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 20:23:16,598 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:23:16,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:23:16,761 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 5 treesize of output 3 [2022-11-20 20:23:16,869 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:16,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 230 [2022-11-20 20:23:17,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:17,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:17,054 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 22 for LOIs [2022-11-20 20:23:17,065 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 9 [2022-11-20 20:23:17,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:23:17,086 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 20:23:17,091 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 20:23:17,098 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 19 treesize of output 1 [2022-11-20 20:23:17,113 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 20:23:17,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:17,121 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 25 treesize of output 13 [2022-11-20 20:23:17,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:17,129 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 25 treesize of output 13 [2022-11-20 20:23:17,132 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:23:30,536 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13484#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (<= 3 |ULTIMATE.start_main_~count~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (or (not (<= (+ 8 |ULTIMATE.start_sll_destroy_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_destroy_~head#1.base|))) (not (<= 0 (+ |ULTIMATE.start_sll_destroy_~head#1.offset| 4)))) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-20 20:23:30,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:23:30,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:23:30,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11, 11] total 45 [2022-11-20 20:23:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822348339] [2022-11-20 20:23:30,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:23:30,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-20 20:23:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:23:30,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-20 20:23:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=6143, Unknown=0, NotChecked=0, Total=6480 [2022-11-20 20:23:30,538 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 46 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 43 states have internal predecessors, (109), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 20:23:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:23:35,077 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-11-20 20:23:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 20:23:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 43 states have internal predecessors, (109), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2022-11-20 20:23:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:23:35,078 INFO L225 Difference]: With dead ends: 64 [2022-11-20 20:23:35,078 INFO L226 Difference]: Without dead ends: 64 [2022-11-20 20:23:35,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=576, Invalid=9930, Unknown=0, NotChecked=0, Total=10506 [2022-11-20 20:23:35,079 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 148 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:23:35,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 249 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1107 Invalid, 0 Unknown, 3 Unchecked, 1.2s Time] [2022-11-20 20:23:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-20 20:23:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2022-11-20 20:23:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:23:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-11-20 20:23:35,082 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 57 [2022-11-20 20:23:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:23:35,082 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-11-20 20:23:35,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 43 states have internal predecessors, (109), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 20:23:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-11-20 20:23:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 20:23:35,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:23:35,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:23:35,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-11-20 20:23:35,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-20 20:23:35,290 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:23:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:23:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash 877521132, now seen corresponding path program 1 times [2022-11-20 20:23:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:23:35,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761136531] [2022-11-20 20:23:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:23:35,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:23:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:23:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:23:35,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:23:35,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761136531] [2022-11-20 20:23:35,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761136531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:23:35,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228476315] [2022-11-20 20:23:35,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:23:35,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:23:35,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:23:35,887 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:23:35,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-20 20:23:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:23:36,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-20 20:23:36,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:23:36,310 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 20:23:36,353 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_4666 Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_4666)))) is different from true [2022-11-20 20:23:36,376 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 20:23:36,408 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_4667 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_4667))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-20 20:23:36,433 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 20:23:36,462 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_4668 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_4668))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-20 20:23:36,485 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 20:23:36,759 INFO L321 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2022-11-20 20:23:36,759 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 25 treesize of output 25 [2022-11-20 20:23:36,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-20 20:23:36,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:36,953 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2022-11-20 20:23:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-11-20 20:23:36,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:23:37,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,267 INFO L321 Elim1Store]: treesize reduction 17, result has 48.5 percent of original size [2022-11-20 20:23:37,268 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 33 treesize of output 30 [2022-11-20 20:23:37,272 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 8 treesize of output 4 [2022-11-20 20:23:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 20:23:37,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228476315] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:23:37,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1005363969] [2022-11-20 20:23:37,797 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2022-11-20 20:23:37,797 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:23:37,798 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:23:37,798 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:23:37,798 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:23:37,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 20:23:37,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:23:37,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:23:37,875 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 9 [2022-11-20 20:23:37,882 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 19 treesize of output 1 [2022-11-20 20:23:37,887 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 20:23:37,892 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 20:23:37,900 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 20:23:37,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,907 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 25 treesize of output 13 [2022-11-20 20:23:37,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,914 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 25 treesize of output 13 [2022-11-20 20:23:37,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:37,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-20 20:23:37,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:37,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:38,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:38,026 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 13 [2022-11-20 20:23:38,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,037 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 27 treesize of output 11 [2022-11-20 20:23:38,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:38,049 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 13 [2022-11-20 20:23:38,161 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:38,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:23:38,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:38,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:38,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:38,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:23:38,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:38,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:38,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:38,563 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:38,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:23:38,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:38,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:38,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:38,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:38,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:38,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:23:38,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:38,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,968 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 232 treesize of output 212 [2022-11-20 20:23:38,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:38,982 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 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-20 20:23:38,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:38,994 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 0 case distinctions, treesize of input 236 treesize of output 224 [2022-11-20 20:23:39,129 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:39,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:23:39,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:39,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:39,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:39,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:39,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:39,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:23:39,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:39,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:39,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:39,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:39,541 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:39,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:23:39,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:39,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:39,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 20:23:39,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:23:39,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:39,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:39,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 20:23:39,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:39,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:39,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 20:23:39,891 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:39,899 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:23:39,906 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:40,061 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:23:40,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:23:40,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:40,515 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 769 treesize of output 779 [2022-11-20 20:23:41,134 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 7 treesize of output 3 [2022-11-20 20:23:41,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:41,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 188 [2022-11-20 20:23:41,202 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 0 case distinctions, treesize of input 147 treesize of output 139 [2022-11-20 20:23:41,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:41,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:41,228 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 147 treesize of output 131 [2022-11-20 20:23:41,246 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 5 treesize of output 3 [2022-11-20 20:23:41,595 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:23:41,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:23:41,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:41,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 337 treesize of output 347 [2022-11-20 20:23:41,936 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 7 treesize of output 3 [2022-11-20 20:23:41,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:41,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 188 [2022-11-20 20:23:42,000 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 0 case distinctions, treesize of input 147 treesize of output 139 [2022-11-20 20:23:42,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:42,026 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 147 treesize of output 131 [2022-11-20 20:23:42,053 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 5 treesize of output 3 [2022-11-20 20:23:42,610 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:42,622 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:23:42,635 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:23:42,661 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 20:23:42,695 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:23:42,695 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 23 treesize of output 30 [2022-11-20 20:23:42,739 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-20 20:23:42,739 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 23 treesize of output 30 [2022-11-20 20:23:43,410 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 20:23:43,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:23:43,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 20:23:43,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 20:23:43,681 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-20 20:23:43,681 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 140 treesize of output 152 [2022-11-20 20:23:44,084 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-20 20:23:44,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 217 [2022-11-20 20:23:44,250 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 5 treesize of output 3 [2022-11-20 20:23:44,358 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-20 20:23:44,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 233 [2022-11-20 20:23:44,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:44,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 20:23:44,544 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 22 for LOIs [2022-11-20 20:23:44,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-20 20:23:44,559 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 9 [2022-11-20 20:23:44,575 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 19 treesize of output 1 [2022-11-20 20:23:44,580 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 20:23:44,586 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 20:23:44,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:44,602 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 25 treesize of output 13 [2022-11-20 20:23:44,610 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 20:23:44,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:44,618 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 25 treesize of output 13 [2022-11-20 20:23:44,621 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:23:56,777 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14053#(and (<= |ULTIMATE.start_main_~count~0#1| 3) (<= 3 |ULTIMATE.start_main_~count~0#1|) (<= 5 |ULTIMATE.start_sll_insert_~data#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 0 |ULTIMATE.start_sll_insert_~head#1.base|) (<= 0 (+ |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_insert_#in~data#1| 5) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_#in~head#1.base|) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 5 |ULTIMATE.start_sll_insert_#in~data#1|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_insert_~data#1| 5) (<= |ULTIMATE.start_sll_insert_~index#1| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_~len#1|) (= |ULTIMATE.start_sll_destroy_~head#1.base| 0) (or (and (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (= |ULTIMATE.start_sll_destroy_~temp~1#1.offset| |ULTIMATE.start_sll_destroy_~head#1.offset|) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_destroy_~head#1.base_38| Int)) (and (<= 8 (select |#length| |v_ULTIMATE.start_sll_destroy_~head#1.base_38|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_destroy_~head#1.base_38|) 4) |ULTIMATE.start_sll_destroy_~temp~1#1.offset|) (= (select |#valid| |v_ULTIMATE.start_sll_destroy_~head#1.base_38|) 0) (< |v_ULTIMATE.start_sll_destroy_~head#1.base_38| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_destroy_~temp~1#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_destroy_~head#1.base_38|) 4)))) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_28| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#s~0#1.base_28|) 0) (<= 0 |v_ULTIMATE.start_main_~#s~0#1.base_28|))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_destroy_~temp~1#1.base| |ULTIMATE.start_sll_destroy_~head#1.base|) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_destroy_~head#1.base| |ULTIMATE.start_sll_destroy_#in~head#1.base|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_28| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#s~0#1.base_28|) 0) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#s~0#1.base_28|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#s~0#1.base_28|) 0) |ULTIMATE.start_sll_destroy_#in~head#1.base|) (<= 0 |v_ULTIMATE.start_main_~#s~0#1.base_28|) (= |ULTIMATE.start_sll_destroy_#in~head#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#s~0#1.base_28|) 0)))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (= |ULTIMATE.start_sll_destroy_#in~head#1.offset| |ULTIMATE.start_sll_destroy_~head#1.offset|) (= |#NULL.base| 0))) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_insert_~head#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_destroy_~head#1.offset| 0) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2022-11-20 20:23:56,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:23:56,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:23:56,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 12] total 30 [2022-11-20 20:23:56,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782841974] [2022-11-20 20:23:56,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:23:56,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 20:23:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:23:56,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 20:23:56,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=3739, Unknown=3, NotChecked=378, Total=4422 [2022-11-20 20:23:56,780 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 31 states, 31 states have (on average 3.129032258064516) internal successors, (97), 29 states have internal predecessors, (97), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 20:23:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:23:57,820 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-11-20 20:23:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:23:57,820 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.129032258064516) internal successors, (97), 29 states have internal predecessors, (97), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2022-11-20 20:23:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:23:57,821 INFO L225 Difference]: With dead ends: 62 [2022-11-20 20:23:57,821 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 20:23:57,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 118 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=435, Invalid=5274, Unknown=3, NotChecked=450, Total=6162 [2022-11-20 20:23:57,822 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 81 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:23:57,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 149 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 354 Invalid, 0 Unknown, 148 Unchecked, 0.3s Time] [2022-11-20 20:23:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 20:23:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2022-11-20 20:23:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.1) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 20:23:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-11-20 20:23:57,825 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 57 [2022-11-20 20:23:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:23:57,825 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-11-20 20:23:57,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.129032258064516) internal successors, (97), 29 states have internal predecessors, (97), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 20:23:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-11-20 20:23:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 20:23:57,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:23:57,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:23:57,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-20 20:23:58,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-20 20:23:58,042 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-11-20 20:23:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:23:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1482468844, now seen corresponding path program 1 times [2022-11-20 20:23:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:23:58,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532100121] [2022-11-20 20:23:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:23:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:23:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:23:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:23:59,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:23:59,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532100121] [2022-11-20 20:23:59,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532100121] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:23:59,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302964390] [2022-11-20 20:23:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:23:59,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:23:59,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:23:59,946 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:23:59,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54a0b76a-7f75-4917-b427-6664c123931f/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-20 20:24:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:00,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 20:24:00,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:24:00,443 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 20:24:00,846 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 17 treesize of output 9 [2022-11-20 20:24:00,850 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 5 treesize of output 3 [2022-11-20 20:24:01,024 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:24:01,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:01,037 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 23 treesize of output 23 [2022-11-20 20:24:01,053 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 20:24:01,053 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 15 treesize of output 15 [2022-11-20 20:24:01,553 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-20 20:24:01,554 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 51 treesize of output 37 [2022-11-20 20:24:01,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:01,560 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 28 treesize of output 30 [2022-11-20 20:24:01,720 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 20:24:01,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 78 [2022-11-20 20:24:01,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:24:01,737 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 62 treesize of output 63 [2022-11-20 20:24:02,560 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 56 treesize of output 40 [2022-11-20 20:24:02,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:02,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:24:02,694 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 19 [2022-11-20 20:24:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:24:02,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:24:04,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:24:04,120 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 472 treesize of output 467 [2022-11-20 20:24:04,131 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 284 treesize of output 268 [2022-11-20 20:24:04,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:24:04,152 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 356 treesize of output 356 [2022-11-20 20:24:04,163 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 264 treesize of output 256