/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 21:50:24,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 21:50:24,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 21:50:24,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 21:50:24,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 21:50:24,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 21:50:24,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 21:50:24,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 21:50:24,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 21:50:24,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 21:50:24,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 21:50:24,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 21:50:24,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 21:50:25,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 21:50:25,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 21:50:25,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 21:50:25,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 21:50:25,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 21:50:25,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 21:50:25,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 21:50:25,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 21:50:25,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 21:50:25,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 21:50:25,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 21:50:25,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 21:50:25,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 21:50:25,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 21:50:25,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 21:50:25,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 21:50:25,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 21:50:25,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 21:50:25,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 21:50:25,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 21:50:25,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 21:50:25,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 21:50:25,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 21:50:25,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 21:50:25,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 21:50:25,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 21:50:25,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 21:50:25,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 21:50:25,022 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 21:50:25,042 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 21:50:25,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 21:50:25,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 21:50:25,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 21:50:25,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 21:50:25,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 21:50:25,044 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 21:50:25,044 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 21:50:25,044 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 21:50:25,044 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 21:50:25,044 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 21:50:25,045 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 21:50:25,045 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 21:50:25,045 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 21:50:25,045 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 21:50:25,045 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 21:50:25,046 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 21:50:25,046 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 21:50:25,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 21:50:25,047 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 21:50:25,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 21:50:25,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 21:50:25,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 21:50:25,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 21:50:25,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 21:50:25,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 21:50:25,048 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 21:50:25,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 21:50:25,048 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 21:50:25,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 21:50:25,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 21:50:25,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 21:50:25,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 21:50:25,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 21:50:25,050 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 21:50:25,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 21:50:25,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 21:50:25,050 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 21:50:25,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 21:50:25,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 21:50:25,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 21:50:25,051 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-02 21:50:25,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 21:50:25,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 21:50:25,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 21:50:25,280 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 21:50:25,281 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 21:50:25,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2023-04-02 21:50:26,361 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 21:50:26,590 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 21:50:26,590 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2023-04-02 21:50:26,600 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3e9f97c/4dead0242b04493e96af51c1e6606cf7/FLAG9ea847080 [2023-04-02 21:50:26,612 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c3e9f97c/4dead0242b04493e96af51c1e6606cf7 [2023-04-02 21:50:26,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 21:50:26,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 21:50:26,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 21:50:26,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 21:50:26,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 21:50:26,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 09:50:26" (1/1) ... [2023-04-02 21:50:26,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3f92ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:26, skipping insertion in model container [2023-04-02 21:50:26,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 09:50:26" (1/1) ... [2023-04-02 21:50:26,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 21:50:26,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 21:50:26,899 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2023-04-02 21:50:26,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 21:50:26,914 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 21:50:26,972 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i[24165,24178] [2023-04-02 21:50:26,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 21:50:27,001 INFO L208 MainTranslator]: Completed translation [2023-04-02 21:50:27,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27 WrapperNode [2023-04-02 21:50:27,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 21:50:27,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 21:50:27,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 21:50:27,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 21:50:27,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,041 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 21:50:27,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 21:50:27,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 21:50:27,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 21:50:27,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (1/1) ... [2023-04-02 21:50:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 21:50:27,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:50:27,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 21:50:27,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 21:50:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 21:50:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 21:50:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 21:50:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 21:50:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 21:50:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 21:50:27,112 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-04-02 21:50:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2023-04-02 21:50:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2023-04-02 21:50:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2023-04-02 21:50:27,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 21:50:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 21:50:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 21:50:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 21:50:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 21:50:27,113 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 21:50:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 21:50:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 21:50:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 21:50:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 21:50:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 21:50:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 21:50:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 21:50:27,114 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 21:50:27,115 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 21:50:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 21:50:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 21:50:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 21:50:27,119 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 21:50:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 21:50:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 21:50:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 21:50:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 21:50:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 21:50:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 21:50:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 21:50:27,338 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 21:50:27,340 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 21:50:27,380 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 21:50:27,541 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 21:50:27,614 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 21:50:27,614 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-02 21:50:27,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 09:50:27 BoogieIcfgContainer [2023-04-02 21:50:27,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 21:50:27,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 21:50:27,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 21:50:27,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 21:50:27,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 09:50:26" (1/3) ... [2023-04-02 21:50:27,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a81453c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 09:50:27, skipping insertion in model container [2023-04-02 21:50:27,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:50:27" (2/3) ... [2023-04-02 21:50:27,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a81453c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 09:50:27, skipping insertion in model container [2023-04-02 21:50:27,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 09:50:27" (3/3) ... [2023-04-02 21:50:27,623 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2023-04-02 21:50:27,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 21:50:27,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 21:50:27,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 21:50:27,694 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@31bf63ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 21:50:27,694 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 21:50:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 21:50:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 21:50:27,703 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:50:27,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:50:27,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:50:27,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:50:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash -308473228, now seen corresponding path program 1 times [2023-04-02 21:50:27,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:50:27,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647130882] [2023-04-02 21:50:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:50:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:50:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:50:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:50:28,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:50:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647130882] [2023-04-02 21:50:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647130882] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 21:50:28,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 21:50:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 21:50:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575078930] [2023-04-02 21:50:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:50:28,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 21:50:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:50:28,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 21:50:28,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 21:50:28,120 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 21:50:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:50:28,193 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2023-04-02 21:50:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 21:50:28,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2023-04-02 21:50:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:50:28,202 INFO L225 Difference]: With dead ends: 73 [2023-04-02 21:50:28,203 INFO L226 Difference]: Without dead ends: 31 [2023-04-02 21:50:28,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 21:50:28,210 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 15 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 21:50:28,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 124 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 21:50:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-02 21:50:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-04-02 21:50:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 21:50:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-04-02 21:50:28,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2023-04-02 21:50:28,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:50:28,260 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-04-02 21:50:28,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 21:50:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-04-02 21:50:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 21:50:28,265 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:50:28,266 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 21:50:28,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 21:50:28,266 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:50:28,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:50:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash -740569555, now seen corresponding path program 1 times [2023-04-02 21:50:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:50:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062092505] [2023-04-02 21:50:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:50:28,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:50:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:50:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 21:50:28,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:50:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062092505] [2023-04-02 21:50:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062092505] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:50:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578028864] [2023-04-02 21:50:28,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:50:28,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:50:28,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:50:28,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:50:28,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 21:50:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:50:28,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 21:50:28,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:50:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:50:28,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:50:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 21:50:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578028864] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:50:28,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1302293592] [2023-04-02 21:50:28,953 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-04-02 21:50:28,953 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:50:28,956 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:50:28,960 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:50:28,962 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:50:29,046 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:50:29,563 INFO L197 IcfgInterpreter]: Interpreting procedure sll_prepend with input of size 36 for LOIs [2023-04-02 21:50:29,775 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 44 for LOIs [2023-04-02 21:50:30,129 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 15 for LOIs [2023-04-02 21:50:30,148 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:50:30,152 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:50:40,697 WARN L223 SmtUtils]: Spent 9.52s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 21:50:40,944 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '384#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= |main_~#s~0.offset| 0) (= main_~ptr~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (= main_~len~0 2) (= |#NULL.offset| 0) (= 5 main_~uneq~0) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0) main_~ptr~0.offset) (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|) (not (= (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset) 5)) (= |#NULL.base| 0))' at error location [2023-04-02 21:50:40,944 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:50:40,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:50:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-04-02 21:50:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7951817] [2023-04-02 21:50:40,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 21:50:40,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 21:50:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:50:40,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 21:50:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2023-04-02 21:50:40,951 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 12 states, 8 states have (on average 3.625) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-02 21:50:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:50:41,102 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2023-04-02 21:50:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 21:50:41,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 3.625) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 29 [2023-04-02 21:50:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:50:41,104 INFO L225 Difference]: With dead ends: 52 [2023-04-02 21:50:41,104 INFO L226 Difference]: Without dead ends: 34 [2023-04-02 21:50:41,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 21:50:41,106 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 21:50:41,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 57 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 21:50:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-04-02 21:50:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-04-02 21:50:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 21:50:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-04-02 21:50:41,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 29 [2023-04-02 21:50:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:50:41,113 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-04-02 21:50:41,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 3.625) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-02 21:50:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-04-02 21:50:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-02 21:50:41,114 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:50:41,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:50:41,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 21:50:41,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:50:41,315 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:50:41,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:50:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1721884588, now seen corresponding path program 2 times [2023-04-02 21:50:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:50:41,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580398803] [2023-04-02 21:50:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:50:41,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:50:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:50:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 21:50:42,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:50:42,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580398803] [2023-04-02 21:50:42,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580398803] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 21:50:42,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 21:50:42,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-04-02 21:50:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077353979] [2023-04-02 21:50:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:50:42,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-02 21:50:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:50:42,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-02 21:50:42,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-04-02 21:50:42,421 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 21:50:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:50:42,767 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-04-02 21:50:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 21:50:42,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2023-04-02 21:50:42,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:50:42,769 INFO L225 Difference]: With dead ends: 34 [2023-04-02 21:50:42,769 INFO L226 Difference]: Without dead ends: 32 [2023-04-02 21:50:42,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-04-02 21:50:42,770 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 21:50:42,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 102 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 21:50:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-02 21:50:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-04-02 21:50:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 21:50:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-04-02 21:50:42,776 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 36 [2023-04-02 21:50:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:50:42,777 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-04-02 21:50:42,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-02 21:50:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-04-02 21:50:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-04-02 21:50:42,778 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:50:42,778 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-04-02 21:50:42,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 21:50:42,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:50:42,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:50:42,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1168578336, now seen corresponding path program 1 times [2023-04-02 21:50:42,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:50:42,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912583670] [2023-04-02 21:50:42,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:50:42,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:50:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:50:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 21:50:43,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:50:43,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912583670] [2023-04-02 21:50:43,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912583670] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:50:43,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511615261] [2023-04-02 21:50:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:50:43,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:50:43,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:50:43,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:50:43,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 21:50:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:50:44,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 57 conjunts are in the unsatisfiable core [2023-04-02 21:50:44,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:50:44,257 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 [2023-04-02 21:50:44,403 WARN L861 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_325 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res.base| v_ArrVal_325)))) is different from true [2023-04-02 21:50:44,567 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 21:50:44,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-04-02 21:50:44,585 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 8 treesize of output 7 [2023-04-02 21:50:44,606 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 12 treesize of output 11 [2023-04-02 21:50:44,715 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 0 case distinctions, treesize of input 75 treesize of output 46 [2023-04-02 21:50:44,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-04-02 21:50:44,782 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|))) (let ((.cse0 (+ .cse1 4))) (or (exists ((sll_prepend_~new_head~1.base Int)) (and (exists ((v_ArrVal_325 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (= (store (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store v_ArrVal_325 .cse0 (select (select (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base v_ArrVal_325) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|))) |c_sll_prepend_#in~head.base| (store (select (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base v_ArrVal_330) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)) |c_#memory_$Pointer$.base|)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= .cse1 (select v_DerPreprocessor_2 |c_sll_prepend_#in~head.offset|)) (= (select (store (store (store (store |c_#memory_$Pointer$.offset| sll_prepend_~new_head~1.base v_DerPreprocessor_1) |c_sll_prepend_#in~head.base| v_DerPreprocessor_2) sll_prepend_~new_head~1.base v_DerPreprocessor_1) |c_sll_prepend_#in~head.base| v_DerPreprocessor_2) sll_prepend_~new_head~1.base) v_DerPreprocessor_1))) (< sll_prepend_~new_head~1.base |c_#StackHeapBarrier|))) (exists ((sll_prepend_~new_head~1.base Int)) (and (exists ((v_ArrVal_325 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (= (store (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store v_ArrVal_325 .cse0 (select (select (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base v_ArrVal_325) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|))) |c_sll_prepend_#in~head.base| (store (select (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base v_ArrVal_330) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)) |c_#memory_$Pointer$.base|)) (not (= |c_sll_prepend_#in~head.base| sll_prepend_~new_head~1.base)) (< sll_prepend_~new_head~1.base |c_#StackHeapBarrier|)))))) is different from true [2023-04-02 21:50:45,874 INFO L321 Elim1Store]: treesize reduction 104, result has 60.8 percent of original size [2023-04-02 21:50:45,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 308 treesize of output 998 [2023-04-02 21:50:46,046 INFO L321 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2023-04-02 21:50:46,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 114 [2023-04-02 21:50:46,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 21:50:46,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 21:50:46,666 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 21:50:46,789 INFO L217 Elim1Store]: Index analysis took 638 ms [2023-04-02 21:50:47,193 INFO L321 Elim1Store]: treesize reduction 255, result has 3.0 percent of original size [2023-04-02 21:50:47,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 33 case distinctions, treesize of input 551 treesize of output 6141 [2023-04-02 21:50:47,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18338 treesize of output 16747 [2023-04-02 21:50:47,953 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 17427 treesize of output 15736 [2023-04-02 21:50:48,466 INFO L217 Elim1Store]: Index analysis took 134 ms [2023-04-02 21:50:49,034 INFO L321 Elim1Store]: treesize reduction 66, result has 7.0 percent of original size [2023-04-02 21:50:49,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 221 treesize of output 220 [2023-04-02 21:50:49,814 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2023-04-02 21:50:51,487 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 9 treesize of output 7 [2023-04-02 21:50:53,396 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 44 treesize of output 15 [2023-04-02 21:50:54,750 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-04-02 21:50:54,751 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 13 treesize of output 3 [2023-04-02 21:50:59,105 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 9996 treesize of output 9972 [2023-04-02 21:51:11,748 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 9 treesize of output 7 [2023-04-02 21:52:16,000 WARN L223 SmtUtils]: Spent 52.36s on a formula simplification that was a NOOP. DAG size: 1263 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 21:52:16,662 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 31048 treesize of output 30820 [2023-04-02 21:52:27,027 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_main_~ptr~0.offset 4))) (let ((.cse27 (= .cse2 0))) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_prenex_270 (Array Int Int)) (v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_275 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_20 0))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse0 (select .cse9 0))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_18))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse7 (store (store (store (store (store (store (store (store (store (store (store .cse10 .cse4 v_DerPreprocessor_20) .cse0 v_prenex_271) .cse4 .cse9) .cse0 v_prenex_271) .cse4 .cse9) .cse0 v_prenex_271) .cse4 .cse9) .cse0 v_prenex_271) .cse4 .cse9) .cse0 v_prenex_271) .cse4 .cse9))) (let ((.cse1 (select .cse7 .cse0)) (.cse6 (select v_prenex_270 0)) (.cse5 (select .cse3 .cse2)) (.cse8 (store .cse10 .cse4 v_prenex_270))) (and (= c_main_~ptr~0.base .cse0) (= (select .cse1 .cse2) (select .cse3 0)) (<= (+ 2 .cse0) .cse4) (= (store .cse1 .cse2 .cse5) .cse3) (= .cse6 .cse4) (= .cse6 (select v_prenex_270 .cse2)) (not (= .cse5 0)) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse7 .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse8) (= .cse8 (store (store .cse7 .cse0 v_prenex_272) .cse4 v_prenex_270)) (= v_DerPreprocessor_20 (store .cse9 0 .cse4)))))))))) (exists ((v_prenex_305 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_309 (Array Int Int)) (v_prenex_582 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_DerPreprocessor_11 0))) (let ((.cse19 (select |c_#memory_$Pointer$.base| .cse16))) (let ((.cse15 (select .cse19 0))) (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse15 v_prenex_582) .cse16 v_DerPreprocessor_11))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse15)) (.cse14 (store (store (store (store (store (store (store (store (store (store .cse13 .cse15 v_prenex_305) .cse16 .cse19) .cse15 v_prenex_305) .cse16 .cse19) .cse15 v_prenex_305) .cse16 .cse19) .cse15 v_prenex_305) .cse16 .cse19) .cse15 v_prenex_305) .cse16 .cse19))) (let ((.cse12 (select .cse14 .cse15)) (.cse17 (select .cse11 .cse2)) (.cse18 (select v_DerPreprocessor_11 .cse2))) (and (= (select .cse11 0) (select .cse12 .cse2)) (= .cse13 (store (store .cse14 .cse15 v_DerPreprocessor_5) .cse16 v_DerPreprocessor_11)) (not (= .cse17 0)) (= c_main_~ptr~0.base .cse15) (= .cse18 .cse17) (= v_DerPreprocessor_11 (store .cse19 0 .cse16)) (= .cse13 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse14 .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11)) (<= (+ 2 .cse15) .cse16) (= .cse11 (store .cse12 .cse2 .cse17)) (= .cse18 .cse16))))))))) (and (exists ((v_prenex_340 (Array Int Int)) (v_prenex_573 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_336 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse23 (select v_prenex_29 0))) (let ((.cse26 (select |c_#memory_$Pointer$.base| .cse23))) (let ((.cse22 (select .cse26 0))) (let ((.cse20 (store (store |c_#memory_$Pointer$.base| .cse22 v_prenex_573) .cse23 v_prenex_29)) (.cse25 (select |c_#memory_$Pointer$.base| .cse22))) (let ((.cse24 (select .cse25 0)) (.cse21 (store (store (store (store (store (store (store (store (store (store .cse20 .cse22 v_prenex_336) .cse23 .cse26) .cse22 v_prenex_336) .cse23 .cse26) .cse22 v_prenex_336) .cse23 .cse26) .cse22 v_prenex_336) .cse23 .cse26) .cse22 v_prenex_336) .cse23 .cse26))) (and (= .cse20 (store (store .cse21 .cse22 v_prenex_27) .cse23 v_prenex_29)) (not (= .cse24 0)) (= .cse25 (store (select .cse21 .cse22) 0 .cse24)) (= .cse20 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse21 .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29)) (= c_main_~ptr~0.base .cse22) (<= (+ 2 .cse22) .cse23) (= (store .cse26 0 .cse23) v_prenex_29)))))))) .cse27) (exists ((v_prenex_317 (Array Int Int)) (v_prenex_574 (Array Int Int)) (v_prenex_311 (Array Int Int)) (v_prenex_576 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_prenex_314 (Array Int Int))) (let ((.cse29 (select v_prenex_574 0))) (let ((.cse28 (select |c_#memory_$Pointer$.base| .cse29))) (let ((.cse32 (select .cse28 0))) (let ((.cse36 (store |c_#memory_$Pointer$.base| .cse32 v_prenex_576))) (let ((.cse34 (select |c_#memory_$Pointer$.base| .cse32)) (.cse31 (store (store (store (store (store (store (store (store (store (store (store .cse36 .cse29 v_prenex_574) .cse32 v_prenex_313) .cse29 .cse28) .cse32 v_prenex_313) .cse29 .cse28) .cse32 v_prenex_313) .cse29 .cse28) .cse32 v_prenex_313) .cse29 .cse28) .cse32 v_prenex_313) .cse29 .cse28))) (let ((.cse30 (store .cse36 .cse29 v_prenex_314)) (.cse33 (select .cse31 .cse32)) (.cse35 (select .cse34 .cse2))) (and (= (store .cse28 0 .cse29) v_prenex_574) (= .cse29 (select v_prenex_314 0)) (= .cse30 (store (store .cse31 .cse32 v_prenex_311) .cse29 v_prenex_314)) (= (select .cse33 .cse2) (select .cse34 0)) (not (= .cse35 0)) (= .cse32 c_main_~ptr~0.base) (= .cse30 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse31 .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314)) (= (store .cse33 .cse2 .cse35) .cse34) (<= (+ .cse32 2) .cse29))))))))) (and (exists ((v_prenex_291 (Array Int Int)) (v_prenex_285 (Array Int Int)) (v_prenex_286 (Array Int Int)) (v_prenex_561 (Array Int Int)) (v_prenex_288 (Array Int Int))) (let ((.cse39 (select v_prenex_286 0))) (let ((.cse41 (select |c_#memory_$Pointer$.base| .cse39))) (let ((.cse38 (select .cse41 0))) (let ((.cse43 (select |c_#memory_$Pointer$.base| .cse38)) (.cse40 (store (store |c_#memory_$Pointer$.base| .cse38 v_prenex_561) .cse39 v_prenex_286))) (let ((.cse37 (store (store (store (store (store (store (store (store (store (store .cse40 .cse38 v_prenex_288) .cse39 .cse41) .cse38 v_prenex_288) .cse39 .cse41) .cse38 v_prenex_288) .cse39 .cse41) .cse38 v_prenex_288) .cse39 .cse41) .cse38 v_prenex_288) .cse39 .cse41)) (.cse42 (select .cse43 0))) (and (= (store (store .cse37 .cse38 v_prenex_285) .cse39 v_prenex_286) .cse40) (= .cse38 c_main_~ptr~0.base) (= (store .cse41 0 .cse39) v_prenex_286) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse37 .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse40) (= .cse39 .cse42) (not (= .cse42 0)) (<= (+ .cse38 2) .cse39) (= .cse43 (store (select .cse37 .cse38) 0 .cse42))))))))) .cse27) (and (exists ((v_prenex_21 (Array Int Int)) (v_prenex_591 (Array Int Int)) (v_prenex_294 (Array Int Int)) (v_prenex_295 (Array Int Int)) (v_prenex_296 (Array Int Int)) (v_prenex_589 (Array Int Int))) (let ((.cse47 (select v_prenex_589 0))) (let ((.cse48 (select |c_#memory_$Pointer$.base| .cse47))) (let ((.cse46 (select .cse48 0))) (let ((.cse49 (select |c_#memory_$Pointer$.base| .cse46)) (.cse51 (store |c_#memory_$Pointer$.base| .cse46 v_prenex_591))) (let ((.cse44 (store .cse51 .cse47 v_prenex_295)) (.cse45 (store (store (store (store (store (store (store (store (store (store (store .cse51 .cse47 v_prenex_589) .cse46 v_prenex_294) .cse47 .cse48) .cse46 v_prenex_294) .cse47 .cse48) .cse46 v_prenex_294) .cse47 .cse48) .cse46 v_prenex_294) .cse47 .cse48) .cse46 v_prenex_294) .cse47 .cse48)) (.cse50 (select .cse49 0))) (and (= .cse44 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse45 .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295)) (= (select v_prenex_295 0) .cse47) (= (store (store .cse45 .cse46 v_prenex_21) .cse47 v_prenex_295) .cse44) (= (store .cse48 0 .cse47) v_prenex_589) (= c_main_~ptr~0.base .cse46) (= .cse49 (store (select .cse45 .cse46) 0 .cse50)) (<= (+ 2 .cse46) .cse47) (not (= .cse50 0))))))))) .cse27) (exists ((v_prenex_549 (Array Int Int)) (v_prenex_543 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_544 (Array Int Int)) (v_prenex_545 (Array Int Int)) (v_prenex_546 (Array Int Int))) (let ((.cse58 (select v_DerPreprocessor_23 0))) (let ((.cse55 (select |c_#memory_$Pointer$.base| .cse58))) (let ((.cse54 (select .cse55 0))) (let ((.cse60 (store (store (store |c_#memory_$Pointer$.base| .cse58 v_DerPreprocessor_23) .cse54 v_prenex_543) .cse58 v_prenex_546)) (.cse52 (select |c_#memory_$Pointer$.base| .cse54))) (let ((.cse56 (select v_DerPreprocessor_23 .cse2)) (.cse57 (select .cse52 .cse2)) (.cse53 (store (store .cse60 .cse54 v_prenex_545) .cse58 v_prenex_546)) (.cse59 (select (store (store .cse60 .cse54 v_prenex_549) .cse58 v_prenex_546) .cse54))) (and (= .cse52 (select .cse53 .cse54)) (= (store v_DerPreprocessor_23 0 .cse54) .cse55) (= .cse56 .cse57) (<= (+ .cse54 2) .cse58) (= .cse54 c_main_~ptr~0.base) (= (select .cse59 0) (select .cse59 .cse2)) (not (= .cse56 0)) (= (select v_prenex_546 0) .cse54) (= .cse52 (store .cse59 .cse2 .cse57)) (= (select (store (store (store (store .cse53 .cse54 v_prenex_544) .cse58 .cse55) .cse54 v_prenex_544) .cse58 .cse55) .cse54) .cse59)))))))) (and (exists ((v_prenex_565 (Array Int Int)) (v_prenex_301 (Array Int Int)) (v_prenex_302 (Array Int Int)) (v_prenex_567 (Array Int Int)) (v_prenex_303 (Array Int Int)) (v_prenex_304 (Array Int Int))) (let ((.cse64 (select v_prenex_565 0))) (let ((.cse66 (select |c_#memory_$Pointer$.base| .cse64))) (let ((.cse63 (select .cse66 0))) (let ((.cse67 (select |c_#memory_$Pointer$.base| .cse63)) (.cse68 (store |c_#memory_$Pointer$.base| .cse63 v_prenex_567))) (let ((.cse61 (store .cse68 .cse64 v_prenex_302)) (.cse62 (store (store (store (store (store (store (store (store (store (store (store .cse68 .cse64 v_prenex_565) .cse63 v_prenex_301) .cse64 .cse66) .cse63 v_prenex_301) .cse64 .cse66) .cse63 v_prenex_301) .cse64 .cse66) .cse63 v_prenex_301) .cse64 .cse66) .cse63 v_prenex_301) .cse64 .cse66)) (.cse65 (select .cse67 0))) (and (= .cse61 (store (store .cse62 .cse63 v_prenex_303) .cse64 v_prenex_302)) (= .cse61 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse62 .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302)) (not (= .cse65 0)) (= (select v_prenex_302 0) .cse64) (= c_main_~ptr~0.base .cse63) (= (store .cse66 0 .cse64) v_prenex_565) (= .cse67 (store (select .cse62 .cse63) 0 .cse65)) (<= (+ 2 .cse63) .cse64)))))))) .cse27) (and (exists ((v_prenex_592 (Array Int Int)) (v_prenex_593 (Array Int Int)) (v_prenex_583 (Array Int Int)) (v_prenex_594 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_584 (Array Int Int)) (v_prenex_585 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_327 (Array Int Int)) (v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (|main_~#s~0.base| Int)) (let ((.cse69 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse74 (select .cse69 0)) (.cse70 (select v_prenex_584 0))) (let ((.cse75 (store (store (store (store |c_#memory_$Pointer$.base| .cse74 v_prenex_585) |main_~#s~0.base| v_prenex_584) .cse70 v_prenex_583) |main_~#s~0.base| v_prenex_584))) (let ((.cse80 (store (store (store (store (store (store (store (store (store (store (store (store .cse75 .cse74 v_prenex_326) |main_~#s~0.base| .cse69) .cse74 v_prenex_326) |main_~#s~0.base| .cse69) .cse74 v_prenex_326) |main_~#s~0.base| .cse69) .cse70 v_prenex_327) |main_~#s~0.base| .cse69) .cse74 v_prenex_326) |main_~#s~0.base| .cse69) .cse74 v_prenex_326) |main_~#s~0.base| .cse69))) (let ((.cse81 (select |c_#memory_$Pointer$.base| .cse74)) (.cse71 (select .cse75 .cse70)) (.cse79 (store (store (store (store .cse80 .cse74 v_prenex_594) |main_~#s~0.base| v_prenex_328) .cse70 v_prenex_593) |main_~#s~0.base| v_prenex_328)) (.cse76 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse80 .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse70 v_prenex_329) |main_~#s~0.base| v_prenex_328))) (let ((.cse72 (select .cse76 .cse70)) (.cse78 (select (store (store (store (store .cse79 .cse70 v_prenex_592) |main_~#s~0.base| v_prenex_584) .cse70 v_prenex_592) |main_~#s~0.base| v_prenex_584) .cse70)) (.cse73 (select .cse71 0)) (.cse82 (select .cse81 0)) (.cse77 (select .cse79 .cse70))) (and (= v_prenex_584 (store .cse69 0 .cse70)) (= .cse71 (store .cse72 0 .cse73)) (= c_main_~ptr~0.base .cse74) (= (store (store (store (store .cse75 .cse70 .cse72) |main_~#s~0.base| v_prenex_328) .cse70 .cse72) |main_~#s~0.base| v_prenex_328) .cse76) (= v_prenex_329 .cse72) (= v_prenex_593 .cse77) (= .cse78 .cse72) (= (select .cse79 .cse74) v_prenex_594) (= |c_#memory_$Pointer$.base| (store (store (store (store .cse80 .cse74 .cse81) |main_~#s~0.base| .cse69) .cse74 .cse81) |main_~#s~0.base| .cse69)) (not (= .cse82 0)) (= (select .cse76 .cse74) v_prenex_330) (= .cse78 v_prenex_592) (= (store (store (store (store .cse75 .cse70 .cse77) |main_~#s~0.base| v_prenex_328) .cse70 .cse77) |main_~#s~0.base| v_prenex_328) .cse79) (= v_prenex_327 (select .cse80 .cse70)) (<= (+ 2 .cse74) |main_~#s~0.base|) (= .cse81 (store (select .cse80 .cse74) 0 .cse82)) (= (select .cse75 .cse74) v_prenex_585) (= .cse73 .cse82) (= .cse71 .cse77) (= .cse71 v_prenex_583) (= (select v_prenex_328 0) .cse70))))))))) .cse27) (exists ((|main_~#s~0.base| Int)) (let ((.cse95 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse83 (select .cse95 0))) (and (= c_main_~ptr~0.base .cse83) (exists ((v_prenex_558 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_551 (Array Int Int)) (v_prenex_552 (Array Int Int)) (v_prenex_553 (Array Int Int)) (v_prenex_554 (Array Int Int)) (v_prenex_555 (Array Int Int)) (v_prenex_556 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int)) (v_prenex_557 (Array Int Int))) (let ((.cse94 (select v_DerPreprocessor_25 0))) (let ((.cse91 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse83 v_prenex_551) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25))) (let ((.cse93 (store (store (store (store .cse91 .cse94 v_prenex_554) |main_~#s~0.base| v_prenex_555) .cse83 v_prenex_553) |main_~#s~0.base| v_prenex_555)) (.cse85 (select |c_#memory_$Pointer$.base| .cse83)) (.cse88 (select (store (store (store (store .cse91 .cse94 v_DerPreprocessor_26) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_DerPreprocessor_26) |main_~#s~0.base| v_DerPreprocessor_25) .cse94)) (.cse89 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse91 .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse83 v_prenex_557) |main_~#s~0.base| v_prenex_555))) (let ((.cse87 (select .cse91 .cse94)) (.cse84 (select .cse89 .cse83)) (.cse92 (select .cse88 .cse2)) (.cse86 (select .cse85 .cse2)) (.cse90 (select .cse93 .cse83))) (and (= (select .cse84 0) (select .cse84 .cse2)) (= .cse85 (store .cse84 .cse2 .cse86)) (= (select .cse87 .cse2) (select .cse88 0)) (= .cse87 v_prenex_556) (= .cse89 (store (store (store (store |c_#memory_$Pointer$.base| .cse83 .cse84) |main_~#s~0.base| v_prenex_555) .cse83 .cse84) |main_~#s~0.base| v_prenex_555)) (= .cse90 .cse85) (= (select .cse91 .cse83) v_prenex_551) (= (store .cse87 .cse2 .cse92) .cse88) (= v_prenex_554 (select .cse93 .cse94)) (= .cse88 v_DerPreprocessor_26) (= (select v_prenex_555 0) .cse83) (= (store v_DerPreprocessor_25 0 .cse83) .cse95) (= v_prenex_558 (select .cse89 .cse94)) (= .cse84 (select (store (store (store (store .cse93 .cse83 v_prenex_552) |main_~#s~0.base| .cse95) .cse83 v_prenex_552) |main_~#s~0.base| .cse95) .cse83)) (not (= .cse92 0)) (= .cse92 .cse86) (= (store (store (store (store |c_#memory_$Pointer$.base| .cse83 .cse90) |main_~#s~0.base| v_prenex_555) .cse83 .cse90) |main_~#s~0.base| v_prenex_555) .cse93))))))) (<= (+ 2 .cse83) |main_~#s~0.base|))))) (and (exists ((v_prenex_25 (Array Int Int)) (v_prenex_562 (Array Int Int)) (v_prenex_595 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_564 (Array Int Int)) (v_prenex_599 (Array Int Int))) (let ((.cse99 (select v_prenex_562 0))) (let ((.cse102 (select |c_#memory_$Pointer$.base| .cse99))) (let ((.cse98 (select .cse102 0))) (let ((.cse103 (store |c_#memory_$Pointer$.base| .cse98 v_prenex_564)) (.cse101 (select |c_#memory_$Pointer$.base| .cse98))) (let ((.cse100 (select .cse101 0)) (.cse97 (store (store (store (store (store (store (store (store (store (store (store .cse103 .cse99 v_prenex_562) .cse98 v_prenex_595) .cse99 .cse102) .cse98 v_prenex_595) .cse99 .cse102) .cse98 v_prenex_595) .cse99 .cse102) .cse98 v_prenex_595) .cse99 .cse102) .cse98 v_prenex_595) .cse99 .cse102)) (.cse96 (store .cse103 .cse99 v_prenex_25))) (and (= .cse96 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse97 .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25)) (= .cse99 (select v_prenex_25 0)) (= (store (select .cse97 .cse98) 0 .cse100) .cse101) (not (= .cse100 0)) (<= (+ 2 .cse98) .cse99) (= .cse98 c_main_~ptr~0.base) (= v_prenex_562 (store .cse102 0 .cse99)) (= (store (store .cse97 .cse98 v_prenex_24) .cse99 v_prenex_25) .cse96)))))))) .cse27) (exists ((v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_324 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_579 (Array Int Int))) (let ((.cse105 (select v_prenex_321 0))) (let ((.cse107 (select |c_#memory_$Pointer$.base| .cse105))) (let ((.cse104 (select .cse107 0))) (let ((.cse110 (store (store |c_#memory_$Pointer$.base| .cse104 v_prenex_579) .cse105 v_prenex_321))) (let ((.cse108 (select |c_#memory_$Pointer$.base| .cse104)) (.cse111 (store (store (store (store (store (store (store (store (store (store .cse110 .cse104 v_prenex_320) .cse105 .cse107) .cse104 v_prenex_320) .cse105 .cse107) .cse104 v_prenex_320) .cse105 .cse107) .cse104 v_prenex_320) .cse105 .cse107) .cse104 v_prenex_320) .cse105 .cse107))) (let ((.cse109 (select .cse111 .cse104)) (.cse106 (select .cse108 .cse2))) (and (<= (+ 2 .cse104) .cse105) (= .cse104 c_main_~ptr~0.base) (= .cse105 (select v_prenex_321 .cse2)) (not (= .cse106 0)) (= (store .cse107 0 .cse105) v_prenex_321) (= (select .cse108 0) (select .cse109 .cse2)) (= .cse108 (store .cse109 .cse2 .cse106)) (= .cse110 (store (store .cse111 .cse104 v_prenex_324) .cse105 v_prenex_321)) (= .cse110 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse111 .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321)))))))))) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_570 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_335 (Array Int Int)) (v_prenex_568 (Array Int Int))) (let ((.cse113 (select v_prenex_568 0))) (let ((.cse112 (select |c_#memory_$Pointer$.base| .cse113))) (let ((.cse117 (select .cse112 0))) (let ((.cse120 (store |c_#memory_$Pointer$.base| .cse117 v_prenex_570))) (let ((.cse119 (select |c_#memory_$Pointer$.base| .cse117)) (.cse116 (store (store (store (store (store (store (store (store (store (store (store .cse120 .cse113 v_prenex_568) .cse117 v_prenex_331) .cse113 .cse112) .cse117 v_prenex_331) .cse113 .cse112) .cse117 v_prenex_331) .cse113 .cse112) .cse117 v_prenex_331) .cse113 .cse112) .cse117 v_prenex_331) .cse113 .cse112))) (let ((.cse118 (select .cse116 .cse117)) (.cse114 (select .cse119 .cse2)) (.cse115 (store .cse120 .cse113 v_prenex_19))) (and (= (store .cse112 0 .cse113) v_prenex_568) (not (= 0 .cse114)) (= .cse115 (store (store .cse116 .cse117 v_prenex_18) .cse113 v_prenex_19)) (= (select .cse118 .cse2) (select .cse119 0)) (= (select v_prenex_19 0) .cse113) (= (store .cse118 .cse2 .cse114) .cse119) (<= (+ .cse117 2) .cse113) (= (select v_prenex_568 .cse2) .cse113) (= .cse117 c_main_~ptr~0.base) (= .cse115 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse116 .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19)))))))))) (exists ((v_prenex_538 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_539 (Array Int Int)) (v_prenex_540 (Array Int Int)) (v_prenex_541 (Array Int Int)) (v_prenex_67 (Array Int Int))) (let ((.cse123 (select v_DerPreprocessor_32 0))) (let ((.cse122 (select |c_#memory_$Pointer$.base| .cse123))) (let ((.cse121 (select .cse122 0))) (let ((.cse124 (select |c_#memory_$Pointer$.base| .cse121)) (.cse128 (store (store (store |c_#memory_$Pointer$.base| .cse123 v_DerPreprocessor_32) .cse121 v_prenex_538) .cse123 v_prenex_541))) (let ((.cse125 (select (store (store .cse128 .cse121 v_prenex_67) .cse123 v_prenex_541) .cse121)) (.cse126 (select .cse124 .cse2)) (.cse127 (store (store .cse128 .cse121 v_prenex_540) .cse123 v_prenex_541))) (and (= (store v_DerPreprocessor_32 0 .cse121) .cse122) (= .cse121 c_main_~ptr~0.base) (<= (+ .cse121 2) .cse123) (= .cse124 (store .cse125 .cse2 .cse126)) (= (select (store (store (store (store .cse127 .cse121 v_prenex_539) .cse123 .cse122) .cse121 v_prenex_539) .cse123 .cse122) .cse121) .cse125) (= .cse121 (select v_prenex_541 0)) (= (select .cse125 .cse2) (select .cse125 0)) (not (= .cse126 0)) (= .cse124 (select .cse127 .cse121))))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_32 (Array Int Int)) (|main_~#s~0.base| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse138 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse132 (select .cse138 0)) (.cse134 (select v_DerPreprocessor_28 0))) (let ((.cse141 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse132 v_DerPreprocessor_10) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28))) (let ((.cse139 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse141 .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse132 v_DerPreprocessor_16) |main_~#s~0.base| v_DerPreprocessor_15)) (.cse140 (select (store (store (store (store .cse141 .cse134 v_DerPreprocessor_29) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_29) |main_~#s~0.base| v_DerPreprocessor_28) .cse134)) (.cse133 (store (store (store (store .cse141 .cse134 v_prenex_30) |main_~#s~0.base| v_DerPreprocessor_15) .cse132 v_prenex_31) |main_~#s~0.base| v_DerPreprocessor_15)) (.cse130 (select |c_#memory_$Pointer$.base| .cse132))) (let ((.cse135 (select .cse130 0)) (.cse129 (select .cse133 .cse132)) (.cse131 (select .cse141 .cse134)) (.cse136 (select .cse140 0)) (.cse137 (select .cse139 .cse132))) (and (= .cse129 .cse130) (= .cse131 v_DerPreprocessor_8) (= (select v_DerPreprocessor_15 0) .cse132) (= c_main_~ptr~0.base .cse132) (= (select .cse133 .cse134) v_prenex_30) (= .cse135 .cse136) (= .cse137 (select (store (store (store (store .cse133 .cse132 v_prenex_32) |main_~#s~0.base| .cse138) .cse132 v_prenex_32) |main_~#s~0.base| .cse138) .cse132)) (= (store .cse137 0 .cse135) .cse130) (= (store v_DerPreprocessor_28 0 .cse132) .cse138) (not (= .cse136 0)) (= .cse133 (store (store (store (store |c_#memory_$Pointer$.base| .cse132 .cse129) |main_~#s~0.base| v_DerPreprocessor_15) .cse132 .cse129) |main_~#s~0.base| v_DerPreprocessor_15)) (<= (+ 2 .cse132) |main_~#s~0.base|) (= v_DerPreprocessor_14 (select .cse139 .cse134)) (= (store .cse131 0 .cse136) .cse140) (= .cse139 (store (store (store (store |c_#memory_$Pointer$.base| .cse132 .cse137) |main_~#s~0.base| v_DerPreprocessor_15) .cse132 .cse137) |main_~#s~0.base| v_DerPreprocessor_15)) (= (select .cse141 .cse132) v_DerPreprocessor_10) (= v_DerPreprocessor_29 .cse140)))))))) .cse27) (exists ((|main_~#s~0.base| Int)) (let ((.cse156 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse142 (select .cse156 0))) (let ((.cse144 (select |c_#memory_$Pointer$.base| .cse142))) (let ((.cse143 (select .cse144 .cse2))) (and (= c_main_~ptr~0.base .cse142) (not (= .cse143 0)) (<= (+ 2 .cse142) |main_~#s~0.base|) (exists ((v_prenex_280 (Array Int Int)) (v_prenex_281 (Array Int Int)) (v_prenex_282 (Array Int Int)) (v_prenex_283 (Array Int Int)) (v_prenex_276 (Array Int Int)) (v_prenex_277 (Array Int Int)) (v_prenex_586 (Array Int Int)) (v_prenex_278 (Array Int Int)) (v_prenex_587 (Array Int Int)) (v_prenex_279 (Array Int Int)) (v_prenex_588 (Array Int Int))) (let ((.cse148 (select v_prenex_587 0))) (let ((.cse147 (store (store (store (store |c_#memory_$Pointer$.base| .cse142 v_prenex_588) |main_~#s~0.base| v_prenex_587) .cse148 v_prenex_586) |main_~#s~0.base| v_prenex_587))) (let ((.cse150 (store (store (store (store (store (store (store (store (store (store (store (store .cse147 .cse142 v_prenex_281) |main_~#s~0.base| .cse156) .cse142 v_prenex_281) |main_~#s~0.base| .cse156) .cse142 v_prenex_281) |main_~#s~0.base| .cse156) .cse148 v_prenex_276) |main_~#s~0.base| .cse156) .cse142 v_prenex_281) |main_~#s~0.base| .cse156) .cse142 v_prenex_281) |main_~#s~0.base| .cse156))) (let ((.cse155 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse150 .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse148 v_prenex_282) |main_~#s~0.base| v_prenex_280)) (.cse151 (select .cse147 .cse148)) (.cse146 (store (store (store (store .cse150 .cse142 v_prenex_279) |main_~#s~0.base| v_prenex_280) .cse148 v_prenex_278) |main_~#s~0.base| v_prenex_280))) (let ((.cse154 (select (store (store (store (store .cse146 .cse148 v_prenex_277) |main_~#s~0.base| v_prenex_587) .cse148 v_prenex_277) |main_~#s~0.base| v_prenex_587) .cse148)) (.cse149 (select .cse146 .cse148)) (.cse153 (select .cse151 .cse2)) (.cse152 (select .cse155 .cse148)) (.cse145 (select .cse150 .cse142))) (and (= (select .cse144 0) (select .cse145 .cse2)) (= .cse146 (store (store (store (store .cse147 .cse148 .cse149) |main_~#s~0.base| v_prenex_280) .cse148 .cse149) |main_~#s~0.base| v_prenex_280)) (= (select .cse147 .cse142) v_prenex_588) (= (select .cse150 .cse148) v_prenex_276) (= .cse151 (store .cse152 .cse2 .cse153)) (= .cse152 .cse154) (= .cse149 v_prenex_278) (= (select .cse155 .cse142) v_prenex_283) (= .cse154 v_prenex_277) (= .cse151 v_prenex_586) (= (store (store (store (store .cse150 .cse142 .cse144) |main_~#s~0.base| .cse156) .cse142 .cse144) |main_~#s~0.base| .cse156) |c_#memory_$Pointer$.base|) (= (store (store (store (store .cse147 .cse148 .cse152) |main_~#s~0.base| v_prenex_280) .cse148 .cse152) |main_~#s~0.base| v_prenex_280) .cse155) (= (select .cse152 0) (select .cse152 .cse2)) (= .cse149 .cse151) (= v_prenex_587 (store .cse156 0 .cse148)) (= .cse143 .cse153) (= .cse152 v_prenex_282) (= (select .cse146 .cse142) v_prenex_279) (= .cse144 (store .cse145 .cse2 .cse143)) (= .cse148 (select v_prenex_280 0)))))))))))))))))) is different from false [2023-04-02 21:52:27,243 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_main_~ptr~0.offset 4))) (let ((.cse27 (= .cse2 0))) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_prenex_270 (Array Int Int)) (v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_275 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_20 0))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse0 (select .cse9 0))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_18))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse7 (store (store (store (store (store (store (store (store (store (store (store .cse10 .cse4 v_DerPreprocessor_20) .cse0 v_prenex_271) .cse4 .cse9) .cse0 v_prenex_271) .cse4 .cse9) .cse0 v_prenex_271) .cse4 .cse9) .cse0 v_prenex_271) .cse4 .cse9) .cse0 v_prenex_271) .cse4 .cse9))) (let ((.cse1 (select .cse7 .cse0)) (.cse6 (select v_prenex_270 0)) (.cse5 (select .cse3 .cse2)) (.cse8 (store .cse10 .cse4 v_prenex_270))) (and (= c_main_~ptr~0.base .cse0) (= (select .cse1 .cse2) (select .cse3 0)) (<= (+ 2 .cse0) .cse4) (= (store .cse1 .cse2 .cse5) .cse3) (= .cse6 .cse4) (= .cse6 (select v_prenex_270 .cse2)) (not (= .cse5 0)) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse7 .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse0 v_prenex_275) .cse4 v_prenex_270) .cse8) (= .cse8 (store (store .cse7 .cse0 v_prenex_272) .cse4 v_prenex_270)) (= v_DerPreprocessor_20 (store .cse9 0 .cse4)))))))))) (exists ((v_prenex_305 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_309 (Array Int Int)) (v_prenex_582 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_DerPreprocessor_11 0))) (let ((.cse19 (select |c_#memory_$Pointer$.base| .cse16))) (let ((.cse15 (select .cse19 0))) (let ((.cse13 (store (store |c_#memory_$Pointer$.base| .cse15 v_prenex_582) .cse16 v_DerPreprocessor_11))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse15)) (.cse14 (store (store (store (store (store (store (store (store (store (store .cse13 .cse15 v_prenex_305) .cse16 .cse19) .cse15 v_prenex_305) .cse16 .cse19) .cse15 v_prenex_305) .cse16 .cse19) .cse15 v_prenex_305) .cse16 .cse19) .cse15 v_prenex_305) .cse16 .cse19))) (let ((.cse12 (select .cse14 .cse15)) (.cse17 (select .cse11 .cse2)) (.cse18 (select v_DerPreprocessor_11 .cse2))) (and (= (select .cse11 0) (select .cse12 .cse2)) (= .cse13 (store (store .cse14 .cse15 v_DerPreprocessor_5) .cse16 v_DerPreprocessor_11)) (not (= .cse17 0)) (= c_main_~ptr~0.base .cse15) (= .cse18 .cse17) (= v_DerPreprocessor_11 (store .cse19 0 .cse16)) (= .cse13 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse14 .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11) .cse15 v_prenex_309) .cse16 v_DerPreprocessor_11)) (<= (+ 2 .cse15) .cse16) (= .cse11 (store .cse12 .cse2 .cse17)) (= .cse18 .cse16))))))))) (and (exists ((v_prenex_340 (Array Int Int)) (v_prenex_573 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_336 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse23 (select v_prenex_29 0))) (let ((.cse26 (select |c_#memory_$Pointer$.base| .cse23))) (let ((.cse22 (select .cse26 0))) (let ((.cse20 (store (store |c_#memory_$Pointer$.base| .cse22 v_prenex_573) .cse23 v_prenex_29)) (.cse25 (select |c_#memory_$Pointer$.base| .cse22))) (let ((.cse24 (select .cse25 0)) (.cse21 (store (store (store (store (store (store (store (store (store (store .cse20 .cse22 v_prenex_336) .cse23 .cse26) .cse22 v_prenex_336) .cse23 .cse26) .cse22 v_prenex_336) .cse23 .cse26) .cse22 v_prenex_336) .cse23 .cse26) .cse22 v_prenex_336) .cse23 .cse26))) (and (= .cse20 (store (store .cse21 .cse22 v_prenex_27) .cse23 v_prenex_29)) (not (= .cse24 0)) (= .cse25 (store (select .cse21 .cse22) 0 .cse24)) (= .cse20 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse21 .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29) .cse22 v_prenex_340) .cse23 v_prenex_29)) (= c_main_~ptr~0.base .cse22) (<= (+ 2 .cse22) .cse23) (= (store .cse26 0 .cse23) v_prenex_29)))))))) .cse27) (exists ((v_prenex_317 (Array Int Int)) (v_prenex_574 (Array Int Int)) (v_prenex_311 (Array Int Int)) (v_prenex_576 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_prenex_314 (Array Int Int))) (let ((.cse29 (select v_prenex_574 0))) (let ((.cse28 (select |c_#memory_$Pointer$.base| .cse29))) (let ((.cse32 (select .cse28 0))) (let ((.cse36 (store |c_#memory_$Pointer$.base| .cse32 v_prenex_576))) (let ((.cse34 (select |c_#memory_$Pointer$.base| .cse32)) (.cse31 (store (store (store (store (store (store (store (store (store (store (store .cse36 .cse29 v_prenex_574) .cse32 v_prenex_313) .cse29 .cse28) .cse32 v_prenex_313) .cse29 .cse28) .cse32 v_prenex_313) .cse29 .cse28) .cse32 v_prenex_313) .cse29 .cse28) .cse32 v_prenex_313) .cse29 .cse28))) (let ((.cse30 (store .cse36 .cse29 v_prenex_314)) (.cse33 (select .cse31 .cse32)) (.cse35 (select .cse34 .cse2))) (and (= (store .cse28 0 .cse29) v_prenex_574) (= .cse29 (select v_prenex_314 0)) (= .cse30 (store (store .cse31 .cse32 v_prenex_311) .cse29 v_prenex_314)) (= (select .cse33 .cse2) (select .cse34 0)) (not (= .cse35 0)) (= .cse32 c_main_~ptr~0.base) (= .cse30 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse31 .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314) .cse32 v_prenex_317) .cse29 v_prenex_314)) (= (store .cse33 .cse2 .cse35) .cse34) (<= (+ .cse32 2) .cse29))))))))) (and (exists ((v_prenex_291 (Array Int Int)) (v_prenex_285 (Array Int Int)) (v_prenex_286 (Array Int Int)) (v_prenex_561 (Array Int Int)) (v_prenex_288 (Array Int Int))) (let ((.cse39 (select v_prenex_286 0))) (let ((.cse41 (select |c_#memory_$Pointer$.base| .cse39))) (let ((.cse38 (select .cse41 0))) (let ((.cse43 (select |c_#memory_$Pointer$.base| .cse38)) (.cse40 (store (store |c_#memory_$Pointer$.base| .cse38 v_prenex_561) .cse39 v_prenex_286))) (let ((.cse37 (store (store (store (store (store (store (store (store (store (store .cse40 .cse38 v_prenex_288) .cse39 .cse41) .cse38 v_prenex_288) .cse39 .cse41) .cse38 v_prenex_288) .cse39 .cse41) .cse38 v_prenex_288) .cse39 .cse41) .cse38 v_prenex_288) .cse39 .cse41)) (.cse42 (select .cse43 0))) (and (= (store (store .cse37 .cse38 v_prenex_285) .cse39 v_prenex_286) .cse40) (= .cse38 c_main_~ptr~0.base) (= (store .cse41 0 .cse39) v_prenex_286) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse37 .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse38 v_prenex_291) .cse39 v_prenex_286) .cse40) (= .cse39 .cse42) (not (= .cse42 0)) (<= (+ .cse38 2) .cse39) (= .cse43 (store (select .cse37 .cse38) 0 .cse42))))))))) .cse27) (and (exists ((v_prenex_21 (Array Int Int)) (v_prenex_591 (Array Int Int)) (v_prenex_294 (Array Int Int)) (v_prenex_295 (Array Int Int)) (v_prenex_296 (Array Int Int)) (v_prenex_589 (Array Int Int))) (let ((.cse47 (select v_prenex_589 0))) (let ((.cse48 (select |c_#memory_$Pointer$.base| .cse47))) (let ((.cse46 (select .cse48 0))) (let ((.cse49 (select |c_#memory_$Pointer$.base| .cse46)) (.cse51 (store |c_#memory_$Pointer$.base| .cse46 v_prenex_591))) (let ((.cse44 (store .cse51 .cse47 v_prenex_295)) (.cse45 (store (store (store (store (store (store (store (store (store (store (store .cse51 .cse47 v_prenex_589) .cse46 v_prenex_294) .cse47 .cse48) .cse46 v_prenex_294) .cse47 .cse48) .cse46 v_prenex_294) .cse47 .cse48) .cse46 v_prenex_294) .cse47 .cse48) .cse46 v_prenex_294) .cse47 .cse48)) (.cse50 (select .cse49 0))) (and (= .cse44 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse45 .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295) .cse46 v_prenex_296) .cse47 v_prenex_295)) (= (select v_prenex_295 0) .cse47) (= (store (store .cse45 .cse46 v_prenex_21) .cse47 v_prenex_295) .cse44) (= (store .cse48 0 .cse47) v_prenex_589) (= c_main_~ptr~0.base .cse46) (= .cse49 (store (select .cse45 .cse46) 0 .cse50)) (<= (+ 2 .cse46) .cse47) (not (= .cse50 0))))))))) .cse27) (exists ((v_prenex_549 (Array Int Int)) (v_prenex_543 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_544 (Array Int Int)) (v_prenex_545 (Array Int Int)) (v_prenex_546 (Array Int Int))) (let ((.cse58 (select v_DerPreprocessor_23 0))) (let ((.cse55 (select |c_#memory_$Pointer$.base| .cse58))) (let ((.cse54 (select .cse55 0))) (let ((.cse60 (store (store (store |c_#memory_$Pointer$.base| .cse58 v_DerPreprocessor_23) .cse54 v_prenex_543) .cse58 v_prenex_546)) (.cse52 (select |c_#memory_$Pointer$.base| .cse54))) (let ((.cse56 (select v_DerPreprocessor_23 .cse2)) (.cse57 (select .cse52 .cse2)) (.cse53 (store (store .cse60 .cse54 v_prenex_545) .cse58 v_prenex_546)) (.cse59 (select (store (store .cse60 .cse54 v_prenex_549) .cse58 v_prenex_546) .cse54))) (and (= .cse52 (select .cse53 .cse54)) (= (store v_DerPreprocessor_23 0 .cse54) .cse55) (= .cse56 .cse57) (<= (+ .cse54 2) .cse58) (= .cse54 c_main_~ptr~0.base) (= (select .cse59 0) (select .cse59 .cse2)) (not (= .cse56 0)) (= (select v_prenex_546 0) .cse54) (= .cse52 (store .cse59 .cse2 .cse57)) (= (select (store (store (store (store .cse53 .cse54 v_prenex_544) .cse58 .cse55) .cse54 v_prenex_544) .cse58 .cse55) .cse54) .cse59)))))))) (and (exists ((v_prenex_565 (Array Int Int)) (v_prenex_301 (Array Int Int)) (v_prenex_302 (Array Int Int)) (v_prenex_567 (Array Int Int)) (v_prenex_303 (Array Int Int)) (v_prenex_304 (Array Int Int))) (let ((.cse64 (select v_prenex_565 0))) (let ((.cse66 (select |c_#memory_$Pointer$.base| .cse64))) (let ((.cse63 (select .cse66 0))) (let ((.cse67 (select |c_#memory_$Pointer$.base| .cse63)) (.cse68 (store |c_#memory_$Pointer$.base| .cse63 v_prenex_567))) (let ((.cse61 (store .cse68 .cse64 v_prenex_302)) (.cse62 (store (store (store (store (store (store (store (store (store (store (store .cse68 .cse64 v_prenex_565) .cse63 v_prenex_301) .cse64 .cse66) .cse63 v_prenex_301) .cse64 .cse66) .cse63 v_prenex_301) .cse64 .cse66) .cse63 v_prenex_301) .cse64 .cse66) .cse63 v_prenex_301) .cse64 .cse66)) (.cse65 (select .cse67 0))) (and (= .cse61 (store (store .cse62 .cse63 v_prenex_303) .cse64 v_prenex_302)) (= .cse61 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse62 .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302) .cse63 v_prenex_304) .cse64 v_prenex_302)) (not (= .cse65 0)) (= (select v_prenex_302 0) .cse64) (= c_main_~ptr~0.base .cse63) (= (store .cse66 0 .cse64) v_prenex_565) (= .cse67 (store (select .cse62 .cse63) 0 .cse65)) (<= (+ 2 .cse63) .cse64)))))))) .cse27) (and (exists ((v_prenex_592 (Array Int Int)) (v_prenex_593 (Array Int Int)) (v_prenex_583 (Array Int Int)) (v_prenex_594 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_584 (Array Int Int)) (v_prenex_585 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_327 (Array Int Int)) (v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (|main_~#s~0.base| Int)) (let ((.cse69 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse74 (select .cse69 0)) (.cse70 (select v_prenex_584 0))) (let ((.cse75 (store (store (store (store |c_#memory_$Pointer$.base| .cse74 v_prenex_585) |main_~#s~0.base| v_prenex_584) .cse70 v_prenex_583) |main_~#s~0.base| v_prenex_584))) (let ((.cse80 (store (store (store (store (store (store (store (store (store (store (store (store .cse75 .cse74 v_prenex_326) |main_~#s~0.base| .cse69) .cse74 v_prenex_326) |main_~#s~0.base| .cse69) .cse74 v_prenex_326) |main_~#s~0.base| .cse69) .cse70 v_prenex_327) |main_~#s~0.base| .cse69) .cse74 v_prenex_326) |main_~#s~0.base| .cse69) .cse74 v_prenex_326) |main_~#s~0.base| .cse69))) (let ((.cse81 (select |c_#memory_$Pointer$.base| .cse74)) (.cse71 (select .cse75 .cse70)) (.cse79 (store (store (store (store .cse80 .cse74 v_prenex_594) |main_~#s~0.base| v_prenex_328) .cse70 v_prenex_593) |main_~#s~0.base| v_prenex_328)) (.cse76 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse80 .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse74 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse70 v_prenex_329) |main_~#s~0.base| v_prenex_328))) (let ((.cse72 (select .cse76 .cse70)) (.cse78 (select (store (store (store (store .cse79 .cse70 v_prenex_592) |main_~#s~0.base| v_prenex_584) .cse70 v_prenex_592) |main_~#s~0.base| v_prenex_584) .cse70)) (.cse73 (select .cse71 0)) (.cse82 (select .cse81 0)) (.cse77 (select .cse79 .cse70))) (and (= v_prenex_584 (store .cse69 0 .cse70)) (= .cse71 (store .cse72 0 .cse73)) (= c_main_~ptr~0.base .cse74) (= (store (store (store (store .cse75 .cse70 .cse72) |main_~#s~0.base| v_prenex_328) .cse70 .cse72) |main_~#s~0.base| v_prenex_328) .cse76) (= v_prenex_329 .cse72) (= v_prenex_593 .cse77) (= .cse78 .cse72) (= (select .cse79 .cse74) v_prenex_594) (= |c_#memory_$Pointer$.base| (store (store (store (store .cse80 .cse74 .cse81) |main_~#s~0.base| .cse69) .cse74 .cse81) |main_~#s~0.base| .cse69)) (not (= .cse82 0)) (= (select .cse76 .cse74) v_prenex_330) (= .cse78 v_prenex_592) (= (store (store (store (store .cse75 .cse70 .cse77) |main_~#s~0.base| v_prenex_328) .cse70 .cse77) |main_~#s~0.base| v_prenex_328) .cse79) (= v_prenex_327 (select .cse80 .cse70)) (<= (+ 2 .cse74) |main_~#s~0.base|) (= .cse81 (store (select .cse80 .cse74) 0 .cse82)) (= (select .cse75 .cse74) v_prenex_585) (= .cse73 .cse82) (= .cse71 .cse77) (= .cse71 v_prenex_583) (= (select v_prenex_328 0) .cse70))))))))) .cse27) (exists ((|main_~#s~0.base| Int)) (let ((.cse95 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse83 (select .cse95 0))) (and (= c_main_~ptr~0.base .cse83) (exists ((v_prenex_558 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_551 (Array Int Int)) (v_prenex_552 (Array Int Int)) (v_prenex_553 (Array Int Int)) (v_prenex_554 (Array Int Int)) (v_prenex_555 (Array Int Int)) (v_prenex_556 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int)) (v_prenex_557 (Array Int Int))) (let ((.cse94 (select v_DerPreprocessor_25 0))) (let ((.cse91 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse83 v_prenex_551) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25))) (let ((.cse93 (store (store (store (store .cse91 .cse94 v_prenex_554) |main_~#s~0.base| v_prenex_555) .cse83 v_prenex_553) |main_~#s~0.base| v_prenex_555)) (.cse85 (select |c_#memory_$Pointer$.base| .cse83)) (.cse88 (select (store (store (store (store .cse91 .cse94 v_DerPreprocessor_26) |main_~#s~0.base| v_DerPreprocessor_25) .cse94 v_DerPreprocessor_26) |main_~#s~0.base| v_DerPreprocessor_25) .cse94)) (.cse89 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse91 .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse94 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse83 v_prenex_557) |main_~#s~0.base| v_prenex_555))) (let ((.cse87 (select .cse91 .cse94)) (.cse84 (select .cse89 .cse83)) (.cse92 (select .cse88 .cse2)) (.cse86 (select .cse85 .cse2)) (.cse90 (select .cse93 .cse83))) (and (= (select .cse84 0) (select .cse84 .cse2)) (= .cse85 (store .cse84 .cse2 .cse86)) (= (select .cse87 .cse2) (select .cse88 0)) (= .cse87 v_prenex_556) (= .cse89 (store (store (store (store |c_#memory_$Pointer$.base| .cse83 .cse84) |main_~#s~0.base| v_prenex_555) .cse83 .cse84) |main_~#s~0.base| v_prenex_555)) (= .cse90 .cse85) (= (select .cse91 .cse83) v_prenex_551) (= (store .cse87 .cse2 .cse92) .cse88) (= v_prenex_554 (select .cse93 .cse94)) (= .cse88 v_DerPreprocessor_26) (= (select v_prenex_555 0) .cse83) (= (store v_DerPreprocessor_25 0 .cse83) .cse95) (= v_prenex_558 (select .cse89 .cse94)) (= .cse84 (select (store (store (store (store .cse93 .cse83 v_prenex_552) |main_~#s~0.base| .cse95) .cse83 v_prenex_552) |main_~#s~0.base| .cse95) .cse83)) (not (= .cse92 0)) (= .cse92 .cse86) (= (store (store (store (store |c_#memory_$Pointer$.base| .cse83 .cse90) |main_~#s~0.base| v_prenex_555) .cse83 .cse90) |main_~#s~0.base| v_prenex_555) .cse93))))))) (<= (+ 2 .cse83) |main_~#s~0.base|))))) (and (exists ((v_prenex_25 (Array Int Int)) (v_prenex_562 (Array Int Int)) (v_prenex_595 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_564 (Array Int Int)) (v_prenex_599 (Array Int Int))) (let ((.cse99 (select v_prenex_562 0))) (let ((.cse102 (select |c_#memory_$Pointer$.base| .cse99))) (let ((.cse98 (select .cse102 0))) (let ((.cse103 (store |c_#memory_$Pointer$.base| .cse98 v_prenex_564)) (.cse101 (select |c_#memory_$Pointer$.base| .cse98))) (let ((.cse100 (select .cse101 0)) (.cse97 (store (store (store (store (store (store (store (store (store (store (store .cse103 .cse99 v_prenex_562) .cse98 v_prenex_595) .cse99 .cse102) .cse98 v_prenex_595) .cse99 .cse102) .cse98 v_prenex_595) .cse99 .cse102) .cse98 v_prenex_595) .cse99 .cse102) .cse98 v_prenex_595) .cse99 .cse102)) (.cse96 (store .cse103 .cse99 v_prenex_25))) (and (= .cse96 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse97 .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25) .cse98 v_prenex_599) .cse99 v_prenex_25)) (= .cse99 (select v_prenex_25 0)) (= (store (select .cse97 .cse98) 0 .cse100) .cse101) (not (= .cse100 0)) (<= (+ 2 .cse98) .cse99) (= .cse98 c_main_~ptr~0.base) (= v_prenex_562 (store .cse102 0 .cse99)) (= (store (store .cse97 .cse98 v_prenex_24) .cse99 v_prenex_25) .cse96)))))))) .cse27) (exists ((v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_324 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_579 (Array Int Int))) (let ((.cse105 (select v_prenex_321 0))) (let ((.cse107 (select |c_#memory_$Pointer$.base| .cse105))) (let ((.cse104 (select .cse107 0))) (let ((.cse110 (store (store |c_#memory_$Pointer$.base| .cse104 v_prenex_579) .cse105 v_prenex_321))) (let ((.cse108 (select |c_#memory_$Pointer$.base| .cse104)) (.cse111 (store (store (store (store (store (store (store (store (store (store .cse110 .cse104 v_prenex_320) .cse105 .cse107) .cse104 v_prenex_320) .cse105 .cse107) .cse104 v_prenex_320) .cse105 .cse107) .cse104 v_prenex_320) .cse105 .cse107) .cse104 v_prenex_320) .cse105 .cse107))) (let ((.cse109 (select .cse111 .cse104)) (.cse106 (select .cse108 .cse2))) (and (<= (+ 2 .cse104) .cse105) (= .cse104 c_main_~ptr~0.base) (= .cse105 (select v_prenex_321 .cse2)) (not (= .cse106 0)) (= (store .cse107 0 .cse105) v_prenex_321) (= (select .cse108 0) (select .cse109 .cse2)) (= .cse108 (store .cse109 .cse2 .cse106)) (= .cse110 (store (store .cse111 .cse104 v_prenex_324) .cse105 v_prenex_321)) (= .cse110 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse111 .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321) .cse104 v_prenex_325) .cse105 v_prenex_321)))))))))) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_570 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_335 (Array Int Int)) (v_prenex_568 (Array Int Int))) (let ((.cse113 (select v_prenex_568 0))) (let ((.cse112 (select |c_#memory_$Pointer$.base| .cse113))) (let ((.cse117 (select .cse112 0))) (let ((.cse120 (store |c_#memory_$Pointer$.base| .cse117 v_prenex_570))) (let ((.cse119 (select |c_#memory_$Pointer$.base| .cse117)) (.cse116 (store (store (store (store (store (store (store (store (store (store (store .cse120 .cse113 v_prenex_568) .cse117 v_prenex_331) .cse113 .cse112) .cse117 v_prenex_331) .cse113 .cse112) .cse117 v_prenex_331) .cse113 .cse112) .cse117 v_prenex_331) .cse113 .cse112) .cse117 v_prenex_331) .cse113 .cse112))) (let ((.cse118 (select .cse116 .cse117)) (.cse114 (select .cse119 .cse2)) (.cse115 (store .cse120 .cse113 v_prenex_19))) (and (= (store .cse112 0 .cse113) v_prenex_568) (not (= 0 .cse114)) (= .cse115 (store (store .cse116 .cse117 v_prenex_18) .cse113 v_prenex_19)) (= (select .cse118 .cse2) (select .cse119 0)) (= (select v_prenex_19 0) .cse113) (= (store .cse118 .cse2 .cse114) .cse119) (<= (+ .cse117 2) .cse113) (= (select v_prenex_568 .cse2) .cse113) (= .cse117 c_main_~ptr~0.base) (= .cse115 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse116 .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19) .cse117 v_prenex_335) .cse113 v_prenex_19)))))))))) (exists ((v_prenex_538 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_539 (Array Int Int)) (v_prenex_540 (Array Int Int)) (v_prenex_541 (Array Int Int)) (v_prenex_67 (Array Int Int))) (let ((.cse123 (select v_DerPreprocessor_32 0))) (let ((.cse122 (select |c_#memory_$Pointer$.base| .cse123))) (let ((.cse121 (select .cse122 0))) (let ((.cse124 (select |c_#memory_$Pointer$.base| .cse121)) (.cse128 (store (store (store |c_#memory_$Pointer$.base| .cse123 v_DerPreprocessor_32) .cse121 v_prenex_538) .cse123 v_prenex_541))) (let ((.cse125 (select (store (store .cse128 .cse121 v_prenex_67) .cse123 v_prenex_541) .cse121)) (.cse126 (select .cse124 .cse2)) (.cse127 (store (store .cse128 .cse121 v_prenex_540) .cse123 v_prenex_541))) (and (= (store v_DerPreprocessor_32 0 .cse121) .cse122) (= .cse121 c_main_~ptr~0.base) (<= (+ .cse121 2) .cse123) (= .cse124 (store .cse125 .cse2 .cse126)) (= (select (store (store (store (store .cse127 .cse121 v_prenex_539) .cse123 .cse122) .cse121 v_prenex_539) .cse123 .cse122) .cse121) .cse125) (= .cse121 (select v_prenex_541 0)) (= (select .cse125 .cse2) (select .cse125 0)) (not (= .cse126 0)) (= .cse124 (select .cse127 .cse121))))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_32 (Array Int Int)) (|main_~#s~0.base| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse138 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse132 (select .cse138 0)) (.cse134 (select v_DerPreprocessor_28 0))) (let ((.cse141 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse132 v_DerPreprocessor_10) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28))) (let ((.cse139 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse141 .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse134 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse132 v_DerPreprocessor_16) |main_~#s~0.base| v_DerPreprocessor_15)) (.cse140 (select (store (store (store (store .cse141 .cse134 v_DerPreprocessor_29) |main_~#s~0.base| v_DerPreprocessor_28) .cse134 v_DerPreprocessor_29) |main_~#s~0.base| v_DerPreprocessor_28) .cse134)) (.cse133 (store (store (store (store .cse141 .cse134 v_prenex_30) |main_~#s~0.base| v_DerPreprocessor_15) .cse132 v_prenex_31) |main_~#s~0.base| v_DerPreprocessor_15)) (.cse130 (select |c_#memory_$Pointer$.base| .cse132))) (let ((.cse135 (select .cse130 0)) (.cse129 (select .cse133 .cse132)) (.cse131 (select .cse141 .cse134)) (.cse136 (select .cse140 0)) (.cse137 (select .cse139 .cse132))) (and (= .cse129 .cse130) (= .cse131 v_DerPreprocessor_8) (= (select v_DerPreprocessor_15 0) .cse132) (= c_main_~ptr~0.base .cse132) (= (select .cse133 .cse134) v_prenex_30) (= .cse135 .cse136) (= .cse137 (select (store (store (store (store .cse133 .cse132 v_prenex_32) |main_~#s~0.base| .cse138) .cse132 v_prenex_32) |main_~#s~0.base| .cse138) .cse132)) (= (store .cse137 0 .cse135) .cse130) (= (store v_DerPreprocessor_28 0 .cse132) .cse138) (not (= .cse136 0)) (= .cse133 (store (store (store (store |c_#memory_$Pointer$.base| .cse132 .cse129) |main_~#s~0.base| v_DerPreprocessor_15) .cse132 .cse129) |main_~#s~0.base| v_DerPreprocessor_15)) (<= (+ 2 .cse132) |main_~#s~0.base|) (= v_DerPreprocessor_14 (select .cse139 .cse134)) (= (store .cse131 0 .cse136) .cse140) (= .cse139 (store (store (store (store |c_#memory_$Pointer$.base| .cse132 .cse137) |main_~#s~0.base| v_DerPreprocessor_15) .cse132 .cse137) |main_~#s~0.base| v_DerPreprocessor_15)) (= (select .cse141 .cse132) v_DerPreprocessor_10) (= v_DerPreprocessor_29 .cse140)))))))) .cse27) (exists ((|main_~#s~0.base| Int)) (let ((.cse156 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse142 (select .cse156 0))) (let ((.cse144 (select |c_#memory_$Pointer$.base| .cse142))) (let ((.cse143 (select .cse144 .cse2))) (and (= c_main_~ptr~0.base .cse142) (not (= .cse143 0)) (<= (+ 2 .cse142) |main_~#s~0.base|) (exists ((v_prenex_280 (Array Int Int)) (v_prenex_281 (Array Int Int)) (v_prenex_282 (Array Int Int)) (v_prenex_283 (Array Int Int)) (v_prenex_276 (Array Int Int)) (v_prenex_277 (Array Int Int)) (v_prenex_586 (Array Int Int)) (v_prenex_278 (Array Int Int)) (v_prenex_587 (Array Int Int)) (v_prenex_279 (Array Int Int)) (v_prenex_588 (Array Int Int))) (let ((.cse148 (select v_prenex_587 0))) (let ((.cse147 (store (store (store (store |c_#memory_$Pointer$.base| .cse142 v_prenex_588) |main_~#s~0.base| v_prenex_587) .cse148 v_prenex_586) |main_~#s~0.base| v_prenex_587))) (let ((.cse150 (store (store (store (store (store (store (store (store (store (store (store (store .cse147 .cse142 v_prenex_281) |main_~#s~0.base| .cse156) .cse142 v_prenex_281) |main_~#s~0.base| .cse156) .cse142 v_prenex_281) |main_~#s~0.base| .cse156) .cse148 v_prenex_276) |main_~#s~0.base| .cse156) .cse142 v_prenex_281) |main_~#s~0.base| .cse156) .cse142 v_prenex_281) |main_~#s~0.base| .cse156))) (let ((.cse155 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse150 .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse142 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse148 v_prenex_282) |main_~#s~0.base| v_prenex_280)) (.cse151 (select .cse147 .cse148)) (.cse146 (store (store (store (store .cse150 .cse142 v_prenex_279) |main_~#s~0.base| v_prenex_280) .cse148 v_prenex_278) |main_~#s~0.base| v_prenex_280))) (let ((.cse154 (select (store (store (store (store .cse146 .cse148 v_prenex_277) |main_~#s~0.base| v_prenex_587) .cse148 v_prenex_277) |main_~#s~0.base| v_prenex_587) .cse148)) (.cse149 (select .cse146 .cse148)) (.cse153 (select .cse151 .cse2)) (.cse152 (select .cse155 .cse148)) (.cse145 (select .cse150 .cse142))) (and (= (select .cse144 0) (select .cse145 .cse2)) (= .cse146 (store (store (store (store .cse147 .cse148 .cse149) |main_~#s~0.base| v_prenex_280) .cse148 .cse149) |main_~#s~0.base| v_prenex_280)) (= (select .cse147 .cse142) v_prenex_588) (= (select .cse150 .cse148) v_prenex_276) (= .cse151 (store .cse152 .cse2 .cse153)) (= .cse152 .cse154) (= .cse149 v_prenex_278) (= (select .cse155 .cse142) v_prenex_283) (= .cse154 v_prenex_277) (= .cse151 v_prenex_586) (= (store (store (store (store .cse150 .cse142 .cse144) |main_~#s~0.base| .cse156) .cse142 .cse144) |main_~#s~0.base| .cse156) |c_#memory_$Pointer$.base|) (= (store (store (store (store .cse147 .cse148 .cse152) |main_~#s~0.base| v_prenex_280) .cse148 .cse152) |main_~#s~0.base| v_prenex_280) .cse155) (= (select .cse152 0) (select .cse152 .cse2)) (= .cse149 .cse151) (= v_prenex_587 (store .cse156 0 .cse148)) (= .cse143 .cse153) (= .cse152 v_prenex_282) (= (select .cse146 .cse142) v_prenex_279) (= .cse144 (store .cse145 .cse2 .cse143)) (= .cse148 (select v_prenex_280 0)))))))))))))))))) is different from true [2023-04-02 21:52:27,658 INFO L321 Elim1Store]: treesize reduction 64, result has 20.0 percent of original size [2023-04-02 21:52:27,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 485 treesize of output 875 [2023-04-02 21:52:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-04-02 21:52:27,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:52:28,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511615261] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:52:28,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2045923703] [2023-04-02 21:52:28,972 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-04-02 21:52:28,972 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:52:28,972 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:52:28,972 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:52:28,973 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:52:29,003 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:52:29,231 INFO L197 IcfgInterpreter]: Interpreting procedure sll_prepend with input of size 36 for LOIs [2023-04-02 21:52:29,336 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 44 for LOIs [2023-04-02 21:52:29,545 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 15 for LOIs [2023-04-02 21:52:29,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:52:29,561 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:52:55,532 WARN L223 SmtUtils]: Spent 9.26s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 21:52:56,487 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '817#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= |main_~#s~0.offset| 0) (= main_~ptr~0.offset 0) (= main_~len~0 2) (= main_~ptr~0.base 0) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0) 4)) 0) (= |#NULL.offset| 0) (= 5 main_~uneq~0) (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0) 4)) 0) (= |#NULL.base| 0) (= main_~count~0 1))' at error location [2023-04-02 21:52:56,487 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:52:56,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 21:52:56,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2023-04-02 21:52:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178467766] [2023-04-02 21:52:56,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 21:52:56,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-02 21:52:56,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:52:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-02 21:52:56,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2461, Unknown=16, NotChecked=306, Total=2970 [2023-04-02 21:52:56,490 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 29 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 21 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-02 21:53:18,401 WARN L223 SmtUtils]: Spent 11.82s on a formula simplification. DAG size of input: 1272 DAG size of output: 761 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 21:53:21,634 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_main_~#s~0.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_main_~#s~0.base|))) (and (not (= (select (select |c_#memory_$Pointer$.base| (select .cse0 |c_main_~#s~0.offset|)) 4) 0)) (= (select .cse1 |c_main_~#s~0.offset|) 0) (= |c_main_~#s~0.offset| 0) (= c_main_~ptr~0.offset 0) (let ((.cse6 (select .cse0 0))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse6)) (.cse13 (+ 4 (select .cse1 0)))) (let ((.cse14 (select .cse11 .cse13))) (let ((.cse2 (<= (+ .cse6 2) |c_main_~#s~0.base|)) (.cse18 (select .cse11 0)) (.cse27 (= 0 .cse13)) (.cse3 (not (= .cse14 0)))) (or (and .cse2 .cse3 (or (exists ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_19 0))) (and (= v_DerPreprocessor_19 (store .cse0 0 .cse4)) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse4 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (let ((.cse15 (select .cse9 .cse4))) (let ((.cse19 (select .cse15 .cse13))) (and (exists ((v_prenex_280 (Array Int Int)) (v_prenex_281 (Array Int Int)) (v_prenex_282 (Array Int Int)) (v_prenex_283 (Array Int Int)) (v_prenex_276 (Array Int Int)) (v_prenex_277 (Array Int Int)) (v_prenex_278 (Array Int Int)) (v_prenex_279 (Array Int Int))) (let ((.cse16 (store (store (store (store (store (store (store (store (store (store (store (store .cse9 .cse6 v_prenex_281) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_281) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_281) |c_main_~#s~0.base| .cse0) .cse4 v_prenex_276) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_281) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_281) |c_main_~#s~0.base| .cse0))) (let ((.cse5 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse16 .cse6 v_prenex_283) |c_main_~#s~0.base| v_prenex_280) .cse6 v_prenex_283) |c_main_~#s~0.base| v_prenex_280) .cse6 v_prenex_283) |c_main_~#s~0.base| v_prenex_280) .cse6 v_prenex_283) |c_main_~#s~0.base| v_prenex_280) .cse6 v_prenex_283) |c_main_~#s~0.base| v_prenex_280) .cse6 v_prenex_283) |c_main_~#s~0.base| v_prenex_280) .cse6 v_prenex_283) |c_main_~#s~0.base| v_prenex_280) .cse4 v_prenex_282) |c_main_~#s~0.base| v_prenex_280)) (.cse8 (store (store (store (store .cse16 .cse6 v_prenex_279) |c_main_~#s~0.base| v_prenex_280) .cse4 v_prenex_278) |c_main_~#s~0.base| v_prenex_280))) (let ((.cse12 (select .cse16 .cse6)) (.cse17 (select (store (store (store (store .cse8 .cse4 v_prenex_277) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse4 v_prenex_277) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse4)) (.cse10 (select .cse8 .cse4)) (.cse7 (select .cse5 .cse4))) (and (= .cse4 (select v_prenex_280 0)) (= (select .cse5 .cse6) v_prenex_283) (= v_prenex_282 .cse7) (= .cse8 (store (store (store (store .cse9 .cse4 .cse10) |c_main_~#s~0.base| v_prenex_280) .cse4 .cse10) |c_main_~#s~0.base| v_prenex_280)) (= .cse11 (store .cse12 .cse13 .cse14)) (= .cse10 .cse15) (= |c_#memory_$Pointer$.base| (store (store (store (store .cse16 .cse6 .cse11) |c_main_~#s~0.base| .cse0) .cse6 .cse11) |c_main_~#s~0.base| .cse0)) (= .cse17 v_prenex_277) (= (select .cse16 .cse4) v_prenex_276) (= (select .cse7 .cse13) (select .cse7 0)) (= .cse18 (select .cse12 .cse13)) (= .cse17 .cse7) (= .cse5 (store (store (store (store .cse9 .cse4 .cse7) |c_main_~#s~0.base| v_prenex_280) .cse4 .cse7) |c_main_~#s~0.base| v_prenex_280)) (= .cse10 v_prenex_278) (= (select .cse8 .cse6) v_prenex_279) (= (store .cse7 .cse13 .cse19) .cse15)))))) (= v_DerPreprocessor_20 .cse15) (= .cse14 .cse19) (= v_DerPreprocessor_18 (select .cse9 .cse6)))))))))) (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_297 (Array Int Int)) (v_prenex_298 (Array Int Int)) (v_prenex_299 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_300 (Array Int Int)) (v_prenex_301 (Array Int Int)) (v_prenex_302 (Array Int Int)) (v_prenex_303 (Array Int Int)) (v_prenex_304 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_19 0))) (let ((.cse24 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse21 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (let ((.cse20 (store (store (store (store (store (store (store (store (store (store (store (store .cse24 .cse6 v_prenex_301) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_301) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_301) |c_main_~#s~0.base| .cse0) .cse21 v_prenex_297) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_301) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_301) |c_main_~#s~0.base| .cse0))) (let ((.cse23 (store (store (store (store .cse20 .cse6 v_prenex_303) |c_main_~#s~0.base| v_prenex_300) .cse21 v_prenex_298) |c_main_~#s~0.base| v_prenex_300)) (.cse26 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse20 .cse6 v_prenex_304) |c_main_~#s~0.base| v_prenex_300) .cse6 v_prenex_304) |c_main_~#s~0.base| v_prenex_300) .cse6 v_prenex_304) |c_main_~#s~0.base| v_prenex_300) .cse6 v_prenex_304) |c_main_~#s~0.base| v_prenex_300) .cse6 v_prenex_304) |c_main_~#s~0.base| v_prenex_300) .cse6 v_prenex_304) |c_main_~#s~0.base| v_prenex_300) .cse6 v_prenex_304) |c_main_~#s~0.base| v_prenex_300) .cse21 v_prenex_302) |c_main_~#s~0.base| v_prenex_300))) (let ((.cse25 (select .cse26 .cse21)) (.cse22 (select .cse23 .cse21))) (and (= (select .cse20 .cse21) v_prenex_297) (= .cse22 v_prenex_298) (= (select (store (store (store (store .cse23 .cse21 v_prenex_299) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse21 v_prenex_299) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse21) v_prenex_299) (= v_DerPreprocessor_19 (store .cse0 0 .cse21)) (= (store (store (store (store .cse24 .cse21 .cse25) |c_main_~#s~0.base| v_prenex_300) .cse21 .cse25) |c_main_~#s~0.base| v_prenex_300) .cse26) (= (store (select .cse20 .cse6) 0 .cse18) .cse11) (= .cse25 v_prenex_302) (= v_DerPreprocessor_20 (select .cse24 .cse21)) (= .cse21 (select v_prenex_300 0)) (= .cse23 (store (store (store (store .cse24 .cse21 .cse22) |c_main_~#s~0.base| v_prenex_300) .cse21 .cse22) |c_main_~#s~0.base| v_prenex_300)) (= .cse21 |c_main_~#s~0.base|)))))))) .cse27) (exists ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse28 (select v_DerPreprocessor_19 0))) (and (= v_DerPreprocessor_19 (store .cse0 0 .cse28)) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse33 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse28 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (and (exists ((v_prenex_318 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_322 (Array Int Int)) (v_prenex_323 (Array Int Int)) (v_prenex_324 (Array Int Int)) (v_prenex_325 (Array Int Int))) (let ((.cse31 (store (store (store (store (store (store (store (store (store (store (store (store .cse33 .cse6 v_prenex_320) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_320) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_320) |c_main_~#s~0.base| .cse0) .cse28 v_prenex_318) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_320) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_320) |c_main_~#s~0.base| .cse0))) (let ((.cse36 (store (store (store (store .cse31 .cse6 v_prenex_324) |c_main_~#s~0.base| v_prenex_319) .cse28 v_prenex_323) |c_main_~#s~0.base| v_prenex_319)) (.cse34 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse31 .cse6 v_prenex_325) |c_main_~#s~0.base| v_prenex_319) .cse6 v_prenex_325) |c_main_~#s~0.base| v_prenex_319) .cse6 v_prenex_325) |c_main_~#s~0.base| v_prenex_319) .cse6 v_prenex_325) |c_main_~#s~0.base| v_prenex_319) .cse6 v_prenex_325) |c_main_~#s~0.base| v_prenex_319) .cse6 v_prenex_325) |c_main_~#s~0.base| v_prenex_319) .cse6 v_prenex_325) |c_main_~#s~0.base| v_prenex_319) .cse28 v_prenex_321) |c_main_~#s~0.base| v_prenex_319))) (let ((.cse29 (select .cse34 .cse28)) (.cse35 (select (store (store (store (store .cse36 .cse28 v_prenex_322) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse28 v_prenex_322) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse28)) (.cse30 (select .cse36 .cse28)) (.cse32 (select .cse31 .cse6))) (and (= (select .cse29 .cse13) (select .cse29 0)) (= v_prenex_323 .cse30) (= (select .cse31 .cse28) v_prenex_318) (= .cse29 v_prenex_321) (= (select .cse32 .cse13) .cse18) (= (store (store (store (store .cse33 .cse28 .cse29) |c_main_~#s~0.base| v_prenex_319) .cse28 .cse29) |c_main_~#s~0.base| v_prenex_319) .cse34) (= .cse29 .cse35) (= v_prenex_322 .cse35) (= (store (store (store (store .cse33 .cse28 .cse30) |c_main_~#s~0.base| v_prenex_319) .cse28 .cse30) |c_main_~#s~0.base| v_prenex_319) .cse36) (= (store .cse32 .cse13 .cse14) .cse11)))))) (= v_DerPreprocessor_20 (select .cse33 .cse28))))) (= .cse28 |c_main_~#s~0.base|)))) (exists ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse37 (select v_DerPreprocessor_19 0))) (and (= v_DerPreprocessor_19 (store .cse0 0 .cse37)) (= .cse37 |c_main_~#s~0.base|) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse42 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse37 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (and (exists ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_334 (Array Int Int)) (v_prenex_335 (Array Int Int))) (let ((.cse41 (store (store (store (store (store (store (store (store (store (store (store (store .cse42 .cse6 v_prenex_331) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_331) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_331) |c_main_~#s~0.base| .cse0) .cse37 v_prenex_332) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_331) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_331) |c_main_~#s~0.base| .cse0))) (let ((.cse45 (store (store (store (store .cse41 .cse6 v_prenex_18) |c_main_~#s~0.base| v_prenex_333) .cse37 v_prenex_19) |c_main_~#s~0.base| v_prenex_333)) (.cse43 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse41 .cse6 v_prenex_335) |c_main_~#s~0.base| v_prenex_333) .cse6 v_prenex_335) |c_main_~#s~0.base| v_prenex_333) .cse6 v_prenex_335) |c_main_~#s~0.base| v_prenex_333) .cse6 v_prenex_335) |c_main_~#s~0.base| v_prenex_333) .cse6 v_prenex_335) |c_main_~#s~0.base| v_prenex_333) .cse6 v_prenex_335) |c_main_~#s~0.base| v_prenex_333) .cse6 v_prenex_335) |c_main_~#s~0.base| v_prenex_333) .cse37 v_prenex_334) |c_main_~#s~0.base| v_prenex_333))) (let ((.cse40 (select .cse43 .cse37)) (.cse39 (select .cse45 .cse37)) (.cse44 (select (store (store (store (store .cse45 .cse37 v_prenex_20) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse37 v_prenex_20) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse37)) (.cse38 (select .cse41 .cse6))) (and (= (select .cse38 .cse13) .cse18) (= .cse39 v_prenex_19) (= .cse40 v_prenex_334) (= v_prenex_332 (select .cse41 .cse37)) (= (store (store (store (store .cse42 .cse37 .cse40) |c_main_~#s~0.base| v_prenex_333) .cse37 .cse40) |c_main_~#s~0.base| v_prenex_333) .cse43) (= (select .cse44 0) (select .cse44 .cse13)) (= (store (store (store (store .cse42 .cse37 .cse39) |c_main_~#s~0.base| v_prenex_333) .cse37 .cse39) |c_main_~#s~0.base| v_prenex_333) .cse45) (= v_prenex_20 .cse44) (= (store .cse38 .cse13 .cse14) .cse11) (= (select v_prenex_333 0) .cse37)))))) (= v_DerPreprocessor_20 (select .cse42 .cse37)))))))) (exists ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse46 (select v_DerPreprocessor_19 0))) (and (= v_DerPreprocessor_19 (store .cse0 0 .cse46)) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse47 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse46 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (and (= v_DerPreprocessor_20 (select .cse47 .cse46)) (exists ((v_prenex_270 (Array Int Int)) (v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_273 (Array Int Int)) (v_prenex_274 (Array Int Int)) (v_prenex_275 (Array Int Int)) (v_prenex_268 (Array Int Int)) (v_prenex_269 (Array Int Int))) (let ((.cse51 (store (store (store (store (store (store (store (store (store (store (store (store .cse47 .cse6 v_prenex_271) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_271) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_271) |c_main_~#s~0.base| .cse0) .cse46 v_prenex_268) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_271) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_271) |c_main_~#s~0.base| .cse0))) (let ((.cse49 (store (store (store (store .cse51 .cse6 v_prenex_272) |c_main_~#s~0.base| v_prenex_269) .cse46 v_prenex_270) |c_main_~#s~0.base| v_prenex_269)) (.cse53 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse51 .cse6 v_prenex_275) |c_main_~#s~0.base| v_prenex_269) .cse6 v_prenex_275) |c_main_~#s~0.base| v_prenex_269) .cse6 v_prenex_275) |c_main_~#s~0.base| v_prenex_269) .cse6 v_prenex_275) |c_main_~#s~0.base| v_prenex_269) .cse6 v_prenex_275) |c_main_~#s~0.base| v_prenex_269) .cse6 v_prenex_275) |c_main_~#s~0.base| v_prenex_269) .cse6 v_prenex_275) |c_main_~#s~0.base| v_prenex_269) .cse46 v_prenex_273) |c_main_~#s~0.base| v_prenex_269))) (let ((.cse48 (select .cse51 .cse6)) (.cse52 (select .cse53 .cse46)) (.cse50 (select .cse49 .cse46))) (and (= (select .cse48 .cse13) .cse18) (= (select (store (store (store (store .cse49 .cse46 v_prenex_274) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse46 v_prenex_274) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse46) v_prenex_274) (= .cse49 (store (store (store (store .cse47 .cse46 .cse50) |c_main_~#s~0.base| v_prenex_269) .cse46 .cse50) |c_main_~#s~0.base| v_prenex_269)) (= v_prenex_268 (select .cse51 .cse46)) (= (select v_prenex_269 0) .cse46) (= (store (store (store (store .cse47 .cse46 .cse52) |c_main_~#s~0.base| v_prenex_269) .cse46 .cse52) |c_main_~#s~0.base| v_prenex_269) .cse53) (= (store .cse48 .cse13 .cse14) .cse11) (= (select .cse52 .cse13) (select .cse52 0)) (= v_prenex_273 .cse52) (= v_prenex_270 .cse50))))))))) (= .cse46 |c_main_~#s~0.base|)))) (exists ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse54 (select v_DerPreprocessor_19 0))) (and (= v_DerPreprocessor_19 (store .cse0 0 .cse54)) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse56 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse54 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (and (exists ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_310 (Array Int Int)) (v_prenex_311 (Array Int Int)) (v_prenex_312 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_prenex_314 (Array Int Int)) (v_prenex_315 (Array Int Int))) (let ((.cse61 (store (store (store (store (store (store (store (store (store (store (store (store .cse56 .cse6 v_prenex_313) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_313) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_313) |c_main_~#s~0.base| .cse0) .cse54 v_prenex_310) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_313) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_313) |c_main_~#s~0.base| .cse0))) (let ((.cse58 (store (store (store (store .cse61 .cse6 v_prenex_311) |c_main_~#s~0.base| v_prenex_312) .cse54 v_prenex_316) |c_main_~#s~0.base| v_prenex_312)) (.cse60 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse61 .cse6 v_prenex_317) |c_main_~#s~0.base| v_prenex_312) .cse6 v_prenex_317) |c_main_~#s~0.base| v_prenex_312) .cse6 v_prenex_317) |c_main_~#s~0.base| v_prenex_312) .cse6 v_prenex_317) |c_main_~#s~0.base| v_prenex_312) .cse6 v_prenex_317) |c_main_~#s~0.base| v_prenex_312) .cse6 v_prenex_317) |c_main_~#s~0.base| v_prenex_312) .cse6 v_prenex_317) |c_main_~#s~0.base| v_prenex_312) .cse54 v_prenex_314) |c_main_~#s~0.base| v_prenex_312))) (let ((.cse55 (select .cse61 .cse6)) (.cse59 (select .cse60 .cse54)) (.cse57 (select .cse58 .cse54))) (and (= (store .cse55 .cse13 .cse14) .cse11) (= (store (store (store (store .cse56 .cse54 .cse57) |c_main_~#s~0.base| v_prenex_312) .cse54 .cse57) |c_main_~#s~0.base| v_prenex_312) .cse58) (= (store (store (store (store .cse56 .cse54 .cse59) |c_main_~#s~0.base| v_prenex_312) .cse54 .cse59) |c_main_~#s~0.base| v_prenex_312) .cse60) (= (select .cse55 .cse13) .cse18) (= .cse59 v_prenex_314) (= v_prenex_310 (select .cse61 .cse54)) (= .cse54 (select v_prenex_312 0)) (= v_prenex_315 (select (store (store (store (store .cse58 .cse54 v_prenex_315) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse54 v_prenex_315) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse54)) (= .cse57 v_prenex_316)))))) (= v_DerPreprocessor_20 (select .cse56 .cse54))))) (= .cse54 |c_main_~#s~0.base|)))) (and .cse27 (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse65 (select v_DerPreprocessor_19 0))) (let ((.cse67 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse65 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (let ((.cse62 (store (store (store (store (store (store (store (store (store (store (store (store .cse67 .cse6 v_DerPreprocessor_8) |c_main_~#s~0.base| .cse0) .cse6 v_DerPreprocessor_8) |c_main_~#s~0.base| .cse0) .cse6 v_DerPreprocessor_8) |c_main_~#s~0.base| .cse0) .cse65 v_DerPreprocessor_10) |c_main_~#s~0.base| .cse0) .cse6 v_DerPreprocessor_8) |c_main_~#s~0.base| .cse0) .cse6 v_DerPreprocessor_8) |c_main_~#s~0.base| .cse0))) (let ((.cse64 (store (store (store (store .cse62 .cse6 v_prenex_24) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse65 v_prenex_25) |c_main_~#s~0.base| v_DerPreprocessor_15)) (.cse66 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse62 .cse6 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse65 v_DerPreprocessor_16) |c_main_~#s~0.base| v_DerPreprocessor_15))) (let ((.cse68 (select .cse66 .cse65)) (.cse63 (select .cse64 .cse65))) (and (= (store (select .cse62 .cse6) 0 .cse18) .cse11) (= .cse63 v_prenex_25) (= v_prenex_26 (select (store (store (store (store .cse64 .cse65 v_prenex_26) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse65 v_prenex_26) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse65)) (= v_DerPreprocessor_19 (store .cse0 0 .cse65)) (= .cse66 (store (store (store (store .cse67 .cse65 .cse68) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse65 .cse68) |c_main_~#s~0.base| v_DerPreprocessor_15)) (= (select v_DerPreprocessor_15 0) .cse65) (= v_DerPreprocessor_10 (select .cse62 .cse65)) (= v_DerPreprocessor_20 (select .cse67 .cse65)) (= v_DerPreprocessor_16 .cse68) (= .cse65 |c_main_~#s~0.base|) (= .cse64 (store (store (store (store .cse67 .cse65 .cse63) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse65 .cse63) |c_main_~#s~0.base| v_DerPreprocessor_15)))))))))) (and .cse27 (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_prenex_292 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_293 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_294 (Array Int Int)) (v_prenex_295 (Array Int Int)) (v_prenex_296 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_22 (Array Int Int))) (let ((.cse70 (select v_DerPreprocessor_19 0))) (let ((.cse74 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse70 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (let ((.cse75 (store (store (store (store (store (store (store (store (store (store (store (store .cse74 .cse6 v_prenex_294) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_294) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_294) |c_main_~#s~0.base| .cse0) .cse70 v_prenex_292) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_294) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_294) |c_main_~#s~0.base| .cse0))) (let ((.cse69 (store (store (store (store .cse75 .cse6 v_prenex_21) |c_main_~#s~0.base| v_prenex_293) .cse70 v_prenex_22) |c_main_~#s~0.base| v_prenex_293)) (.cse73 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse75 .cse6 v_prenex_296) |c_main_~#s~0.base| v_prenex_293) .cse6 v_prenex_296) |c_main_~#s~0.base| v_prenex_293) .cse6 v_prenex_296) |c_main_~#s~0.base| v_prenex_293) .cse6 v_prenex_296) |c_main_~#s~0.base| v_prenex_293) .cse6 v_prenex_296) |c_main_~#s~0.base| v_prenex_293) .cse6 v_prenex_296) |c_main_~#s~0.base| v_prenex_293) .cse6 v_prenex_296) |c_main_~#s~0.base| v_prenex_293) .cse70 v_prenex_295) |c_main_~#s~0.base| v_prenex_293))) (let ((.cse72 (select .cse73 .cse70)) (.cse71 (select .cse69 .cse70))) (and (= (select (store (store (store (store .cse69 .cse70 v_prenex_23) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse70 v_prenex_23) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse70) v_prenex_23) (= (select v_prenex_293 0) .cse70) (= .cse71 v_prenex_22) (= v_prenex_295 .cse72) (= .cse73 (store (store (store (store .cse74 .cse70 .cse72) |c_main_~#s~0.base| v_prenex_293) .cse70 .cse72) |c_main_~#s~0.base| v_prenex_293)) (= v_DerPreprocessor_19 (store .cse0 0 .cse70)) (= (store (store (store (store .cse74 .cse70 .cse71) |c_main_~#s~0.base| v_prenex_293) .cse70 .cse71) |c_main_~#s~0.base| v_prenex_293) .cse69) (= v_prenex_292 (select .cse75 .cse70)) (= (store (select .cse75 .cse6) 0 .cse18) .cse11) (= v_DerPreprocessor_20 (select .cse74 .cse70)) (= .cse70 |c_main_~#s~0.base|))))))))) (exists ((v_DerPreprocessor_19 (Array Int Int))) (let ((.cse79 (select v_DerPreprocessor_19 0))) (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse78 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse79 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (let ((.cse76 (select .cse78 .cse79))) (and (= v_DerPreprocessor_20 .cse76) (= .cse14 (select .cse76 .cse13)) (exists ((v_prenex_305 (Array Int Int)) (v_prenex_306 (Array Int Int)) (v_prenex_307 (Array Int Int)) (v_prenex_308 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_309 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse84 (store (store (store (store (store (store (store (store (store (store (store (store .cse78 .cse6 v_prenex_305) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_305) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_305) |c_main_~#s~0.base| .cse0) .cse79 v_prenex_306) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_305) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_305) |c_main_~#s~0.base| .cse0))) (let ((.cse83 (store (store (store (store .cse84 .cse6 v_DerPreprocessor_5) |c_main_~#s~0.base| v_prenex_307) .cse79 v_DerPreprocessor_7) |c_main_~#s~0.base| v_prenex_307)) (.cse77 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse84 .cse6 v_prenex_309) |c_main_~#s~0.base| v_prenex_307) .cse6 v_prenex_309) |c_main_~#s~0.base| v_prenex_307) .cse6 v_prenex_309) |c_main_~#s~0.base| v_prenex_307) .cse6 v_prenex_309) |c_main_~#s~0.base| v_prenex_307) .cse6 v_prenex_309) |c_main_~#s~0.base| v_prenex_307) .cse6 v_prenex_309) |c_main_~#s~0.base| v_prenex_307) .cse6 v_prenex_309) |c_main_~#s~0.base| v_prenex_307) .cse79 v_prenex_308) |c_main_~#s~0.base| v_prenex_307))) (let ((.cse80 (select .cse77 .cse79)) (.cse81 (select .cse84 .cse6)) (.cse85 (select (store (store (store (store .cse83 .cse79 v_DerPreprocessor_11) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse79 v_DerPreprocessor_11) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse79)) (.cse82 (select .cse83 .cse79))) (and (= .cse77 (store (store (store (store .cse78 .cse79 .cse80) |c_main_~#s~0.base| v_prenex_307) .cse79 .cse80) |c_main_~#s~0.base| v_prenex_307)) (= .cse18 (select .cse81 .cse13)) (= .cse80 v_prenex_308) (= .cse11 (store .cse81 .cse13 .cse14)) (= (store (store (store (store .cse78 .cse79 .cse82) |c_main_~#s~0.base| v_prenex_307) .cse79 .cse82) |c_main_~#s~0.base| v_prenex_307) .cse83) (= .cse82 v_DerPreprocessor_7) (= v_prenex_306 (select .cse84 .cse79)) (= (select .cse85 .cse13) (select .cse85 0)) (= v_DerPreprocessor_11 .cse85) (= .cse82 .cse76)))))))))) (= v_DerPreprocessor_19 (store .cse0 0 .cse79)) (= .cse79 |c_main_~#s~0.base|)))) (and .cse27 (exists ((v_prenex_327 (Array Int Int)) (v_prenex_328 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_326 (Array Int Int))) (let ((.cse92 (select v_DerPreprocessor_19 0))) (let ((.cse91 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse92 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (let ((.cse93 (store (store (store (store (store (store (store (store (store (store (store (store .cse91 .cse6 v_prenex_326) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_326) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_326) |c_main_~#s~0.base| .cse0) .cse92 v_prenex_327) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_326) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_326) |c_main_~#s~0.base| .cse0))) (let ((.cse89 (select .cse91 .cse92)) (.cse90 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse93 .cse6 v_prenex_330) |c_main_~#s~0.base| v_prenex_328) .cse6 v_prenex_330) |c_main_~#s~0.base| v_prenex_328) .cse6 v_prenex_330) |c_main_~#s~0.base| v_prenex_328) .cse6 v_prenex_330) |c_main_~#s~0.base| v_prenex_328) .cse6 v_prenex_330) |c_main_~#s~0.base| v_prenex_328) .cse6 v_prenex_330) |c_main_~#s~0.base| v_prenex_328) .cse6 v_prenex_330) |c_main_~#s~0.base| v_prenex_328) .cse92 v_prenex_329) |c_main_~#s~0.base| v_prenex_328)) (.cse94 (store (store (store (store .cse93 .cse6 v_prenex_30) |c_main_~#s~0.base| v_prenex_328) .cse92 v_prenex_31) |c_main_~#s~0.base| v_prenex_328))) (let ((.cse87 (select (store (store (store (store .cse94 .cse92 v_prenex_32) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse92 v_prenex_32) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse92)) (.cse86 (select .cse90 .cse92)) (.cse95 (select .cse94 .cse92)) (.cse88 (select .cse89 0))) (and (= .cse86 .cse87) (= (store .cse86 0 .cse88) .cse89) (= .cse87 v_prenex_32) (= .cse90 (store (store (store (store .cse91 .cse92 .cse86) |c_main_~#s~0.base| v_prenex_328) .cse92 .cse86) |c_main_~#s~0.base| v_prenex_328)) (= (store (select .cse93 .cse6) 0 .cse18) .cse11) (= (select .cse94 .cse6) v_prenex_30) (= v_prenex_330 (select .cse90 .cse6)) (= .cse89 .cse95) (= (select v_prenex_328 0) .cse92) (= v_DerPreprocessor_19 (store .cse0 0 .cse92)) (= v_prenex_327 (select .cse93 .cse92)) (= v_prenex_31 .cse95) (= .cse86 v_prenex_329) (= .cse94 (store (store (store (store .cse91 .cse92 .cse95) |c_main_~#s~0.base| v_prenex_328) .cse92 .cse95) |c_main_~#s~0.base| v_prenex_328)) (= v_DerPreprocessor_20 .cse89) (= |c_#memory_$Pointer$.base| (store (store (store (store .cse93 .cse6 .cse11) |c_main_~#s~0.base| .cse0) .cse6 .cse11) |c_main_~#s~0.base| .cse0)) (= .cse88 .cse18) (= v_DerPreprocessor_18 (select .cse91 .cse6)))))))))) (and (exists ((v_prenex_290 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_prenex_291 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_284 (Array Int Int)) (v_prenex_285 (Array Int Int)) (v_prenex_286 (Array Int Int)) (v_prenex_287 (Array Int Int)) (v_prenex_288 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_289 (Array Int Int))) (let ((.cse98 (select v_DerPreprocessor_19 0))) (let ((.cse97 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse98 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (let ((.cse100 (store (store (store (store (store (store (store (store (store (store (store (store .cse97 .cse6 v_prenex_288) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_288) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_288) |c_main_~#s~0.base| .cse0) .cse98 v_prenex_284) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_288) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_288) |c_main_~#s~0.base| .cse0))) (let ((.cse103 (store (store (store (store .cse100 .cse6 v_prenex_285) |c_main_~#s~0.base| v_prenex_287) .cse98 v_prenex_286) |c_main_~#s~0.base| v_prenex_287)) (.cse96 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse100 .cse6 v_prenex_291) |c_main_~#s~0.base| v_prenex_287) .cse6 v_prenex_291) |c_main_~#s~0.base| v_prenex_287) .cse6 v_prenex_291) |c_main_~#s~0.base| v_prenex_287) .cse6 v_prenex_291) |c_main_~#s~0.base| v_prenex_287) .cse6 v_prenex_291) |c_main_~#s~0.base| v_prenex_287) .cse6 v_prenex_291) |c_main_~#s~0.base| v_prenex_287) .cse6 v_prenex_291) |c_main_~#s~0.base| v_prenex_287) .cse98 v_prenex_289) |c_main_~#s~0.base| v_prenex_287))) (let ((.cse99 (select .cse96 .cse98)) (.cse102 (select .cse97 .cse98)) (.cse101 (select .cse103 .cse98))) (and (= .cse96 (store (store (store (store .cse97 .cse98 .cse99) |c_main_~#s~0.base| v_prenex_287) .cse98 .cse99) |c_main_~#s~0.base| v_prenex_287)) (= (store (select .cse100 .cse6) 0 .cse18) .cse11) (= .cse101 .cse102) (= .cse99 v_prenex_289) (= v_DerPreprocessor_19 (store .cse0 0 .cse98)) (= .cse101 v_prenex_286) (= v_prenex_284 (select .cse100 .cse98)) (= v_DerPreprocessor_20 .cse102) (= (select (store (store (store (store .cse103 .cse98 v_prenex_290) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse98 v_prenex_290) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse98) v_prenex_290) (= (select .cse102 0) .cse18) (= .cse98 |c_main_~#s~0.base|) (= (store (store (store (store .cse97 .cse98 .cse101) |c_main_~#s~0.base| v_prenex_287) .cse98 .cse101) |c_main_~#s~0.base| v_prenex_287) .cse103)))))))) .cse27) (and .cse27 (exists ((v_prenex_338 (Array Int Int)) (v_prenex_339 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_340 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_28 (Array Int Int)) (v_prenex_336 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_prenex_337 (Array Int Int))) (let ((.cse107 (select v_DerPreprocessor_19 0))) (let ((.cse106 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_18) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse107 v_DerPreprocessor_20) |c_main_~#s~0.base| v_DerPreprocessor_19))) (let ((.cse111 (store (store (store (store (store (store (store (store (store (store (store (store .cse106 .cse6 v_prenex_336) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_336) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_336) |c_main_~#s~0.base| .cse0) .cse107 v_prenex_337) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_336) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_336) |c_main_~#s~0.base| .cse0))) (let ((.cse109 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse111 .cse6 v_prenex_340) |c_main_~#s~0.base| v_prenex_338) .cse6 v_prenex_340) |c_main_~#s~0.base| v_prenex_338) .cse6 v_prenex_340) |c_main_~#s~0.base| v_prenex_338) .cse6 v_prenex_340) |c_main_~#s~0.base| v_prenex_338) .cse6 v_prenex_340) |c_main_~#s~0.base| v_prenex_338) .cse6 v_prenex_340) |c_main_~#s~0.base| v_prenex_338) .cse6 v_prenex_340) |c_main_~#s~0.base| v_prenex_338) .cse107 v_prenex_339) |c_main_~#s~0.base| v_prenex_338)) (.cse105 (store (store (store (store .cse111 .cse6 v_prenex_27) |c_main_~#s~0.base| v_prenex_338) .cse107 v_prenex_28) |c_main_~#s~0.base| v_prenex_338))) (let ((.cse104 (select .cse105 .cse107)) (.cse110 (select (store (store (store (store .cse105 .cse107 v_prenex_29) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse107 v_prenex_29) |c_main_~#s~0.base| v_DerPreprocessor_19) .cse107)) (.cse108 (select .cse109 .cse107))) (and (= v_prenex_28 .cse104) (= .cse105 (store (store (store (store .cse106 .cse107 .cse104) |c_main_~#s~0.base| v_prenex_338) .cse107 .cse104) |c_main_~#s~0.base| v_prenex_338)) (= (store (store (store (store .cse106 .cse107 .cse108) |c_main_~#s~0.base| v_prenex_338) .cse107 .cse108) |c_main_~#s~0.base| v_prenex_338) .cse109) (= .cse110 v_prenex_29) (= (select .cse111 .cse107) v_prenex_337) (= v_DerPreprocessor_19 (store .cse0 0 .cse107)) (= .cse108 .cse110) (= v_DerPreprocessor_20 (select .cse106 .cse107)) (= .cse108 v_prenex_339) (= (store (select .cse111 .cse6) 0 .cse18) .cse11) (= .cse107 |c_main_~#s~0.base|))))))))))) (and .cse2 (or (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse115 (select v_DerPreprocessor_28 0))) (let ((.cse112 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse115 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_28) .cse115 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_28) .cse115 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_28) .cse6 v_DerPreprocessor_10) |c_main_~#s~0.base| v_DerPreprocessor_28) .cse115 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_28) .cse115 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_28))) (let ((.cse116 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse112 .cse115 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse115 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse115 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse115 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse115 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse115 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse115 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_16) |c_main_~#s~0.base| v_DerPreprocessor_15)) (.cse114 (store (store (store (store .cse112 .cse115 v_prenex_30) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_prenex_31) |c_main_~#s~0.base| v_DerPreprocessor_15)) (.cse119 (select (store (store (store (store .cse112 .cse115 v_DerPreprocessor_29) |c_main_~#s~0.base| v_DerPreprocessor_28) .cse115 v_DerPreprocessor_29) |c_main_~#s~0.base| v_DerPreprocessor_28) .cse115))) (let ((.cse118 (select .cse112 .cse115)) (.cse113 (select .cse119 0)) (.cse120 (select .cse114 .cse6)) (.cse117 (select .cse116 .cse6))) (and (= v_DerPreprocessor_10 (select .cse112 .cse6)) (= .cse113 .cse18) (= (select .cse114 .cse115) v_prenex_30) (= .cse116 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 .cse117) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 .cse117) |c_main_~#s~0.base| v_DerPreprocessor_15)) (= v_DerPreprocessor_8 .cse118) (= (store .cse118 0 .cse113) .cse119) (not (= .cse113 0)) (= (select v_DerPreprocessor_15 0) .cse6) (= .cse114 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 .cse120) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 .cse120) |c_main_~#s~0.base| v_DerPreprocessor_15)) (= .cse120 .cse11) (= .cse117 (select (store (store (store (store .cse114 .cse6 v_prenex_32) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_32) |c_main_~#s~0.base| .cse0) .cse6)) (= (store .cse117 0 .cse18) .cse11) (= (select .cse116 .cse115) v_DerPreprocessor_14) (= v_DerPreprocessor_29 .cse119) (= (store v_DerPreprocessor_28 0 .cse6) .cse0))))))) .cse27) (and .cse3 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_prenex_67 (Array Int Int)) (v_prenex_66 (Array Int Int))) (let ((.cse122 (select v_DerPreprocessor_31 0))) (let ((.cse124 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse122 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_31) .cse122 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_31) .cse122 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_31) .cse6 v_DerPreprocessor_10) |c_main_~#s~0.base| v_DerPreprocessor_31) .cse122 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_31) .cse122 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_31))) (let ((.cse125 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse124 .cse122 v_prenex_68) |c_main_~#s~0.base| v_prenex_66) .cse122 v_prenex_68) |c_main_~#s~0.base| v_prenex_66) .cse122 v_prenex_68) |c_main_~#s~0.base| v_prenex_66) .cse122 v_prenex_68) |c_main_~#s~0.base| v_prenex_66) .cse122 v_prenex_68) |c_main_~#s~0.base| v_prenex_66) .cse122 v_prenex_68) |c_main_~#s~0.base| v_prenex_66) .cse122 v_prenex_68) |c_main_~#s~0.base| v_prenex_66) .cse6 v_prenex_67) |c_main_~#s~0.base| v_prenex_66))) (let ((.cse123 (select .cse125 .cse6)) (.cse121 (store (store (store (store .cse124 .cse122 v_prenex_30) |c_main_~#s~0.base| v_prenex_66) .cse6 v_prenex_31) |c_main_~#s~0.base| v_prenex_66))) (and (= v_prenex_30 (select .cse121 .cse122)) (= .cse11 (store .cse123 .cse13 .cse14)) (= (select (store (store (store (store .cse124 .cse122 v_DerPreprocessor_32) |c_main_~#s~0.base| v_DerPreprocessor_31) .cse122 v_DerPreprocessor_32) |c_main_~#s~0.base| v_DerPreprocessor_31) .cse122) v_DerPreprocessor_32) (= (select .cse123 0) (select .cse123 .cse13)) (= (select v_prenex_66 0) .cse6) (= .cse11 (select .cse121 .cse6)) (= (store v_DerPreprocessor_31 0 .cse6) .cse0) (= (select .cse125 .cse122) v_prenex_68) (= .cse122 |c_main_~#s~0.base|) (= (select .cse124 .cse122) v_DerPreprocessor_8) (= .cse123 (select (store (store (store (store .cse121 .cse6 v_prenex_32) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_32) |c_main_~#s~0.base| .cse0) .cse6))))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse128 (select v_DerPreprocessor_22 0))) (let ((.cse131 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse128 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_22) .cse128 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_22) .cse128 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_22) .cse6 v_DerPreprocessor_10) |c_main_~#s~0.base| v_DerPreprocessor_22) .cse128 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_22) .cse128 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_22))) (let ((.cse132 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse131 .cse128 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse128 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse128 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse128 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse128 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse128 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse128 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_16) |c_main_~#s~0.base| v_DerPreprocessor_15)) (.cse127 (select (store (store (store (store .cse131 .cse128 v_DerPreprocessor_23) |c_main_~#s~0.base| v_DerPreprocessor_22) .cse128 v_DerPreprocessor_23) |c_main_~#s~0.base| v_DerPreprocessor_22) .cse128))) (let ((.cse129 (select .cse127 .cse13)) (.cse130 (store (store (store (store .cse131 .cse128 v_prenex_30) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_prenex_31) |c_main_~#s~0.base| v_DerPreprocessor_15)) (.cse126 (select .cse132 .cse6))) (and (= (select .cse126 0) (select .cse126 .cse13)) (= .cse127 v_DerPreprocessor_23) (= .cse128 |c_main_~#s~0.base|) (not (= .cse129 0)) (= .cse129 .cse14) (= (select .cse130 .cse128) v_prenex_30) (= (select .cse131 .cse128) v_DerPreprocessor_8) (= (select v_DerPreprocessor_15 0) .cse6) (= (select .cse130 .cse6) .cse11) (= (select .cse132 .cse128) v_DerPreprocessor_14) (= .cse11 (store .cse126 .cse13 .cse14)) (= (select (store (store (store (store .cse130 .cse6 v_prenex_32) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_32) |c_main_~#s~0.base| .cse0) .cse6) .cse126) (= (store v_DerPreprocessor_22 0 .cse6) .cse0))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse135 (select v_DerPreprocessor_25 0))) (let ((.cse141 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse135 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_25) .cse135 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_25) .cse135 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_25) .cse6 v_DerPreprocessor_10) |c_main_~#s~0.base| v_DerPreprocessor_25) .cse135 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_25) .cse135 v_DerPreprocessor_8) |c_main_~#s~0.base| v_DerPreprocessor_25))) (let ((.cse136 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse141 .cse135 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse135 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse135 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse135 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse135 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse135 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse135 v_DerPreprocessor_14) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_DerPreprocessor_16) |c_main_~#s~0.base| v_DerPreprocessor_15)) (.cse140 (select (store (store (store (store .cse141 .cse135 v_DerPreprocessor_26) |c_main_~#s~0.base| v_DerPreprocessor_25) .cse135 v_DerPreprocessor_26) |c_main_~#s~0.base| v_DerPreprocessor_25) .cse135)) (.cse134 (store (store (store (store .cse141 .cse135 v_prenex_30) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 v_prenex_31) |c_main_~#s~0.base| v_DerPreprocessor_15))) (let ((.cse139 (select .cse134 .cse6)) (.cse133 (select .cse140 .cse13)) (.cse137 (select .cse136 .cse6)) (.cse138 (select .cse141 .cse135))) (and (= .cse14 .cse133) (= v_prenex_30 (select .cse134 .cse135)) (= v_DerPreprocessor_14 (select .cse136 .cse135)) (= (select .cse137 .cse13) (select .cse137 0)) (= .cse138 v_DerPreprocessor_8) (= (store v_DerPreprocessor_25 0 .cse6) .cse0) (= .cse11 .cse139) (= (store .cse138 .cse13 .cse133) .cse140) (= (select (store (store (store (store .cse134 .cse6 v_prenex_32) |c_main_~#s~0.base| .cse0) .cse6 v_prenex_32) |c_main_~#s~0.base| .cse0) .cse6) .cse137) (= .cse134 (store (store (store (store |c_#memory_$Pointer$.base| .cse6 .cse139) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 .cse139) |c_main_~#s~0.base| v_DerPreprocessor_15)) (= (store (store (store (store |c_#memory_$Pointer$.base| .cse6 .cse137) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse6 .cse137) |c_main_~#s~0.base| v_DerPreprocessor_15) .cse136) (= (select v_DerPreprocessor_15 0) .cse6) (not (= 0 .cse133)) (= (select .cse141 .cse6) v_DerPreprocessor_10) (= v_DerPreprocessor_26 .cse140) (= (store .cse137 .cse13 .cse14) .cse11) (= (select .cse138 .cse13) (select .cse140 0))))))))))))))) (let ((.cse144 (+ c_main_~ptr~0.offset 4))) (let ((.cse169 (= .cse144 0))) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_prenex_270 (Array Int Int)) (v_prenex_271 (Array Int Int)) (v_prenex_272 (Array Int Int)) (v_prenex_275 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse146 (select v_DerPreprocessor_20 0))) (let ((.cse151 (select |c_#memory_$Pointer$.base| .cse146))) (let ((.cse142 (select .cse151 0))) (let ((.cse152 (store |c_#memory_$Pointer$.base| .cse142 v_DerPreprocessor_18))) (let ((.cse145 (select |c_#memory_$Pointer$.base| .cse142)) (.cse149 (store (store (store (store (store (store (store (store (store (store (store .cse152 .cse146 v_DerPreprocessor_20) .cse142 v_prenex_271) .cse146 .cse151) .cse142 v_prenex_271) .cse146 .cse151) .cse142 v_prenex_271) .cse146 .cse151) .cse142 v_prenex_271) .cse146 .cse151) .cse142 v_prenex_271) .cse146 .cse151))) (let ((.cse143 (select .cse149 .cse142)) (.cse148 (select v_prenex_270 0)) (.cse147 (select .cse145 .cse144)) (.cse150 (store .cse152 .cse146 v_prenex_270))) (and (= c_main_~ptr~0.base .cse142) (= (select .cse143 .cse144) (select .cse145 0)) (<= (+ 2 .cse142) .cse146) (= (store .cse143 .cse144 .cse147) .cse145) (= .cse148 .cse146) (= .cse148 (select v_prenex_270 .cse144)) (not (= .cse147 0)) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse149 .cse142 v_prenex_275) .cse146 v_prenex_270) .cse142 v_prenex_275) .cse146 v_prenex_270) .cse142 v_prenex_275) .cse146 v_prenex_270) .cse142 v_prenex_275) .cse146 v_prenex_270) .cse142 v_prenex_275) .cse146 v_prenex_270) .cse142 v_prenex_275) .cse146 v_prenex_270) .cse142 v_prenex_275) .cse146 v_prenex_270) .cse150) (= .cse150 (store (store .cse149 .cse142 v_prenex_272) .cse146 v_prenex_270)) (= v_DerPreprocessor_20 (store .cse151 0 .cse146)))))))))) (exists ((v_prenex_305 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (v_prenex_309 (Array Int Int)) (v_prenex_582 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse158 (select v_DerPreprocessor_11 0))) (let ((.cse161 (select |c_#memory_$Pointer$.base| .cse158))) (let ((.cse157 (select .cse161 0))) (let ((.cse155 (store (store |c_#memory_$Pointer$.base| .cse157 v_prenex_582) .cse158 v_DerPreprocessor_11))) (let ((.cse153 (select |c_#memory_$Pointer$.base| .cse157)) (.cse156 (store (store (store (store (store (store (store (store (store (store .cse155 .cse157 v_prenex_305) .cse158 .cse161) .cse157 v_prenex_305) .cse158 .cse161) .cse157 v_prenex_305) .cse158 .cse161) .cse157 v_prenex_305) .cse158 .cse161) .cse157 v_prenex_305) .cse158 .cse161))) (let ((.cse154 (select .cse156 .cse157)) (.cse159 (select .cse153 .cse144)) (.cse160 (select v_DerPreprocessor_11 .cse144))) (and (= (select .cse153 0) (select .cse154 .cse144)) (= .cse155 (store (store .cse156 .cse157 v_DerPreprocessor_5) .cse158 v_DerPreprocessor_11)) (not (= .cse159 0)) (= c_main_~ptr~0.base .cse157) (= .cse160 .cse159) (= v_DerPreprocessor_11 (store .cse161 0 .cse158)) (= .cse155 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse156 .cse157 v_prenex_309) .cse158 v_DerPreprocessor_11) .cse157 v_prenex_309) .cse158 v_DerPreprocessor_11) .cse157 v_prenex_309) .cse158 v_DerPreprocessor_11) .cse157 v_prenex_309) .cse158 v_DerPreprocessor_11) .cse157 v_prenex_309) .cse158 v_DerPreprocessor_11) .cse157 v_prenex_309) .cse158 v_DerPreprocessor_11) .cse157 v_prenex_309) .cse158 v_DerPreprocessor_11)) (<= (+ 2 .cse157) .cse158) (= .cse153 (store .cse154 .cse144 .cse159)) (= .cse160 .cse158))))))))) (and (exists ((v_prenex_340 (Array Int Int)) (v_prenex_573 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_336 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse165 (select v_prenex_29 0))) (let ((.cse168 (select |c_#memory_$Pointer$.base| .cse165))) (let ((.cse164 (select .cse168 0))) (let ((.cse162 (store (store |c_#memory_$Pointer$.base| .cse164 v_prenex_573) .cse165 v_prenex_29)) (.cse167 (select |c_#memory_$Pointer$.base| .cse164))) (let ((.cse166 (select .cse167 0)) (.cse163 (store (store (store (store (store (store (store (store (store (store .cse162 .cse164 v_prenex_336) .cse165 .cse168) .cse164 v_prenex_336) .cse165 .cse168) .cse164 v_prenex_336) .cse165 .cse168) .cse164 v_prenex_336) .cse165 .cse168) .cse164 v_prenex_336) .cse165 .cse168))) (and (= .cse162 (store (store .cse163 .cse164 v_prenex_27) .cse165 v_prenex_29)) (not (= .cse166 0)) (= .cse167 (store (select .cse163 .cse164) 0 .cse166)) (= .cse162 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse163 .cse164 v_prenex_340) .cse165 v_prenex_29) .cse164 v_prenex_340) .cse165 v_prenex_29) .cse164 v_prenex_340) .cse165 v_prenex_29) .cse164 v_prenex_340) .cse165 v_prenex_29) .cse164 v_prenex_340) .cse165 v_prenex_29) .cse164 v_prenex_340) .cse165 v_prenex_29) .cse164 v_prenex_340) .cse165 v_prenex_29)) (= c_main_~ptr~0.base .cse164) (<= (+ 2 .cse164) .cse165) (= (store .cse168 0 .cse165) v_prenex_29)))))))) .cse169) (exists ((v_prenex_317 (Array Int Int)) (v_prenex_574 (Array Int Int)) (v_prenex_311 (Array Int Int)) (v_prenex_576 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_prenex_314 (Array Int Int))) (let ((.cse171 (select v_prenex_574 0))) (let ((.cse170 (select |c_#memory_$Pointer$.base| .cse171))) (let ((.cse174 (select .cse170 0))) (let ((.cse178 (store |c_#memory_$Pointer$.base| .cse174 v_prenex_576))) (let ((.cse176 (select |c_#memory_$Pointer$.base| .cse174)) (.cse173 (store (store (store (store (store (store (store (store (store (store (store .cse178 .cse171 v_prenex_574) .cse174 v_prenex_313) .cse171 .cse170) .cse174 v_prenex_313) .cse171 .cse170) .cse174 v_prenex_313) .cse171 .cse170) .cse174 v_prenex_313) .cse171 .cse170) .cse174 v_prenex_313) .cse171 .cse170))) (let ((.cse172 (store .cse178 .cse171 v_prenex_314)) (.cse175 (select .cse173 .cse174)) (.cse177 (select .cse176 .cse144))) (and (= (store .cse170 0 .cse171) v_prenex_574) (= .cse171 (select v_prenex_314 0)) (= .cse172 (store (store .cse173 .cse174 v_prenex_311) .cse171 v_prenex_314)) (= (select .cse175 .cse144) (select .cse176 0)) (not (= .cse177 0)) (= .cse174 c_main_~ptr~0.base) (= .cse172 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse173 .cse174 v_prenex_317) .cse171 v_prenex_314) .cse174 v_prenex_317) .cse171 v_prenex_314) .cse174 v_prenex_317) .cse171 v_prenex_314) .cse174 v_prenex_317) .cse171 v_prenex_314) .cse174 v_prenex_317) .cse171 v_prenex_314) .cse174 v_prenex_317) .cse171 v_prenex_314) .cse174 v_prenex_317) .cse171 v_prenex_314)) (= (store .cse175 .cse144 .cse177) .cse176) (<= (+ .cse174 2) .cse171))))))))) (and (exists ((v_prenex_291 (Array Int Int)) (v_prenex_285 (Array Int Int)) (v_prenex_286 (Array Int Int)) (v_prenex_561 (Array Int Int)) (v_prenex_288 (Array Int Int))) (let ((.cse181 (select v_prenex_286 0))) (let ((.cse183 (select |c_#memory_$Pointer$.base| .cse181))) (let ((.cse180 (select .cse183 0))) (let ((.cse185 (select |c_#memory_$Pointer$.base| .cse180)) (.cse182 (store (store |c_#memory_$Pointer$.base| .cse180 v_prenex_561) .cse181 v_prenex_286))) (let ((.cse179 (store (store (store (store (store (store (store (store (store (store .cse182 .cse180 v_prenex_288) .cse181 .cse183) .cse180 v_prenex_288) .cse181 .cse183) .cse180 v_prenex_288) .cse181 .cse183) .cse180 v_prenex_288) .cse181 .cse183) .cse180 v_prenex_288) .cse181 .cse183)) (.cse184 (select .cse185 0))) (and (= (store (store .cse179 .cse180 v_prenex_285) .cse181 v_prenex_286) .cse182) (= .cse180 c_main_~ptr~0.base) (= (store .cse183 0 .cse181) v_prenex_286) (= (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse179 .cse180 v_prenex_291) .cse181 v_prenex_286) .cse180 v_prenex_291) .cse181 v_prenex_286) .cse180 v_prenex_291) .cse181 v_prenex_286) .cse180 v_prenex_291) .cse181 v_prenex_286) .cse180 v_prenex_291) .cse181 v_prenex_286) .cse180 v_prenex_291) .cse181 v_prenex_286) .cse180 v_prenex_291) .cse181 v_prenex_286) .cse182) (= .cse181 .cse184) (not (= .cse184 0)) (<= (+ .cse180 2) .cse181) (= .cse185 (store (select .cse179 .cse180) 0 .cse184))))))))) .cse169) (and (exists ((v_prenex_21 (Array Int Int)) (v_prenex_591 (Array Int Int)) (v_prenex_294 (Array Int Int)) (v_prenex_295 (Array Int Int)) (v_prenex_296 (Array Int Int)) (v_prenex_589 (Array Int Int))) (let ((.cse189 (select v_prenex_589 0))) (let ((.cse190 (select |c_#memory_$Pointer$.base| .cse189))) (let ((.cse188 (select .cse190 0))) (let ((.cse191 (select |c_#memory_$Pointer$.base| .cse188)) (.cse193 (store |c_#memory_$Pointer$.base| .cse188 v_prenex_591))) (let ((.cse186 (store .cse193 .cse189 v_prenex_295)) (.cse187 (store (store (store (store (store (store (store (store (store (store (store .cse193 .cse189 v_prenex_589) .cse188 v_prenex_294) .cse189 .cse190) .cse188 v_prenex_294) .cse189 .cse190) .cse188 v_prenex_294) .cse189 .cse190) .cse188 v_prenex_294) .cse189 .cse190) .cse188 v_prenex_294) .cse189 .cse190)) (.cse192 (select .cse191 0))) (and (= .cse186 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse187 .cse188 v_prenex_296) .cse189 v_prenex_295) .cse188 v_prenex_296) .cse189 v_prenex_295) .cse188 v_prenex_296) .cse189 v_prenex_295) .cse188 v_prenex_296) .cse189 v_prenex_295) .cse188 v_prenex_296) .cse189 v_prenex_295) .cse188 v_prenex_296) .cse189 v_prenex_295) .cse188 v_prenex_296) .cse189 v_prenex_295)) (= (select v_prenex_295 0) .cse189) (= (store (store .cse187 .cse188 v_prenex_21) .cse189 v_prenex_295) .cse186) (= (store .cse190 0 .cse189) v_prenex_589) (= c_main_~ptr~0.base .cse188) (= .cse191 (store (select .cse187 .cse188) 0 .cse192)) (<= (+ 2 .cse188) .cse189) (not (= .cse192 0))))))))) .cse169) (exists ((v_prenex_549 (Array Int Int)) (v_prenex_543 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_544 (Array Int Int)) (v_prenex_545 (Array Int Int)) (v_prenex_546 (Array Int Int))) (let ((.cse200 (select v_DerPreprocessor_23 0))) (let ((.cse197 (select |c_#memory_$Pointer$.base| .cse200))) (let ((.cse196 (select .cse197 0))) (let ((.cse202 (store (store (store |c_#memory_$Pointer$.base| .cse200 v_DerPreprocessor_23) .cse196 v_prenex_543) .cse200 v_prenex_546)) (.cse194 (select |c_#memory_$Pointer$.base| .cse196))) (let ((.cse198 (select v_DerPreprocessor_23 .cse144)) (.cse199 (select .cse194 .cse144)) (.cse195 (store (store .cse202 .cse196 v_prenex_545) .cse200 v_prenex_546)) (.cse201 (select (store (store .cse202 .cse196 v_prenex_549) .cse200 v_prenex_546) .cse196))) (and (= .cse194 (select .cse195 .cse196)) (= (store v_DerPreprocessor_23 0 .cse196) .cse197) (= .cse198 .cse199) (<= (+ .cse196 2) .cse200) (= .cse196 c_main_~ptr~0.base) (= (select .cse201 0) (select .cse201 .cse144)) (not (= .cse198 0)) (= (select v_prenex_546 0) .cse196) (= .cse194 (store .cse201 .cse144 .cse199)) (= (select (store (store (store (store .cse195 .cse196 v_prenex_544) .cse200 .cse197) .cse196 v_prenex_544) .cse200 .cse197) .cse196) .cse201)))))))) (and (exists ((v_prenex_565 (Array Int Int)) (v_prenex_301 (Array Int Int)) (v_prenex_302 (Array Int Int)) (v_prenex_567 (Array Int Int)) (v_prenex_303 (Array Int Int)) (v_prenex_304 (Array Int Int))) (let ((.cse206 (select v_prenex_565 0))) (let ((.cse208 (select |c_#memory_$Pointer$.base| .cse206))) (let ((.cse205 (select .cse208 0))) (let ((.cse209 (select |c_#memory_$Pointer$.base| .cse205)) (.cse210 (store |c_#memory_$Pointer$.base| .cse205 v_prenex_567))) (let ((.cse203 (store .cse210 .cse206 v_prenex_302)) (.cse204 (store (store (store (store (store (store (store (store (store (store (store .cse210 .cse206 v_prenex_565) .cse205 v_prenex_301) .cse206 .cse208) .cse205 v_prenex_301) .cse206 .cse208) .cse205 v_prenex_301) .cse206 .cse208) .cse205 v_prenex_301) .cse206 .cse208) .cse205 v_prenex_301) .cse206 .cse208)) (.cse207 (select .cse209 0))) (and (= .cse203 (store (store .cse204 .cse205 v_prenex_303) .cse206 v_prenex_302)) (= .cse203 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse204 .cse205 v_prenex_304) .cse206 v_prenex_302) .cse205 v_prenex_304) .cse206 v_prenex_302) .cse205 v_prenex_304) .cse206 v_prenex_302) .cse205 v_prenex_304) .cse206 v_prenex_302) .cse205 v_prenex_304) .cse206 v_prenex_302) .cse205 v_prenex_304) .cse206 v_prenex_302) .cse205 v_prenex_304) .cse206 v_prenex_302)) (not (= .cse207 0)) (= (select v_prenex_302 0) .cse206) (= c_main_~ptr~0.base .cse205) (= (store .cse208 0 .cse206) v_prenex_565) (= .cse209 (store (select .cse204 .cse205) 0 .cse207)) (<= (+ 2 .cse205) .cse206)))))))) .cse169) (and (exists ((v_prenex_592 (Array Int Int)) (v_prenex_593 (Array Int Int)) (v_prenex_583 (Array Int Int)) (v_prenex_594 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_584 (Array Int Int)) (v_prenex_585 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_327 (Array Int Int)) (v_prenex_328 (Array Int Int)) (v_prenex_329 (Array Int Int)) (|main_~#s~0.base| Int)) (let ((.cse211 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse216 (select .cse211 0)) (.cse212 (select v_prenex_584 0))) (let ((.cse217 (store (store (store (store |c_#memory_$Pointer$.base| .cse216 v_prenex_585) |main_~#s~0.base| v_prenex_584) .cse212 v_prenex_583) |main_~#s~0.base| v_prenex_584))) (let ((.cse222 (store (store (store (store (store (store (store (store (store (store (store (store .cse217 .cse216 v_prenex_326) |main_~#s~0.base| .cse211) .cse216 v_prenex_326) |main_~#s~0.base| .cse211) .cse216 v_prenex_326) |main_~#s~0.base| .cse211) .cse212 v_prenex_327) |main_~#s~0.base| .cse211) .cse216 v_prenex_326) |main_~#s~0.base| .cse211) .cse216 v_prenex_326) |main_~#s~0.base| .cse211))) (let ((.cse223 (select |c_#memory_$Pointer$.base| .cse216)) (.cse213 (select .cse217 .cse212)) (.cse221 (store (store (store (store .cse222 .cse216 v_prenex_594) |main_~#s~0.base| v_prenex_328) .cse212 v_prenex_593) |main_~#s~0.base| v_prenex_328)) (.cse218 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse222 .cse216 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse216 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse216 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse216 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse216 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse216 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse216 v_prenex_330) |main_~#s~0.base| v_prenex_328) .cse212 v_prenex_329) |main_~#s~0.base| v_prenex_328))) (let ((.cse214 (select .cse218 .cse212)) (.cse220 (select (store (store (store (store .cse221 .cse212 v_prenex_592) |main_~#s~0.base| v_prenex_584) .cse212 v_prenex_592) |main_~#s~0.base| v_prenex_584) .cse212)) (.cse215 (select .cse213 0)) (.cse224 (select .cse223 0)) (.cse219 (select .cse221 .cse212))) (and (= v_prenex_584 (store .cse211 0 .cse212)) (= .cse213 (store .cse214 0 .cse215)) (= c_main_~ptr~0.base .cse216) (= (store (store (store (store .cse217 .cse212 .cse214) |main_~#s~0.base| v_prenex_328) .cse212 .cse214) |main_~#s~0.base| v_prenex_328) .cse218) (= v_prenex_329 .cse214) (= v_prenex_593 .cse219) (= .cse220 .cse214) (= (select .cse221 .cse216) v_prenex_594) (= |c_#memory_$Pointer$.base| (store (store (store (store .cse222 .cse216 .cse223) |main_~#s~0.base| .cse211) .cse216 .cse223) |main_~#s~0.base| .cse211)) (not (= .cse224 0)) (= (select .cse218 .cse216) v_prenex_330) (= .cse220 v_prenex_592) (= (store (store (store (store .cse217 .cse212 .cse219) |main_~#s~0.base| v_prenex_328) .cse212 .cse219) |main_~#s~0.base| v_prenex_328) .cse221) (= v_prenex_327 (select .cse222 .cse212)) (<= (+ 2 .cse216) |main_~#s~0.base|) (= .cse223 (store (select .cse222 .cse216) 0 .cse224)) (= (select .cse217 .cse216) v_prenex_585) (= .cse215 .cse224) (= .cse213 .cse219) (= .cse213 v_prenex_583) (= (select v_prenex_328 0) .cse212))))))))) .cse169) (exists ((|main_~#s~0.base| Int)) (let ((.cse237 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse225 (select .cse237 0))) (and (= c_main_~ptr~0.base .cse225) (exists ((v_prenex_558 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_551 (Array Int Int)) (v_prenex_552 (Array Int Int)) (v_prenex_553 (Array Int Int)) (v_prenex_554 (Array Int Int)) (v_prenex_555 (Array Int Int)) (v_prenex_556 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int)) (v_prenex_557 (Array Int Int))) (let ((.cse236 (select v_DerPreprocessor_25 0))) (let ((.cse233 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse236 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse236 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse236 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse225 v_prenex_551) |main_~#s~0.base| v_DerPreprocessor_25) .cse236 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25) .cse236 v_prenex_556) |main_~#s~0.base| v_DerPreprocessor_25))) (let ((.cse235 (store (store (store (store .cse233 .cse236 v_prenex_554) |main_~#s~0.base| v_prenex_555) .cse225 v_prenex_553) |main_~#s~0.base| v_prenex_555)) (.cse227 (select |c_#memory_$Pointer$.base| .cse225)) (.cse230 (select (store (store (store (store .cse233 .cse236 v_DerPreprocessor_26) |main_~#s~0.base| v_DerPreprocessor_25) .cse236 v_DerPreprocessor_26) |main_~#s~0.base| v_DerPreprocessor_25) .cse236)) (.cse231 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse233 .cse236 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse236 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse236 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse236 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse236 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse236 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse236 v_prenex_558) |main_~#s~0.base| v_prenex_555) .cse225 v_prenex_557) |main_~#s~0.base| v_prenex_555))) (let ((.cse229 (select .cse233 .cse236)) (.cse226 (select .cse231 .cse225)) (.cse234 (select .cse230 .cse144)) (.cse228 (select .cse227 .cse144)) (.cse232 (select .cse235 .cse225))) (and (= (select .cse226 0) (select .cse226 .cse144)) (= .cse227 (store .cse226 .cse144 .cse228)) (= (select .cse229 .cse144) (select .cse230 0)) (= .cse229 v_prenex_556) (= .cse231 (store (store (store (store |c_#memory_$Pointer$.base| .cse225 .cse226) |main_~#s~0.base| v_prenex_555) .cse225 .cse226) |main_~#s~0.base| v_prenex_555)) (= .cse232 .cse227) (= (select .cse233 .cse225) v_prenex_551) (= (store .cse229 .cse144 .cse234) .cse230) (= v_prenex_554 (select .cse235 .cse236)) (= .cse230 v_DerPreprocessor_26) (= (select v_prenex_555 0) .cse225) (= (store v_DerPreprocessor_25 0 .cse225) .cse237) (= v_prenex_558 (select .cse231 .cse236)) (= .cse226 (select (store (store (store (store .cse235 .cse225 v_prenex_552) |main_~#s~0.base| .cse237) .cse225 v_prenex_552) |main_~#s~0.base| .cse237) .cse225)) (not (= .cse234 0)) (= .cse234 .cse228) (= (store (store (store (store |c_#memory_$Pointer$.base| .cse225 .cse232) |main_~#s~0.base| v_prenex_555) .cse225 .cse232) |main_~#s~0.base| v_prenex_555) .cse235))))))) (<= (+ 2 .cse225) |main_~#s~0.base|))))) (and (exists ((v_prenex_25 (Array Int Int)) (v_prenex_562 (Array Int Int)) (v_prenex_595 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_564 (Array Int Int)) (v_prenex_599 (Array Int Int))) (let ((.cse241 (select v_prenex_562 0))) (let ((.cse244 (select |c_#memory_$Pointer$.base| .cse241))) (let ((.cse240 (select .cse244 0))) (let ((.cse245 (store |c_#memory_$Pointer$.base| .cse240 v_prenex_564)) (.cse243 (select |c_#memory_$Pointer$.base| .cse240))) (let ((.cse242 (select .cse243 0)) (.cse239 (store (store (store (store (store (store (store (store (store (store (store .cse245 .cse241 v_prenex_562) .cse240 v_prenex_595) .cse241 .cse244) .cse240 v_prenex_595) .cse241 .cse244) .cse240 v_prenex_595) .cse241 .cse244) .cse240 v_prenex_595) .cse241 .cse244) .cse240 v_prenex_595) .cse241 .cse244)) (.cse238 (store .cse245 .cse241 v_prenex_25))) (and (= .cse238 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse239 .cse240 v_prenex_599) .cse241 v_prenex_25) .cse240 v_prenex_599) .cse241 v_prenex_25) .cse240 v_prenex_599) .cse241 v_prenex_25) .cse240 v_prenex_599) .cse241 v_prenex_25) .cse240 v_prenex_599) .cse241 v_prenex_25) .cse240 v_prenex_599) .cse241 v_prenex_25) .cse240 v_prenex_599) .cse241 v_prenex_25)) (= .cse241 (select v_prenex_25 0)) (= (store (select .cse239 .cse240) 0 .cse242) .cse243) (not (= .cse242 0)) (<= (+ 2 .cse240) .cse241) (= .cse240 c_main_~ptr~0.base) (= v_prenex_562 (store .cse244 0 .cse241)) (= (store (store .cse239 .cse240 v_prenex_24) .cse241 v_prenex_25) .cse238)))))))) .cse169) (exists ((v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_324 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_579 (Array Int Int))) (let ((.cse247 (select v_prenex_321 0))) (let ((.cse249 (select |c_#memory_$Pointer$.base| .cse247))) (let ((.cse246 (select .cse249 0))) (let ((.cse252 (store (store |c_#memory_$Pointer$.base| .cse246 v_prenex_579) .cse247 v_prenex_321))) (let ((.cse250 (select |c_#memory_$Pointer$.base| .cse246)) (.cse253 (store (store (store (store (store (store (store (store (store (store .cse252 .cse246 v_prenex_320) .cse247 .cse249) .cse246 v_prenex_320) .cse247 .cse249) .cse246 v_prenex_320) .cse247 .cse249) .cse246 v_prenex_320) .cse247 .cse249) .cse246 v_prenex_320) .cse247 .cse249))) (let ((.cse251 (select .cse253 .cse246)) (.cse248 (select .cse250 .cse144))) (and (<= (+ 2 .cse246) .cse247) (= .cse246 c_main_~ptr~0.base) (= .cse247 (select v_prenex_321 .cse144)) (not (= .cse248 0)) (= (store .cse249 0 .cse247) v_prenex_321) (= (select .cse250 0) (select .cse251 .cse144)) (= .cse250 (store .cse251 .cse144 .cse248)) (= .cse252 (store (store .cse253 .cse246 v_prenex_324) .cse247 v_prenex_321)) (= .cse252 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse253 .cse246 v_prenex_325) .cse247 v_prenex_321) .cse246 v_prenex_325) .cse247 v_prenex_321) .cse246 v_prenex_325) .cse247 v_prenex_321) .cse246 v_prenex_325) .cse247 v_prenex_321) .cse246 v_prenex_325) .cse247 v_prenex_321) .cse246 v_prenex_325) .cse247 v_prenex_321) .cse246 v_prenex_325) .cse247 v_prenex_321)))))))))) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_570 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_335 (Array Int Int)) (v_prenex_568 (Array Int Int))) (let ((.cse255 (select v_prenex_568 0))) (let ((.cse254 (select |c_#memory_$Pointer$.base| .cse255))) (let ((.cse259 (select .cse254 0))) (let ((.cse262 (store |c_#memory_$Pointer$.base| .cse259 v_prenex_570))) (let ((.cse261 (select |c_#memory_$Pointer$.base| .cse259)) (.cse258 (store (store (store (store (store (store (store (store (store (store (store .cse262 .cse255 v_prenex_568) .cse259 v_prenex_331) .cse255 .cse254) .cse259 v_prenex_331) .cse255 .cse254) .cse259 v_prenex_331) .cse255 .cse254) .cse259 v_prenex_331) .cse255 .cse254) .cse259 v_prenex_331) .cse255 .cse254))) (let ((.cse260 (select .cse258 .cse259)) (.cse256 (select .cse261 .cse144)) (.cse257 (store .cse262 .cse255 v_prenex_19))) (and (= (store .cse254 0 .cse255) v_prenex_568) (not (= 0 .cse256)) (= .cse257 (store (store .cse258 .cse259 v_prenex_18) .cse255 v_prenex_19)) (= (select .cse260 .cse144) (select .cse261 0)) (= (select v_prenex_19 0) .cse255) (= (store .cse260 .cse144 .cse256) .cse261) (<= (+ .cse259 2) .cse255) (= (select v_prenex_568 .cse144) .cse255) (= .cse259 c_main_~ptr~0.base) (= .cse257 (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse258 .cse259 v_prenex_335) .cse255 v_prenex_19) .cse259 v_prenex_335) .cse255 v_prenex_19) .cse259 v_prenex_335) .cse255 v_prenex_19) .cse259 v_prenex_335) .cse255 v_prenex_19) .cse259 v_prenex_335) .cse255 v_prenex_19) .cse259 v_prenex_335) .cse255 v_prenex_19) .cse259 v_prenex_335) .cse255 v_prenex_19)))))))))) (exists ((v_prenex_538 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_539 (Array Int Int)) (v_prenex_540 (Array Int Int)) (v_prenex_541 (Array Int Int)) (v_prenex_67 (Array Int Int))) (let ((.cse265 (select v_DerPreprocessor_32 0))) (let ((.cse264 (select |c_#memory_$Pointer$.base| .cse265))) (let ((.cse263 (select .cse264 0))) (let ((.cse266 (select |c_#memory_$Pointer$.base| .cse263)) (.cse270 (store (store (store |c_#memory_$Pointer$.base| .cse265 v_DerPreprocessor_32) .cse263 v_prenex_538) .cse265 v_prenex_541))) (let ((.cse267 (select (store (store .cse270 .cse263 v_prenex_67) .cse265 v_prenex_541) .cse263)) (.cse268 (select .cse266 .cse144)) (.cse269 (store (store .cse270 .cse263 v_prenex_540) .cse265 v_prenex_541))) (and (= (store v_DerPreprocessor_32 0 .cse263) .cse264) (= .cse263 c_main_~ptr~0.base) (<= (+ .cse263 2) .cse265) (= .cse266 (store .cse267 .cse144 .cse268)) (= (select (store (store (store (store .cse269 .cse263 v_prenex_539) .cse265 .cse264) .cse263 v_prenex_539) .cse265 .cse264) .cse263) .cse267) (= .cse263 (select v_prenex_541 0)) (= (select .cse267 .cse144) (select .cse267 0)) (not (= .cse268 0)) (= .cse266 (select .cse269 .cse263))))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_32 (Array Int Int)) (|main_~#s~0.base| Int) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse280 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse274 (select .cse280 0)) (.cse276 (select v_DerPreprocessor_28 0))) (let ((.cse283 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse276 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse276 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse276 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse274 v_DerPreprocessor_10) |main_~#s~0.base| v_DerPreprocessor_28) .cse276 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28) .cse276 v_DerPreprocessor_8) |main_~#s~0.base| v_DerPreprocessor_28))) (let ((.cse281 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse283 .cse276 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse276 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse276 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse276 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse276 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse276 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse276 v_DerPreprocessor_14) |main_~#s~0.base| v_DerPreprocessor_15) .cse274 v_DerPreprocessor_16) |main_~#s~0.base| v_DerPreprocessor_15)) (.cse282 (select (store (store (store (store .cse283 .cse276 v_DerPreprocessor_29) |main_~#s~0.base| v_DerPreprocessor_28) .cse276 v_DerPreprocessor_29) |main_~#s~0.base| v_DerPreprocessor_28) .cse276)) (.cse275 (store (store (store (store .cse283 .cse276 v_prenex_30) |main_~#s~0.base| v_DerPreprocessor_15) .cse274 v_prenex_31) |main_~#s~0.base| v_DerPreprocessor_15)) (.cse272 (select |c_#memory_$Pointer$.base| .cse274))) (let ((.cse277 (select .cse272 0)) (.cse271 (select .cse275 .cse274)) (.cse273 (select .cse283 .cse276)) (.cse278 (select .cse282 0)) (.cse279 (select .cse281 .cse274))) (and (= .cse271 .cse272) (= .cse273 v_DerPreprocessor_8) (= (select v_DerPreprocessor_15 0) .cse274) (= c_main_~ptr~0.base .cse274) (= (select .cse275 .cse276) v_prenex_30) (= .cse277 .cse278) (= .cse279 (select (store (store (store (store .cse275 .cse274 v_prenex_32) |main_~#s~0.base| .cse280) .cse274 v_prenex_32) |main_~#s~0.base| .cse280) .cse274)) (= (store .cse279 0 .cse277) .cse272) (= (store v_DerPreprocessor_28 0 .cse274) .cse280) (not (= .cse278 0)) (= .cse275 (store (store (store (store |c_#memory_$Pointer$.base| .cse274 .cse271) |main_~#s~0.base| v_DerPreprocessor_15) .cse274 .cse271) |main_~#s~0.base| v_DerPreprocessor_15)) (<= (+ 2 .cse274) |main_~#s~0.base|) (= v_DerPreprocessor_14 (select .cse281 .cse276)) (= (store .cse273 0 .cse278) .cse282) (= .cse281 (store (store (store (store |c_#memory_$Pointer$.base| .cse274 .cse279) |main_~#s~0.base| v_DerPreprocessor_15) .cse274 .cse279) |main_~#s~0.base| v_DerPreprocessor_15)) (= (select .cse283 .cse274) v_DerPreprocessor_10) (= v_DerPreprocessor_29 .cse282)))))))) .cse169) (exists ((|main_~#s~0.base| Int)) (let ((.cse298 (select |c_#memory_$Pointer$.base| |main_~#s~0.base|))) (let ((.cse284 (select .cse298 0))) (let ((.cse286 (select |c_#memory_$Pointer$.base| .cse284))) (let ((.cse285 (select .cse286 .cse144))) (and (= c_main_~ptr~0.base .cse284) (not (= .cse285 0)) (<= (+ 2 .cse284) |main_~#s~0.base|) (exists ((v_prenex_280 (Array Int Int)) (v_prenex_281 (Array Int Int)) (v_prenex_282 (Array Int Int)) (v_prenex_283 (Array Int Int)) (v_prenex_276 (Array Int Int)) (v_prenex_277 (Array Int Int)) (v_prenex_586 (Array Int Int)) (v_prenex_278 (Array Int Int)) (v_prenex_587 (Array Int Int)) (v_prenex_279 (Array Int Int)) (v_prenex_588 (Array Int Int))) (let ((.cse290 (select v_prenex_587 0))) (let ((.cse289 (store (store (store (store |c_#memory_$Pointer$.base| .cse284 v_prenex_588) |main_~#s~0.base| v_prenex_587) .cse290 v_prenex_586) |main_~#s~0.base| v_prenex_587))) (let ((.cse292 (store (store (store (store (store (store (store (store (store (store (store (store .cse289 .cse284 v_prenex_281) |main_~#s~0.base| .cse298) .cse284 v_prenex_281) |main_~#s~0.base| .cse298) .cse284 v_prenex_281) |main_~#s~0.base| .cse298) .cse290 v_prenex_276) |main_~#s~0.base| .cse298) .cse284 v_prenex_281) |main_~#s~0.base| .cse298) .cse284 v_prenex_281) |main_~#s~0.base| .cse298))) (let ((.cse297 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse292 .cse284 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse284 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse284 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse284 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse284 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse284 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse284 v_prenex_283) |main_~#s~0.base| v_prenex_280) .cse290 v_prenex_282) |main_~#s~0.base| v_prenex_280)) (.cse293 (select .cse289 .cse290)) (.cse288 (store (store (store (store .cse292 .cse284 v_prenex_279) |main_~#s~0.base| v_prenex_280) .cse290 v_prenex_278) |main_~#s~0.base| v_prenex_280))) (let ((.cse296 (select (store (store (store (store .cse288 .cse290 v_prenex_277) |main_~#s~0.base| v_prenex_587) .cse290 v_prenex_277) |main_~#s~0.base| v_prenex_587) .cse290)) (.cse291 (select .cse288 .cse290)) (.cse295 (select .cse293 .cse144)) (.cse294 (select .cse297 .cse290)) (.cse287 (select .cse292 .cse284))) (and (= (select .cse286 0) (select .cse287 .cse144)) (= .cse288 (store (store (store (store .cse289 .cse290 .cse291) |main_~#s~0.base| v_prenex_280) .cse290 .cse291) |main_~#s~0.base| v_prenex_280)) (= (select .cse289 .cse284) v_prenex_588) (= (select .cse292 .cse290) v_prenex_276) (= .cse293 (store .cse294 .cse144 .cse295)) (= .cse294 .cse296) (= .cse291 v_prenex_278) (= (select .cse297 .cse284) v_prenex_283) (= .cse296 v_prenex_277) (= .cse293 v_prenex_586) (= (store (store (store (store .cse292 .cse284 .cse286) |main_~#s~0.base| .cse298) .cse284 .cse286) |main_~#s~0.base| .cse298) |c_#memory_$Pointer$.base|) (= (store (store (store (store .cse289 .cse290 .cse294) |main_~#s~0.base| v_prenex_280) .cse290 .cse294) |main_~#s~0.base| v_prenex_280) .cse297) (= (select .cse294 0) (select .cse294 .cse144)) (= .cse291 .cse293) (= v_prenex_587 (store .cse298 0 .cse290)) (= .cse285 .cse295) (= .cse294 v_prenex_282) (= (select .cse288 .cse284) v_prenex_279) (= .cse286 (store .cse287 .cse144 .cse285)) (= .cse290 (select v_prenex_280 0)))))))))))))))))) (< |c_#StackHeapBarrier| |c_main_~#s~0.base|) (not (= (select (select |c_#memory_$Pointer$.base| c_main_~ptr~0.base) 4) 0)))) is different from false [2023-04-02 21:53:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:53:21,915 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2023-04-02 21:53:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 21:53:21,916 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 21 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 38 [2023-04-02 21:53:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:53:21,917 INFO L225 Difference]: With dead ends: 39 [2023-04-02 21:53:21,917 INFO L226 Difference]: Without dead ends: 36 [2023-04-02 21:53:21,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 116.4s TimeCoverageRelationStatistics Valid=228, Invalid=3310, Unknown=18, NotChecked=476, Total=4032 [2023-04-02 21:53:21,920 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-04-02 21:53:21,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 250 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 3 Unknown, 138 Unchecked, 2.2s Time] [2023-04-02 21:53:21,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-02 21:53:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2023-04-02 21:53:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 21:53:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-04-02 21:53:21,930 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 38 [2023-04-02 21:53:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:53:21,930 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-04-02 21:53:21,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 21 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-02 21:53:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-04-02 21:53:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-04-02 21:53:21,931 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:53:21,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-04-02 21:53:21,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 21:53:22,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-02 21:53:22,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:53:22,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:53:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1168633361, now seen corresponding path program 1 times [2023-04-02 21:53:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:53:22,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262477775] [2023-04-02 21:53:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:53:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:53:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:53:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 21:53:24,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:53:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262477775] [2023-04-02 21:53:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262477775] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:53:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345763446] [2023-04-02 21:53:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:53:24,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:53:24,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:53:24,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:53:24,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 21:53:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:53:24,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 123 conjunts are in the unsatisfiable core [2023-04-02 21:53:24,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:53:24,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 21:53:24,931 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 [2023-04-02 21:53:24,961 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 19 treesize of output 18 [2023-04-02 21:53:25,214 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 [2023-04-02 21:53:25,220 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 [2023-04-02 21:53:25,225 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 [2023-04-02 21:53:25,228 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 [2023-04-02 21:53:25,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:25,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:25,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:25,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-04-02 21:53:25,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:25,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:25,721 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 53 treesize of output 44 [2023-04-02 21:53:25,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:25,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:25,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 31 treesize of output 26 [2023-04-02 21:53:25,744 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 12 treesize of output 11 [2023-04-02 21:53:25,752 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 14 treesize of output 11 [2023-04-02 21:53:25,758 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 47 treesize of output 38 [2023-04-02 21:53:25,774 INFO L321 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2023-04-02 21:53:25,775 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 29 treesize of output 29 [2023-04-02 21:53:25,782 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 18 treesize of output 17 [2023-04-02 21:53:25,977 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-04-02 21:53:25,977 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 41 [2023-04-02 21:53:25,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:25,986 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 21:53:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 21:53:26,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:53:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345763446] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:53:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [136345417] [2023-04-02 21:53:26,911 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-04-02 21:53:26,911 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:53:26,911 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:53:26,911 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:53:26,911 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:53:26,927 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:53:27,140 INFO L197 IcfgInterpreter]: Interpreting procedure sll_prepend with input of size 36 for LOIs [2023-04-02 21:53:27,226 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 44 for LOIs [2023-04-02 21:53:27,398 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 15 for LOIs [2023-04-02 21:53:27,409 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:53:27,412 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:53:39,052 WARN L223 SmtUtils]: Spent 9.26s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 21:53:39,808 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1134#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= |main_~#s~0.offset| 0) (= main_~len~0 2) (= main_~temp~2.base (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset) 1)) (= 5 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0))) (= main_~ptr~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0) 4))) (= |#NULL.offset| 0) (or (not (= main_~ptr~0.offset 0)) (not (= main_~ptr~0.base 0))) (= 5 main_~uneq~0) (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)) main_~temp~2.offset) (= |#NULL.base| 0) (= main_~count~0 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0) 4)) main_~ptr~0.offset))' at error location [2023-04-02 21:53:39,808 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:53:39,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 21:53:39,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2023-04-02 21:53:39,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138922141] [2023-04-02 21:53:39,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 21:53:39,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-02 21:53:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:53:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-02 21:53:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3444, Unknown=6, NotChecked=0, Total=3660 [2023-04-02 21:53:39,811 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 33 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 25 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-02 21:53:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:53:42,247 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-04-02 21:53:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 21:53:42,248 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 25 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 38 [2023-04-02 21:53:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:53:42,249 INFO L225 Difference]: With dead ends: 36 [2023-04-02 21:53:42,249 INFO L226 Difference]: Without dead ends: 34 [2023-04-02 21:53:42,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=290, Invalid=4960, Unknown=6, NotChecked=0, Total=5256 [2023-04-02 21:53:42,251 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 21:53:42,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 186 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-02 21:53:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-04-02 21:53:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-04-02 21:53:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 21:53:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-04-02 21:53:42,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 38 [2023-04-02 21:53:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:53:42,257 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-04-02 21:53:42,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 25 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-02 21:53:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-04-02 21:53:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 21:53:42,258 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:53:42,258 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-04-02 21:53:42,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-02 21:53:42,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:53:42,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:53:42,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:53:42,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2070093893, now seen corresponding path program 1 times [2023-04-02 21:53:42,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:53:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70660756] [2023-04-02 21:53:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:53:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:53:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:53:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 21:53:45,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:53:45,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70660756] [2023-04-02 21:53:45,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70660756] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:53:45,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589626610] [2023-04-02 21:53:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:53:45,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:53:45,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:53:45,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:53:45,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 21:53:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:53:45,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 112 conjunts are in the unsatisfiable core [2023-04-02 21:53:45,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:53:45,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 21:53:45,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 21:53:45,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 21:53:45,487 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 [2023-04-02 21:53:45,491 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 [2023-04-02 21:53:45,495 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 [2023-04-02 21:53:45,893 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_681 (Array Int Int)) (sll_prepend_~new_head~1.offset Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (sll_prepend_~new_head~1.base Int)) (let ((.cse0 (+ sll_prepend_~new_head~1.offset 4))) (and (= (store (store |c_old(#memory_$Pointer$.offset)| sll_prepend_~new_head~1.base (store v_ArrVal_681 .cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| sll_prepend_~new_head~1.base v_ArrVal_681) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|))) |c_sll_prepend_#in~head.base| (store (select (store |c_old(#memory_$Pointer$.offset)| sll_prepend_~new_head~1.base v_ArrVal_683) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset| sll_prepend_~new_head~1.offset)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| sll_prepend_~new_head~1.base) 0) (< sll_prepend_~new_head~1.base |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store v_ArrVal_682 .cse0 (select (select (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base v_ArrVal_682) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|))))) (store .cse1 |c_sll_prepend_#in~head.base| (store (select .cse1 |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base))))))) is different from true [2023-04-02 21:53:45,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:45,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:45,916 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 26 [2023-04-02 21:53:45,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:45,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:45,946 INFO L321 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2023-04-02 21:53:45,947 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 54 treesize of output 51 [2023-04-02 21:53:45,958 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 12 treesize of output 11 [2023-04-02 21:53:45,965 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 44 treesize of output 35 [2023-04-02 21:53:45,974 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 14 treesize of output 13 [2023-04-02 21:53:45,994 INFO L321 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2023-04-02 21:53:45,994 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 [2023-04-02 21:53:46,002 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 14 treesize of output 11 [2023-04-02 21:53:46,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:53:46,210 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 98 treesize of output 73 [2023-04-02 21:53:46,330 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-04-02 21:53:46,331 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 [2023-04-02 21:53:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 21:53:46,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:53:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589626610] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:53:46,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [7497635] [2023-04-02 21:53:46,910 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-02 21:53:46,910 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:53:46,910 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:53:46,911 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:53:46,911 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:53:46,927 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:53:47,179 INFO L197 IcfgInterpreter]: Interpreting procedure sll_prepend with input of size 36 for LOIs [2023-04-02 21:53:47,255 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 44 for LOIs [2023-04-02 21:53:47,458 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 15 for LOIs [2023-04-02 21:53:47,474 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:53:47,477 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:53:59,303 WARN L223 SmtUtils]: Spent 9.53s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 21:54:00,057 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1470#(and (= main_~data~0 1) (<= 1 main_~count~0) (<= 1 |#StackHeapBarrier|) (= |main_~#s~0.offset| 0) (= main_~ptr~0.offset 0) (= main_~len~0 2) (= main_~ptr~0.base 0) (not (= main_~count~0 3)) (= |#NULL.offset| 0) (= 5 main_~uneq~0) (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|) (= |#NULL.base| 0))' at error location [2023-04-02 21:54:00,057 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:54:00,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 21:54:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2023-04-02 21:54:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242811505] [2023-04-02 21:54:00,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 21:54:00,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-04-02 21:54:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:54:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-04-02 21:54:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3811, Unknown=2, NotChecked=124, Total=4160 [2023-04-02 21:54:00,062 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 36 states, 23 states have (on average 1.608695652173913) internal successors, (37), 27 states have internal predecessors, (37), 8 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-02 21:54:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:54:02,399 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-04-02 21:54:02,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 21:54:02,400 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 23 states have (on average 1.608695652173913) internal successors, (37), 27 states have internal predecessors, (37), 8 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 40 [2023-04-02 21:54:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:54:02,402 INFO L225 Difference]: With dead ends: 42 [2023-04-02 21:54:02,402 INFO L226 Difference]: Without dead ends: 39 [2023-04-02 21:54:02,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=324, Invalid=5530, Unknown=2, NotChecked=150, Total=6006 [2023-04-02 21:54:02,404 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 70 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 21:54:02,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 303 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 718 Invalid, 0 Unknown, 43 Unchecked, 1.0s Time] [2023-04-02 21:54:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-04-02 21:54:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-04-02 21:54:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 21:54:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-04-02 21:54:02,411 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 40 [2023-04-02 21:54:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:54:02,411 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-04-02 21:54:02,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 23 states have (on average 1.608695652173913) internal successors, (37), 27 states have internal predecessors, (37), 8 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-04-02 21:54:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-04-02 21:54:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 21:54:02,412 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:54:02,412 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 21:54:02,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-02 21:54:02,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:54:02,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:54:02,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:54:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2070148918, now seen corresponding path program 1 times [2023-04-02 21:54:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:54:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284931861] [2023-04-02 21:54:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:54:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:54:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:54:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:54:07,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:54:07,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284931861] [2023-04-02 21:54:07,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284931861] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:54:07,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927639407] [2023-04-02 21:54:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:54:07,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:54:07,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:54:07,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:54:07,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 21:54:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:54:07,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 166 conjunts are in the unsatisfiable core [2023-04-02 21:54:07,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:54:07,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 21:54:07,557 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 [2023-04-02 21:54:07,776 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 [2023-04-02 21:54:07,935 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 19 treesize of output 18 [2023-04-02 21:54:08,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:08,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 21:54:08,419 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 [2023-04-02 21:54:08,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:08,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-04-02 21:54:08,435 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 [2023-04-02 21:54:08,700 INFO L321 Elim1Store]: treesize reduction 96, result has 24.4 percent of original size [2023-04-02 21:54:08,701 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 6 case distinctions, treesize of input 47 treesize of output 55 [2023-04-02 21:54:09,072 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-04-02 21:54:09,072 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 46 [2023-04-02 21:54:09,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 21:54:09,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-04-02 21:54:09,667 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (sll_prepend_~new_head~1.offset Int) (v_ArrVal_872 (Array Int Int)) (sll_prepend_~new_head~1.base Int) (v_ArrVal_874 (Array Int Int))) (let ((.cse0 (+ sll_prepend_~new_head~1.offset 4))) (and (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| sll_prepend_~new_head~1.base (store v_ArrVal_868 .cse0 (select (select (store |c_old(#memory_$Pointer$.offset)| sll_prepend_~new_head~1.base v_ArrVal_868) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|))) |c_sll_prepend_#in~head.base| (store (select (store |c_old(#memory_$Pointer$.offset)| sll_prepend_~new_head~1.base v_ArrVal_874) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset| sll_prepend_~new_head~1.offset))) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (store v_ArrVal_865 .cse0 (select (select (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base v_ArrVal_865) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|))))) (store .cse1 |c_sll_prepend_#in~head.base| (store (select .cse1 |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= |c_#memory_int| (store (store |c_old(#memory_int)| sll_prepend_~new_head~1.base v_ArrVal_872) |c_sll_prepend_#in~head.base| v_ArrVal_878)) (= (select |c_old(#valid)| sll_prepend_~new_head~1.base) 0) (< sll_prepend_~new_head~1.base |c_#StackHeapBarrier|)))) is different from true [2023-04-02 21:54:09,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:09,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:09,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:09,698 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 121 treesize of output 111 [2023-04-02 21:54:09,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:09,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:09,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2023-04-02 21:54:09,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:09,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:09,729 INFO L321 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2023-04-02 21:54:09,730 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 128 treesize of output 103 [2023-04-02 21:54:09,738 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 12 treesize of output 11 [2023-04-02 21:54:09,744 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 12 treesize of output 11 [2023-04-02 21:54:09,750 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 108 treesize of output 89 [2023-04-02 21:54:09,756 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 147 treesize of output 134 [2023-04-02 21:54:09,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:09,780 INFO L321 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2023-04-02 21:54:09,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 77 [2023-04-02 21:54:10,453 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-04-02 21:54:10,453 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 297 treesize of output 76 [2023-04-02 21:54:10,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:54:10,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-04-02 21:54:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:54:10,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:54:11,518 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (v_sll_prepend_~new_head~1.base_18 Int) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_sll_prepend_~new_head~1.offset_18 Int)) (or (not (= (select |c_#valid| v_sll_prepend_~new_head~1.base_18) 0)) (= c_main_~data~0 (let ((.cse4 (+ v_sll_prepend_~new_head~1.offset_18 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_sll_prepend_~new_head~1.base_18 (store v_ArrVal_914 .cse4 (select (select (store |c_#memory_$Pointer$.offset| v_sll_prepend_~new_head~1.base_18 v_ArrVal_914) |c_main_~#s~0.base|) |c_main_~#s~0.offset|))) |c_main_~#s~0.base| (store (select (store |c_#memory_$Pointer$.offset| v_sll_prepend_~new_head~1.base_18 v_ArrVal_913) |c_main_~#s~0.base|) |c_main_~#s~0.offset| v_sll_prepend_~new_head~1.offset_18))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| v_sll_prepend_~new_head~1.base_18 (store v_ArrVal_917 .cse4 (select (select (store |c_#memory_$Pointer$.base| v_sll_prepend_~new_head~1.base_18 v_ArrVal_917) |c_main_~#s~0.base|) |c_main_~#s~0.offset|))))) (store .cse5 |c_main_~#s~0.base| (store (select .cse5 |c_main_~#s~0.base|) |c_main_~#s~0.offset| v_sll_prepend_~new_head~1.base_18))))) (let ((.cse1 (select (select .cse0 v_sll_prepend_~new_head~1.base_18) .cse4)) (.cse2 (+ (select (select .cse3 v_sll_prepend_~new_head~1.base_18) .cse4) 4))) (select (select (store (store |c_#memory_int| v_sll_prepend_~new_head~1.base_18 v_ArrVal_915) |c_main_~#s~0.base| v_ArrVal_916) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) (<= |c_#StackHeapBarrier| v_sll_prepend_~new_head~1.base_18))) is different from false [2023-04-02 21:54:11,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927639407] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:54:11,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [477740772] [2023-04-02 21:54:11,523 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-04-02 21:54:11,523 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:54:11,523 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:54:11,523 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:54:11,524 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:54:11,541 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:54:11,737 INFO L197 IcfgInterpreter]: Interpreting procedure sll_prepend with input of size 36 for LOIs [2023-04-02 21:54:11,807 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 44 for LOIs [2023-04-02 21:54:11,967 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 15 for LOIs [2023-04-02 21:54:11,984 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:54:11,986 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:54:25,302 WARN L223 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 21:54:26,230 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1839#(and (= main_~data~0 1) (<= 1 main_~count~0) (<= 1 |#StackHeapBarrier|) (= |main_~#s~0.offset| 0) (= main_~len~0 2) (= main_~temp~2.base (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset) 1)) (= |#NULL.offset| 0) (or (not (= main_~ptr~0.offset 0)) (not (= main_~ptr~0.base 0))) (= 5 main_~uneq~0) (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)) main_~temp~2.offset) (= |#NULL.base| 0))' at error location [2023-04-02 21:54:26,230 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:54:26,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 21:54:26,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 52 [2023-04-02 21:54:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158761848] [2023-04-02 21:54:26,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 21:54:26,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-04-02 21:54:26,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:54:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-04-02 21:54:26,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=6060, Unknown=7, NotChecked=314, Total=6642 [2023-04-02 21:54:26,234 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 52 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 39 states have internal predecessors, (51), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2023-04-02 21:54:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:54:32,920 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-04-02 21:54:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-04-02 21:54:32,921 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 39 states have internal predecessors, (51), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) Word has length 40 [2023-04-02 21:54:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:54:32,921 INFO L225 Difference]: With dead ends: 56 [2023-04-02 21:54:32,922 INFO L226 Difference]: Without dead ends: 54 [2023-04-02 21:54:32,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=488, Invalid=10855, Unknown=7, NotChecked=422, Total=11772 [2023-04-02 21:54:32,925 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-04-02 21:54:32,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 326 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1335 Invalid, 0 Unknown, 62 Unchecked, 2.2s Time] [2023-04-02 21:54:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-04-02 21:54:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2023-04-02 21:54:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 21:54:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-04-02 21:54:32,933 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 40 [2023-04-02 21:54:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:54:32,934 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-04-02 21:54:32,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 39 states have internal predecessors, (51), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2023-04-02 21:54:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-04-02 21:54:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-04-02 21:54:32,935 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:54:32,935 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-02 21:54:32,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 21:54:33,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:54:33,142 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:54:33,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:54:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash -843150378, now seen corresponding path program 2 times [2023-04-02 21:54:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:54:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220724644] [2023-04-02 21:54:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:54:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:54:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:54:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-02 21:54:33,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:54:33,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220724644] [2023-04-02 21:54:33,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220724644] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:54:33,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871704458] [2023-04-02 21:54:33,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 21:54:33,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:54:33,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:54:33,321 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:54:33,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 21:54:33,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 21:54:33,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 21:54:33,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjunts are in the unsatisfiable core [2023-04-02 21:54:33,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:54:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-02 21:54:33,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:54:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-02 21:54:33,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871704458] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:54:33,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [616781830] [2023-04-02 21:54:33,698 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-02 21:54:33,698 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:54:33,698 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:54:33,698 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:54:33,698 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:54:33,712 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:54:33,924 INFO L197 IcfgInterpreter]: Interpreting procedure sll_prepend with input of size 36 for LOIs [2023-04-02 21:54:34,007 INFO L197 IcfgInterpreter]: Interpreting procedure sll_create with input of size 44 for LOIs [2023-04-02 21:54:34,171 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 15 for LOIs [2023-04-02 21:54:34,182 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:54:34,184 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:54:44,189 WARN L223 SmtUtils]: Spent 8.80s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)