./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:14:23,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:14:23,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:14:23,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:14:23,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:14:23,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:14:23,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:14:23,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:14:23,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:14:23,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:14:23,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:14:23,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:14:23,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:14:23,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:14:23,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:14:23,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:14:23,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:14:23,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:14:23,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:14:23,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:14:23,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:14:23,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:14:23,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:14:23,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:14:23,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:14:23,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:14:23,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:14:23,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:14:23,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:14:23,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:14:23,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:14:23,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:14:23,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:14:23,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:14:23,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:14:23,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:14:23,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:14:23,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:14:23,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:14:23,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:14:23,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:14:23,883 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:14:23,928 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:14:23,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:14:23,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:14:23,929 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:14:23,930 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:14:23,930 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:14:23,931 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:14:23,931 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:14:23,931 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:14:23,931 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:14:23,932 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:14:23,933 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:14:23,933 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:14:23,933 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:14:23,933 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:14:23,934 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:14:23,934 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:14:23,934 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:14:23,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:14:23,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:14:23,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:14:23,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:14:23,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:14:23,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:14:23,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:14:23,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:14:23,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:14:23,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:14:23,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:14:23,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:14:23,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:14:23,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:14:23,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:14:23,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:14:23,938 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:14:23,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:14:23,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:14:23,939 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:14:23,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:14:23,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:14:23,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:14:23,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2022-11-19 07:14:24,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:14:24,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:14:24,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:14:24,273 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:14:24,274 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:14:24,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/heap-data/shared_mem1.i [2022-11-19 07:14:24,335 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data/f672b0a27/a096398953e44be588b69fb4c3baba18/FLAG19295eea1 [2022-11-19 07:14:24,869 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:14:24,870 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/sv-benchmarks/c/heap-data/shared_mem1.i [2022-11-19 07:14:24,882 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data/f672b0a27/a096398953e44be588b69fb4c3baba18/FLAG19295eea1 [2022-11-19 07:14:25,163 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data/f672b0a27/a096398953e44be588b69fb4c3baba18 [2022-11-19 07:14:25,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:14:25,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:14:25,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:14:25,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:14:25,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:14:25,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d493cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25, skipping insertion in model container [2022-11-19 07:14:25,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:14:25,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:14:25,592 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2022-11-19 07:14:25,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:14:25,603 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:14:25,639 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2022-11-19 07:14:25,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:14:25,665 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:14:25,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25 WrapperNode [2022-11-19 07:14:25,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:14:25,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:14:25,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:14:25,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:14:25,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,723 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-19 07:14:25,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:14:25,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:14:25,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:14:25,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:14:25,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,772 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:14:25,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:14:25,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:14:25,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:14:25,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (1/1) ... [2022-11-19 07:14:25,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:14:25,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:14:25,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:14:25,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:14:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:14:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:14:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:14:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:14:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:14:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 07:14:25,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:14:25,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:14:25,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:14:25,970 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:14:25,972 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:14:26,244 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:14:26,337 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:14:26,337 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 07:14:26,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:14:26 BoogieIcfgContainer [2022-11-19 07:14:26,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:14:26,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:14:26,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:14:26,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:14:26,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:14:25" (1/3) ... [2022-11-19 07:14:26,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94885db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:14:26, skipping insertion in model container [2022-11-19 07:14:26,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:14:25" (2/3) ... [2022-11-19 07:14:26,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94885db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:14:26, skipping insertion in model container [2022-11-19 07:14:26,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:14:26" (3/3) ... [2022-11-19 07:14:26,355 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-11-19 07:14:26,373 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:14:26,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:14:26,420 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:14:26,426 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;@74606872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:14:26,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:14:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 07:14:26,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:14:26,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 07:14:26,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:14:26,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:14:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1727782104, now seen corresponding path program 1 times [2022-11-19 07:14:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:14:26,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888927901] [2022-11-19 07:14:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:14:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:14:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:14:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:14:26,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:14:26,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888927901] [2022-11-19 07:14:26,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888927901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:14:26,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:14:26,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:14:26,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576323577] [2022-11-19 07:14:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:14:26,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:14:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:14:26,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:14:26,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:14:26,819 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:14:26,881 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-11-19 07:14:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:14:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-19 07:14:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:14:26,892 INFO L225 Difference]: With dead ends: 15 [2022-11-19 07:14:26,892 INFO L226 Difference]: Without dead ends: 8 [2022-11-19 07:14:26,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:14:26,899 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:14:26,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:14:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-19 07:14:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-19 07:14:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-19 07:14:26,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2022-11-19 07:14:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:14:26,934 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-19 07:14:26,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-11-19 07:14:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:14:26,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:14:26,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:14:26,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:14:26,937 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:14:26,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:14:26,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1888775881, now seen corresponding path program 1 times [2022-11-19 07:14:26,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:14:26,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029914584] [2022-11-19 07:14:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:14:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:14:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:14:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:14:27,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:14:27,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029914584] [2022-11-19 07:14:27,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029914584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:14:27,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:14:27,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:14:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587178354] [2022-11-19 07:14:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:14:27,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:14:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:14:27,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:14:28,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:14:28,000 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:14:28,136 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-19 07:14:28,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:14:28,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 07:14:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:14:28,138 INFO L225 Difference]: With dead ends: 15 [2022-11-19 07:14:28,139 INFO L226 Difference]: Without dead ends: 13 [2022-11-19 07:14:28,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:14:28,140 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:14:28,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:14:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-19 07:14:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-19 07:14:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-11-19 07:14:28,147 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-11-19 07:14:28,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:14:28,149 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-11-19 07:14:28,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-11-19 07:14:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:14:28,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:14:28,154 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:14:28,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:14:28,154 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:14:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:14:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2091148262, now seen corresponding path program 1 times [2022-11-19 07:14:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:14:28,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122051328] [2022-11-19 07:14:28,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:14:28,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:14:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:14:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:14:29,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:14:29,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122051328] [2022-11-19 07:14:29,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122051328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:14:29,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197102774] [2022-11-19 07:14:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:14:29,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:14:29,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:14:29,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:14:29,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:14:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:14:29,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-19 07:14:29,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:14:29,611 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-19 07:14:29,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-11-19 07:14:29,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2022-11-19 07:14:29,681 INFO L321 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2022-11-19 07:14:29,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 86 [2022-11-19 07:14:29,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-19 07:14:29,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,836 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 71 treesize of output 53 [2022-11-19 07:14:29,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 117 [2022-11-19 07:14:29,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:29,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 3 [2022-11-19 07:14:29,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-19 07:14:29,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:29,998 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 32 treesize of output 22 [2022-11-19 07:14:30,006 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 18 treesize of output 19 [2022-11-19 07:14:30,026 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 18 treesize of output 19 [2022-11-19 07:14:30,048 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:14:30,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:14:30,383 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-19 07:14:30,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-19 07:14:30,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,540 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-19 07:14:30,540 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 2 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 07:14:30,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:14:30,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:14:30,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,639 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 18 treesize of output 22 [2022-11-19 07:14:30,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:14:30,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,751 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 18 treesize of output 22 [2022-11-19 07:14:30,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:30,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-19 07:14:30,977 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:14:30,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 194 [2022-11-19 07:14:31,022 INFO L321 Elim1Store]: treesize reduction 79, result has 6.0 percent of original size [2022-11-19 07:14:31,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 145 [2022-11-19 07:14:31,074 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-19 07:14:31,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 154 [2022-11-19 07:14:31,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2022-11-19 07:14:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:14:31,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:14:31,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:14:31,748 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:14:31,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:14:31,777 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:14:40,172 WARN L233 SmtUtils]: Spent 7.28s on a formula simplification. DAG size of input: 133 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:14:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:14:40,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197102774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:14:40,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1124253899] [2022-11-19 07:14:40,568 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-19 07:14:40,568 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:14:40,572 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:14:40,577 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:14:40,578 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:14:40,782 INFO L321 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-11-19 07:14:40,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 61 [2022-11-19 07:14:40,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:40,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:40,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-19 07:14:40,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:40,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:40,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-11-19 07:14:40,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:40,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:40,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-19 07:14:40,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:40,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:40,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-19 07:14:41,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2022-11-19 07:14:41,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-19 07:14:41,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:41,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-19 07:14:41,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:41,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-19 07:14:41,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2022-11-19 07:14:41,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,571 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:14:41,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 53 [2022-11-19 07:14:41,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-19 07:14:41,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:41,806 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-11-19 07:14:41,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 24 [2022-11-19 07:14:41,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:41,864 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 07:14:41,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2022-11-19 07:14:41,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:14:41,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:14:41,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:41,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:41,950 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 07:14:41,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2022-11-19 07:14:42,084 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:14:42,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-11-19 07:14:42,150 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:14:42,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 81 [2022-11-19 07:14:42,264 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-19 07:14:42,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 40 [2022-11-19 07:14:42,384 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:14:42,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 128 [2022-11-19 07:14:42,457 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:14:42,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 84 [2022-11-19 07:14:42,553 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-11-19 07:14:42,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2022-11-19 07:14:42,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-19 07:14:42,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:42,719 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-11-19 07:14:42,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 24 [2022-11-19 07:14:42,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:42,770 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 07:14:42,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2022-11-19 07:14:42,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:14:42,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:14:42,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:42,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:42,858 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 07:14:42,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2022-11-19 07:14:42,875 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:14:43,217 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '145#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~m~0#1.offset|) (<= |ULTIMATE.start_main_~m~0#1.offset| 0) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 07:14:43,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:14:43,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:14:43,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-19 07:14:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545392597] [2022-11-19 07:14:43,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:14:43,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:14:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:14:43,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:14:43,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2022-11-19 07:14:43,219 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:14:43,418 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-11-19 07:14:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:14:43,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:14:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:14:43,419 INFO L225 Difference]: With dead ends: 17 [2022-11-19 07:14:43,420 INFO L226 Difference]: Without dead ends: 15 [2022-11-19 07:14:43,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=56, Invalid=215, Unknown=1, NotChecked=0, Total=272 [2022-11-19 07:14:43,421 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:14:43,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-11-19 07:14:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-19 07:14:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2022-11-19 07:14:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-19 07:14:43,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2022-11-19 07:14:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:14:43,426 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-19 07:14:43,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:14:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-19 07:14:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:14:43,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:14:43,427 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:14:43,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:14:43,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:14:43,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:14:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:14:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1657406600, now seen corresponding path program 1 times [2022-11-19 07:14:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:14:43,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646501077] [2022-11-19 07:14:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:14:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:14:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:14:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:14:44,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:14:44,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646501077] [2022-11-19 07:14:44,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646501077] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:14:44,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661877981] [2022-11-19 07:14:44,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:14:44,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:14:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:14:44,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:14:44,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:14:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:14:45,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-19 07:14:45,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:14:45,050 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 10 treesize of output 8 [2022-11-19 07:14:45,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:14:45,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:45,089 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 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-19 07:14:45,097 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 30 treesize of output 30 [2022-11-19 07:14:45,103 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 [2022-11-19 07:14:45,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:45,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:14:45,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:14:45,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:14:45,525 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:14:45,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 145 [2022-11-19 07:14:45,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2022-11-19 07:14:45,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 136 [2022-11-19 07:14:45,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2022-11-19 07:14:45,912 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2022-11-19 07:14:45,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 382 treesize of output 311 [2022-11-19 07:14:45,956 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-19 07:14:45,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 329 treesize of output 244 [2022-11-19 07:14:45,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:46,042 INFO L321 Elim1Store]: treesize reduction 176, result has 15.4 percent of original size [2022-11-19 07:14:46,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 292 treesize of output 275 [2022-11-19 07:14:46,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:14:46,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 113 [2022-11-19 07:14:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:14:46,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:15:32,055 WARN L233 SmtUtils]: Spent 42.82s on a formula simplification. DAG size of input: 103 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:15:32,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse57 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse57))) (let ((.cse55 (select |c_#memory_int| .cse6)) (.cse56 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse57))) (let ((.cse32 (select .cse55 .cse56))) (let ((.cse33 (store |c_#memory_int| .cse6 (store .cse55 .cse56 (+ .cse32 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (and (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_352)) (.cse5 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_356))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (let ((.cse0 (store |c_#memory_int| .cse6 v_ArrVal_353)) (.cse1 (select (select .cse5 .cse3) .cse4))) (or (forall ((v_ArrVal_359 (Array Int Int))) (< (select (select (store .cse0 .cse1 v_ArrVal_359) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (<= (select (select .cse0 .cse1) (select (select .cse2 .cse3) .cse4)) 100))))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_352)) (.cse13 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_356))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse12 (+ (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (let ((.cse8 (store |c_#memory_int| .cse6 v_ArrVal_353)) (.cse9 (select (select .cse13 .cse11) .cse12))) (or (forall ((v_ArrVal_359 (Array Int Int))) (< 90 (select (select (store .cse8 .cse9 v_ArrVal_359) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (not (<= (select (select .cse8 .cse9) (select (select .cse10 .cse11) .cse12)) 100))))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< 90 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_352))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse22 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_356))) (let ((.cse18 (select (select .cse22 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse21 (+ .cse19 4))) (let ((.cse14 (store |c_#memory_int| .cse6 v_ArrVal_353)) (.cse15 (select (select .cse22 .cse18) .cse21))) (store .cse14 .cse15 (let ((.cse16 (select .cse14 .cse15)) (.cse17 (select (select .cse20 .cse18) .cse21))) (store .cse16 .cse17 (+ (* (- 1) (select (select .cse14 .cse18) .cse19)) (select .cse16 .cse17))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< (select (select (let ((.cse29 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_352))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse31 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_356))) (let ((.cse27 (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse30 (+ .cse28 4))) (let ((.cse23 (store |c_#memory_int| .cse6 v_ArrVal_353)) (.cse24 (select (select .cse31 .cse27) .cse30))) (store .cse23 .cse24 (let ((.cse25 (select .cse23 .cse24)) (.cse26 (select (select .cse29 .cse27) .cse30))) (store .cse25 .cse26 (+ (* (- 1) (select (select .cse23 .cse27) .cse28)) (select .cse25 .cse26))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))) (<= .cse32 100)) (forall ((v_ArrVal_352 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< (select (select (let ((.cse39 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_352))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse41 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_356))) (let ((.cse37 (select (select .cse41 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse40 (+ .cse38 4))) (let ((.cse34 (select (select .cse41 .cse37) .cse40))) (store .cse33 .cse34 (let ((.cse35 (select .cse33 .cse34)) (.cse36 (select (select .cse39 .cse37) .cse40))) (store .cse35 .cse36 (+ (select .cse35 .cse36) (* (- 1) (select (select .cse33 .cse37) .cse38)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (forall ((v_ArrVal_352 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_352)) (.cse46 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_356))) (let ((.cse44 (select (select .cse46 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse45 (+ (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (let ((.cse42 (select (select .cse46 .cse44) .cse45))) (or (forall ((v_ArrVal_359 (Array Int Int))) (< (select (select (store .cse33 .cse42 v_ArrVal_359) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (<= (select (select .cse33 .cse42) (select (select .cse43 .cse44) .cse45)) 100))))))) (forall ((v_ArrVal_352 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< 90 (select (select (let ((.cse52 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_352))) (let ((.cse51 (select (select .cse52 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse54 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_356))) (let ((.cse50 (select (select .cse54 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse53 (+ .cse51 4))) (let ((.cse47 (select (select .cse54 .cse50) .cse53))) (store .cse33 .cse47 (let ((.cse48 (select .cse33 .cse47)) (.cse49 (select (select .cse52 .cse50) .cse53))) (store .cse48 .cse49 (+ (select .cse48 .cse49) (* (- 1) (select (select .cse33 .cse50) .cse51)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))))) is different from false [2022-11-19 07:15:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:15:32,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661877981] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:15:32,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1601954584] [2022-11-19 07:15:32,525 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-19 07:15:32,525 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:15:32,525 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:15:32,525 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:15:32,525 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:15:32,767 INFO L321 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2022-11-19 07:15:32,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 45 [2022-11-19 07:15:32,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:32,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:32,864 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:15:32,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-11-19 07:15:33,129 INFO L321 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-11-19 07:15:33,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 61 [2022-11-19 07:15:33,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:33,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-11-19 07:15:33,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:33,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:33,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-19 07:15:33,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:33,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:33,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-19 07:15:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:33,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:33,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 233 [2022-11-19 07:15:33,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 253 [2022-11-19 07:15:33,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 104 [2022-11-19 07:15:33,827 INFO L321 Elim1Store]: treesize reduction 188, result has 10.5 percent of original size [2022-11-19 07:15:33,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 805 treesize of output 618 [2022-11-19 07:15:33,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:15:33,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:15:34,335 INFO L321 Elim1Store]: treesize reduction 900, result has 3.7 percent of original size [2022-11-19 07:15:34,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 32 case distinctions, treesize of input 799 treesize of output 707 [2022-11-19 07:15:34,532 INFO L321 Elim1Store]: treesize reduction 188, result has 10.5 percent of original size [2022-11-19 07:15:34,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 837 treesize of output 710 [2022-11-19 07:15:34,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:15:34,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:15:34,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:34,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 578 treesize of output 558 [2022-11-19 07:15:34,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:34,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:34,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 56 [2022-11-19 07:15:34,809 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 35 treesize of output 27 [2022-11-19 07:15:35,288 INFO L321 Elim1Store]: treesize reduction 182, result has 13.3 percent of original size [2022-11-19 07:15:35,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 805 treesize of output 624 [2022-11-19 07:15:35,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:15:35,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:15:35,764 INFO L321 Elim1Store]: treesize reduction 980, result has 3.4 percent of original size [2022-11-19 07:15:35,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 32 case distinctions, treesize of input 799 treesize of output 707 [2022-11-19 07:15:35,988 INFO L321 Elim1Store]: treesize reduction 188, result has 10.5 percent of original size [2022-11-19 07:15:35,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 837 treesize of output 710 [2022-11-19 07:15:36,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:15:36,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:15:36,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:36,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 578 treesize of output 558 [2022-11-19 07:15:36,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:36,256 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 96 treesize of output 63 [2022-11-19 07:15:36,273 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 53 treesize of output 37 [2022-11-19 07:15:36,432 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:15:40,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1601954584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:15:40,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:15:40,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5, 5] total 16 [2022-11-19 07:15:40,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704428997] [2022-11-19 07:15:40,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:15:40,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:15:40,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:15:40,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:15:40,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=187, Unknown=8, NotChecked=28, Total=272 [2022-11-19 07:15:40,911 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:15:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:15:41,015 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-19 07:15:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:15:41,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:15:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:15:41,017 INFO L225 Difference]: With dead ends: 19 [2022-11-19 07:15:41,017 INFO L226 Difference]: Without dead ends: 12 [2022-11-19 07:15:41,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=49, Invalid=187, Unknown=8, NotChecked=28, Total=272 [2022-11-19 07:15:41,018 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:15:41,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-11-19 07:15:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-19 07:15:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-19 07:15:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:15:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-19 07:15:41,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-11-19 07:15:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:15:41,024 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-19 07:15:41,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:15:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-19 07:15:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:15:41,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:15:41,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:15:41,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-19 07:15:41,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:15:41,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:15:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:15:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash -451076779, now seen corresponding path program 1 times [2022-11-19 07:15:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:15:41,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457424772] [2022-11-19 07:15:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:15:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:15:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:15:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:15:44,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:15:44,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457424772] [2022-11-19 07:15:44,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457424772] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:15:44,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42153167] [2022-11-19 07:15:44,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:15:44,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:15:44,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:15:44,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:15:44,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:15:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:15:44,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-19 07:15:44,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:15:44,203 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 18 treesize of output 19 [2022-11-19 07:15:44,275 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:15:44,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:15:44,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:44,324 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 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-19 07:15:44,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-19 07:15:44,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:44,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:44,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:15:44,370 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 [2022-11-19 07:15:44,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:15:44,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-19 07:15:44,763 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-19 07:15:44,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:44,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:45,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:45,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2022-11-19 07:15:45,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:45,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:45,174 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 35 treesize of output 30 [2022-11-19 07:15:45,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 07:15:45,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:45,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:15:45,351 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 41 treesize of output 36 [2022-11-19 07:15:45,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 07:15:45,551 INFO L321 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2022-11-19 07:15:45,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 204 treesize of output 206 [2022-11-19 07:15:46,943 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-19 07:15:46,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 304 treesize of output 271 [2022-11-19 07:15:47,037 INFO L321 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2022-11-19 07:15:47,038 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 3 case distinctions, treesize of input 290 treesize of output 271 [2022-11-19 07:15:47,191 INFO L321 Elim1Store]: treesize reduction 280, result has 9.7 percent of original size [2022-11-19 07:15:47,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 276 treesize of output 279 [2022-11-19 07:15:47,241 INFO L321 Elim1Store]: treesize reduction 55, result has 5.2 percent of original size [2022-11-19 07:15:47,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 223 [2022-11-19 07:15:47,358 INFO L321 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2022-11-19 07:15:47,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 177 [2022-11-19 07:15:48,829 INFO L321 Elim1Store]: treesize reduction 73, result has 41.6 percent of original size [2022-11-19 07:15:48,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 390 treesize of output 388 [2022-11-19 07:15:48,985 INFO L217 Elim1Store]: Index analysis took 121 ms [2022-11-19 07:15:49,660 INFO L321 Elim1Store]: treesize reduction 732, result has 17.0 percent of original size [2022-11-19 07:15:49,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 42 case distinctions, treesize of input 327 treesize of output 444 [2022-11-19 07:15:50,022 INFO L321 Elim1Store]: treesize reduction 112, result has 34.5 percent of original size [2022-11-19 07:15:50,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 267 treesize of output 288 [2022-11-19 07:15:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:15:50,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:15:51,618 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse65 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse65))) (let ((.cse62 (select |c_#memory_int| .cse7)) (.cse63 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse65))) (let ((.cse64 (select .cse62 .cse63))) (let ((.cse18 (<= .cse64 100)) (.cse0 (store |c_#memory_int| .cse7 (store .cse62 .cse63 (+ .cse64 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse8 (not (< (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))) (.cse9 (not .cse18))) (and (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_555)) (.cse5 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_554))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6) 4))) (let ((.cse1 (select (select .cse5 .cse3) .cse4))) (or (< 90 (select (select (store .cse0 .cse1 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= (select (select .cse0 .cse1) (select (select .cse2 .cse3) .cse4)) 100))))))) .cse8 .cse9) (or .cse8 (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_555))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse17 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_554))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse16 (+ .cse14 4))) (let ((.cse10 (select (select .cse17 .cse13) .cse16))) (store .cse0 .cse10 (let ((.cse11 (select .cse0 .cse10)) (.cse12 (select (select .cse15 .cse13) .cse16))) (store .cse11 .cse12 (+ (* (- 1) (select (select .cse0 .cse13) .cse14)) (select .cse11 .cse12))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) .cse9) (or .cse18 (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| .cse7 v_ArrVal_556))) (or (not (< (select (select .cse19 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (< 90 (select (select (let ((.cse25 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_555))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse27 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_554))) (let ((.cse23 (select (select .cse27 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse26 (+ .cse24 4))) (let ((.cse20 (select (select .cse27 .cse23) .cse26))) (store .cse19 .cse20 (let ((.cse21 (select .cse19 .cse20)) (.cse22 (select (select .cse25 .cse23) .cse26))) (store .cse21 .cse22 (+ (* (- 1) (select (select .cse19 .cse23) .cse24)) (select .cse21 .cse22))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))) (or .cse18 (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse30 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_555)) (.cse33 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_554))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse32 (+ (select (select .cse30 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6) 4))) (let ((.cse29 (select (select .cse33 .cse31) .cse32)) (.cse28 (store |c_#memory_int| .cse7 v_ArrVal_556))) (or (< (select (select (store .cse28 .cse29 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= (select (select .cse28 .cse29) (select (select .cse30 .cse31) .cse32)) 100)) (not (< (select (select .cse28 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)))))))) (or .cse18 (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| .cse7 v_ArrVal_556))) (or (not (< (select (select .cse34 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (< (select (select (let ((.cse40 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_555))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse42 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_554))) (let ((.cse38 (select (select .cse42 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse41 (+ .cse39 4))) (let ((.cse35 (select (select .cse42 .cse38) .cse41))) (store .cse34 .cse35 (let ((.cse36 (select .cse34 .cse35)) (.cse37 (select (select .cse40 .cse38) .cse41))) (store .cse36 .cse37 (+ (* (- 1) (select (select .cse34 .cse38) .cse39)) (select .cse36 .cse37))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_555)) (.cse48 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_554))) (let ((.cse46 (select (select .cse48 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse47 (+ (select (select .cse45 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6) 4))) (let ((.cse44 (select (select .cse48 .cse46) .cse47)) (.cse43 (store |c_#memory_int| .cse7 v_ArrVal_556))) (or (< 90 (select (select (store .cse43 .cse44 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= (select (select .cse43 .cse44) (select (select .cse45 .cse46) .cse47)) 100)) (not (< (select (select .cse43 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))) .cse18) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_555)) (.cse53 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_554))) (let ((.cse51 (select (select .cse53 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse52 (+ (select (select .cse50 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6) 4))) (let ((.cse49 (select (select .cse53 .cse51) .cse52))) (or (< (select (select (store .cse0 .cse49 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= (select (select .cse0 .cse49) (select (select .cse50 .cse51) .cse52)) 100))))))) .cse8 .cse9) (or (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< 90 (select (select (let ((.cse59 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_555))) (let ((.cse58 (select (select .cse59 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse61 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_554))) (let ((.cse57 (select (select .cse61 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse60 (+ .cse58 4))) (let ((.cse54 (select (select .cse61 .cse57) .cse60))) (store .cse0 .cse54 (let ((.cse55 (select .cse0 .cse54)) (.cse56 (select (select .cse59 .cse57) .cse60))) (store .cse55 .cse56 (+ (* (- 1) (select (select .cse0 .cse57) .cse58)) (select .cse55 .cse56))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) .cse8 .cse9)))))))) is different from false [2022-11-19 07:17:24,769 WARN L233 SmtUtils]: Spent 1.54m on a formula simplification. DAG size of input: 113 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:17:25,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:25,527 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:17:25,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:17:25,623 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:17:32,617 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse72 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse188 (select |c_#memory_int| .cse72)) (.cse189 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse187 (select .cse188 .cse189))) (let ((.cse66 (store |c_#memory_int| .cse72 (store .cse188 .cse189 (+ .cse187 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (let ((.cse73 (not (< (select (select .cse66 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))) (.cse16 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse13 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse80 (<= .cse187 100))) (and (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse14 (let ((.cse18 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse18 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse2 (let ((.cse17 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse17 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse0 (let ((.cse15 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse15 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535)))) (.cse1 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (<= (select (select .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 100) (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse4 (store .cse0 .cse1 v_ArrVal_556))) (or (< 90 (select (select (let ((.cse10 (store .cse2 .cse1 v_ArrVal_555))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse12 (store .cse14 .cse1 v_ArrVal_554))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse11 (+ 4 .cse9))) (let ((.cse5 (select (select .cse12 .cse8) .cse11))) (store .cse4 .cse5 (let ((.cse6 (select .cse4 .cse5)) (.cse7 (select (select .cse10 .cse8) .cse11))) (store .cse6 .cse7 (+ (* (- 1) (select (select .cse4 .cse8) .cse9)) (select .cse6 .cse7))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< (select (select .cse4 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))) (not (= (select |c_#valid| v_ArrVal_536) 0)))) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse28 (let ((.cse36 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse36 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse30 (let ((.cse35 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse35 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse19 (let ((.cse31 (let ((.cse34 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse34 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535))))) (store .cse31 .cse29 (let ((.cse32 (select .cse31 .cse29)) (.cse33 (select (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse32 .cse33 (+ (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse32 .cse33)))))))) (or (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< 90 (select (select (let ((.cse25 (store .cse30 .cse29 v_ArrVal_555))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse27 (store .cse28 .cse29 v_ArrVal_554))) (let ((.cse23 (select (select .cse27 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse26 (+ 4 .cse24))) (let ((.cse20 (select (select .cse27 .cse23) .cse26))) (store .cse19 .cse20 (let ((.cse21 (select .cse19 .cse20)) (.cse22 (select (select .cse25 .cse23) .cse26))) (store .cse21 .cse22 (+ (* (- 1) (select (select .cse19 .cse23) .cse24)) (select .cse21 .cse22))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (not (< (select (select .cse19 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))))) (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))))) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (forall ((v_arrayElimArr_47 (Array Int Int))) (or (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse45 (let ((.cse49 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse49 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse42 (let ((.cse48 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse48 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse48 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535)))) (.cse43 (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse46 (let ((.cse47 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse47 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse47 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0))))) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse39 (store .cse46 .cse43 v_ArrVal_555)) (.cse44 (store .cse45 .cse43 v_ArrVal_554))) (let ((.cse40 (select (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse41 (+ 4 (select (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)))) (let ((.cse38 (select (select .cse44 .cse40) .cse41)) (.cse37 (store .cse42 .cse43 v_ArrVal_556))) (or (not (<= (select (select .cse37 .cse38) (select (select .cse39 .cse40) .cse41)) 100)) (< (select (select (store .cse37 .cse38 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< (select (select .cse37 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))) (<= (select (select .cse42 .cse43) (select (select .cse46 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 100))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))) (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))))) (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))))) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse59 (let ((.cse65 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse65 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse65 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse62 (let ((.cse64 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse64 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse64 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535)))) (.cse60 (select (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse61 (let ((.cse63 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse63 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse63 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0))))) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse50 (store .cse62 .cse60 v_ArrVal_556))) (or (< (select (select (let ((.cse56 (store .cse61 .cse60 v_ArrVal_555))) (let ((.cse55 (select (select .cse56 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse58 (store .cse59 .cse60 v_ArrVal_554))) (let ((.cse54 (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse57 (+ 4 .cse55))) (let ((.cse51 (select (select .cse58 .cse54) .cse57))) (store .cse50 .cse51 (let ((.cse52 (select .cse50 .cse51)) (.cse53 (select (select .cse56 .cse54) .cse57))) (store .cse52 .cse53 (+ (* (- 1) (select (select .cse50 .cse54) .cse55)) (select .cse52 .cse53))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< (select (select .cse50 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))) (<= (select (select .cse62 .cse60) (select (select .cse61 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 100))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))))) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.offset| .cse72 v_ArrVal_555)) (.cse71 (store |c_#memory_$Pointer$.base| .cse72 v_ArrVal_554))) (let ((.cse69 (select (select .cse71 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse70 (+ (select (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13) 4))) (let ((.cse67 (select (select .cse71 .cse69) .cse70))) (or (not (<= (select (select .cse66 .cse67) (select (select .cse68 .cse69) .cse70)) 100)) (< 90 (select (select (store .cse66 .cse67 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))) .cse73) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse76 (store |c_#memory_$Pointer$.offset| .cse72 v_ArrVal_555)) (.cse79 (store |c_#memory_$Pointer$.base| .cse72 v_ArrVal_554))) (let ((.cse77 (select (select .cse79 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse78 (+ (select (select .cse76 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13) 4))) (let ((.cse74 (store |c_#memory_int| .cse72 v_ArrVal_556)) (.cse75 (select (select .cse79 .cse77) .cse78))) (or (not (< (select (select .cse74 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (< (select (select (store .cse74 .cse75 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= (select (select .cse74 .cse75) (select (select .cse76 .cse77) .cse78)) 100))))))) .cse80) (or (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< 90 (select (select (let ((.cse86 (store |c_#memory_$Pointer$.offset| .cse72 v_ArrVal_555))) (let ((.cse85 (select (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse88 (store |c_#memory_$Pointer$.base| .cse72 v_ArrVal_554))) (let ((.cse84 (select (select .cse88 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse87 (+ .cse85 4))) (let ((.cse81 (select (select .cse88 .cse84) .cse87))) (store .cse66 .cse81 (let ((.cse82 (select .cse66 .cse81)) (.cse83 (select (select .cse86 .cse84) .cse87))) (store .cse82 .cse83 (+ (* (- 1) (select (select .cse66 .cse84) .cse85)) (select .cse82 .cse83))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) .cse73) (forall ((v_ArrVal_536 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse95 (let ((.cse103 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse103 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse103 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse97 (let ((.cse102 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse102 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse102 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse96 (select (select .cse95 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse89 (let ((.cse98 (let ((.cse101 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse101 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse101 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535))))) (store .cse98 .cse96 (let ((.cse99 (select .cse98 .cse96)) (.cse100 (select (select .cse97 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse99 .cse100 (+ (select (select .cse98 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse99 .cse100)))))))) (or (not (< (select (select .cse89 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse91 (store .cse97 .cse96 v_ArrVal_555)) (.cse94 (store .cse95 .cse96 v_ArrVal_554))) (let ((.cse92 (select (select .cse94 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse93 (+ 4 (select (select .cse91 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)))) (let ((.cse90 (select (select .cse94 .cse92) .cse93))) (or (not (<= (select (select .cse89 .cse90) (select (select .cse91 .cse92) .cse93)) 100)) (< 90 (select (select (store .cse89 .cse90 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))) (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)))) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse113 (let ((.cse121 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse121 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse121 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse115 (let ((.cse120 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse120 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse120 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse114 (select (select .cse113 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse104 (let ((.cse116 (let ((.cse119 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse119 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse119 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535))))) (store .cse116 .cse114 (let ((.cse117 (select .cse116 .cse114)) (.cse118 (select (select .cse115 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse117 .cse118 (+ (select (select .cse116 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse117 .cse118)))))))) (or (not (< (select (select .cse104 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< (select (select (let ((.cse110 (store .cse115 .cse114 v_ArrVal_555))) (let ((.cse109 (select (select .cse110 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse112 (store .cse113 .cse114 v_ArrVal_554))) (let ((.cse108 (select (select .cse112 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse111 (+ 4 .cse109))) (let ((.cse105 (select (select .cse112 .cse108) .cse111))) (store .cse104 .cse105 (let ((.cse106 (select .cse104 .cse105)) (.cse107 (select (select .cse110 .cse108) .cse111))) (store .cse106 .cse107 (+ (* (- 1) (select (select .cse104 .cse108) .cse109)) (select .cse106 .cse107))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))))) (or (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< (select (select (let ((.cse127 (store |c_#memory_$Pointer$.offset| .cse72 v_ArrVal_555))) (let ((.cse126 (select (select .cse127 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse129 (store |c_#memory_$Pointer$.base| .cse72 v_ArrVal_554))) (let ((.cse125 (select (select .cse129 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse128 (+ .cse126 4))) (let ((.cse122 (select (select .cse129 .cse125) .cse128))) (store .cse66 .cse122 (let ((.cse123 (select .cse66 .cse122)) (.cse124 (select (select .cse127 .cse125) .cse128))) (store .cse123 .cse124 (+ (* (- 1) (select (select .cse66 .cse125) .cse126)) (select .cse123 .cse124))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) .cse73) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse132 (store |c_#memory_$Pointer$.offset| .cse72 v_ArrVal_555)) (.cse135 (store |c_#memory_$Pointer$.base| .cse72 v_ArrVal_554))) (let ((.cse133 (select (select .cse135 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse134 (+ (select (select .cse132 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13) 4))) (let ((.cse130 (store |c_#memory_int| .cse72 v_ArrVal_556)) (.cse131 (select (select .cse135 .cse133) .cse134))) (or (< 90 (select (select (store .cse130 .cse131 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< (select (select .cse130 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (<= (select (select .cse130 .cse131) (select (select .cse132 .cse133) .cse134)) 100))))))) .cse80) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse136 (store |c_#memory_int| .cse72 v_ArrVal_556))) (or (< 90 (select (select (let ((.cse142 (store |c_#memory_$Pointer$.offset| .cse72 v_ArrVal_555))) (let ((.cse141 (select (select .cse142 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse144 (store |c_#memory_$Pointer$.base| .cse72 v_ArrVal_554))) (let ((.cse140 (select (select .cse144 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse143 (+ .cse141 4))) (let ((.cse137 (select (select .cse144 .cse140) .cse143))) (store .cse136 .cse137 (let ((.cse138 (select .cse136 .cse137)) (.cse139 (select (select .cse142 .cse140) .cse143))) (store .cse138 .cse139 (+ (select .cse138 .cse139) (* (select (select .cse136 .cse140) .cse141) (- 1)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< (select (select .cse136 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))) .cse80) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse146 (store |c_#memory_$Pointer$.offset| .cse72 v_ArrVal_555)) (.cse149 (store |c_#memory_$Pointer$.base| .cse72 v_ArrVal_554))) (let ((.cse147 (select (select .cse149 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse148 (+ (select (select .cse146 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13) 4))) (let ((.cse145 (select (select .cse149 .cse147) .cse148))) (or (not (<= (select (select .cse66 .cse145) (select (select .cse146 .cse147) .cse148)) 100)) (< (select (select (store .cse66 .cse145 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)))))) .cse73) (forall ((v_ArrVal_536 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (forall ((v_arrayElimArr_47 (Array Int Int))) (or (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse156 (let ((.cse164 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse164 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse164 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse158 (let ((.cse163 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse163 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse163 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse157 (select (select .cse156 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse150 (let ((.cse159 (let ((.cse162 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse162 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse162 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535))))) (store .cse159 .cse157 (let ((.cse160 (select .cse159 .cse157)) (.cse161 (select (select .cse158 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse160 .cse161 (+ (select (select .cse159 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse160 .cse161)))))))) (or (not (< (select (select .cse150 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse152 (store .cse158 .cse157 v_ArrVal_555)) (.cse155 (store .cse156 .cse157 v_ArrVal_554))) (let ((.cse153 (select (select .cse155 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse154 (+ 4 (select (select .cse152 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)))) (let ((.cse151 (select (select .cse155 .cse153) .cse154))) (or (< (select (select (store .cse150 .cse151 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= (select (select .cse150 .cse151) (select (select .cse152 .cse153) .cse154)) 100)))))))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))) (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))) (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)))) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)) (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse174 (let ((.cse177 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse177 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse177 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse165 (let ((.cse176 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse176 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse176 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535)))) (.cse167 (let ((.cse175 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse175 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse175 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse166 (select (select .cse174 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (<= (select (select .cse165 .cse166) (select (select .cse167 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 100) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse170 (store .cse167 .cse166 v_ArrVal_555)) (.cse173 (store .cse174 .cse166 v_ArrVal_554))) (let ((.cse171 (select (select .cse173 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse172 (+ 4 (select (select .cse170 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)))) (let ((.cse169 (select (select .cse173 .cse171) .cse172)) (.cse168 (store .cse165 .cse166 v_ArrVal_556))) (or (< 90 (select (select (store .cse168 .cse169 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= (select (select .cse168 .cse169) (select (select .cse170 .cse171) .cse172)) 100)) (not (< (select (select .cse168 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))))))) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse178 (store |c_#memory_int| .cse72 v_ArrVal_556))) (or (not (< (select (select .cse178 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (< (select (select (let ((.cse184 (store |c_#memory_$Pointer$.offset| .cse72 v_ArrVal_555))) (let ((.cse183 (select (select .cse184 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse186 (store |c_#memory_$Pointer$.base| .cse72 v_ArrVal_554))) (let ((.cse182 (select (select .cse186 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse185 (+ .cse183 4))) (let ((.cse179 (select (select .cse186 .cse182) .cse185))) (store .cse178 .cse179 (let ((.cse180 (select .cse178 .cse179)) (.cse181 (select (select .cse184 .cse182) .cse185))) (store .cse180 .cse181 (+ (select .cse180 .cse181) (* (select (select .cse178 .cse182) .cse183) (- 1)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)))) .cse80)))))))) is different from true [2022-11-19 07:17:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-19 07:17:34,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42153167] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:17:34,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375009311] [2022-11-19 07:17:34,420 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-19 07:17:34,420 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:17:34,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:17:34,421 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:17:34,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:17:34,715 INFO L321 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-11-19 07:17:34,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 61 [2022-11-19 07:17:34,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2022-11-19 07:17:34,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:34,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:34,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-19 07:17:34,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:34,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:34,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-19 07:17:34,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:34,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:34,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-11-19 07:17:34,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:34,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:34,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-19 07:17:35,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:17:35,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-19 07:17:35,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:17:35,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-19 07:17:35,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-19 07:17:35,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2022-11-19 07:17:35,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,675 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:17:35,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 53 [2022-11-19 07:17:35,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-19 07:17:35,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:17:35,852 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-11-19 07:17:35,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 24 [2022-11-19 07:17:35,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:17:35,935 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 07:17:35,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2022-11-19 07:17:35,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:35,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:17:36,011 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 07:17:36,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2022-11-19 07:17:36,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:17:36,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:17:36,213 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:17:36,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-11-19 07:17:36,323 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:17:36,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 81 [2022-11-19 07:17:36,527 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-19 07:17:36,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 40 [2022-11-19 07:17:36,697 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:17:36,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 128 [2022-11-19 07:17:36,806 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:17:36,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 84 [2022-11-19 07:17:36,952 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-11-19 07:17:36,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2022-11-19 07:17:37,144 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:17:37,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 234 [2022-11-19 07:17:37,263 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:17:37,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 162 [2022-11-19 07:17:37,502 INFO L321 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2022-11-19 07:17:37,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 121 [2022-11-19 07:17:37,679 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:17:37,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 89 [2022-11-19 07:17:37,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-19 07:17:37,962 INFO L321 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2022-11-19 07:17:37,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 287 [2022-11-19 07:17:38,045 INFO L321 Elim1Store]: treesize reduction 25, result has 35.9 percent of original size [2022-11-19 07:17:38,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 39 [2022-11-19 07:17:38,146 INFO L321 Elim1Store]: treesize reduction 25, result has 35.9 percent of original size [2022-11-19 07:17:38,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 39 [2022-11-19 07:17:38,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2022-11-19 07:17:38,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2022-11-19 07:17:38,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 36 [2022-11-19 07:17:38,319 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-19 07:17:38,320 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 69 treesize of output 39 [2022-11-19 07:17:38,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2022-11-19 07:17:38,380 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:17:38,414 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:17:38,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2022-11-19 07:17:38,443 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 24 treesize of output 18 [2022-11-19 07:17:39,115 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:17:39,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 234 [2022-11-19 07:17:39,227 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:17:39,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 162 [2022-11-19 07:17:39,530 INFO L321 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2022-11-19 07:17:39,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 121 [2022-11-19 07:17:39,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-11-19 07:17:39,690 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 52 treesize of output 28 [2022-11-19 07:17:39,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2022-11-19 07:17:39,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 48 [2022-11-19 07:17:39,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2022-11-19 07:17:39,926 INFO L321 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2022-11-19 07:17:39,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 342 treesize of output 329 [2022-11-19 07:17:39,992 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 27 treesize of output 19 [2022-11-19 07:17:40,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-11-19 07:17:40,054 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 25 treesize of output 17 [2022-11-19 07:17:40,069 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:17:40,137 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-11-19 07:17:40,137 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 100 treesize of output 94 [2022-11-19 07:17:40,744 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:17:41,710 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '371#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~m~0#1.offset|) (<= |ULTIMATE.start_main_~m~0#1.offset| 0) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 07:17:41,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:17:41,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:17:41,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-19 07:17:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362520124] [2022-11-19 07:17:41,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:17:41,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-19 07:17:41,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:17:41,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-19 07:17:41,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=291, Unknown=4, NotChecked=70, Total=420 [2022-11-19 07:17:41,713 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:43,875 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse193 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse108 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse76 (select .cse193 .cse3))) (let ((.cse194 (select |c_#memory_int| .cse76)) (.cse20 (select .cse108 .cse3))) (let ((.cse192 (select .cse194 .cse20)) (.cse21 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse70 (store |c_#memory_int| .cse76 (store .cse194 .cse20 (+ .cse192 .cse21))))) (let ((.cse19 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse77 (not (< (select (select .cse70 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))) (.cse53 (select .cse193 .cse13)) (.cse16 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse84 (<= .cse192 100))) (and (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse14 (let ((.cse18 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse18 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse2 (let ((.cse17 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse17 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse0 (let ((.cse15 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse15 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535)))) (.cse1 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (<= (select (select .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 100) (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse4 (store .cse0 .cse1 v_ArrVal_556))) (or (< 90 (select (select (let ((.cse10 (store .cse2 .cse1 v_ArrVal_555))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse12 (store .cse14 .cse1 v_ArrVal_554))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse11 (+ 4 .cse9))) (let ((.cse5 (select (select .cse12 .cse8) .cse11))) (store .cse4 .cse5 (let ((.cse6 (select .cse4 .cse5)) (.cse7 (select (select .cse10 .cse8) .cse11))) (store .cse6 .cse7 (+ (* (- 1) (select (select .cse4 .cse8) .cse9)) (select .cse6 .cse7))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< (select (select .cse4 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))) (not (= (select |c_#valid| v_ArrVal_536) 0)))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (<= 100 .cse19) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse20) (= .cse21 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (<= .cse19 100) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse31 (let ((.cse39 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse39 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse39 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse33 (let ((.cse38 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse38 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse22 (let ((.cse34 (let ((.cse37 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse37 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535))))) (store .cse34 .cse32 (let ((.cse35 (select .cse34 .cse32)) (.cse36 (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse35 .cse36 (+ (select (select .cse34 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse35 .cse36)))))))) (or (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< 90 (select (select (let ((.cse28 (store .cse33 .cse32 v_ArrVal_555))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse30 (store .cse31 .cse32 v_ArrVal_554))) (let ((.cse26 (select (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse29 (+ 4 .cse27))) (let ((.cse23 (select (select .cse30 .cse26) .cse29))) (store .cse22 .cse23 (let ((.cse24 (select .cse22 .cse23)) (.cse25 (select (select .cse28 .cse26) .cse29))) (store .cse24 .cse25 (+ (* (- 1) (select (select .cse22 .cse26) .cse27)) (select .cse24 .cse25))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (not (< (select (select .cse22 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))))) (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))))) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (forall ((v_arrayElimArr_47 (Array Int Int))) (or (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse48 (let ((.cse52 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse52 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse52 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse45 (let ((.cse51 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse51 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse51 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535)))) (.cse46 (select (select .cse48 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse49 (let ((.cse50 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse50 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse50 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0))))) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse42 (store .cse49 .cse46 v_ArrVal_555)) (.cse47 (store .cse48 .cse46 v_ArrVal_554))) (let ((.cse43 (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse44 (+ 4 (select (select .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)))) (let ((.cse41 (select (select .cse47 .cse43) .cse44)) (.cse40 (store .cse45 .cse46 v_ArrVal_556))) (or (not (<= (select (select .cse40 .cse41) (select (select .cse42 .cse43) .cse44)) 100)) (< (select (select (store .cse40 .cse41 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< (select (select .cse40 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))) (<= (select (select .cse45 .cse46) (select (select .cse49 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 100))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))) (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))))) (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))))) (= .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse63 (let ((.cse69 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse69 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse69 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse66 (let ((.cse68 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse68 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse68 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535)))) (.cse64 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse65 (let ((.cse67 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse67 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse67 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0))))) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse54 (store .cse66 .cse64 v_ArrVal_556))) (or (< (select (select (let ((.cse60 (store .cse65 .cse64 v_ArrVal_555))) (let ((.cse59 (select (select .cse60 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse62 (store .cse63 .cse64 v_ArrVal_554))) (let ((.cse58 (select (select .cse62 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse61 (+ 4 .cse59))) (let ((.cse55 (select (select .cse62 .cse58) .cse61))) (store .cse54 .cse55 (let ((.cse56 (select .cse54 .cse55)) (.cse57 (select (select .cse60 .cse58) .cse61))) (store .cse56 .cse57 (+ (* (- 1) (select (select .cse54 .cse58) .cse59)) (select .cse56 .cse57))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< (select (select .cse54 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))) (<= (select (select .cse66 .cse64) (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 100))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))))) (= .cse19 100) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| .cse76 v_ArrVal_555)) (.cse75 (store |c_#memory_$Pointer$.base| .cse76 v_ArrVal_554))) (let ((.cse73 (select (select .cse75 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse74 (+ (select (select .cse72 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13) 4))) (let ((.cse71 (select (select .cse75 .cse73) .cse74))) (or (not (<= (select (select .cse70 .cse71) (select (select .cse72 .cse73) .cse74)) 100)) (< 90 (select (select (store .cse70 .cse71 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))) .cse77) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|) 1) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.offset| .cse76 v_ArrVal_555)) (.cse83 (store |c_#memory_$Pointer$.base| .cse76 v_ArrVal_554))) (let ((.cse81 (select (select .cse83 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse82 (+ (select (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13) 4))) (let ((.cse78 (store |c_#memory_int| .cse76 v_ArrVal_556)) (.cse79 (select (select .cse83 .cse81) .cse82))) (or (not (< (select (select .cse78 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (< (select (select (store .cse78 .cse79 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= (select (select .cse78 .cse79) (select (select .cse80 .cse81) .cse82)) 100))))))) .cse84) (or (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< 90 (select (select (let ((.cse90 (store |c_#memory_$Pointer$.offset| .cse76 v_ArrVal_555))) (let ((.cse89 (select (select .cse90 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse92 (store |c_#memory_$Pointer$.base| .cse76 v_ArrVal_554))) (let ((.cse88 (select (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse91 (+ .cse89 4))) (let ((.cse85 (select (select .cse92 .cse88) .cse91))) (store .cse70 .cse85 (let ((.cse86 (select .cse70 .cse85)) (.cse87 (select (select .cse90 .cse88) .cse91))) (store .cse86 .cse87 (+ (* (- 1) (select (select .cse70 .cse88) .cse89)) (select .cse86 .cse87))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) .cse77) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse76)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_536 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse99 (let ((.cse107 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse107 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse107 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse101 (let ((.cse106 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse106 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse106 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse100 (select (select .cse99 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse93 (let ((.cse102 (let ((.cse105 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse105 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse105 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535))))) (store .cse102 .cse100 (let ((.cse103 (select .cse102 .cse100)) (.cse104 (select (select .cse101 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse103 .cse104 (+ (select (select .cse102 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse103 .cse104)))))))) (or (not (< (select (select .cse93 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse95 (store .cse101 .cse100 v_ArrVal_555)) (.cse98 (store .cse99 .cse100 v_ArrVal_554))) (let ((.cse96 (select (select .cse98 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse97 (+ 4 (select (select .cse95 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)))) (let ((.cse94 (select (select .cse98 .cse96) .cse97))) (or (not (<= (select (select .cse93 .cse94) (select (select .cse95 .cse96) .cse97)) 100)) (< 90 (select (select (store .cse93 .cse94 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))) (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)))) (= (select .cse108 .cse13) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse118 (let ((.cse126 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse126 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse126 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse120 (let ((.cse125 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse125 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse125 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse119 (select (select .cse118 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse109 (let ((.cse121 (let ((.cse124 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse124 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse124 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535))))) (store .cse121 .cse119 (let ((.cse122 (select .cse121 .cse119)) (.cse123 (select (select .cse120 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse122 .cse123 (+ (select (select .cse121 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse122 .cse123)))))))) (or (not (< (select (select .cse109 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< (select (select (let ((.cse115 (store .cse120 .cse119 v_ArrVal_555))) (let ((.cse114 (select (select .cse115 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse117 (store .cse118 .cse119 v_ArrVal_554))) (let ((.cse113 (select (select .cse117 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse116 (+ 4 .cse114))) (let ((.cse110 (select (select .cse117 .cse113) .cse116))) (store .cse109 .cse110 (let ((.cse111 (select .cse109 .cse110)) (.cse112 (select (select .cse115 .cse113) .cse116))) (store .cse111 .cse112 (+ (* (- 1) (select (select .cse109 .cse113) .cse114)) (select .cse111 .cse112))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))))) (or (forall ((v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (< (select (select (let ((.cse132 (store |c_#memory_$Pointer$.offset| .cse76 v_ArrVal_555))) (let ((.cse131 (select (select .cse132 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse134 (store |c_#memory_$Pointer$.base| .cse76 v_ArrVal_554))) (let ((.cse130 (select (select .cse134 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse133 (+ .cse131 4))) (let ((.cse127 (select (select .cse134 .cse130) .cse133))) (store .cse70 .cse127 (let ((.cse128 (select .cse70 .cse127)) (.cse129 (select (select .cse132 .cse130) .cse133))) (store .cse128 .cse129 (+ (* (- 1) (select (select .cse70 .cse130) .cse131)) (select .cse128 .cse129))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) .cse77) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse137 (store |c_#memory_$Pointer$.offset| .cse76 v_ArrVal_555)) (.cse140 (store |c_#memory_$Pointer$.base| .cse76 v_ArrVal_554))) (let ((.cse138 (select (select .cse140 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse139 (+ (select (select .cse137 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13) 4))) (let ((.cse135 (store |c_#memory_int| .cse76 v_ArrVal_556)) (.cse136 (select (select .cse140 .cse138) .cse139))) (or (< 90 (select (select (store .cse135 .cse136 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< (select (select .cse135 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (<= (select (select .cse135 .cse136) (select (select .cse137 .cse138) .cse139)) 100))))))) .cse84) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse141 (store |c_#memory_int| .cse76 v_ArrVal_556))) (or (< 90 (select (select (let ((.cse147 (store |c_#memory_$Pointer$.offset| .cse76 v_ArrVal_555))) (let ((.cse146 (select (select .cse147 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse149 (store |c_#memory_$Pointer$.base| .cse76 v_ArrVal_554))) (let ((.cse145 (select (select .cse149 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse148 (+ .cse146 4))) (let ((.cse142 (select (select .cse149 .cse145) .cse148))) (store .cse141 .cse142 (let ((.cse143 (select .cse141 .cse142)) (.cse144 (select (select .cse147 .cse145) .cse148))) (store .cse143 .cse144 (+ (select .cse143 .cse144) (* (select (select .cse141 .cse145) .cse146) (- 1)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< (select (select .cse141 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))) .cse84) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse151 (store |c_#memory_$Pointer$.offset| .cse76 v_ArrVal_555)) (.cse154 (store |c_#memory_$Pointer$.base| .cse76 v_ArrVal_554))) (let ((.cse152 (select (select .cse154 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse153 (+ (select (select .cse151 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13) 4))) (let ((.cse150 (select (select .cse154 .cse152) .cse153))) (or (not (<= (select (select .cse70 .cse150) (select (select .cse151 .cse152) .cse153)) 100)) (< (select (select (store .cse70 .cse150 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)))))) .cse77) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (<= 1 .cse21) (forall ((v_ArrVal_536 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (forall ((v_arrayElimArr_47 (Array Int Int))) (or (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse161 (let ((.cse169 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse169 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse169 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse163 (let ((.cse168 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse168 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse168 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse162 (select (select .cse161 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse155 (let ((.cse164 (let ((.cse167 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse167 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse167 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535))))) (store .cse164 .cse162 (let ((.cse165 (select .cse164 .cse162)) (.cse166 (select (select .cse163 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (store .cse165 .cse166 (+ (select (select .cse164 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse165 .cse166)))))))) (or (not (< (select (select .cse155 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse157 (store .cse163 .cse162 v_ArrVal_555)) (.cse160 (store .cse161 .cse162 v_ArrVal_554))) (let ((.cse158 (select (select .cse160 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse159 (+ 4 (select (select .cse157 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)))) (let ((.cse156 (select (select .cse160 .cse158) .cse159))) (or (< (select (select (store .cse155 .cse156 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= (select (select .cse155 .cse156) (select (select .cse157 .cse158) .cse159)) 100)))))))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))) (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)))) (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)))) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse53) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse76) (forall ((v_ArrVal_536 Int)) (or (= v_ArrVal_536 0) (not (= (select |c_#valid| v_ArrVal_536) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_10| Int)) (or (not (< |v_ULTIMATE.start_main_~x~0#1_10| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_10|)) (forall ((v_arrayElimArr_47 (Array Int Int))) (or (not (= (select v_arrayElimArr_47 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_47 4))) (forall ((v_arrayElimArr_46 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_46 4))) (forall ((v_ArrVal_533 Int) (v_ArrVal_548 Int) (v_ArrVal_535 Int)) (let ((.cse179 (let ((.cse182 (store |c_#memory_$Pointer$.base| v_ArrVal_536 v_arrayElimArr_47))) (store .cse182 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse182 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_536))))) (let ((.cse170 (let ((.cse181 (store |c_#memory_int| v_ArrVal_536 (store (store (store (select |c_#memory_int| v_ArrVal_536) 0 |v_ULTIMATE.start_main_~x~0#1_10|) 4 v_ArrVal_533) 8 v_ArrVal_548)))) (store .cse181 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse181 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 v_ArrVal_535)))) (.cse172 (let ((.cse180 (store |c_#memory_$Pointer$.offset| v_ArrVal_536 v_arrayElimArr_46))) (store .cse180 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse180 |c_ULTIMATE.start_main_~list~0#1.base|) .cse16 0)))) (.cse171 (select (select .cse179 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (<= (select (select .cse170 .cse171) (select (select .cse172 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 100) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse175 (store .cse172 .cse171 v_ArrVal_555)) (.cse178 (store .cse179 .cse171 v_ArrVal_554))) (let ((.cse176 (select (select .cse178 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse177 (+ 4 (select (select .cse175 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)))) (let ((.cse174 (select (select .cse178 .cse176) .cse177)) (.cse173 (store .cse170 .cse171 v_ArrVal_556))) (or (< 90 (select (select (store .cse173 .cse174 v_ArrVal_557) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= (select (select .cse173 .cse174) (select (select .cse175 .cse176) .cse177)) 100)) (not (< (select (select .cse173 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_46 8))))))))))) (or (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (let ((.cse183 (store |c_#memory_int| .cse76 v_ArrVal_556))) (or (not (< (select (select .cse183 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (< (select (select (let ((.cse189 (store |c_#memory_$Pointer$.offset| .cse76 v_ArrVal_555))) (let ((.cse188 (select (select .cse189 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse191 (store |c_#memory_$Pointer$.base| .cse76 v_ArrVal_554))) (let ((.cse187 (select (select .cse191 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse190 (+ .cse188 4))) (let ((.cse184 (select (select .cse191 .cse187) .cse190))) (store .cse183 .cse184 (let ((.cse185 (select .cse183 .cse184)) (.cse186 (select (select .cse189 .cse187) .cse190))) (store .cse185 .cse186 (+ (select .cse185 .cse186) (* (select (select .cse183 .cse187) .cse188) (- 1)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)))) .cse84)))))))) is different from true [2022-11-19 07:17:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:17:46,715 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-11-19 07:17:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:17:46,716 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 07:17:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:17:46,716 INFO L225 Difference]: With dead ends: 21 [2022-11-19 07:17:46,716 INFO L226 Difference]: Without dead ends: 19 [2022-11-19 07:17:46,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 102.3s TimeCoverageRelationStatistics Valid=88, Invalid=425, Unknown=5, NotChecked=132, Total=650 [2022-11-19 07:17:46,718 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:17:46,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 42 Unchecked, 0.5s Time] [2022-11-19 07:17:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-19 07:17:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-19 07:17:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-19 07:17:46,730 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-11-19 07:17:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:17:46,731 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-19 07:17:46,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:17:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-19 07:17:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:17:46,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:17:46,732 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-19 07:17:46,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:17:46,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:46,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:17:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:17:46,935 INFO L85 PathProgramCache]: Analyzing trace with hash -809288718, now seen corresponding path program 2 times [2022-11-19 07:17:46,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:17:46,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94173769] [2022-11-19 07:17:46,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:17:46,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:17:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:17:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:17:53,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:17:53,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94173769] [2022-11-19 07:17:53,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94173769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:17:53,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804003710] [2022-11-19 07:17:53,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:17:53,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:17:53,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:17:53,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:17:53,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:17:54,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 07:17:54,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:17:54,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-19 07:17:54,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:17:54,067 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 18 treesize of output 19 [2022-11-19 07:17:54,087 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 18 treesize of output 19 [2022-11-19 07:17:54,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:54,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:54,169 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:17:54,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-11-19 07:17:54,255 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:17:54,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-11-19 07:17:54,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:17:54,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:54,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:17:54,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:55,022 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-19 07:17:55,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-19 07:17:55,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:55,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:55,257 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:17:55,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 55 [2022-11-19 07:17:55,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:55,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-11-19 07:17:55,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:17:55,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 25 [2022-11-19 07:17:55,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:55,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-11-19 07:17:55,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:17:55,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 07:17:56,866 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-19 07:17:56,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:56,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-19 07:17:57,624 INFO L321 Elim1Store]: treesize reduction 33, result has 50.7 percent of original size [2022-11-19 07:17:57,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 369 [2022-11-19 07:17:59,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:59,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:17:59,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:18:00,020 INFO L321 Elim1Store]: treesize reduction 121, result has 13.6 percent of original size [2022-11-19 07:18:00,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 235 treesize of output 209 [2022-11-19 07:18:00,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:18:00,066 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 210 treesize of output 193 [2022-11-19 07:18:00,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 164 [2022-11-19 07:18:01,695 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-19 07:18:01,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 302 treesize of output 273 [2022-11-19 07:18:01,898 INFO L321 Elim1Store]: treesize reduction 300, result has 5.7 percent of original size [2022-11-19 07:18:01,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 288 treesize of output 279 [2022-11-19 07:18:01,964 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-19 07:18:01,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 231 [2022-11-19 07:18:02,013 INFO L321 Elim1Store]: treesize reduction 55, result has 5.2 percent of original size [2022-11-19 07:18:02,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 241 treesize of output 221 [2022-11-19 07:18:03,625 INFO L321 Elim1Store]: treesize reduction 73, result has 41.6 percent of original size [2022-11-19 07:18:03,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 427 treesize of output 425 [2022-11-19 07:18:03,760 INFO L217 Elim1Store]: Index analysis took 112 ms [2022-11-19 07:18:05,460 INFO L321 Elim1Store]: treesize reduction 795, result has 33.6 percent of original size [2022-11-19 07:18:05,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 357 treesize of output 642 [2022-11-19 07:18:05,740 INFO L321 Elim1Store]: treesize reduction 74, result has 30.2 percent of original size [2022-11-19 07:18:05,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 725 treesize of output 665 [2022-11-19 07:18:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:18:05,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:18:17,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:18:17,582 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:18:17,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:18:17,656 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:18:26,655 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse78 (select |c_#memory_int| .cse50)) (.cse79 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse80 (select .cse78 .cse79)) (.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse18 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse12 (let ((.cse20 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse20 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_807))))) (let ((.cse15 (let ((.cse19 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse19 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_828)))) (.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16)) (.cse14 (let ((.cse17 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse17 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 0))))) (or (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse1 (store .cse15 .cse13 v_ArrVal_835))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse0 91) (not (< .cse0 110)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse8 (store .cse14 .cse13 v_ArrVal_834))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse10 (store .cse12 .cse13 v_ArrVal_838))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (+ .cse7 4))) (let ((.cse2 (select (select .cse10 .cse6) .cse9))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse8 .cse6) .cse9))) (let ((.cse5 (select .cse3 .cse4))) (or (< (select (select (store .cse1 .cse2 (store .cse3 .cse4 (+ .cse5 (select (select .cse1 .cse6) .cse7)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= .cse5 100)))))))))))))) (<= (select (select .cse15 .cse13) (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16)) 100))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse32 (let ((.cse38 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse38 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_807))))) (let ((.cse35 (let ((.cse37 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse37 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_828)))) (.cse33 (select (select .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16)) (.cse34 (let ((.cse36 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse36 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 0))))) (or (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse22 (store .cse35 .cse33 v_ArrVal_835))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse21 91) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse29 (store .cse34 .cse33 v_ArrVal_834))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse31 (store .cse32 .cse33 v_ArrVal_838))) (let ((.cse27 (select (select .cse31 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse30 (+ .cse28 4))) (let ((.cse23 (select (select .cse31 .cse27) .cse30))) (let ((.cse24 (select .cse22 .cse23)) (.cse25 (select (select .cse29 .cse27) .cse30))) (let ((.cse26 (select .cse24 .cse25))) (or (< 90 (select (select (store .cse22 .cse23 (store .cse24 .cse25 (+ .cse26 (* (- 1) (select (select .cse22 .cse27) .cse28))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (<= .cse26 100))))))))) (not (< .cse21 110)))))) (<= (select (select .cse35 .cse33) (select (select .cse34 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16)) 100))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)))) (let ((.cse40 (store |c_#memory_int| .cse50 (store .cse78 .cse79 (+ .cse80 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse39 91) (not (< .cse39 110)) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| .cse50 v_ArrVal_834))) (let ((.cse45 (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse49 (store |c_#memory_$Pointer$.base| .cse50 v_ArrVal_838))) (let ((.cse44 (select (select .cse49 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse48 (+ .cse45 4))) (let ((.cse41 (select (select .cse49 .cse44) .cse48))) (let ((.cse42 (select .cse40 .cse41)) (.cse43 (select (select .cse47 .cse44) .cse48))) (let ((.cse46 (select .cse42 .cse43))) (or (< (select (select (store .cse40 .cse41 (store .cse42 .cse43 (+ (* (- 1) (select (select .cse40 .cse44) .cse45)) .cse46))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse46 100))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.offset| .cse50 v_ArrVal_834))) (let ((.cse56 (select (select .cse57 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse59 (store |c_#memory_$Pointer$.base| .cse50 v_ArrVal_838))) (let ((.cse55 (select (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse58 (+ .cse56 4))) (let ((.cse52 (select (select .cse59 .cse55) .cse58))) (let ((.cse53 (select .cse40 .cse52)) (.cse54 (select (select .cse57 .cse55) .cse58))) (let ((.cse51 (select .cse53 .cse54))) (or (<= .cse51 100) (< 90 (select (select (store .cse40 .cse52 (store .cse53 .cse54 (+ (* (- 1) (select (select .cse40 .cse55) .cse56)) .cse51))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.offset| .cse50 v_ArrVal_834))) (let ((.cse65 (select (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse68 (store |c_#memory_$Pointer$.base| .cse50 v_ArrVal_838))) (let ((.cse64 (select (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse67 (+ .cse65 4))) (let ((.cse61 (select (select .cse68 .cse64) .cse67))) (let ((.cse62 (select .cse40 .cse61)) (.cse63 (select (select .cse66 .cse64) .cse67))) (let ((.cse60 (select .cse62 .cse63))) (or (not (<= .cse60 100)) (< 90 (select (select (store .cse40 .cse61 (store .cse62 .cse63 (+ (select (select .cse40 .cse64) .cse65) .cse60))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse75 (store |c_#memory_$Pointer$.offset| .cse50 v_ArrVal_834))) (let ((.cse74 (select (select .cse75 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse77 (store |c_#memory_$Pointer$.base| .cse50 v_ArrVal_838))) (let ((.cse73 (select (select .cse77 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse76 (+ .cse74 4))) (let ((.cse70 (select (select .cse77 .cse73) .cse76))) (let ((.cse71 (select .cse40 .cse70)) (.cse72 (select (select .cse75 .cse73) .cse76))) (let ((.cse69 (select .cse71 .cse72))) (or (not (<= .cse69 100)) (< (select (select (store .cse40 .cse70 (store .cse71 .cse72 (+ (select (select .cse40 .cse73) .cse74) .cse69))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))))))) (forall ((v_ArrVal_807 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse92 (let ((.cse98 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse98 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse98 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_807))))) (let ((.cse95 (let ((.cse97 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse97 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse97 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_828)))) (.cse93 (select (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16)) (.cse94 (let ((.cse96 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse96 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse96 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 0))))) (or (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse82 (store .cse95 .cse93 v_ArrVal_835))) (let ((.cse81 (select (select .cse82 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse81 91) (not (< .cse81 110)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse89 (store .cse94 .cse93 v_ArrVal_834))) (let ((.cse88 (select (select .cse89 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse91 (store .cse92 .cse93 v_ArrVal_838))) (let ((.cse87 (select (select .cse91 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse90 (+ .cse88 4))) (let ((.cse83 (select (select .cse91 .cse87) .cse90))) (let ((.cse84 (select .cse82 .cse83)) (.cse85 (select (select .cse89 .cse87) .cse90))) (let ((.cse86 (select .cse84 .cse85))) (or (< (select (select (store .cse82 .cse83 (store .cse84 .cse85 (+ .cse86 (* (- 1) (select (select .cse82 .cse87) .cse88))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse86 100))))))))))))) (<= (select (select .cse95 .cse93) (select (select .cse94 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16)) 100))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)))) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse110 (let ((.cse118 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse118 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse118 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_807))))) (let ((.cse112 (let ((.cse117 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse117 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse117 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 0)))) (.cse111 (select (select .cse110 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse100 (let ((.cse113 (let ((.cse116 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse116 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse116 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_828))))) (store .cse113 .cse111 (let ((.cse114 (select .cse113 .cse111)) (.cse115 (select (select .cse112 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (store .cse114 .cse115 (+ (select .cse114 .cse115) (select (select .cse113 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (let ((.cse99 (select (select .cse100 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse99 91) (not (< .cse99 110)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse107 (store .cse112 .cse111 v_ArrVal_834))) (let ((.cse106 (select (select .cse107 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse109 (store .cse110 .cse111 v_ArrVal_838))) (let ((.cse105 (select (select .cse109 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse108 (+ .cse106 4))) (let ((.cse101 (select (select .cse109 .cse105) .cse108))) (let ((.cse102 (select .cse100 .cse101)) (.cse103 (select (select .cse107 .cse105) .cse108))) (let ((.cse104 (select .cse102 .cse103))) (or (< 90 (select (select (store .cse100 .cse101 (store .cse102 .cse103 (+ .cse104 (select (select .cse100 .cse105) .cse106)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse104 100)))))))))))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))) (or (and (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse119 (store |c_#memory_int| .cse50 v_ArrVal_835))) (let ((.cse129 (select (select .cse119 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse126 (store |c_#memory_$Pointer$.offset| .cse50 v_ArrVal_834))) (let ((.cse124 (select (select .cse126 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse128 (store |c_#memory_$Pointer$.base| .cse50 v_ArrVal_838))) (let ((.cse123 (select (select .cse128 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse127 (+ .cse124 4))) (let ((.cse120 (select (select .cse128 .cse123) .cse127))) (let ((.cse121 (select .cse119 .cse120)) (.cse122 (select (select .cse126 .cse123) .cse127))) (let ((.cse125 (select .cse121 .cse122))) (or (< (select (select (store .cse119 .cse120 (store .cse121 .cse122 (+ (select (select .cse119 .cse123) .cse124) .cse125))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= .cse125 100)))))))))) (< .cse129 91) (not (< .cse129 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse130 (store |c_#memory_int| .cse50 v_ArrVal_835))) (let ((.cse140 (select (select .cse130 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse137 (store |c_#memory_$Pointer$.offset| .cse50 v_ArrVal_834))) (let ((.cse135 (select (select .cse137 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse139 (store |c_#memory_$Pointer$.base| .cse50 v_ArrVal_838))) (let ((.cse134 (select (select .cse139 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse138 (+ .cse135 4))) (let ((.cse131 (select (select .cse139 .cse134) .cse138))) (let ((.cse132 (select .cse130 .cse131)) (.cse133 (select (select .cse137 .cse134) .cse138))) (let ((.cse136 (select .cse132 .cse133))) (or (< 90 (select (select (store .cse130 .cse131 (store .cse132 .cse133 (+ (select (select .cse130 .cse134) .cse135) .cse136))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse136 100)))))))))) (< .cse140 91) (not (< .cse140 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse142 (store |c_#memory_int| .cse50 v_ArrVal_835))) (let ((.cse151 (select (select .cse142 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse148 (store |c_#memory_$Pointer$.offset| .cse50 v_ArrVal_834))) (let ((.cse147 (select (select .cse148 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse150 (store |c_#memory_$Pointer$.base| .cse50 v_ArrVal_838))) (let ((.cse146 (select (select .cse150 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse149 (+ .cse147 4))) (let ((.cse143 (select (select .cse150 .cse146) .cse149))) (let ((.cse144 (select .cse142 .cse143)) (.cse145 (select (select .cse148 .cse146) .cse149))) (let ((.cse141 (select .cse144 .cse145))) (or (<= .cse141 100) (< 90 (select (select (store .cse142 .cse143 (store .cse144 .cse145 (+ .cse141 (* (- 1) (select (select .cse142 .cse146) .cse147))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (< .cse151 91) (not (< .cse151 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse153 (store |c_#memory_int| .cse50 v_ArrVal_835))) (let ((.cse162 (select (select .cse153 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse159 (store |c_#memory_$Pointer$.offset| .cse50 v_ArrVal_834))) (let ((.cse158 (select (select .cse159 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse161 (store |c_#memory_$Pointer$.base| .cse50 v_ArrVal_838))) (let ((.cse157 (select (select .cse161 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse160 (+ .cse158 4))) (let ((.cse154 (select (select .cse161 .cse157) .cse160))) (let ((.cse155 (select .cse153 .cse154)) (.cse156 (select (select .cse159 .cse157) .cse160))) (let ((.cse152 (select .cse155 .cse156))) (or (<= .cse152 100) (< (select (select (store .cse153 .cse154 (store .cse155 .cse156 (+ .cse152 (* (- 1) (select (select .cse153 .cse157) .cse158))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (< .cse162 91) (not (< .cse162 110))))))) (<= .cse80 100)) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse174 (let ((.cse182 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse182 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse182 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_807))))) (let ((.cse176 (let ((.cse181 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse181 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse181 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 0)))) (.cse175 (select (select .cse174 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse165 (let ((.cse177 (let ((.cse180 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse180 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse180 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_828))))) (store .cse177 .cse175 (let ((.cse178 (select .cse177 .cse175)) (.cse179 (select (select .cse176 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (store .cse178 .cse179 (+ (select .cse178 .cse179) (select (select .cse177 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (let ((.cse163 (select (select .cse165 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse163 91) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse171 (store .cse176 .cse175 v_ArrVal_834))) (let ((.cse170 (select (select .cse171 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse173 (store .cse174 .cse175 v_ArrVal_838))) (let ((.cse169 (select (select .cse173 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse172 (+ .cse170 4))) (let ((.cse166 (select (select .cse173 .cse169) .cse172))) (let ((.cse167 (select .cse165 .cse166)) (.cse168 (select (select .cse171 .cse169) .cse172))) (let ((.cse164 (select .cse167 .cse168))) (or (<= .cse164 100) (< 90 (select (select (store .cse165 .cse166 (store .cse167 .cse168 (+ .cse164 (* (- 1) (select (select .cse165 .cse169) .cse170))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (not (< .cse163 110)))))))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (not (= (select |c_#valid| v_ArrVal_807) 0)))) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse194 (let ((.cse200 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse200 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse200 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_807))))) (let ((.cse197 (let ((.cse199 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse199 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse199 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_828)))) (.cse195 (select (select .cse194 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16)) (.cse196 (let ((.cse198 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse198 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse198 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 0))))) (or (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse185 (store .cse197 .cse195 v_ArrVal_835))) (let ((.cse183 (select (select .cse185 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse183 91) (not (< .cse183 110)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse191 (store .cse196 .cse195 v_ArrVal_834))) (let ((.cse190 (select (select .cse191 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse193 (store .cse194 .cse195 v_ArrVal_838))) (let ((.cse189 (select (select .cse193 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse192 (+ .cse190 4))) (let ((.cse186 (select (select .cse193 .cse189) .cse192))) (let ((.cse187 (select .cse185 .cse186)) (.cse188 (select (select .cse191 .cse189) .cse192))) (let ((.cse184 (select .cse187 .cse188))) (or (not (<= .cse184 100)) (< 90 (select (select (store .cse185 .cse186 (store .cse187 .cse188 (+ .cse184 (select (select .cse185 .cse189) .cse190)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))))))) (<= (select (select .cse197 .cse195) (select (select .cse196 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16)) 100))))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)))) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse211 (let ((.cse220 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse220 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse220 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_807))))) (let ((.cse213 (let ((.cse219 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse219 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse219 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 0)))) (.cse212 (select (select .cse211 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse201 (let ((.cse215 (let ((.cse218 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse218 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse218 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_828))))) (store .cse215 .cse212 (let ((.cse216 (select .cse215 .cse212)) (.cse217 (select (select .cse213 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (store .cse216 .cse217 (+ (select .cse216 .cse217) (select (select .cse215 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (let ((.cse214 (select (select .cse201 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse208 (store .cse213 .cse212 v_ArrVal_834))) (let ((.cse207 (select (select .cse208 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse210 (store .cse211 .cse212 v_ArrVal_838))) (let ((.cse206 (select (select .cse210 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse209 (+ .cse207 4))) (let ((.cse202 (select (select .cse210 .cse206) .cse209))) (let ((.cse203 (select .cse201 .cse202)) (.cse204 (select (select .cse208 .cse206) .cse209))) (let ((.cse205 (select .cse203 .cse204))) (or (< (select (select (store .cse201 .cse202 (store .cse203 .cse204 (+ .cse205 (* (- 1) (select (select .cse201 .cse206) .cse207))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse205 100))))))))) (< .cse214 91) (not (< .cse214 110)))))))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse231 (let ((.cse240 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse240 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse240 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_807))))) (let ((.cse233 (let ((.cse239 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse239 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse239 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 0)))) (.cse232 (select (select .cse231 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (let ((.cse222 (let ((.cse235 (let ((.cse238 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse238 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse238 |c_ULTIMATE.start_main_~list~0#1.base|) .cse18 v_ArrVal_828))))) (store .cse235 .cse232 (let ((.cse236 (select .cse235 .cse232)) (.cse237 (select (select .cse233 |c_ULTIMATE.start_main_~head~0#1.base|) .cse16))) (store .cse236 .cse237 (+ (select .cse236 .cse237) (select (select .cse235 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (let ((.cse234 (select (select .cse222 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse228 (store .cse233 .cse232 v_ArrVal_834))) (let ((.cse227 (select (select .cse228 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse230 (store .cse231 .cse232 v_ArrVal_838))) (let ((.cse226 (select (select .cse230 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse229 (+ .cse227 4))) (let ((.cse223 (select (select .cse230 .cse226) .cse229))) (let ((.cse224 (select .cse222 .cse223)) (.cse225 (select (select .cse228 .cse226) .cse229))) (let ((.cse221 (select .cse224 .cse225))) (or (not (<= .cse221 100)) (< (select (select (store .cse222 .cse223 (store .cse224 .cse225 (+ .cse221 (select (select .cse222 .cse226) .cse227)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (< .cse234 91) (not (< .cse234 110)))))))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0))))))))) is different from true [2022-11-19 07:18:29,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:18:29,875 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:19:04,731 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse15 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse198 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse226 (select |c_#memory_int| .cse198)) (.cse227 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse228 (select .cse226 .cse227)) (.cse18 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse17 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse19 (let ((.cse21 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse21 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse14 (let ((.cse20 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse20 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse11 (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse7 (store .cse14 .cse11 v_ArrVal_834))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse9 (store .cse19 .cse11 v_ArrVal_838))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse8 (+ .cse6 4))) (let ((.cse0 (let ((.cse10 (let ((.cse16 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse16 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse10 .cse11 (let ((.cse12 (select .cse10 .cse11)) (.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse12 .cse13 (+ (select .cse12 .cse13) (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< 90 (select (select (store .cse0 .cse1 (store .cse2 .cse3 (+ .cse4 (select (select .cse0 .cse5) .cse6)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (<= .cse4 100)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse37 (let ((.cse39 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse39 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse39 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse32 (let ((.cse38 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse38 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse31 (select (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse33 (store .cse32 .cse31 v_ArrVal_834))) (let ((.cse29 (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse35 (store .cse37 .cse31 v_ArrVal_838))) (let ((.cse28 (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse34 (+ .cse29 4)) (.cse30 (let ((.cse36 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse36 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse23 (store .cse30 .cse31 v_ArrVal_835)) (.cse24 (select (select .cse35 .cse28) .cse34))) (let ((.cse25 (select .cse23 .cse24)) (.cse26 (select (select .cse33 .cse28) .cse34))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse27 (select .cse25 .cse26))) (or (< .cse22 91) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< .cse22 110)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< (select (select (store .cse23 .cse24 (store .cse25 .cse26 (+ .cse27 (select (select .cse23 .cse28) .cse29)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (<= .cse27 100)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= (select (select .cse30 .cse31) (select (select .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int)) (let ((.cse54 (let ((.cse55 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse55 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse42 (select (select .cse54 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse50 (store .cse43 .cse42 v_ArrVal_834))) (let ((.cse49 (select (select .cse50 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse52 (store .cse54 .cse42 v_ArrVal_838))) (let ((.cse48 (select (select .cse52 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse51 (+ 4 .cse49)) (.cse41 (let ((.cse53 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse53 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse53 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (let ((.cse44 (store .cse41 .cse42 v_ArrVal_835)) (.cse45 (select (select .cse52 .cse48) .cse51))) (let ((.cse46 (select .cse44 .cse45)) (.cse47 (select (select .cse50 .cse48) .cse51))) (let ((.cse40 (select .cse46 .cse47))) (or (<= .cse40 100) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= (select (select .cse41 .cse42) (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< (select (select .cse44 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< (select (select (store .cse44 .cse45 (store .cse46 .cse47 (+ (* (- 1) (select (select .cse44 .cse48) .cse49)) .cse40))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse70 (let ((.cse72 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse72 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse72 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse65 (let ((.cse71 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse71 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse71 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse64 (select (select .cse70 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse66 (store .cse65 .cse64 v_ArrVal_834))) (let ((.cse62 (select (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse68 (store .cse70 .cse64 v_ArrVal_838))) (let ((.cse61 (select (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse67 (+ .cse62 4)) (.cse63 (let ((.cse69 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse69 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse69 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse56 (store .cse63 .cse64 v_ArrVal_835)) (.cse58 (select (select .cse68 .cse61) .cse67))) (let ((.cse59 (select .cse56 .cse58)) (.cse60 (select (select .cse66 .cse61) .cse67))) (let ((.cse57 (select .cse59 .cse60))) (or (< (select (select .cse56 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (<= .cse57 100)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (< 90 (select (select (store .cse56 .cse58 (store .cse59 .cse60 (+ .cse57 (select (select .cse56 .cse61) .cse62)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (<= (select (select .cse63 .cse64) (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int)) (let ((.cse88 (let ((.cse89 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse89 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse89 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse76 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse75 (select (select .cse88 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse84 (store .cse76 .cse75 v_ArrVal_834))) (let ((.cse83 (select (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse86 (store .cse88 .cse75 v_ArrVal_838))) (let ((.cse82 (select (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse85 (+ 4 .cse83)) (.cse74 (let ((.cse87 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse87 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse87 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (let ((.cse78 (store .cse74 .cse75 v_ArrVal_835)) (.cse79 (select (select .cse86 .cse82) .cse85))) (let ((.cse80 (select .cse78 .cse79)) (.cse81 (select (select .cse84 .cse82) .cse85))) (let ((.cse73 (select .cse80 .cse81)) (.cse77 (select (select .cse78 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (<= .cse73 100)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= (select (select .cse74 .cse75) (select (select .cse76 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< .cse77 110)) (< (select (select (store .cse78 .cse79 (store .cse80 .cse81 (+ .cse73 (select (select .cse78 .cse82) .cse83)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< .cse77 91))))))))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse105 (let ((.cse107 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse107 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse107 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse100 (let ((.cse106 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse106 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse106 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse99 (select (select .cse105 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse101 (store .cse100 .cse99 v_ArrVal_834))) (let ((.cse97 (select (select .cse101 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse103 (store .cse105 .cse99 v_ArrVal_838))) (let ((.cse96 (select (select .cse103 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse102 (+ .cse97 4)) (.cse98 (let ((.cse104 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse104 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse104 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse91 (store .cse98 .cse99 v_ArrVal_835)) (.cse92 (select (select .cse103 .cse96) .cse102))) (let ((.cse93 (select .cse91 .cse92)) (.cse94 (select (select .cse101 .cse96) .cse102))) (let ((.cse90 (select (select .cse91 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse95 (select .cse93 .cse94))) (or (< .cse90 91) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< .cse90 110)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< 90 (select (select (store .cse91 .cse92 (store .cse93 .cse94 (+ .cse95 (* (- 1) (select (select .cse91 .cse96) .cse97))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (<= .cse95 100) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= (select (select .cse98 .cse99) (select (select .cse100 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse125 (let ((.cse127 (store (let ((.cse128 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse128 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse128 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse127 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse127 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse118 (let ((.cse126 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse126 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse126 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse117 (select (select .cse125 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse119 (store .cse118 .cse117 v_ArrVal_834))) (let ((.cse115 (select (select .cse119 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse121 (store .cse125 .cse117 v_ArrVal_838))) (let ((.cse114 (select (select .cse121 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse120 (+ .cse115 4)) (.cse116 (let ((.cse122 (let ((.cse123 (let ((.cse124 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse124 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse124 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse123 v_ArrVal_807 (store (store (store (select .cse123 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse122 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse122 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse110 (store .cse116 .cse117 v_ArrVal_835)) (.cse111 (select (select .cse121 .cse114) .cse120))) (let ((.cse112 (select .cse110 .cse111)) (.cse113 (select (select .cse119 .cse114) .cse120))) (let ((.cse109 (select .cse112 .cse113)) (.cse108 (select (select .cse110 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (< .cse108 110)) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse109 100) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (< 90 (select (select (store .cse110 .cse111 (store .cse112 .cse113 (+ (* (- 1) (select (select .cse110 .cse114) .cse115)) .cse109))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (<= (select (select .cse116 .cse117) (select (select .cse118 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< .cse108 91) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_789 Int) (v_ArrVal_788 Int)) (let ((.cse146 (let ((.cse147 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse147 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse147 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse144 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse141 (select (select .cse146 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse137 (store .cse144 .cse141 v_ArrVal_834))) (let ((.cse136 (select (select .cse137 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse139 (store .cse146 .cse141 v_ArrVal_838))) (let ((.cse135 (select (select .cse139 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse138 (+ 4 .cse136))) (let ((.cse131 (let ((.cse140 (let ((.cse145 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse145 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse145 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse140 .cse141 (let ((.cse142 (select .cse140 .cse141)) (.cse143 (select (select .cse144 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse142 .cse143 (+ (select (select .cse140 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse142 .cse143))))))) (.cse132 (select (select .cse139 .cse135) .cse138))) (let ((.cse133 (select .cse131 .cse132)) (.cse134 (select (select .cse137 .cse135) .cse138))) (let ((.cse130 (select .cse133 .cse134)) (.cse129 (select (select .cse131 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (< .cse129 110)) (not (<= .cse130 100)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (< (select (select (store .cse131 .cse132 (store .cse133 .cse134 (+ .cse130 (select (select .cse131 .cse135) .cse136)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse129 91) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))))) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int)) (let ((.cse163 (let ((.cse164 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse164 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse164 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse151 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse150 (select (select .cse163 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse159 (store .cse151 .cse150 v_ArrVal_834))) (let ((.cse158 (select (select .cse159 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse161 (store .cse163 .cse150 v_ArrVal_838))) (let ((.cse157 (select (select .cse161 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse160 (+ 4 .cse158)) (.cse149 (let ((.cse162 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse162 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse162 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (let ((.cse153 (store .cse149 .cse150 v_ArrVal_835)) (.cse154 (select (select .cse161 .cse157) .cse160))) (let ((.cse155 (select .cse153 .cse154)) (.cse156 (select (select .cse159 .cse157) .cse160))) (let ((.cse148 (select .cse155 .cse156)) (.cse152 (select (select .cse153 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (<= .cse148 100) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= (select (select .cse149 .cse150) (select (select .cse151 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< .cse152 110)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< 90 (select (select (store .cse153 .cse154 (store .cse155 .cse156 (+ (* (- 1) (select (select .cse153 .cse157) .cse158)) .cse148))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse152 91))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0) (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse183 (let ((.cse185 (store (let ((.cse186 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse186 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse186 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse185 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse185 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse179 (let ((.cse184 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse184 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse184 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse176 (select (select .cse183 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse172 (store .cse179 .cse176 v_ArrVal_834))) (let ((.cse171 (select (select .cse172 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse174 (store .cse183 .cse176 v_ArrVal_838))) (let ((.cse170 (select (select .cse174 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse173 (+ .cse171 4))) (let ((.cse165 (let ((.cse175 (let ((.cse180 (let ((.cse181 (let ((.cse182 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse182 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse182 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse181 v_ArrVal_807 (store (store (store (select .cse181 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse180 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse180 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse175 .cse176 (let ((.cse177 (select .cse175 .cse176)) (.cse178 (select (select .cse179 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse177 .cse178 (+ (select (select .cse175 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse177 .cse178))))))) (.cse167 (select (select .cse174 .cse170) .cse173))) (let ((.cse168 (select .cse165 .cse167)) (.cse169 (select (select .cse172 .cse170) .cse173))) (let ((.cse166 (select .cse168 .cse169))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (< (select (select .cse165 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse166 100) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< (select (select (store .cse165 .cse167 (store .cse168 .cse169 (+ .cse166 (* (- 1) (select (select .cse165 .cse170) .cse171))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (let ((.cse188 (store |c_#memory_int| .cse198 (store .cse226 .cse227 (+ .cse228 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (let ((.cse187 (select (select .cse188 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse187 91) (not (< .cse187 110)) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse195 (store |c_#memory_$Pointer$.offset| .cse198 v_ArrVal_834))) (let ((.cse193 (select (select .cse195 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse197 (store |c_#memory_$Pointer$.base| .cse198 v_ArrVal_838))) (let ((.cse192 (select (select .cse197 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse196 (+ .cse193 4))) (let ((.cse189 (select (select .cse197 .cse192) .cse196))) (let ((.cse190 (select .cse188 .cse189)) (.cse191 (select (select .cse195 .cse192) .cse196))) (let ((.cse194 (select .cse190 .cse191))) (or (< (select (select (store .cse188 .cse189 (store .cse190 .cse191 (+ (* (- 1) (select (select .cse188 .cse192) .cse193)) .cse194))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse194 100))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse205 (store |c_#memory_$Pointer$.offset| .cse198 v_ArrVal_834))) (let ((.cse204 (select (select .cse205 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse207 (store |c_#memory_$Pointer$.base| .cse198 v_ArrVal_838))) (let ((.cse203 (select (select .cse207 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse206 (+ .cse204 4))) (let ((.cse200 (select (select .cse207 .cse203) .cse206))) (let ((.cse201 (select .cse188 .cse200)) (.cse202 (select (select .cse205 .cse203) .cse206))) (let ((.cse199 (select .cse201 .cse202))) (or (<= .cse199 100) (< 90 (select (select (store .cse188 .cse200 (store .cse201 .cse202 (+ (* (- 1) (select (select .cse188 .cse203) .cse204)) .cse199))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse214 (store |c_#memory_$Pointer$.offset| .cse198 v_ArrVal_834))) (let ((.cse213 (select (select .cse214 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse216 (store |c_#memory_$Pointer$.base| .cse198 v_ArrVal_838))) (let ((.cse212 (select (select .cse216 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse215 (+ .cse213 4))) (let ((.cse209 (select (select .cse216 .cse212) .cse215))) (let ((.cse210 (select .cse188 .cse209)) (.cse211 (select (select .cse214 .cse212) .cse215))) (let ((.cse208 (select .cse210 .cse211))) (or (not (<= .cse208 100)) (< 90 (select (select (store .cse188 .cse209 (store .cse210 .cse211 (+ (select (select .cse188 .cse212) .cse213) .cse208))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse223 (store |c_#memory_$Pointer$.offset| .cse198 v_ArrVal_834))) (let ((.cse222 (select (select .cse223 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse225 (store |c_#memory_$Pointer$.base| .cse198 v_ArrVal_838))) (let ((.cse221 (select (select .cse225 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse224 (+ .cse222 4))) (let ((.cse218 (select (select .cse225 .cse221) .cse224))) (let ((.cse219 (select .cse188 .cse218)) (.cse220 (select (select .cse223 .cse221) .cse224))) (let ((.cse217 (select .cse219 .cse220))) (or (not (<= .cse217 100)) (< (select (select (store .cse188 .cse218 (store .cse219 .cse220 (+ (select (select .cse188 .cse221) .cse222) .cse217))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse246 (let ((.cse248 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse248 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse248 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse244 (let ((.cse247 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse247 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse247 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse241 (select (select .cse246 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse237 (store .cse244 .cse241 v_ArrVal_834))) (let ((.cse236 (select (select .cse237 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse239 (store .cse246 .cse241 v_ArrVal_838))) (let ((.cse235 (select (select .cse239 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse238 (+ .cse236 4))) (let ((.cse231 (let ((.cse240 (let ((.cse245 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse245 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse245 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse240 .cse241 (let ((.cse242 (select .cse240 .cse241)) (.cse243 (select (select .cse244 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse242 .cse243 (+ (select .cse242 .cse243) (select (select .cse240 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse232 (select (select .cse239 .cse235) .cse238))) (let ((.cse233 (select .cse231 .cse232)) (.cse234 (select (select .cse237 .cse235) .cse238))) (let ((.cse229 (select .cse233 .cse234)) (.cse230 (select (select .cse231 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (<= .cse229 100)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< .cse230 91) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (< (select (select (store .cse231 .cse232 (store .cse233 .cse234 (+ .cse229 (select (select .cse231 .cse235) .cse236)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< .cse230 110)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse265 (let ((.cse267 (store (let ((.cse268 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse268 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse268 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse267 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse267 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse251 (let ((.cse266 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse266 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse266 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse250 (select (select .cse265 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse259 (store .cse251 .cse250 v_ArrVal_834))) (let ((.cse258 (select (select .cse259 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse261 (store .cse265 .cse250 v_ArrVal_838))) (let ((.cse257 (select (select .cse261 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse260 (+ .cse258 4)) (.cse249 (let ((.cse262 (let ((.cse263 (let ((.cse264 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse264 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse264 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse263 v_ArrVal_807 (store (store (store (select .cse263 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse262 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse262 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse253 (store .cse249 .cse250 v_ArrVal_835)) (.cse254 (select (select .cse261 .cse257) .cse260))) (let ((.cse255 (select .cse253 .cse254)) (.cse256 (select (select .cse259 .cse257) .cse260))) (let ((.cse252 (select .cse255 .cse256))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (<= (select (select .cse249 .cse250) (select (select .cse251 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (<= .cse252 100)) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< (select (select .cse253 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (< 90 (select (select (store .cse253 .cse254 (store .cse255 .cse256 (+ (select (select .cse253 .cse257) .cse258) .cse252))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse288 (let ((.cse290 (store (let ((.cse291 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse291 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse291 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse290 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse290 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse284 (let ((.cse289 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse289 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse289 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse281 (select (select .cse288 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse277 (store .cse284 .cse281 v_ArrVal_834))) (let ((.cse276 (select (select .cse277 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse279 (store .cse288 .cse281 v_ArrVal_838))) (let ((.cse275 (select (select .cse279 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse278 (+ .cse276 4))) (let ((.cse271 (let ((.cse280 (let ((.cse285 (let ((.cse286 (let ((.cse287 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse287 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse287 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse286 v_ArrVal_807 (store (store (store (select .cse286 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse285 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse285 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse280 .cse281 (let ((.cse282 (select .cse280 .cse281)) (.cse283 (select (select .cse284 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse282 .cse283 (+ (select (select .cse280 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse282 .cse283))))))) (.cse272 (select (select .cse279 .cse275) .cse278))) (let ((.cse273 (select .cse271 .cse272)) (.cse274 (select (select .cse277 .cse275) .cse278))) (let ((.cse269 (select .cse273 .cse274)) (.cse270 (select (select .cse271 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse269 100)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (< .cse270 110)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (< (select (select (store .cse271 .cse272 (store .cse273 .cse274 (+ .cse269 (select (select .cse271 .cse275) .cse276)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< .cse270 91) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse311 (let ((.cse313 (store (let ((.cse314 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse314 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse314 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse313 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse313 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse307 (let ((.cse312 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse312 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse312 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse304 (select (select .cse311 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse300 (store .cse307 .cse304 v_ArrVal_834))) (let ((.cse298 (select (select .cse300 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse302 (store .cse311 .cse304 v_ArrVal_838))) (let ((.cse297 (select (select .cse302 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse301 (+ .cse298 4))) (let ((.cse292 (let ((.cse303 (let ((.cse308 (let ((.cse309 (let ((.cse310 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse310 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse310 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse309 v_ArrVal_807 (store (store (store (select .cse309 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse308 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse308 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse303 .cse304 (let ((.cse305 (select .cse303 .cse304)) (.cse306 (select (select .cse307 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse305 .cse306 (+ (select (select .cse303 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse305 .cse306))))))) (.cse293 (select (select .cse302 .cse297) .cse301))) (let ((.cse294 (select .cse292 .cse293)) (.cse295 (select (select .cse300 .cse297) .cse301))) (let ((.cse296 (select .cse294 .cse295)) (.cse299 (select (select .cse292 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< 90 (select (select (store .cse292 .cse293 (store .cse294 .cse295 (+ .cse296 (* (- 1) (select (select .cse292 .cse297) .cse298))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (< .cse299 110)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse296 100) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< .cse299 91) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int)) (let ((.cse329 (let ((.cse330 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse330 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse330 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse318 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse317 (select (select .cse329 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse325 (store .cse318 .cse317 v_ArrVal_834))) (let ((.cse324 (select (select .cse325 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse327 (store .cse329 .cse317 v_ArrVal_838))) (let ((.cse323 (select (select .cse327 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse326 (+ 4 .cse324)) (.cse316 (let ((.cse328 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse328 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse328 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (let ((.cse319 (store .cse316 .cse317 v_ArrVal_835)) (.cse320 (select (select .cse327 .cse323) .cse326))) (let ((.cse321 (select .cse319 .cse320)) (.cse322 (select (select .cse325 .cse323) .cse326))) (let ((.cse315 (select .cse321 .cse322))) (or (not (<= .cse315 100)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= (select (select .cse316 .cse317) (select (select .cse318 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (< 90 (select (select (store .cse319 .cse320 (store .cse321 .cse322 (+ .cse315 (select (select .cse319 .cse323) .cse324)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< (select (select .cse319 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (or (and (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse331 (store |c_#memory_int| .cse198 v_ArrVal_835))) (let ((.cse341 (select (select .cse331 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse338 (store |c_#memory_$Pointer$.offset| .cse198 v_ArrVal_834))) (let ((.cse336 (select (select .cse338 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse340 (store |c_#memory_$Pointer$.base| .cse198 v_ArrVal_838))) (let ((.cse335 (select (select .cse340 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse339 (+ .cse336 4))) (let ((.cse332 (select (select .cse340 .cse335) .cse339))) (let ((.cse333 (select .cse331 .cse332)) (.cse334 (select (select .cse338 .cse335) .cse339))) (let ((.cse337 (select .cse333 .cse334))) (or (< (select (select (store .cse331 .cse332 (store .cse333 .cse334 (+ (select (select .cse331 .cse335) .cse336) .cse337))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= .cse337 100)))))))))) (< .cse341 91) (not (< .cse341 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse342 (store |c_#memory_int| .cse198 v_ArrVal_835))) (let ((.cse352 (select (select .cse342 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse349 (store |c_#memory_$Pointer$.offset| .cse198 v_ArrVal_834))) (let ((.cse347 (select (select .cse349 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse351 (store |c_#memory_$Pointer$.base| .cse198 v_ArrVal_838))) (let ((.cse346 (select (select .cse351 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse350 (+ .cse347 4))) (let ((.cse343 (select (select .cse351 .cse346) .cse350))) (let ((.cse344 (select .cse342 .cse343)) (.cse345 (select (select .cse349 .cse346) .cse350))) (let ((.cse348 (select .cse344 .cse345))) (or (< 90 (select (select (store .cse342 .cse343 (store .cse344 .cse345 (+ (select (select .cse342 .cse346) .cse347) .cse348))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse348 100)))))))))) (< .cse352 91) (not (< .cse352 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse354 (store |c_#memory_int| .cse198 v_ArrVal_835))) (let ((.cse363 (select (select .cse354 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse360 (store |c_#memory_$Pointer$.offset| .cse198 v_ArrVal_834))) (let ((.cse359 (select (select .cse360 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse362 (store |c_#memory_$Pointer$.base| .cse198 v_ArrVal_838))) (let ((.cse358 (select (select .cse362 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse361 (+ .cse359 4))) (let ((.cse355 (select (select .cse362 .cse358) .cse361))) (let ((.cse356 (select .cse354 .cse355)) (.cse357 (select (select .cse360 .cse358) .cse361))) (let ((.cse353 (select .cse356 .cse357))) (or (<= .cse353 100) (< 90 (select (select (store .cse354 .cse355 (store .cse356 .cse357 (+ .cse353 (* (- 1) (select (select .cse354 .cse358) .cse359))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (< .cse363 91) (not (< .cse363 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse365 (store |c_#memory_int| .cse198 v_ArrVal_835))) (let ((.cse374 (select (select .cse365 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse371 (store |c_#memory_$Pointer$.offset| .cse198 v_ArrVal_834))) (let ((.cse370 (select (select .cse371 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse373 (store |c_#memory_$Pointer$.base| .cse198 v_ArrVal_838))) (let ((.cse369 (select (select .cse373 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse372 (+ .cse370 4))) (let ((.cse366 (select (select .cse373 .cse369) .cse372))) (let ((.cse367 (select .cse365 .cse366)) (.cse368 (select (select .cse371 .cse369) .cse372))) (let ((.cse364 (select .cse367 .cse368))) (or (<= .cse364 100) (< (select (select (store .cse365 .cse366 (store .cse367 .cse368 (+ .cse364 (* (- 1) (select (select .cse365 .cse369) .cse370))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (< .cse374 91) (not (< .cse374 110))))))) (<= .cse228 100)) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_789 Int) (v_ArrVal_788 Int)) (let ((.cse391 (let ((.cse392 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse392 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse392 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse389 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse386 (select (select .cse391 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse382 (store .cse389 .cse386 v_ArrVal_834))) (let ((.cse381 (select (select .cse382 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse384 (store .cse391 .cse386 v_ArrVal_838))) (let ((.cse380 (select (select .cse384 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse383 (+ 4 .cse381))) (let ((.cse375 (let ((.cse385 (let ((.cse390 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse390 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse390 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse385 .cse386 (let ((.cse387 (select .cse385 .cse386)) (.cse388 (select (select .cse389 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse387 .cse388 (+ (select (select .cse385 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse387 .cse388))))))) (.cse376 (select (select .cse384 .cse380) .cse383))) (let ((.cse377 (select .cse375 .cse376)) (.cse378 (select (select .cse382 .cse380) .cse383))) (let ((.cse379 (select .cse377 .cse378))) (or (< (select (select (store .cse375 .cse376 (store .cse377 .cse378 (+ .cse379 (* (- 1) (select (select .cse375 .cse380) .cse381))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< (select (select .cse375 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse379 100) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse407 (let ((.cse409 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse409 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse409 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse402 (let ((.cse408 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse408 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse408 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse401 (select (select .cse407 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse403 (store .cse402 .cse401 v_ArrVal_834))) (let ((.cse399 (select (select .cse403 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse405 (store .cse407 .cse401 v_ArrVal_838))) (let ((.cse398 (select (select .cse405 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse404 (+ .cse399 4)) (.cse400 (let ((.cse406 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse406 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse406 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse393 (store .cse400 .cse401 v_ArrVal_835)) (.cse394 (select (select .cse405 .cse398) .cse404))) (let ((.cse395 (select .cse393 .cse394)) (.cse396 (select (select .cse403 .cse398) .cse404))) (let ((.cse397 (select .cse395 .cse396))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< (select (select .cse393 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (< (select (select (store .cse393 .cse394 (store .cse395 .cse396 (+ .cse397 (* (- 1) (select (select .cse393 .cse398) .cse399))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse397 100) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= (select (select .cse400 .cse401) (select (select .cse402 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_789 Int) (v_ArrVal_788 Int)) (let ((.cse427 (let ((.cse428 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse428 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse428 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse425 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse422 (select (select .cse427 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse418 (store .cse425 .cse422 v_ArrVal_834))) (let ((.cse417 (select (select .cse418 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse420 (store .cse427 .cse422 v_ArrVal_838))) (let ((.cse416 (select (select .cse420 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse419 (+ 4 .cse417))) (let ((.cse411 (let ((.cse421 (let ((.cse426 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse426 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse426 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse421 .cse422 (let ((.cse423 (select .cse421 .cse422)) (.cse424 (select (select .cse425 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse423 .cse424 (+ (select (select .cse421 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse423 .cse424))))))) (.cse412 (select (select .cse420 .cse416) .cse419))) (let ((.cse413 (select .cse411 .cse412)) (.cse414 (select (select .cse418 .cse416) .cse419))) (let ((.cse415 (select .cse413 .cse414)) (.cse410 (select (select .cse411 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (< .cse410 110)) (< 90 (select (select (store .cse411 .cse412 (store .cse413 .cse414 (+ .cse415 (* (- 1) (select (select .cse411 .cse416) .cse417))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse415 100) (< .cse410 91) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0) (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse447 (let ((.cse449 (store (let ((.cse450 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse450 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse450 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse449 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse449 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse443 (let ((.cse448 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse448 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse448 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse440 (select (select .cse447 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse436 (store .cse443 .cse440 v_ArrVal_834))) (let ((.cse435 (select (select .cse436 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse438 (store .cse447 .cse440 v_ArrVal_838))) (let ((.cse434 (select (select .cse438 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse437 (+ .cse435 4))) (let ((.cse430 (let ((.cse439 (let ((.cse444 (let ((.cse445 (let ((.cse446 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse446 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse446 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse445 v_ArrVal_807 (store (store (store (select .cse445 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse444 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse444 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse439 .cse440 (let ((.cse441 (select .cse439 .cse440)) (.cse442 (select (select .cse443 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse441 .cse442 (+ (select (select .cse439 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse441 .cse442))))))) (.cse431 (select (select .cse438 .cse434) .cse437))) (let ((.cse432 (select .cse430 .cse431)) (.cse433 (select (select .cse436 .cse434) .cse437))) (let ((.cse429 (select .cse432 .cse433))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse429 100)) (< 90 (select (select (store .cse430 .cse431 (store .cse432 .cse433 (+ .cse429 (select (select .cse430 .cse434) .cse435)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< (select (select .cse430 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_789 Int) (v_ArrVal_788 Int)) (let ((.cse467 (let ((.cse468 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse468 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse468 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse465 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse462 (select (select .cse467 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse458 (store .cse465 .cse462 v_ArrVal_834))) (let ((.cse457 (select (select .cse458 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse460 (store .cse467 .cse462 v_ArrVal_838))) (let ((.cse456 (select (select .cse460 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse459 (+ 4 .cse457))) (let ((.cse452 (let ((.cse461 (let ((.cse466 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse466 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse466 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse461 .cse462 (let ((.cse463 (select .cse461 .cse462)) (.cse464 (select (select .cse465 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse463 .cse464 (+ (select (select .cse461 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse463 .cse464))))))) (.cse453 (select (select .cse460 .cse456) .cse459))) (let ((.cse454 (select .cse452 .cse453)) (.cse455 (select (select .cse458 .cse456) .cse459))) (let ((.cse451 (select .cse454 .cse455))) (or (not (<= .cse451 100)) (< 90 (select (select (store .cse452 .cse453 (store .cse454 .cse455 (+ .cse451 (select (select .cse452 .cse456) .cse457)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (< (select (select .cse452 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse486 (let ((.cse488 (store (let ((.cse489 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse489 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse489 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse488 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse488 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse472 (let ((.cse487 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse487 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse487 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse471 (select (select .cse486 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse480 (store .cse472 .cse471 v_ArrVal_834))) (let ((.cse479 (select (select .cse480 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse482 (store .cse486 .cse471 v_ArrVal_838))) (let ((.cse478 (select (select .cse482 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse481 (+ .cse479 4)) (.cse470 (let ((.cse483 (let ((.cse484 (let ((.cse485 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse485 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse485 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse484 v_ArrVal_807 (store (store (store (select .cse484 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse483 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse483 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse474 (store .cse470 .cse471 v_ArrVal_835)) (.cse475 (select (select .cse482 .cse478) .cse481))) (let ((.cse476 (select .cse474 .cse475)) (.cse477 (select (select .cse480 .cse478) .cse481))) (let ((.cse469 (select (select .cse474 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse473 (select .cse476 .cse477))) (or (not (< .cse469 110)) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (<= (select (select .cse470 .cse471) (select (select .cse472 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (<= .cse473 100)) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< .cse469 91) (< (select (select (store .cse474 .cse475 (store .cse476 .cse477 (+ (select (select .cse474 .cse478) .cse479) .cse473))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse507 (let ((.cse509 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse509 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse509 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse505 (let ((.cse508 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse508 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse508 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse502 (select (select .cse507 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse498 (store .cse505 .cse502 v_ArrVal_834))) (let ((.cse497 (select (select .cse498 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse500 (store .cse507 .cse502 v_ArrVal_838))) (let ((.cse496 (select (select .cse500 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse499 (+ .cse497 4))) (let ((.cse492 (let ((.cse501 (let ((.cse506 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse506 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse506 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse501 .cse502 (let ((.cse503 (select .cse501 .cse502)) (.cse504 (select (select .cse505 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse503 .cse504 (+ (select .cse503 .cse504) (select (select .cse501 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse493 (select (select .cse500 .cse496) .cse499))) (let ((.cse494 (select .cse492 .cse493)) (.cse495 (select (select .cse498 .cse496) .cse499))) (let ((.cse490 (select (select .cse492 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse491 (select .cse494 .cse495))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< .cse490 91) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (< .cse490 110)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= .cse491 100) (< 90 (select (select (store .cse492 .cse493 (store .cse494 .cse495 (+ .cse491 (* (- 1) (select (select .cse492 .cse496) .cse497))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse526 (let ((.cse528 (store (let ((.cse529 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse529 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse529 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse528 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse528 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse514 (let ((.cse527 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse527 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse527 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse513 (select (select .cse526 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse520 (store .cse514 .cse513 v_ArrVal_834))) (let ((.cse519 (select (select .cse520 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse522 (store .cse526 .cse513 v_ArrVal_838))) (let ((.cse518 (select (select .cse522 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse521 (+ .cse519 4)) (.cse512 (let ((.cse523 (let ((.cse524 (let ((.cse525 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse525 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse525 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse524 v_ArrVal_807 (store (store (store (select .cse524 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse523 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse523 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse510 (store .cse512 .cse513 v_ArrVal_835)) (.cse515 (select (select .cse522 .cse518) .cse521))) (let ((.cse516 (select .cse510 .cse515)) (.cse517 (select (select .cse520 .cse518) .cse521))) (let ((.cse511 (select .cse516 .cse517))) (or (not (< (select (select .cse510 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse511 100) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (<= (select (select .cse512 .cse513) (select (select .cse514 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< (select (select (store .cse510 .cse515 (store .cse516 .cse517 (+ (* (- 1) (select (select .cse510 .cse518) .cse519)) .cse511))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse546 (let ((.cse548 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse548 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse548 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse544 (let ((.cse547 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse547 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse547 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse541 (select (select .cse546 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse537 (store .cse544 .cse541 v_ArrVal_834))) (let ((.cse536 (select (select .cse537 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse539 (store .cse546 .cse541 v_ArrVal_838))) (let ((.cse535 (select (select .cse539 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse538 (+ .cse536 4))) (let ((.cse530 (let ((.cse540 (let ((.cse545 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse545 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse545 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse540 .cse541 (let ((.cse542 (select .cse540 .cse541)) (.cse543 (select (select .cse544 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse542 .cse543 (+ (select .cse542 .cse543) (select (select .cse540 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse531 (select (select .cse539 .cse535) .cse538))) (let ((.cse532 (select .cse530 .cse531)) (.cse533 (select (select .cse537 .cse535) .cse538))) (let ((.cse534 (select .cse532 .cse533))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (< (select (select .cse530 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (< (select (select (store .cse530 .cse531 (store .cse532 .cse533 (+ .cse534 (* (- 1) (select (select .cse530 .cse535) .cse536))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= .cse534 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|))))))))))))))))) is different from true [2022-11-19 07:19:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-19 07:19:15,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804003710] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:19:15,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981725580] [2022-11-19 07:19:15,883 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-19 07:19:15,883 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:19:15,883 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:19:15,883 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:19:15,883 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:19:16,169 INFO L321 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-11-19 07:19:16,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 39 treesize of output 61 [2022-11-19 07:19:16,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-19 07:19:16,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2022-11-19 07:19:16,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-11-19 07:19:16,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-19 07:19:16,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-19 07:19:16,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2022-11-19 07:19:16,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-19 07:19:16,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:16,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-19 07:19:16,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:16,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2022-11-19 07:19:16,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:16,985 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:19:16,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 53 [2022-11-19 07:19:17,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-19 07:19:17,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:17,163 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-11-19 07:19:17,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 24 [2022-11-19 07:19:17,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:17,247 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-19 07:19:17,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2022-11-19 07:19:17,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:17,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:17,351 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-19 07:19:17,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 39 [2022-11-19 07:19:17,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 07:19:17,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-19 07:19:17,520 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:19:17,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 125 [2022-11-19 07:19:17,629 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:19:17,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 81 [2022-11-19 07:19:17,845 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-19 07:19:17,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 40 [2022-11-19 07:19:17,995 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:19:17,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 128 [2022-11-19 07:19:18,107 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:19:18,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 84 [2022-11-19 07:19:18,239 INFO L321 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2022-11-19 07:19:18,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2022-11-19 07:19:18,419 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:19:18,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 234 [2022-11-19 07:19:18,537 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:19:18,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 162 [2022-11-19 07:19:18,774 INFO L321 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2022-11-19 07:19:18,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 121 [2022-11-19 07:19:18,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2022-11-19 07:19:19,139 INFO L321 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2022-11-19 07:19:19,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 278 [2022-11-19 07:19:19,235 INFO L321 Elim1Store]: treesize reduction 25, result has 35.9 percent of original size [2022-11-19 07:19:19,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 33 [2022-11-19 07:19:19,278 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 81 treesize of output 57 [2022-11-19 07:19:19,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:19:19,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 126 [2022-11-19 07:19:19,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2022-11-19 07:19:19,473 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:19,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 89 [2022-11-19 07:19:19,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-19 07:19:19,542 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:19,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2022-11-19 07:19:19,576 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 24 treesize of output 18 [2022-11-19 07:19:20,465 INFO L321 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-11-19 07:19:20,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 234 [2022-11-19 07:19:20,603 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-19 07:19:20,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 162 [2022-11-19 07:19:20,846 INFO L321 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2022-11-19 07:19:20,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 121 [2022-11-19 07:19:20,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2022-11-19 07:19:20,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-19 07:19:21,011 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:21,032 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 24 treesize of output 18 [2022-11-19 07:19:21,051 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 26 treesize of output 20 [2022-11-19 07:19:21,157 INFO L321 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2022-11-19 07:19:21,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 234 treesize of output 219 [2022-11-19 07:19:21,187 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 27 treesize of output 19 [2022-11-19 07:19:21,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-19 07:19:21,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:21,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-19 07:19:21,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-19 07:19:21,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2022-11-19 07:19:21,323 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 64 treesize of output 40 [2022-11-19 07:19:21,768 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:19:23,439 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '528#(and (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~m~0#1.offset|) (<= |ULTIMATE.start_main_~m~0#1.offset| 0) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 07:19:23,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:19:23,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:19:23,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2022-11-19 07:19:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856951417] [2022-11-19 07:19:23,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:19:23,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-19 07:19:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:23,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-19 07:19:23,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=319, Unknown=3, NotChecked=78, Total=506 [2022-11-19 07:19:23,441 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:25,926 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse230 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse317 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse200 (select .cse230 .cse15))) (let ((.cse228 (select |c_#memory_int| .cse200)) (.cse90 (select .cse317 .cse15))) (let ((.cse91 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse229 (select .cse228 .cse90)) (.cse18 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse17 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse19 (let ((.cse21 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse21 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse21 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse14 (let ((.cse20 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse20 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse11 (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse7 (store .cse14 .cse11 v_ArrVal_834))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse9 (store .cse19 .cse11 v_ArrVal_838))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse8 (+ .cse6 4))) (let ((.cse0 (let ((.cse10 (let ((.cse16 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse16 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse10 .cse11 (let ((.cse12 (select .cse10 .cse11)) (.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse12 .cse13 (+ (select .cse12 .cse13) (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< 90 (select (select (store .cse0 .cse1 (store .cse2 .cse3 (+ .cse4 (select (select .cse0 .cse5) .cse6)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (<= .cse4 100)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse37 (let ((.cse39 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse39 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse39 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse32 (let ((.cse38 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse38 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse38 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse31 (select (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse33 (store .cse32 .cse31 v_ArrVal_834))) (let ((.cse29 (select (select .cse33 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse35 (store .cse37 .cse31 v_ArrVal_838))) (let ((.cse28 (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse34 (+ .cse29 4)) (.cse30 (let ((.cse36 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse36 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse36 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse23 (store .cse30 .cse31 v_ArrVal_835)) (.cse24 (select (select .cse35 .cse28) .cse34))) (let ((.cse25 (select .cse23 .cse24)) (.cse26 (select (select .cse33 .cse28) .cse34))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse27 (select .cse25 .cse26))) (or (< .cse22 91) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< .cse22 110)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< (select (select (store .cse23 .cse24 (store .cse25 .cse26 (+ .cse27 (select (select .cse23 .cse28) .cse29)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (<= .cse27 100)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= (select (select .cse30 .cse31) (select (select .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int)) (let ((.cse54 (let ((.cse55 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse55 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse55 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse42 (select (select .cse54 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse50 (store .cse43 .cse42 v_ArrVal_834))) (let ((.cse49 (select (select .cse50 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse52 (store .cse54 .cse42 v_ArrVal_838))) (let ((.cse48 (select (select .cse52 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse51 (+ 4 .cse49)) (.cse41 (let ((.cse53 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse53 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse53 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (let ((.cse44 (store .cse41 .cse42 v_ArrVal_835)) (.cse45 (select (select .cse52 .cse48) .cse51))) (let ((.cse46 (select .cse44 .cse45)) (.cse47 (select (select .cse50 .cse48) .cse51))) (let ((.cse40 (select .cse46 .cse47))) (or (<= .cse40 100) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= (select (select .cse41 .cse42) (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< (select (select .cse44 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< (select (select (store .cse44 .cse45 (store .cse46 .cse47 (+ (* (- 1) (select (select .cse44 .cse48) .cse49)) .cse40))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse70 (let ((.cse72 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse72 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse72 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse65 (let ((.cse71 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse71 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse71 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse64 (select (select .cse70 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse66 (store .cse65 .cse64 v_ArrVal_834))) (let ((.cse62 (select (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse68 (store .cse70 .cse64 v_ArrVal_838))) (let ((.cse61 (select (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse67 (+ .cse62 4)) (.cse63 (let ((.cse69 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse69 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse69 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse56 (store .cse63 .cse64 v_ArrVal_835)) (.cse58 (select (select .cse68 .cse61) .cse67))) (let ((.cse59 (select .cse56 .cse58)) (.cse60 (select (select .cse66 .cse61) .cse67))) (let ((.cse57 (select .cse59 .cse60))) (or (< (select (select .cse56 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (<= .cse57 100)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (< 90 (select (select (store .cse56 .cse58 (store .cse59 .cse60 (+ .cse57 (select (select .cse56 .cse61) .cse62)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (<= (select (select .cse63 .cse64) (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int)) (let ((.cse88 (let ((.cse89 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse89 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse89 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse76 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse75 (select (select .cse88 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse84 (store .cse76 .cse75 v_ArrVal_834))) (let ((.cse83 (select (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse86 (store .cse88 .cse75 v_ArrVal_838))) (let ((.cse82 (select (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse85 (+ 4 .cse83)) (.cse74 (let ((.cse87 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse87 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse87 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (let ((.cse78 (store .cse74 .cse75 v_ArrVal_835)) (.cse79 (select (select .cse86 .cse82) .cse85))) (let ((.cse80 (select .cse78 .cse79)) (.cse81 (select (select .cse84 .cse82) .cse85))) (let ((.cse73 (select .cse80 .cse81)) (.cse77 (select (select .cse78 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (<= .cse73 100)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= (select (select .cse74 .cse75) (select (select .cse76 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< .cse77 110)) (< (select (select (store .cse78 .cse79 (store .cse80 .cse81 (+ .cse73 (select (select .cse78 .cse82) .cse83)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< .cse77 91))))))))))))))) (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse90) (= .cse91 1) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse107 (let ((.cse109 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse109 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse109 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse102 (let ((.cse108 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse108 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse108 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse101 (select (select .cse107 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse103 (store .cse102 .cse101 v_ArrVal_834))) (let ((.cse99 (select (select .cse103 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse105 (store .cse107 .cse101 v_ArrVal_838))) (let ((.cse98 (select (select .cse105 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse104 (+ .cse99 4)) (.cse100 (let ((.cse106 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse106 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse106 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse93 (store .cse100 .cse101 v_ArrVal_835)) (.cse94 (select (select .cse105 .cse98) .cse104))) (let ((.cse95 (select .cse93 .cse94)) (.cse96 (select (select .cse103 .cse98) .cse104))) (let ((.cse92 (select (select .cse93 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse97 (select .cse95 .cse96))) (or (< .cse92 91) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< .cse92 110)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< 90 (select (select (store .cse93 .cse94 (store .cse95 .cse96 (+ .cse97 (* (- 1) (select (select .cse93 .cse98) .cse99))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (<= .cse97 100) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= (select (select .cse100 .cse101) (select (select .cse102 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse127 (let ((.cse129 (store (let ((.cse130 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse130 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse130 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse129 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse129 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse120 (let ((.cse128 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse128 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse128 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse119 (select (select .cse127 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse121 (store .cse120 .cse119 v_ArrVal_834))) (let ((.cse117 (select (select .cse121 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse123 (store .cse127 .cse119 v_ArrVal_838))) (let ((.cse116 (select (select .cse123 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse122 (+ .cse117 4)) (.cse118 (let ((.cse124 (let ((.cse125 (let ((.cse126 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse126 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse126 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse125 v_ArrVal_807 (store (store (store (select .cse125 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse124 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse124 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse112 (store .cse118 .cse119 v_ArrVal_835)) (.cse113 (select (select .cse123 .cse116) .cse122))) (let ((.cse114 (select .cse112 .cse113)) (.cse115 (select (select .cse121 .cse116) .cse122))) (let ((.cse111 (select .cse114 .cse115)) (.cse110 (select (select .cse112 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (< .cse110 110)) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse111 100) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (< 90 (select (select (store .cse112 .cse113 (store .cse114 .cse115 (+ (* (- 1) (select (select .cse112 .cse116) .cse117)) .cse111))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (<= (select (select .cse118 .cse119) (select (select .cse120 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< .cse110 91) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_789 Int) (v_ArrVal_788 Int)) (let ((.cse148 (let ((.cse149 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse149 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse149 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse146 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse143 (select (select .cse148 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse139 (store .cse146 .cse143 v_ArrVal_834))) (let ((.cse138 (select (select .cse139 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse141 (store .cse148 .cse143 v_ArrVal_838))) (let ((.cse137 (select (select .cse141 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse140 (+ 4 .cse138))) (let ((.cse133 (let ((.cse142 (let ((.cse147 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse147 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse147 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse142 .cse143 (let ((.cse144 (select .cse142 .cse143)) (.cse145 (select (select .cse146 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse144 .cse145 (+ (select (select .cse142 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse144 .cse145))))))) (.cse134 (select (select .cse141 .cse137) .cse140))) (let ((.cse135 (select .cse133 .cse134)) (.cse136 (select (select .cse139 .cse137) .cse140))) (let ((.cse132 (select .cse135 .cse136)) (.cse131 (select (select .cse133 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (< .cse131 110)) (not (<= .cse132 100)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (< (select (select (store .cse133 .cse134 (store .cse135 .cse136 (+ .cse132 (select (select .cse133 .cse137) .cse138)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse131 91) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))))) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int)) (let ((.cse165 (let ((.cse166 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse166 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse166 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse153 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse152 (select (select .cse165 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse161 (store .cse153 .cse152 v_ArrVal_834))) (let ((.cse160 (select (select .cse161 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse163 (store .cse165 .cse152 v_ArrVal_838))) (let ((.cse159 (select (select .cse163 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse162 (+ 4 .cse160)) (.cse151 (let ((.cse164 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse164 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse164 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (let ((.cse155 (store .cse151 .cse152 v_ArrVal_835)) (.cse156 (select (select .cse163 .cse159) .cse162))) (let ((.cse157 (select .cse155 .cse156)) (.cse158 (select (select .cse161 .cse159) .cse162))) (let ((.cse150 (select .cse157 .cse158)) (.cse154 (select (select .cse155 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (<= .cse150 100) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= (select (select .cse151 .cse152) (select (select .cse153 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< .cse154 110)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< 90 (select (select (store .cse155 .cse156 (store .cse157 .cse158 (+ (* (- 1) (select (select .cse155 .cse159) .cse160)) .cse150))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse154 91))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0) (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse185 (let ((.cse187 (store (let ((.cse188 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse188 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse188 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse187 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse187 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse181 (let ((.cse186 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse186 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse186 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse178 (select (select .cse185 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse174 (store .cse181 .cse178 v_ArrVal_834))) (let ((.cse173 (select (select .cse174 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse176 (store .cse185 .cse178 v_ArrVal_838))) (let ((.cse172 (select (select .cse176 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse175 (+ .cse173 4))) (let ((.cse167 (let ((.cse177 (let ((.cse182 (let ((.cse183 (let ((.cse184 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse184 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse184 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse183 v_ArrVal_807 (store (store (store (select .cse183 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse182 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse182 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse177 .cse178 (let ((.cse179 (select .cse177 .cse178)) (.cse180 (select (select .cse181 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse179 .cse180 (+ (select (select .cse177 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse179 .cse180))))))) (.cse169 (select (select .cse176 .cse172) .cse175))) (let ((.cse170 (select .cse167 .cse169)) (.cse171 (select (select .cse174 .cse172) .cse175))) (let ((.cse168 (select .cse170 .cse171))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (< (select (select .cse167 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse168 100) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< (select (select (store .cse167 .cse169 (store .cse170 .cse171 (+ .cse168 (* (- 1) (select (select .cse167 .cse172) .cse173))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (let ((.cse190 (store |c_#memory_int| .cse200 (store .cse228 .cse90 (+ .cse229 .cse91))))) (let ((.cse189 (select (select .cse190 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse189 91) (not (< .cse189 110)) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse197 (store |c_#memory_$Pointer$.offset| .cse200 v_ArrVal_834))) (let ((.cse195 (select (select .cse197 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse199 (store |c_#memory_$Pointer$.base| .cse200 v_ArrVal_838))) (let ((.cse194 (select (select .cse199 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse198 (+ .cse195 4))) (let ((.cse191 (select (select .cse199 .cse194) .cse198))) (let ((.cse192 (select .cse190 .cse191)) (.cse193 (select (select .cse197 .cse194) .cse198))) (let ((.cse196 (select .cse192 .cse193))) (or (< (select (select (store .cse190 .cse191 (store .cse192 .cse193 (+ (* (- 1) (select (select .cse190 .cse194) .cse195)) .cse196))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse196 100))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse207 (store |c_#memory_$Pointer$.offset| .cse200 v_ArrVal_834))) (let ((.cse206 (select (select .cse207 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse209 (store |c_#memory_$Pointer$.base| .cse200 v_ArrVal_838))) (let ((.cse205 (select (select .cse209 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse208 (+ .cse206 4))) (let ((.cse202 (select (select .cse209 .cse205) .cse208))) (let ((.cse203 (select .cse190 .cse202)) (.cse204 (select (select .cse207 .cse205) .cse208))) (let ((.cse201 (select .cse203 .cse204))) (or (<= .cse201 100) (< 90 (select (select (store .cse190 .cse202 (store .cse203 .cse204 (+ (* (- 1) (select (select .cse190 .cse205) .cse206)) .cse201))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse216 (store |c_#memory_$Pointer$.offset| .cse200 v_ArrVal_834))) (let ((.cse215 (select (select .cse216 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse218 (store |c_#memory_$Pointer$.base| .cse200 v_ArrVal_838))) (let ((.cse214 (select (select .cse218 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse217 (+ .cse215 4))) (let ((.cse211 (select (select .cse218 .cse214) .cse217))) (let ((.cse212 (select .cse190 .cse211)) (.cse213 (select (select .cse216 .cse214) .cse217))) (let ((.cse210 (select .cse212 .cse213))) (or (not (<= .cse210 100)) (< 90 (select (select (store .cse190 .cse211 (store .cse212 .cse213 (+ (select (select .cse190 .cse214) .cse215) .cse210))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse225 (store |c_#memory_$Pointer$.offset| .cse200 v_ArrVal_834))) (let ((.cse224 (select (select .cse225 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse227 (store |c_#memory_$Pointer$.base| .cse200 v_ArrVal_838))) (let ((.cse223 (select (select .cse227 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse226 (+ .cse224 4))) (let ((.cse220 (select (select .cse227 .cse223) .cse226))) (let ((.cse221 (select .cse190 .cse220)) (.cse222 (select (select .cse225 .cse223) .cse226))) (let ((.cse219 (select .cse221 .cse222))) (or (not (<= .cse219 100)) (< (select (select (store .cse190 .cse220 (store .cse221 .cse222 (+ (select (select .cse190 .cse223) .cse224) .cse219))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))))))) (= (select .cse230 .cse18) |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse248 (let ((.cse250 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse250 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse250 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse246 (let ((.cse249 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse249 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse249 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse243 (select (select .cse248 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse239 (store .cse246 .cse243 v_ArrVal_834))) (let ((.cse238 (select (select .cse239 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse241 (store .cse248 .cse243 v_ArrVal_838))) (let ((.cse237 (select (select .cse241 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse240 (+ .cse238 4))) (let ((.cse233 (let ((.cse242 (let ((.cse247 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse247 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse247 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse242 .cse243 (let ((.cse244 (select .cse242 .cse243)) (.cse245 (select (select .cse246 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse244 .cse245 (+ (select .cse244 .cse245) (select (select .cse242 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse234 (select (select .cse241 .cse237) .cse240))) (let ((.cse235 (select .cse233 .cse234)) (.cse236 (select (select .cse239 .cse237) .cse240))) (let ((.cse231 (select .cse235 .cse236)) (.cse232 (select (select .cse233 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (<= .cse231 100)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< .cse232 91) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (< (select (select (store .cse233 .cse234 (store .cse235 .cse236 (+ .cse231 (select (select .cse233 .cse237) .cse238)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< .cse232 110)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse267 (let ((.cse269 (store (let ((.cse270 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse270 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse270 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse269 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse269 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse253 (let ((.cse268 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse268 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse268 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse252 (select (select .cse267 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse261 (store .cse253 .cse252 v_ArrVal_834))) (let ((.cse260 (select (select .cse261 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse263 (store .cse267 .cse252 v_ArrVal_838))) (let ((.cse259 (select (select .cse263 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse262 (+ .cse260 4)) (.cse251 (let ((.cse264 (let ((.cse265 (let ((.cse266 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse266 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse266 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse265 v_ArrVal_807 (store (store (store (select .cse265 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse264 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse264 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse255 (store .cse251 .cse252 v_ArrVal_835)) (.cse256 (select (select .cse263 .cse259) .cse262))) (let ((.cse257 (select .cse255 .cse256)) (.cse258 (select (select .cse261 .cse259) .cse262))) (let ((.cse254 (select .cse257 .cse258))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (<= (select (select .cse251 .cse252) (select (select .cse253 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (<= .cse254 100)) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< (select (select .cse255 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (< 90 (select (select (store .cse255 .cse256 (store .cse257 .cse258 (+ (select (select .cse255 .cse259) .cse260) .cse254))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse290 (let ((.cse292 (store (let ((.cse293 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse293 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse293 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse292 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse292 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse286 (let ((.cse291 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse291 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse291 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse283 (select (select .cse290 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse279 (store .cse286 .cse283 v_ArrVal_834))) (let ((.cse278 (select (select .cse279 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse281 (store .cse290 .cse283 v_ArrVal_838))) (let ((.cse277 (select (select .cse281 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse280 (+ .cse278 4))) (let ((.cse273 (let ((.cse282 (let ((.cse287 (let ((.cse288 (let ((.cse289 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse289 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse289 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse288 v_ArrVal_807 (store (store (store (select .cse288 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse287 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse287 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse282 .cse283 (let ((.cse284 (select .cse282 .cse283)) (.cse285 (select (select .cse286 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse284 .cse285 (+ (select (select .cse282 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse284 .cse285))))))) (.cse274 (select (select .cse281 .cse277) .cse280))) (let ((.cse275 (select .cse273 .cse274)) (.cse276 (select (select .cse279 .cse277) .cse280))) (let ((.cse271 (select .cse275 .cse276)) (.cse272 (select (select .cse273 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse271 100)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (< .cse272 110)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (< (select (select (store .cse273 .cse274 (store .cse275 .cse276 (+ .cse271 (select (select .cse273 .cse277) .cse278)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< .cse272 91) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse313 (let ((.cse315 (store (let ((.cse316 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse316 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse316 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse315 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse315 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse309 (let ((.cse314 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse314 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse314 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse306 (select (select .cse313 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse302 (store .cse309 .cse306 v_ArrVal_834))) (let ((.cse300 (select (select .cse302 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse304 (store .cse313 .cse306 v_ArrVal_838))) (let ((.cse299 (select (select .cse304 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse303 (+ .cse300 4))) (let ((.cse294 (let ((.cse305 (let ((.cse310 (let ((.cse311 (let ((.cse312 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse312 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse312 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse311 v_ArrVal_807 (store (store (store (select .cse311 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse310 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse310 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse305 .cse306 (let ((.cse307 (select .cse305 .cse306)) (.cse308 (select (select .cse309 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse307 .cse308 (+ (select (select .cse305 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse307 .cse308))))))) (.cse295 (select (select .cse304 .cse299) .cse303))) (let ((.cse296 (select .cse294 .cse295)) (.cse297 (select (select .cse302 .cse299) .cse303))) (let ((.cse298 (select .cse296 .cse297)) (.cse301 (select (select .cse294 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< 90 (select (select (store .cse294 .cse295 (store .cse296 .cse297 (+ .cse298 (* (- 1) (select (select .cse294 .cse299) .cse300))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (< .cse301 110)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse298 100) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< .cse301 91) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select .cse317 .cse18) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int)) (let ((.cse332 (let ((.cse333 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse333 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse333 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse321 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse320 (select (select .cse332 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse328 (store .cse321 .cse320 v_ArrVal_834))) (let ((.cse327 (select (select .cse328 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse330 (store .cse332 .cse320 v_ArrVal_838))) (let ((.cse326 (select (select .cse330 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse329 (+ 4 .cse327)) (.cse319 (let ((.cse331 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse331 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse331 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (let ((.cse322 (store .cse319 .cse320 v_ArrVal_835)) (.cse323 (select (select .cse330 .cse326) .cse329))) (let ((.cse324 (select .cse322 .cse323)) (.cse325 (select (select .cse328 .cse326) .cse329))) (let ((.cse318 (select .cse324 .cse325))) (or (not (<= .cse318 100)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= (select (select .cse319 .cse320) (select (select .cse321 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (< 90 (select (select (store .cse322 .cse323 (store .cse324 .cse325 (+ .cse318 (select (select .cse322 .cse326) .cse327)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (< (select (select .cse322 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (or (and (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse334 (store |c_#memory_int| .cse200 v_ArrVal_835))) (let ((.cse344 (select (select .cse334 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse341 (store |c_#memory_$Pointer$.offset| .cse200 v_ArrVal_834))) (let ((.cse339 (select (select .cse341 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse343 (store |c_#memory_$Pointer$.base| .cse200 v_ArrVal_838))) (let ((.cse338 (select (select .cse343 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse342 (+ .cse339 4))) (let ((.cse335 (select (select .cse343 .cse338) .cse342))) (let ((.cse336 (select .cse334 .cse335)) (.cse337 (select (select .cse341 .cse338) .cse342))) (let ((.cse340 (select .cse336 .cse337))) (or (< (select (select (store .cse334 .cse335 (store .cse336 .cse337 (+ (select (select .cse334 .cse338) .cse339) .cse340))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= .cse340 100)))))))))) (< .cse344 91) (not (< .cse344 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse345 (store |c_#memory_int| .cse200 v_ArrVal_835))) (let ((.cse355 (select (select .cse345 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse352 (store |c_#memory_$Pointer$.offset| .cse200 v_ArrVal_834))) (let ((.cse350 (select (select .cse352 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse354 (store |c_#memory_$Pointer$.base| .cse200 v_ArrVal_838))) (let ((.cse349 (select (select .cse354 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse353 (+ .cse350 4))) (let ((.cse346 (select (select .cse354 .cse349) .cse353))) (let ((.cse347 (select .cse345 .cse346)) (.cse348 (select (select .cse352 .cse349) .cse353))) (let ((.cse351 (select .cse347 .cse348))) (or (< 90 (select (select (store .cse345 .cse346 (store .cse347 .cse348 (+ (select (select .cse345 .cse349) .cse350) .cse351))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse351 100)))))))))) (< .cse355 91) (not (< .cse355 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse357 (store |c_#memory_int| .cse200 v_ArrVal_835))) (let ((.cse366 (select (select .cse357 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse363 (store |c_#memory_$Pointer$.offset| .cse200 v_ArrVal_834))) (let ((.cse362 (select (select .cse363 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse365 (store |c_#memory_$Pointer$.base| .cse200 v_ArrVal_838))) (let ((.cse361 (select (select .cse365 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse364 (+ .cse362 4))) (let ((.cse358 (select (select .cse365 .cse361) .cse364))) (let ((.cse359 (select .cse357 .cse358)) (.cse360 (select (select .cse363 .cse361) .cse364))) (let ((.cse356 (select .cse359 .cse360))) (or (<= .cse356 100) (< 90 (select (select (store .cse357 .cse358 (store .cse359 .cse360 (+ .cse356 (* (- 1) (select (select .cse357 .cse361) .cse362))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (< .cse366 91) (not (< .cse366 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse368 (store |c_#memory_int| .cse200 v_ArrVal_835))) (let ((.cse377 (select (select .cse368 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse374 (store |c_#memory_$Pointer$.offset| .cse200 v_ArrVal_834))) (let ((.cse373 (select (select .cse374 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse376 (store |c_#memory_$Pointer$.base| .cse200 v_ArrVal_838))) (let ((.cse372 (select (select .cse376 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse375 (+ .cse373 4))) (let ((.cse369 (select (select .cse376 .cse372) .cse375))) (let ((.cse370 (select .cse368 .cse369)) (.cse371 (select (select .cse374 .cse372) .cse375))) (let ((.cse367 (select .cse370 .cse371))) (or (<= .cse367 100) (< (select (select (store .cse368 .cse369 (store .cse370 .cse371 (+ .cse367 (* (- 1) (select (select .cse368 .cse372) .cse373))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (< .cse377 91) (not (< .cse377 110))))))) (<= .cse229 100)) (forall ((v_ArrVal_795 Int)) (or (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_789 Int) (v_ArrVal_788 Int)) (let ((.cse394 (let ((.cse395 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse395 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse395 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse392 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse389 (select (select .cse394 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse385 (store .cse392 .cse389 v_ArrVal_834))) (let ((.cse384 (select (select .cse385 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse387 (store .cse394 .cse389 v_ArrVal_838))) (let ((.cse383 (select (select .cse387 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse386 (+ 4 .cse384))) (let ((.cse378 (let ((.cse388 (let ((.cse393 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse393 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse393 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse388 .cse389 (let ((.cse390 (select .cse388 .cse389)) (.cse391 (select (select .cse392 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse390 .cse391 (+ (select (select .cse388 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse390 .cse391))))))) (.cse379 (select (select .cse387 .cse383) .cse386))) (let ((.cse380 (select .cse378 .cse379)) (.cse381 (select (select .cse385 .cse383) .cse386))) (let ((.cse382 (select .cse380 .cse381))) (or (< (select (select (store .cse378 .cse379 (store .cse380 .cse381 (+ .cse382 (* (- 1) (select (select .cse378 .cse383) .cse384))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< (select (select .cse378 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse382 100) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse410 (let ((.cse412 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse412 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse412 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse405 (let ((.cse411 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse411 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse411 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse404 (select (select .cse410 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse406 (store .cse405 .cse404 v_ArrVal_834))) (let ((.cse402 (select (select .cse406 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse408 (store .cse410 .cse404 v_ArrVal_838))) (let ((.cse401 (select (select .cse408 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse407 (+ .cse402 4)) (.cse403 (let ((.cse409 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse409 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse409 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse396 (store .cse403 .cse404 v_ArrVal_835)) (.cse397 (select (select .cse408 .cse401) .cse407))) (let ((.cse398 (select .cse396 .cse397)) (.cse399 (select (select .cse406 .cse401) .cse407))) (let ((.cse400 (select .cse398 .cse399))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< (select (select .cse396 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (< (select (select (store .cse396 .cse397 (store .cse398 .cse399 (+ .cse400 (* (- 1) (select (select .cse396 .cse401) .cse402))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse400 100) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= (select (select .cse403 .cse404) (select (select .cse405 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_789 Int) (v_ArrVal_788 Int)) (let ((.cse430 (let ((.cse431 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse431 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse431 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse428 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse425 (select (select .cse430 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse421 (store .cse428 .cse425 v_ArrVal_834))) (let ((.cse420 (select (select .cse421 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse423 (store .cse430 .cse425 v_ArrVal_838))) (let ((.cse419 (select (select .cse423 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse422 (+ 4 .cse420))) (let ((.cse414 (let ((.cse424 (let ((.cse429 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse429 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse429 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse424 .cse425 (let ((.cse426 (select .cse424 .cse425)) (.cse427 (select (select .cse428 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse426 .cse427 (+ (select (select .cse424 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse426 .cse427))))))) (.cse415 (select (select .cse423 .cse419) .cse422))) (let ((.cse416 (select .cse414 .cse415)) (.cse417 (select (select .cse421 .cse419) .cse422))) (let ((.cse418 (select .cse416 .cse417)) (.cse413 (select (select .cse414 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (< .cse413 110)) (< 90 (select (select (store .cse414 .cse415 (store .cse416 .cse417 (+ .cse418 (* (- 1) (select (select .cse414 .cse419) .cse420))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse418 100) (< .cse413 91) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0) (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse450 (let ((.cse452 (store (let ((.cse453 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse453 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse453 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse452 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse452 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse446 (let ((.cse451 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse451 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse451 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse443 (select (select .cse450 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse439 (store .cse446 .cse443 v_ArrVal_834))) (let ((.cse438 (select (select .cse439 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse441 (store .cse450 .cse443 v_ArrVal_838))) (let ((.cse437 (select (select .cse441 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse440 (+ .cse438 4))) (let ((.cse433 (let ((.cse442 (let ((.cse447 (let ((.cse448 (let ((.cse449 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse449 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse449 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse448 v_ArrVal_807 (store (store (store (select .cse448 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse447 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse447 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse442 .cse443 (let ((.cse444 (select .cse442 .cse443)) (.cse445 (select (select .cse446 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse444 .cse445 (+ (select (select .cse442 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse444 .cse445))))))) (.cse434 (select (select .cse441 .cse437) .cse440))) (let ((.cse435 (select .cse433 .cse434)) (.cse436 (select (select .cse439 .cse437) .cse440))) (let ((.cse432 (select .cse435 .cse436))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse432 100)) (< 90 (select (select (store .cse433 .cse434 (store .cse435 .cse436 (+ .cse432 (select (select .cse433 .cse437) .cse438)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< (select (select .cse433 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))))) (not (< 0 v_ArrVal_795)))) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse200) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_802 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_789 Int) (v_ArrVal_788 Int)) (let ((.cse470 (let ((.cse471 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse471 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse471 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))))) (let ((.cse468 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0))) (.cse465 (select (select .cse470 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse461 (store .cse468 .cse465 v_ArrVal_834))) (let ((.cse460 (select (select .cse461 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse463 (store .cse470 .cse465 v_ArrVal_838))) (let ((.cse459 (select (select .cse463 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse462 (+ 4 .cse460))) (let ((.cse455 (let ((.cse464 (let ((.cse469 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse469 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse469 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse464 .cse465 (let ((.cse466 (select .cse464 .cse465)) (.cse467 (select (select .cse468 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse466 .cse467 (+ (select (select .cse464 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse466 .cse467))))))) (.cse456 (select (select .cse463 .cse459) .cse462))) (let ((.cse457 (select .cse455 .cse456)) (.cse458 (select (select .cse461 .cse459) .cse462))) (let ((.cse454 (select .cse457 .cse458))) (or (not (<= .cse454 100)) (< 90 (select (select (store .cse455 .cse456 (store .cse457 .cse458 (+ .cse454 (select (select .cse455 .cse459) .cse460)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (< (select (select .cse455 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 91) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (not (< 0 v_ArrVal_795)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse489 (let ((.cse491 (store (let ((.cse492 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse492 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse492 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse491 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse491 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse475 (let ((.cse490 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse490 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse490 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse474 (select (select .cse489 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse483 (store .cse475 .cse474 v_ArrVal_834))) (let ((.cse482 (select (select .cse483 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse485 (store .cse489 .cse474 v_ArrVal_838))) (let ((.cse481 (select (select .cse485 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse484 (+ .cse482 4)) (.cse473 (let ((.cse486 (let ((.cse487 (let ((.cse488 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse488 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse488 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse487 v_ArrVal_807 (store (store (store (select .cse487 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse486 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse486 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse477 (store .cse473 .cse474 v_ArrVal_835)) (.cse478 (select (select .cse485 .cse481) .cse484))) (let ((.cse479 (select .cse477 .cse478)) (.cse480 (select (select .cse483 .cse481) .cse484))) (let ((.cse472 (select (select .cse477 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse476 (select .cse479 .cse480))) (or (not (< .cse472 110)) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (<= (select (select .cse473 .cse474) (select (select .cse475 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (<= .cse476 100)) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< .cse472 91) (< (select (select (store .cse477 .cse478 (store .cse479 .cse480 (+ (select (select .cse477 .cse481) .cse482) .cse476))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse510 (let ((.cse512 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse512 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse512 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse508 (let ((.cse511 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse511 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse511 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse505 (select (select .cse510 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse501 (store .cse508 .cse505 v_ArrVal_834))) (let ((.cse500 (select (select .cse501 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse503 (store .cse510 .cse505 v_ArrVal_838))) (let ((.cse499 (select (select .cse503 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse502 (+ .cse500 4))) (let ((.cse495 (let ((.cse504 (let ((.cse509 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse509 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse509 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse504 .cse505 (let ((.cse506 (select .cse504 .cse505)) (.cse507 (select (select .cse508 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse506 .cse507 (+ (select .cse506 .cse507) (select (select .cse504 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse496 (select (select .cse503 .cse499) .cse502))) (let ((.cse497 (select .cse495 .cse496)) (.cse498 (select (select .cse501 .cse499) .cse502))) (let ((.cse493 (select (select .cse495 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (.cse494 (select .cse497 .cse498))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (< .cse493 91) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (< .cse493 110)) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= .cse494 100) (< 90 (select (select (store .cse495 .cse496 (store .cse497 .cse498 (+ .cse494 (* (- 1) (select (select .cse495 .cse499) .cse500))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (forall ((v_ArrVal_795 Int)) (or (not (< v_ArrVal_795 10)) (forall ((v_ArrVal_796 Int)) (or (forall ((v_ArrVal_807 Int) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_802 Int) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int)) (v_ArrVal_789 Int) (v_arrayElimArr_72 (Array Int Int)) (v_ArrVal_788 Int) (v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse529 (let ((.cse531 (store (let ((.cse532 (store |c_#memory_$Pointer$.base| v_ArrVal_796 v_arrayElimArr_72))) (store .cse532 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse532 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_796))) v_ArrVal_807 v_arrayElimArr_71))) (store .cse531 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse531 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse517 (let ((.cse530 (store (store (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_803) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_796 v_ArrVal_805) |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)) v_ArrVal_807 v_arrayElimArr_70))) (store .cse530 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse530 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse516 (select (select .cse529 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse523 (store .cse517 .cse516 v_ArrVal_834))) (let ((.cse522 (select (select .cse523 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse525 (store .cse529 .cse516 v_ArrVal_838))) (let ((.cse521 (select (select .cse525 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse524 (+ .cse522 4)) (.cse515 (let ((.cse526 (let ((.cse527 (let ((.cse528 (store |c_#memory_int| v_ArrVal_796 (store (store (store (select |c_#memory_int| v_ArrVal_796) 0 v_ArrVal_795) 4 v_ArrVal_789) 8 v_ArrVal_788)))) (store .cse528 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse528 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_802))))) (store .cse527 v_ArrVal_807 (store (store (store (select .cse527 v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814))))) (store .cse526 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse526 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (let ((.cse513 (store .cse515 .cse516 v_ArrVal_835)) (.cse518 (select (select .cse525 .cse521) .cse524))) (let ((.cse519 (select .cse513 .cse518)) (.cse520 (select (select .cse523 .cse521) .cse524))) (let ((.cse514 (select .cse519 .cse520))) (or (not (< (select (select .cse513 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_72 4))) (<= .cse514 100) (not (= (select (store |c_#valid| v_ArrVal_796 1) v_ArrVal_807) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (<= (select (select .cse515 .cse516) (select (select .cse517 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15)) 100) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (< (select (select (store .cse513 .cse518 (store .cse519 .cse520 (+ (* (- 1) (select (select .cse513 .cse521) .cse522)) .cse514))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_72 8))) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))))))))) (not (= (select |c_#valid| v_ArrVal_796) 0)) (= v_ArrVal_796 0))) (not (< 0 v_ArrVal_795)))) (forall ((v_ArrVal_834 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_807 Int) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_arrayElimArr_71 (Array Int Int)) (v_ArrVal_824 Int) (v_arrayElimArr_70 (Array Int Int))) (let ((.cse549 (let ((.cse551 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse551 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse551 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_807))))) (let ((.cse547 (let ((.cse550 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse550 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse550 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 0)))) (.cse544 (select (select .cse549 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (let ((.cse540 (store .cse547 .cse544 v_ArrVal_834))) (let ((.cse539 (select (select .cse540 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse542 (store .cse549 .cse544 v_ArrVal_838))) (let ((.cse538 (select (select .cse542 |c_ULTIMATE.start_main_~head~0#1.base|) .cse18)) (.cse541 (+ .cse539 4))) (let ((.cse533 (let ((.cse543 (let ((.cse548 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse548 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse548 |c_ULTIMATE.start_main_~list~0#1.base|) .cse17 v_ArrVal_828))))) (store .cse543 .cse544 (let ((.cse545 (select .cse543 .cse544)) (.cse546 (select (select .cse547 |c_ULTIMATE.start_main_~head~0#1.base|) .cse15))) (store .cse545 .cse546 (+ (select .cse545 .cse546) (select (select .cse543 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse534 (select (select .cse542 .cse538) .cse541))) (let ((.cse535 (select .cse533 .cse534)) (.cse536 (select (select .cse540 .cse538) .cse541))) (let ((.cse537 (select .cse535 .cse536))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= v_ArrVal_807 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (not (< (select (select .cse533 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)) (< (select (select (store .cse533 .cse534 (store .cse535 .cse536 (+ .cse537 (* (- 1) (select (select .cse533 .cse538) .cse539))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (<= .cse537 100) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|))))))))))))))))) is different from true [2022-11-19 07:19:28,080 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse13 (select .cse11 .cse4))) (let ((.cse90 (select |c_#memory_int| .cse13)) (.cse10 (select .cse12 .cse4))) (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse91 (select .cse90 .cse10)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse31 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (let ((.cse0 (= .cse14 1)) (.cse3 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100)) (.cse7 (= (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|) 1)) (.cse8 (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1))) (or (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and .cse0 (= (select .cse1 .cse2) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3 (= |c_ULTIMATE.start_main_~m~0#1.base| (select .cse1 .cse4)) (= |c_ULTIMATE.start_main_~m~0#1.base| (select .cse5 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (= |c_ULTIMATE.start_main_~m~0#1.offset| (select .cse6 .cse4)) .cse7 .cse8 (< |c_ULTIMATE.start_main_~n~0#1.base| |c_#StackHeapBarrier|) (= (select .cse6 .cse2) |c_ULTIMATE.start_main_~n~0#1.offset|) (not (= 0 |c_ULTIMATE.start_main_~n~0#1.base|)) (= |c_ULTIMATE.start_main_~n~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base|) 1) (= (select .cse5 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|) (< 0 .cse9) (< .cse9 10))) (and (= |c_ULTIMATE.start_main_~m~0#1.offset| .cse10) .cse0 (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3 .cse7 .cse8 (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~m~0#1.base| .cse13)))) (= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse26 (let ((.cse33 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse33 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_807))))) (let ((.cse29 (let ((.cse32 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse32 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse32 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_828)))) (.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse28 (let ((.cse30 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse30 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 0))))) (or (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse16 (store .cse29 .cse27 v_ArrVal_835))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse15 91) (not (< .cse15 110)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse23 (store .cse28 .cse27 v_ArrVal_834))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse25 (store .cse26 .cse27 v_ArrVal_838))) (let ((.cse21 (select (select .cse25 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse24 (+ .cse22 4))) (let ((.cse17 (select (select .cse25 .cse21) .cse24))) (let ((.cse18 (select .cse16 .cse17)) (.cse19 (select (select .cse23 .cse21) .cse24))) (let ((.cse20 (select .cse18 .cse19))) (or (< (select (select (store .cse16 .cse17 (store .cse18 .cse19 (+ .cse20 (select (select .cse16 .cse21) .cse22)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= .cse20 100)))))))))))))) (<= (select (select .cse29 .cse27) (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 100))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse45 (let ((.cse51 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse51 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse51 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_807))))) (let ((.cse48 (let ((.cse50 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse50 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse50 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_828)))) (.cse46 (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse47 (let ((.cse49 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse49 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse49 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 0))))) (or (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse35 (store .cse48 .cse46 v_ArrVal_835))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse34 91) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse42 (store .cse47 .cse46 v_ArrVal_834))) (let ((.cse41 (select (select .cse42 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse44 (store .cse45 .cse46 v_ArrVal_838))) (let ((.cse40 (select (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse43 (+ .cse41 4))) (let ((.cse36 (select (select .cse44 .cse40) .cse43))) (let ((.cse37 (select .cse35 .cse36)) (.cse38 (select (select .cse42 .cse40) .cse43))) (let ((.cse39 (select .cse37 .cse38))) (or (< 90 (select (select (store .cse35 .cse36 (store .cse37 .cse38 (+ .cse39 (* (- 1) (select (select .cse35 .cse40) .cse41))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (<= .cse39 100))))))))) (not (< .cse34 110)))))) (<= (select (select .cse48 .cse46) (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 100))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (let ((.cse53 (store |c_#memory_int| .cse13 (store .cse90 .cse10 (+ .cse91 .cse14))))) (let ((.cse52 (select (select .cse53 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse52 91) (not (< .cse52 110)) (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_834))) (let ((.cse58 (select (select .cse60 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse62 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_838))) (let ((.cse57 (select (select .cse62 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse61 (+ .cse58 4))) (let ((.cse54 (select (select .cse62 .cse57) .cse61))) (let ((.cse55 (select .cse53 .cse54)) (.cse56 (select (select .cse60 .cse57) .cse61))) (let ((.cse59 (select .cse55 .cse56))) (or (< (select (select (store .cse53 .cse54 (store .cse55 .cse56 (+ (* (- 1) (select (select .cse53 .cse57) .cse58)) .cse59))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse59 100))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_834))) (let ((.cse68 (select (select .cse69 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse71 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_838))) (let ((.cse67 (select (select .cse71 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse70 (+ .cse68 4))) (let ((.cse64 (select (select .cse71 .cse67) .cse70))) (let ((.cse65 (select .cse53 .cse64)) (.cse66 (select (select .cse69 .cse67) .cse70))) (let ((.cse63 (select .cse65 .cse66))) (or (<= .cse63 100) (< 90 (select (select (store .cse53 .cse64 (store .cse65 .cse66 (+ (* (- 1) (select (select .cse53 .cse67) .cse68)) .cse63))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_834))) (let ((.cse77 (select (select .cse78 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse80 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_838))) (let ((.cse76 (select (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse79 (+ .cse77 4))) (let ((.cse73 (select (select .cse80 .cse76) .cse79))) (let ((.cse74 (select .cse53 .cse73)) (.cse75 (select (select .cse78 .cse76) .cse79))) (let ((.cse72 (select .cse74 .cse75))) (or (not (<= .cse72 100)) (< 90 (select (select (store .cse53 .cse73 (store .cse74 .cse75 (+ (select (select .cse53 .cse76) .cse77) .cse72))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_834))) (let ((.cse86 (select (select .cse87 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse89 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_838))) (let ((.cse85 (select (select .cse89 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse88 (+ .cse86 4))) (let ((.cse82 (select (select .cse89 .cse85) .cse88))) (let ((.cse83 (select .cse53 .cse82)) (.cse84 (select (select .cse87 .cse85) .cse88))) (let ((.cse81 (select .cse83 .cse84))) (or (not (<= .cse81 100)) (< (select (select (store .cse53 .cse82 (store .cse83 .cse84 (+ (select (select .cse53 .cse85) .cse86) .cse81))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))))))) (forall ((v_ArrVal_807 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse103 (let ((.cse109 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse109 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse109 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_807))))) (let ((.cse106 (let ((.cse108 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse108 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse108 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_828)))) (.cse104 (select (select .cse103 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse105 (let ((.cse107 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse107 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse107 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 0))))) (or (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse93 (store .cse106 .cse104 v_ArrVal_835))) (let ((.cse92 (select (select .cse93 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse92 91) (not (< .cse92 110)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse100 (store .cse105 .cse104 v_ArrVal_834))) (let ((.cse99 (select (select .cse100 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse102 (store .cse103 .cse104 v_ArrVal_838))) (let ((.cse98 (select (select .cse102 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse101 (+ .cse99 4))) (let ((.cse94 (select (select .cse102 .cse98) .cse101))) (let ((.cse95 (select .cse93 .cse94)) (.cse96 (select (select .cse100 .cse98) .cse101))) (let ((.cse97 (select .cse95 .cse96))) (or (< (select (select (store .cse93 .cse94 (store .cse95 .cse96 (+ .cse97 (* (- 1) (select (select .cse93 .cse98) .cse99))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse97 100))))))))))))) (<= (select (select .cse106 .cse104) (select (select .cse105 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 100))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)))) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse121 (let ((.cse129 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse129 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse129 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_807))))) (let ((.cse123 (let ((.cse128 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse128 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse128 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 0)))) (.cse122 (select (select .cse121 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (let ((.cse111 (let ((.cse124 (let ((.cse127 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse127 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse127 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_828))))) (store .cse124 .cse122 (let ((.cse125 (select .cse124 .cse122)) (.cse126 (select (select .cse123 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (store .cse125 .cse126 (+ (select .cse125 .cse126) (select (select .cse124 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (let ((.cse110 (select (select .cse111 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse110 91) (not (< .cse110 110)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse118 (store .cse123 .cse122 v_ArrVal_834))) (let ((.cse117 (select (select .cse118 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse120 (store .cse121 .cse122 v_ArrVal_838))) (let ((.cse116 (select (select .cse120 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse119 (+ .cse117 4))) (let ((.cse112 (select (select .cse120 .cse116) .cse119))) (let ((.cse113 (select .cse111 .cse112)) (.cse114 (select (select .cse118 .cse116) .cse119))) (let ((.cse115 (select .cse113 .cse114))) (or (< 90 (select (select (store .cse111 .cse112 (store .cse113 .cse114 (+ .cse115 (select (select .cse111 .cse116) .cse117)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse115 100)))))))))))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))) (or (and (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse130 (store |c_#memory_int| .cse13 v_ArrVal_835))) (let ((.cse140 (select (select .cse130 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse137 (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_834))) (let ((.cse135 (select (select .cse137 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse139 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_838))) (let ((.cse134 (select (select .cse139 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse138 (+ .cse135 4))) (let ((.cse131 (select (select .cse139 .cse134) .cse138))) (let ((.cse132 (select .cse130 .cse131)) (.cse133 (select (select .cse137 .cse134) .cse138))) (let ((.cse136 (select .cse132 .cse133))) (or (< (select (select (store .cse130 .cse131 (store .cse132 .cse133 (+ (select (select .cse130 .cse134) .cse135) .cse136))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (<= .cse136 100)))))))))) (< .cse140 91) (not (< .cse140 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse141 (store |c_#memory_int| .cse13 v_ArrVal_835))) (let ((.cse151 (select (select .cse141 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse148 (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_834))) (let ((.cse146 (select (select .cse148 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse150 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_838))) (let ((.cse145 (select (select .cse150 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse149 (+ .cse146 4))) (let ((.cse142 (select (select .cse150 .cse145) .cse149))) (let ((.cse143 (select .cse141 .cse142)) (.cse144 (select (select .cse148 .cse145) .cse149))) (let ((.cse147 (select .cse143 .cse144))) (or (< 90 (select (select (store .cse141 .cse142 (store .cse143 .cse144 (+ (select (select .cse141 .cse145) .cse146) .cse147))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (<= .cse147 100)))))))))) (< .cse151 91) (not (< .cse151 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse153 (store |c_#memory_int| .cse13 v_ArrVal_835))) (let ((.cse162 (select (select .cse153 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse159 (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_834))) (let ((.cse158 (select (select .cse159 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse161 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_838))) (let ((.cse157 (select (select .cse161 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse160 (+ .cse158 4))) (let ((.cse154 (select (select .cse161 .cse157) .cse160))) (let ((.cse155 (select .cse153 .cse154)) (.cse156 (select (select .cse159 .cse157) .cse160))) (let ((.cse152 (select .cse155 .cse156))) (or (<= .cse152 100) (< 90 (select (select (store .cse153 .cse154 (store .cse155 .cse156 (+ .cse152 (* (- 1) (select (select .cse153 .cse157) .cse158))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (< .cse162 91) (not (< .cse162 110)))))) (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse164 (store |c_#memory_int| .cse13 v_ArrVal_835))) (let ((.cse173 (select (select .cse164 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse170 (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_834))) (let ((.cse169 (select (select .cse170 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse172 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_838))) (let ((.cse168 (select (select .cse172 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse171 (+ .cse169 4))) (let ((.cse165 (select (select .cse172 .cse168) .cse171))) (let ((.cse166 (select .cse164 .cse165)) (.cse167 (select (select .cse170 .cse168) .cse171))) (let ((.cse163 (select .cse166 .cse167))) (or (<= .cse163 100) (< (select (select (store .cse164 .cse165 (store .cse166 .cse167 (+ .cse163 (* (- 1) (select (select .cse164 .cse168) .cse169))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (< .cse173 91) (not (< .cse173 110))))))) (<= .cse91 100)) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse185 (let ((.cse193 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse193 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse193 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_807))))) (let ((.cse187 (let ((.cse192 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse192 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse192 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 0)))) (.cse186 (select (select .cse185 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (let ((.cse176 (let ((.cse188 (let ((.cse191 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse191 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse191 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_828))))) (store .cse188 .cse186 (let ((.cse189 (select .cse188 .cse186)) (.cse190 (select (select .cse187 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (store .cse189 .cse190 (+ (select .cse189 .cse190) (select (select .cse188 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (let ((.cse174 (select (select .cse176 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse174 91) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse182 (store .cse187 .cse186 v_ArrVal_834))) (let ((.cse181 (select (select .cse182 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse184 (store .cse185 .cse186 v_ArrVal_838))) (let ((.cse180 (select (select .cse184 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse183 (+ .cse181 4))) (let ((.cse177 (select (select .cse184 .cse180) .cse183))) (let ((.cse178 (select .cse176 .cse177)) (.cse179 (select (select .cse182 .cse180) .cse183))) (let ((.cse175 (select .cse178 .cse179))) (or (<= .cse175 100) (< 90 (select (select (store .cse176 .cse177 (store .cse178 .cse179 (+ .cse175 (* (- 1) (select (select .cse176 .cse180) .cse181))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (not (< .cse174 110)))))))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (not (= (select |c_#valid| v_ArrVal_807) 0)))) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse205 (let ((.cse211 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse211 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse211 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_807))))) (let ((.cse208 (let ((.cse210 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse210 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse210 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_828)))) (.cse206 (select (select .cse205 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (.cse207 (let ((.cse209 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse209 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse209 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 0))))) (or (forall ((v_ArrVal_835 (Array Int Int))) (let ((.cse196 (store .cse208 .cse206 v_ArrVal_835))) (let ((.cse194 (select (select .cse196 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse194 91) (not (< .cse194 110)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse202 (store .cse207 .cse206 v_ArrVal_834))) (let ((.cse201 (select (select .cse202 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse204 (store .cse205 .cse206 v_ArrVal_838))) (let ((.cse200 (select (select .cse204 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse203 (+ .cse201 4))) (let ((.cse197 (select (select .cse204 .cse200) .cse203))) (let ((.cse198 (select .cse196 .cse197)) (.cse199 (select (select .cse202 .cse200) .cse203))) (let ((.cse195 (select .cse198 .cse199))) (or (not (<= .cse195 100)) (< 90 (select (select (store .cse196 .cse197 (store .cse198 .cse199 (+ .cse195 (select (select .cse196 .cse200) .cse201)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))))))) (<= (select (select .cse208 .cse206) (select (select .cse207 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) 100))))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)))) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse222 (let ((.cse231 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse231 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse231 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_807))))) (let ((.cse224 (let ((.cse230 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse230 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse230 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 0)))) (.cse223 (select (select .cse222 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (let ((.cse212 (let ((.cse226 (let ((.cse229 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse229 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse229 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_828))))) (store .cse226 .cse223 (let ((.cse227 (select .cse226 .cse223)) (.cse228 (select (select .cse224 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (store .cse227 .cse228 (+ (select .cse227 .cse228) (select (select .cse226 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (let ((.cse225 (select (select .cse212 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse219 (store .cse224 .cse223 v_ArrVal_834))) (let ((.cse218 (select (select .cse219 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse221 (store .cse222 .cse223 v_ArrVal_838))) (let ((.cse217 (select (select .cse221 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse220 (+ .cse218 4))) (let ((.cse213 (select (select .cse221 .cse217) .cse220))) (let ((.cse214 (select .cse212 .cse213)) (.cse215 (select (select .cse219 .cse217) .cse220))) (let ((.cse216 (select .cse214 .cse215))) (or (< (select (select (store .cse212 .cse213 (store .cse214 .cse215 (+ .cse216 (* (- 1) (select (select .cse212 .cse217) .cse218))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (<= .cse216 100))))))))) (< .cse225 91) (not (< .cse225 110)))))))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))))) (forall ((v_ArrVal_807 Int)) (or (= v_ArrVal_807 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (forall ((v_arrayElimArr_70 (Array Int Int))) (or (not (= (select v_arrayElimArr_70 4) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_70 8))) (forall ((v_arrayElimArr_71 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_71 4))) (not (= (select v_arrayElimArr_71 8) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_828 Int) (v_ArrVal_814 Int) (v_ArrVal_824 Int)) (let ((.cse242 (let ((.cse251 (store |c_#memory_$Pointer$.base| v_ArrVal_807 v_arrayElimArr_71))) (store .cse251 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse251 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_807))))) (let ((.cse244 (let ((.cse250 (store |c_#memory_$Pointer$.offset| v_ArrVal_807 v_arrayElimArr_70))) (store .cse250 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse250 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 0)))) (.cse243 (select (select .cse242 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (let ((.cse233 (let ((.cse246 (let ((.cse249 (store |c_#memory_int| v_ArrVal_807 (store (store (store (select |c_#memory_int| v_ArrVal_807) 0 |v_ULTIMATE.start_main_~x~0#1_11|) 4 v_ArrVal_824) 8 v_ArrVal_814)))) (store .cse249 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse249 |c_ULTIMATE.start_main_~list~0#1.base|) .cse31 v_ArrVal_828))))) (store .cse246 .cse243 (let ((.cse247 (select .cse246 .cse243)) (.cse248 (select (select .cse244 |c_ULTIMATE.start_main_~head~0#1.base|) .cse4))) (store .cse247 .cse248 (+ (select .cse247 .cse248) (select (select .cse246 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (let ((.cse245 (select (select .cse233 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int))) (let ((.cse239 (store .cse244 .cse243 v_ArrVal_834))) (let ((.cse238 (select (select .cse239 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse241 (store .cse242 .cse243 v_ArrVal_838))) (let ((.cse237 (select (select .cse241 |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse240 (+ .cse238 4))) (let ((.cse234 (select (select .cse241 .cse237) .cse240))) (let ((.cse235 (select .cse233 .cse234)) (.cse236 (select (select .cse239 .cse237) .cse240))) (let ((.cse232 (select .cse235 .cse236))) (or (not (<= .cse232 100)) (< (select (select (store .cse233 .cse234 (store .cse235 .cse236 (+ .cse232 (select (select .cse233 .cse237) .cse238)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))))) (< .cse245 91) (not (< .cse245 110)))))))))))) (not (< |v_ULTIMATE.start_main_~x~0#1_11| 10)) (not (< 0 |v_ULTIMATE.start_main_~x~0#1_11|)))) (not (< v_ArrVal_807 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_807) 0))))))))) is different from true [2022-11-19 07:19:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:29,415 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-19 07:19:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:19:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:19:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:29,418 INFO L225 Difference]: With dead ends: 28 [2022-11-19 07:19:29,418 INFO L226 Difference]: Without dead ends: 26 [2022-11-19 07:19:29,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=134, Invalid=383, Unknown=5, NotChecked=180, Total=702 [2022-11-19 07:19:29,419 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:29,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2022-11-19 07:19:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-19 07:19:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-11-19 07:19:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-11-19 07:19:29,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-11-19 07:19:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:29,450 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-11-19 07:19:29,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:19:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-11-19 07:19:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:19:29,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:29,451 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:29,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:19:29,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:29,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:19:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 307050244, now seen corresponding path program 3 times [2022-11-19 07:19:29,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:29,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063685111] [2022-11-19 07:19:29,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:29,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:19:36,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:36,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063685111] [2022-11-19 07:19:36,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063685111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:19:36,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145983376] [2022-11-19 07:19:36,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:19:36,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:36,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:19:36,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:19:37,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:19:37,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:19:37,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:19:37,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 103 conjunts are in the unsatisfiable core [2022-11-19 07:19:37,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:19:37,213 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 18 treesize of output 19 [2022-11-19 07:19:37,290 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-19 07:19:37,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-19 07:19:37,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:19:37,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,353 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 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-19 07:19:37,363 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 30 treesize of output 30 [2022-11-19 07:19:37,373 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 [2022-11-19 07:19:37,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:19:37,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2022-11-19 07:19:37,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2022-11-19 07:19:37,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:37,878 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:19:37,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 57 [2022-11-19 07:19:38,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:38,207 INFO L321 Elim1Store]: treesize reduction 91, result has 13.3 percent of original size [2022-11-19 07:19:38,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 145 [2022-11-19 07:19:38,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 96 [2022-11-19 07:19:38,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:38,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:38,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-19 07:19:38,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 07:19:38,917 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-19 07:19:38,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 272 treesize of output 284 [2022-11-19 07:19:40,572 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-19 07:19:40,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 343 treesize of output 292 [2022-11-19 07:19:40,682 INFO L321 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2022-11-19 07:19:40,683 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 3 case distinctions, treesize of input 321 treesize of output 302 [2022-11-19 07:19:40,896 INFO L321 Elim1Store]: treesize reduction 288, result has 5.9 percent of original size [2022-11-19 07:19:40,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 307 treesize of output 304 [2022-11-19 07:19:40,950 INFO L321 Elim1Store]: treesize reduction 55, result has 5.2 percent of original size [2022-11-19 07:19:40,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 274 treesize of output 254 [2022-11-19 07:19:42,890 INFO L321 Elim1Store]: treesize reduction 73, result has 41.6 percent of original size [2022-11-19 07:19:42,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 387 treesize of output 385 [2022-11-19 07:19:43,035 INFO L217 Elim1Store]: Index analysis took 120 ms [2022-11-19 07:19:43,842 INFO L321 Elim1Store]: treesize reduction 584, result has 21.0 percent of original size [2022-11-19 07:19:43,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 317 treesize of output 445 [2022-11-19 07:19:44,310 INFO L321 Elim1Store]: treesize reduction 104, result has 39.2 percent of original size [2022-11-19 07:19:44,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 268 treesize of output 297 [2022-11-19 07:19:47,060 INFO L321 Elim1Store]: treesize reduction 82, result has 39.7 percent of original size [2022-11-19 07:19:47,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 89 [2022-11-19 07:19:49,961 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:50,028 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:50,061 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:50,132 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:54,127 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 15 treesize of output 13 [2022-11-19 07:19:54,396 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:54,618 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-19 07:19:55,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:55,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 51 [2022-11-19 07:19:56,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:56,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 57 [2022-11-19 07:19:56,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 57 [2022-11-19 07:19:56,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:56,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 59 [2022-11-19 07:19:56,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:56,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 55 [2022-11-19 07:19:56,815 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 6 treesize of output 4 [2022-11-19 07:19:56,989 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 197 treesize of output 191 [2022-11-19 07:19:57,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:57,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 61 [2022-11-19 07:19:59,608 INFO L321 Elim1Store]: treesize reduction 107, result has 39.2 percent of original size [2022-11-19 07:19:59,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 524 treesize of output 504 [2022-11-19 07:20:01,179 INFO L321 Elim1Store]: treesize reduction 989, result has 22.3 percent of original size [2022-11-19 07:20:01,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 52 case distinctions, treesize of input 421 treesize of output 646 [2022-11-19 07:20:01,745 INFO L321 Elim1Store]: treesize reduction 109, result has 41.1 percent of original size [2022-11-19 07:20:01,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 525 treesize of output 493 [2022-11-19 07:20:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:20:02,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:21:12,322 WARN L233 SmtUtils]: Spent 47.43s on a formula simplification that was a NOOP. DAG size: 247 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:22:10,211 WARN L233 SmtUtils]: Spent 45.09s on a formula simplification that was a NOOP. DAG size: 247 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:22:12,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:12,173 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:22:12,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:22:12,248 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-19 07:25:42,007 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-19 07:25:42,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-19 07:25:42,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-11-19 07:25:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1922457555] [2022-11-19 07:25:42,010 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-19 07:25:42,010 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:25:42,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:25:42,011 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:25:42,011 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:25:42,016 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-19 07:25:42,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:25:42,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-11-19 07:25:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182143890] [2022-11-19 07:25:42,023 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-19 07:25:42,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:25:42,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:25:42,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:25:42,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=295, Unknown=15, NotChecked=0, Total=380 [2022-11-19 07:25:42,025 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:25:42,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 127.5s TimeCoverageRelationStatistics Valid=70, Invalid=295, Unknown=15, NotChecked=0, Total=380 [2022-11-19 07:25:42,027 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:42,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:25:42,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:42,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-19 07:25:42,230 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@34b1efc1 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:25:42,234 INFO L158 Benchmark]: Toolchain (without parser) took 677065.22ms. Allocated memory was 104.9MB in the beginning and 490.7MB in the end (delta: 385.9MB). Free memory was 59.8MB in the beginning and 208.9MB in the end (delta: -149.1MB). Peak memory consumption was 236.2MB. Max. memory is 16.1GB. [2022-11-19 07:25:42,235 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:42,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.58ms. Allocated memory is still 104.9MB. Free memory was 59.6MB in the beginning and 71.5MB in the end (delta: -11.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-19 07:25:42,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.44ms. Allocated memory is still 104.9MB. Free memory was 71.5MB in the beginning and 69.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:42,235 INFO L158 Benchmark]: Boogie Preprocessor took 51.54ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 68.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:42,235 INFO L158 Benchmark]: RCFGBuilder took 568.58ms. Allocated memory is still 104.9MB. Free memory was 68.1MB in the beginning and 47.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-19 07:25:42,235 INFO L158 Benchmark]: TraceAbstraction took 675887.04ms. Allocated memory was 104.9MB in the beginning and 490.7MB in the end (delta: 385.9MB). Free memory was 47.1MB in the beginning and 208.9MB in the end (delta: -161.8MB). Peak memory consumption was 227.4MB. Max. memory is 16.1GB. [2022-11-19 07:25:42,236 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.58ms. Allocated memory is still 104.9MB. Free memory was 59.6MB in the beginning and 71.5MB in the end (delta: -11.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.44ms. Allocated memory is still 104.9MB. Free memory was 71.5MB in the beginning and 69.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.54ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 68.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 568.58ms. Allocated memory is still 104.9MB. Free memory was 68.1MB in the beginning and 47.7MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 675887.04ms. Allocated memory was 104.9MB in the beginning and 490.7MB in the end (delta: 385.9MB). Free memory was 47.1MB in the beginning and 208.9MB in the end (delta: -161.8MB). Peak memory consumption was 227.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@34b1efc1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@34b1efc1: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:25:44,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:25:44,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:25:44,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:25:44,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:25:44,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:25:44,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:25:44,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:25:44,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:25:44,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:25:44,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:25:44,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:25:44,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:25:44,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:25:44,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:25:44,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:25:44,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:25:44,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:25:44,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:25:44,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:25:44,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:25:44,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:25:44,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:25:44,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:25:44,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:25:44,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:25:44,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:25:44,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:25:44,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:25:44,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:25:44,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:25:44,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:25:44,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:25:44,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:25:44,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:25:44,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:25:44,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:25:44,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:25:44,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:25:44,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:25:44,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:25:44,466 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-19 07:25:44,504 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:25:44,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:25:44,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:25:44,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:25:44,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:25:44,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:25:44,508 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:25:44,508 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:25:44,508 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:25:44,508 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:25:44,509 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:25:44,510 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:25:44,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:25:44,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:25:44,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:25:44,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:25:44,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:25:44,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:25:44,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:25:44,513 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:25:44,513 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:25:44,513 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:25:44,514 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:25:44,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:25:44,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:25:44,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:25:44,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:25:44,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:25:44,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:25:44,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:25:44,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:25:44,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:25:44,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:25:44,517 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:25:44,517 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:25:44,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:25:44,517 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:25:44,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:25:44,518 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2022-11-19 07:25:44,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:25:44,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:25:44,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:25:44,958 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:25:44,958 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:25:44,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/heap-data/shared_mem1.i [2022-11-19 07:25:45,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data/49deb0112/40dad18cd4a24b17bef4f8edec1ece42/FLAGbc5275b85 [2022-11-19 07:25:45,683 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:25:45,683 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/sv-benchmarks/c/heap-data/shared_mem1.i [2022-11-19 07:25:45,694 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data/49deb0112/40dad18cd4a24b17bef4f8edec1ece42/FLAGbc5275b85 [2022-11-19 07:25:45,957 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/data/49deb0112/40dad18cd4a24b17bef4f8edec1ece42 [2022-11-19 07:25:45,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:25:45,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:25:45,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:25:45,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:25:45,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:25:45,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:45" (1/1) ... [2022-11-19 07:25:45,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f5dfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:45, skipping insertion in model container [2022-11-19 07:25:45,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:45" (1/1) ... [2022-11-19 07:25:45,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:25:46,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:25:46,371 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2022-11-19 07:25:46,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:25:46,407 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:25:46,450 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2022-11-19 07:25:46,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:25:46,486 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:25:46,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46 WrapperNode [2022-11-19 07:25:46,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:25:46,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:25:46,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:25:46,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:25:46,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,544 INFO L138 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2022-11-19 07:25:46,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:25:46,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:25:46,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:25:46,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:25:46,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,612 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:25:46,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:25:46,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:25:46,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:25:46,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (1/1) ... [2022-11-19 07:25:46,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:25:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:25:46,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:25:46,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:25:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-19 07:25:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:25:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:25:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 07:25:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 07:25:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:25:46,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:25:46,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:25:46,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:25:46,833 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:25:46,836 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:25:48,272 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:25:48,278 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:25:48,278 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 07:25:48,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:48 BoogieIcfgContainer [2022-11-19 07:25:48,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:25:48,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:25:48,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:25:48,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:25:48,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:25:45" (1/3) ... [2022-11-19 07:25:48,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118cf390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:48, skipping insertion in model container [2022-11-19 07:25:48,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:46" (2/3) ... [2022-11-19 07:25:48,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118cf390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:48, skipping insertion in model container [2022-11-19 07:25:48,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:48" (3/3) ... [2022-11-19 07:25:48,290 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-11-19 07:25:48,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:25:48,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:25:48,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:25:48,364 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;@4c2fc3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:25:48,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:25:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:25:48,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:48,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:48,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:25:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash -15033972, now seen corresponding path program 1 times [2022-11-19 07:25:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:48,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509304750] [2022-11-19 07:25:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:48,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:48,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:48,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:25:48,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-19 07:25:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:48,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:25:48,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:25:48,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:48,637 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:48,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509304750] [2022-11-19 07:25:48,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509304750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:48,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:48,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:25:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228497954] [2022-11-19 07:25:48,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:48,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:25:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:25:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:25:48,687 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:48,703 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2022-11-19 07:25:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:25:48,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 07:25:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:48,713 INFO L225 Difference]: With dead ends: 26 [2022-11-19 07:25:48,714 INFO L226 Difference]: Without dead ends: 12 [2022-11-19 07:25:48,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:25:48,720 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:48,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:25:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-19 07:25:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-19 07:25:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-19 07:25:48,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2022-11-19 07:25:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:48,749 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-19 07:25:48,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-19 07:25:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:25:48,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:48,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:48,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:48,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:48,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:25:48,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash -263268138, now seen corresponding path program 1 times [2022-11-19 07:25:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:48,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331025566] [2022-11-19 07:25:48,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:48,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:48,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:48,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:25:48,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-19 07:25:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:49,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-19 07:25:49,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:49,227 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 18 treesize of output 19 [2022-11-19 07:25:49,252 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 18 treesize of output 19 [2022-11-19 07:25:49,422 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-19 07:25:49,423 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 56 treesize of output 94 [2022-11-19 07:25:49,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:25:49,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-19 07:25:49,704 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 68 treesize of output 37 [2022-11-19 07:25:49,731 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 32 treesize of output 22 [2022-11-19 07:25:49,994 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 80 treesize of output 50 [2022-11-19 07:25:50,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-11-19 07:25:50,092 INFO L321 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-11-19 07:25:50,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2022-11-19 07:25:50,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:25:50,541 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 78 [2022-11-19 07:25:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:25:50,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:50,629 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:50,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331025566] [2022-11-19 07:25:50,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331025566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:50,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:50,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:25:50,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983238788] [2022-11-19 07:25:50,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:50,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:25:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:50,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:25:50,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:25:50,633 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:52,896 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2022-11-19 07:25:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:25:52,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 07:25:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:52,898 INFO L225 Difference]: With dead ends: 22 [2022-11-19 07:25:52,898 INFO L226 Difference]: Without dead ends: 20 [2022-11-19 07:25:52,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:25:52,900 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:52,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 32 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 12 Unchecked, 2.1s Time] [2022-11-19 07:25:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-19 07:25:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-19 07:25:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-11-19 07:25:52,908 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 10 [2022-11-19 07:25:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:52,910 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-11-19 07:25:52,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-11-19 07:25:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:25:52,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:52,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:52,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:53,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:53,112 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:25:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash -263266216, now seen corresponding path program 1 times [2022-11-19 07:25:53,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:53,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882855069] [2022-11-19 07:25:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:53,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:53,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:25:53,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-19 07:25:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:53,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-19 07:25:53,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:53,297 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 18 treesize of output 19 [2022-11-19 07:25:53,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:25:53,423 INFO L321 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2022-11-19 07:25:53,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 59 [2022-11-19 07:25:53,472 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 10 treesize of output 8 [2022-11-19 07:25:53,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2022-11-19 07:25:53,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2022-11-19 07:25:53,731 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 36 treesize of output 23 [2022-11-19 07:25:53,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-11-19 07:25:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:25:53,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:53,816 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:53,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882855069] [2022-11-19 07:25:53,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882855069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:53,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:53,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:25:53,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946936248] [2022-11-19 07:25:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:53,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:53,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:53,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:53,819 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:56,215 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-11-19 07:25:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:56,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 07:25:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:56,217 INFO L225 Difference]: With dead ends: 27 [2022-11-19 07:25:56,217 INFO L226 Difference]: Without dead ends: 20 [2022-11-19 07:25:56,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:25:56,218 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:56,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 10 Unchecked, 2.3s Time] [2022-11-19 07:25:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-19 07:25:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-19 07:25:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-11-19 07:25:56,224 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 10 [2022-11-19 07:25:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:56,225 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-11-19 07:25:56,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-11-19 07:25:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:25:56,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:56,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:56,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:56,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:56,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:25:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash -261421096, now seen corresponding path program 1 times [2022-11-19 07:25:56,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:56,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970326818] [2022-11-19 07:25:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:56,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:56,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:25:56,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-19 07:25:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:56,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 07:25:56,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:56,638 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 18 treesize of output 19 [2022-11-19 07:25:56,651 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 18 treesize of output 19 [2022-11-19 07:25:56,660 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 16 treesize of output 14 [2022-11-19 07:25:56,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-11-19 07:25:56,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 07:25:56,776 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 43 treesize of output 25 [2022-11-19 07:25:56,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-19 07:25:56,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-19 07:25:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:25:56,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:56,807 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:56,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970326818] [2022-11-19 07:25:56,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970326818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:56,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:56,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:25:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470890478] [2022-11-19 07:25:56,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:56,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:25:56,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:56,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:25:56,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:25:56,814 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:59,557 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-11-19 07:25:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:25:59,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 07:25:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:59,560 INFO L225 Difference]: With dead ends: 27 [2022-11-19 07:25:59,560 INFO L226 Difference]: Without dead ends: 20 [2022-11-19 07:25:59,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:25:59,561 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:59,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-19 07:25:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-19 07:25:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-19 07:25:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-11-19 07:25:59,567 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2022-11-19 07:25:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:59,568 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-11-19 07:25:59,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-11-19 07:25:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:25:59,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:59,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:59,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:59,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:59,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:25:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -434920839, now seen corresponding path program 1 times [2022-11-19 07:25:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:59,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777466111] [2022-11-19 07:25:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:59,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:59,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:59,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:25:59,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-19 07:26:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:00,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-19 07:26:00,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:00,185 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-19 07:26:00,186 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 56 treesize of output 94 [2022-11-19 07:26:00,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:26:00,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-19 07:26:00,392 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 68 treesize of output 37 [2022-11-19 07:26:00,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,403 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 32 treesize of output 22 [2022-11-19 07:26:00,444 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 18 treesize of output 19 [2022-11-19 07:26:00,479 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:26:00,479 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-19 07:26:00,497 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 18 treesize of output 19 [2022-11-19 07:26:00,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,701 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 26 treesize of output 23 [2022-11-19 07:26:00,706 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 18 treesize of output 22 [2022-11-19 07:26:00,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,739 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 26 treesize of output 23 [2022-11-19 07:26:00,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,751 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 24 treesize of output 21 [2022-11-19 07:26:00,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:00,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:26:00,776 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:26:00,776 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 13 [2022-11-19 07:26:00,783 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 18 treesize of output 22 [2022-11-19 07:26:00,962 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 64 treesize of output 44 [2022-11-19 07:26:00,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:26:01,008 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-19 07:26:01,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 39 [2022-11-19 07:26:01,015 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 37 treesize of output 25 [2022-11-19 07:26:01,247 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:26:01,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 34 [2022-11-19 07:26:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:01,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:02,080 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (_ BitVec 32)) (v_ArrVal_265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.base_3| (_ BitVec 32)) (v_ArrVal_263 (_ BitVec 32))) (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse1 (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_268))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_263)))) (.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_265) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_271) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_261)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_267) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_260) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_270)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (let ((.cse0 (select .cse3 .cse4))) (or (not (bvsle .cse0 (_ bv100 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_3|) (_ bv0 1))) (bvslt (select (select (store .cse1 .cse2 (store .cse3 .cse4 (bvadd .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)))))))) is different from false [2022-11-19 07:26:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 07:26:02,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:26:02,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777466111] [2022-11-19 07:26:02,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777466111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:02,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712070240] [2022-11-19 07:26:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:02,480 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:26:02,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:26:02,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:26:02,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-19 07:26:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:02,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-19 07:26:02,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:03,008 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-19 07:26:03,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-11-19 07:26:03,143 INFO L321 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2022-11-19 07:26:03,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 91 [2022-11-19 07:26:03,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:26:03,233 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 46 treesize of output 32 [2022-11-19 07:26:03,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,246 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 32 treesize of output 22 [2022-11-19 07:26:03,310 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 [2022-11-19 07:26:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 221 [2022-11-19 07:26:03,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:26:03,629 INFO L217 Elim1Store]: Index analysis took 172 ms [2022-11-19 07:26:03,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 99 [2022-11-19 07:26:03,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:03,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:26:03,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 22 [2022-11-19 07:26:03,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:26:03,935 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 18 treesize of output 19 [2022-11-19 07:26:03,975 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:26:03,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-19 07:26:04,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:26:04,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:04,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:04,340 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 35 treesize of output 30 [2022-11-19 07:26:04,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:04,360 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 26 treesize of output 23 [2022-11-19 07:26:04,367 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 18 treesize of output 22 [2022-11-19 07:26:04,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:04,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:04,422 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-19 07:26:04,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 07:26:04,450 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-19 07:26:04,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 07:26:04,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:04,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:26:04,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 07:26:04,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2022-11-19 07:26:04,746 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-19 07:26:04,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 39 [2022-11-19 07:26:04,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-19 07:26:04,946 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 07:26:04,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2022-11-19 07:26:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:04,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:05,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.base_5| (_ BitVec 32)) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_357 (_ BitVec 32)) (v_ArrVal_366 (_ BitVec 32)) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_365 (_ BitVec 32)) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_5|))) (bvslt (select (select (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse6 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_364))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_366)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_360) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_356) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_357)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_363) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_358) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_365)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (store .cse2 .cse3 (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse2 .cse3))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)))) is different from false [2022-11-19 07:26:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 07:26:05,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1712070240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:05,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824506224] [2022-11-19 07:26:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:05,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:05,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:05,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:05,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:26:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:05,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-19 07:26:05,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:05,988 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 18 treesize of output 19 [2022-11-19 07:26:06,107 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-19 07:26:06,108 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 56 treesize of output 94 [2022-11-19 07:26:06,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:26:06,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-19 07:26:06,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:26:06,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2022-11-19 07:26:06,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,282 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 32 treesize of output 22 [2022-11-19 07:26:06,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:26:06,340 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:26:06,340 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-19 07:26:06,531 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:26:06,565 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:26:06,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,610 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 24 treesize of output 21 [2022-11-19 07:26:06,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:26:06,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,644 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 26 treesize of output 23 [2022-11-19 07:26:06,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:06,677 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 26 treesize of output 23 [2022-11-19 07:26:06,682 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 18 treesize of output 22 [2022-11-19 07:26:06,712 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:26:06,713 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 13 [2022-11-19 07:26:06,748 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 18 treesize of output 22 [2022-11-19 07:26:07,341 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-19 07:26:07,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 68 [2022-11-19 07:26:07,431 INFO L321 Elim1Store]: treesize reduction 22, result has 62.1 percent of original size [2022-11-19 07:26:07,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 55 [2022-11-19 07:26:07,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:26:07,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 50 [2022-11-19 07:26:08,011 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:26:08,012 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 66 [2022-11-19 07:26:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:08,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:08,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:26:08,572 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 2 case distinctions, treesize of input 408 treesize of output 344 [2022-11-19 07:26:08,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:26:08,907 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 284 [2022-11-19 07:26:09,856 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_7| (_ BitVec 32)) (v_ArrVal_449 (_ BitVec 32)) (v_ArrVal_459 (_ BitVec 32)) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.offset_7| (_ BitVec 32))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse3 (let ((.cse11 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_7| v_ArrVal_462))) (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_459)))) (.cse4 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_7| v_arrayElimArr_16))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_465))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse5 (select .cse3 .cse4)) (.cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_7| v_arrayElimArr_17))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_449))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse0 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_7|)) (.cse1 (select .cse5 .cse6)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_7|))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_16 .cse0))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_17 .cse0))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_7|))) (not (bvsle .cse1 (_ bv100 32))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_17 .cse2))) (bvslt (select (select (store .cse3 .cse4 (store .cse5 .cse6 (bvadd (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_16 .cse2))))))))) is different from false [2022-11-19 07:26:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 07:26:10,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824506224] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:10,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 07:26:10,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 8, 9, 9] total 30 [2022-11-19 07:26:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807977596] [2022-11-19 07:26:10,821 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 07:26:10,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-19 07:26:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:26:10,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-19 07:26:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=574, Unknown=3, NotChecked=156, Total=870 [2022-11-19 07:26:10,823 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:13,742 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_356 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.base_5| (_ BitVec 32)) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_357 (_ BitVec 32)) (v_ArrVal_366 (_ BitVec 32)) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_365 (_ BitVec 32)) (v_ArrVal_358 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_5|))) (bvslt (select (select (let ((.cse0 (let ((.cse6 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_364))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_366)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_360) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_356) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_357)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_363) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_5| v_ArrVal_358) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_365)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (store .cse2 .cse3 (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse2 .cse3)))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)))) (= (_ bv100 32) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select .cse7 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~m~0#1.offset|) (= (bvadd (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|) (_ bv1 1)) (_ bv0 1)) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_7| (_ BitVec 32)) (v_ArrVal_449 (_ BitVec 32)) (v_ArrVal_459 (_ BitVec 32)) (v_ArrVal_462 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_465 (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.offset_7| (_ BitVec 32))) (let ((.cse11 (let ((.cse17 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_7| v_ArrVal_462))) (store .cse17 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_459)))) (.cse12 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_7| v_arrayElimArr_16))) (store .cse16 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_465))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse13 (select .cse11 .cse12)) (.cse14 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_7| v_arrayElimArr_17))) (store .cse15 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_449))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse8 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_7|)) (.cse9 (select .cse13 .cse14)) (.cse10 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_7|))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_16 .cse8))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_17 .cse8))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_7|))) (not (bvsle .cse9 (_ bv100 32))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_17 .cse10))) (bvslt (select (select (store .cse11 .cse12 (store .cse13 .cse14 (bvadd (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse9))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_16 .cse10)))))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv1 32)) (= |c_ULTIMATE.start_main_~m~0#1.base| (select .cse7 .cse5)) (forall ((v_ArrVal_261 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_270 (_ BitVec 32)) (v_ArrVal_265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_260 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.base_3| (_ BitVec 32)) (v_ArrVal_263 (_ BitVec 32))) (let ((.cse19 (let ((.cse23 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_268))) (store .cse23 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_263)))) (.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_265) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_271) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_261)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse21 (select .cse19 .cse20)) (.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_267) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_3| v_ArrVal_260) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_270)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (let ((.cse18 (select .cse21 .cse22))) (or (not (bvsle .cse18 (_ bv100 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_3|) (_ bv0 1))) (bvslt (select (select (store .cse19 .cse20 (store .cse21 .cse22 (bvadd .cse18 (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32))))))) (= |c_ULTIMATE.start_main_~m~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|))) is different from true [2022-11-19 07:26:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:16,551 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2022-11-19 07:26:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-19 07:26:16,555 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:26:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:16,557 INFO L225 Difference]: With dead ends: 54 [2022-11-19 07:26:16,557 INFO L226 Difference]: Without dead ends: 47 [2022-11-19 07:26:16,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=323, Invalid=1171, Unknown=4, NotChecked=308, Total=1806 [2022-11-19 07:26:16,559 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:16,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 134 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 123 Invalid, 0 Unknown, 197 Unchecked, 1.7s Time] [2022-11-19 07:26:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-19 07:26:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-11-19 07:26:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-11-19 07:26:16,571 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 12 [2022-11-19 07:26:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:16,572 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-11-19 07:26:16,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-11-19 07:26:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:26:16,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:16,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:16,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:16,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:16,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-19 07:26:17,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:17,181 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:26:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -433073797, now seen corresponding path program 1 times [2022-11-19 07:26:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:26:17,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988476301] [2022-11-19 07:26:17,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:17,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:26:17,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:26:17,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:26:17,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-19 07:26:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:17,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-19 07:26:17,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:17,475 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:26:17,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-19 07:26:17,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:26:17,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-19 07:26:17,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 07:26:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:17,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:17,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:26:17,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-19 07:26:17,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:17,710 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 17 treesize of output 21 [2022-11-19 07:26:17,750 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-19 07:26:17,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 07:26:17,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:26:17,873 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-19 07:26:17,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-19 07:26:17,989 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 07:26:17,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2022-11-19 07:26:17,995 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 6 treesize of output 4 [2022-11-19 07:26:18,036 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 29 treesize of output 17 [2022-11-19 07:26:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:18,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:18,173 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 36 treesize of output 24 [2022-11-19 07:26:18,406 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_549 (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.base_9| (_ BitVec 32)) (v_ArrVal_551 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_118 (_ BitVec 32)) (v_ArrVal_556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_548 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_554) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_552))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_9|))) (bvsle (select (select .cse0 v_arrayElimCell_118) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_551) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_548) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|) v_ArrVal_549)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (_ bv100 32)) (bvslt (select (select (store .cse0 v_arrayElimCell_118 v_ArrVal_556) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32))))) is different from false [2022-11-19 07:26:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 07:26:18,493 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:26:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988476301] [2022-11-19 07:26:18,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988476301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [71642020] [2022-11-19 07:26:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:18,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:26:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:26:18,495 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:26:18,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-19 07:26:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:18,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-19 07:26:18,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:18,883 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 18 treesize of output 19 [2022-11-19 07:26:18,919 INFO L321 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2022-11-19 07:26:18,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2022-11-19 07:26:18,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-11-19 07:26:18,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 07:26:18,968 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 18 treesize of output 19 [2022-11-19 07:26:19,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,161 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 46 [2022-11-19 07:26:19,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:26:19,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:19,198 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 [2022-11-19 07:26:19,206 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 41 treesize of output 37 [2022-11-19 07:26:19,252 INFO L321 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2022-11-19 07:26:19,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 07:26:19,265 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 18 treesize of output 22 [2022-11-19 07:26:19,453 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 35 treesize of output 23 [2022-11-19 07:26:19,460 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-19 07:26:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:19,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:26,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [71642020] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745679031] [2022-11-19 07:26:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:26,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:26,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:26,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:26,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 07:26:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:26,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-19 07:26:26,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:26,585 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 18 treesize of output 19 [2022-11-19 07:26:26,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-19 07:26:26,624 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 07:26:26,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-11-19 07:26:26,639 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 11 treesize of output 3 [2022-11-19 07:26:26,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:26:26,688 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:26:26,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-19 07:26:26,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:26,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:26,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2022-11-19 07:26:26,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:26,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:26,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2022-11-19 07:26:26,915 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 64 treesize of output 56 [2022-11-19 07:26:26,928 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 21 treesize of output 25 [2022-11-19 07:26:26,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:26,945 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 27 treesize of output 31 [2022-11-19 07:26:26,993 INFO L321 Elim1Store]: treesize reduction 12, result has 55.6 percent of original size [2022-11-19 07:26:26,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 07:26:27,029 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 28 treesize of output 32 [2022-11-19 07:26:27,451 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-19 07:26:27,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 41 [2022-11-19 07:26:27,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-19 07:26:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:26:27,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:27,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:26:27,565 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 2 case distinctions, treesize of input 77 treesize of output 74 [2022-11-19 07:26:27,713 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_13| (_ BitVec 32)) (v_ArrVal_736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (_ BitVec 32)) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_727 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.offset_13| (_ BitVec 32)) (v_ArrVal_735 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_21 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_13|)))) (bvsle (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)))) (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_13| v_ArrVal_733) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_735) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_13| v_arrayElimArr_21))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_730))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_13| v_ArrVal_727) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_13| v_ArrVal_736) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_731)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (_ bv100 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_13|))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_21 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_13|)))))) is different from false [2022-11-19 07:26:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-19 07:26:27,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745679031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:27,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 07:26:27,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6, 6, 6, 6] total 25 [2022-11-19 07:26:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132473170] [2022-11-19 07:26:27,880 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 07:26:27,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-19 07:26:27,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:26:27,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-19 07:26:27,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=417, Unknown=19, NotChecked=86, Total=600 [2022-11-19 07:26:27,882 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:34,030 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2022-11-19 07:26:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:26:34,032 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:26:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:34,033 INFO L225 Difference]: With dead ends: 59 [2022-11-19 07:26:34,033 INFO L226 Difference]: Without dead ends: 52 [2022-11-19 07:26:34,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=193, Invalid=784, Unknown=23, NotChecked=122, Total=1122 [2022-11-19 07:26:34,035 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:34,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 128 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 168 Unchecked, 2.2s Time] [2022-11-19 07:26:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-19 07:26:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2022-11-19 07:26:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 43 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-11-19 07:26:34,055 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 12 [2022-11-19 07:26:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:34,056 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-11-19 07:26:34,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2022-11-19 07:26:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:26:34,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:34,060 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:34,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-19 07:26:34,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:34,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:34,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 07:26:34,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:26:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1483344674, now seen corresponding path program 1 times [2022-11-19 07:26:34,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:26:34,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226759422] [2022-11-19 07:26:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:34,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:26:34,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:26:34,687 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:26:34,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-19 07:26:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:35,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-19 07:26:35,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:35,039 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 18 treesize of output 19 [2022-11-19 07:26:35,074 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:26:35,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-19 07:26:35,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-19 07:26:35,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:26:35,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,515 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 26 treesize of output 23 [2022-11-19 07:26:35,520 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 18 treesize of output 22 [2022-11-19 07:26:35,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,614 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-19 07:26:35,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 07:26:35,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,641 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 35 treesize of output 30 [2022-11-19 07:26:35,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 07:26:35,704 INFO L321 Elim1Store]: treesize reduction 22, result has 48.8 percent of original size [2022-11-19 07:26:35,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 07:26:35,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:35,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:26:36,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2022-11-19 07:26:36,119 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-19 07:26:36,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 39 [2022-11-19 07:26:36,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-11-19 07:26:36,216 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 07:26:36,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2022-11-19 07:26:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:26:36,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:36,725 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_824 (_ BitVec 32)) (v_ArrVal_823 (_ BitVec 32)) (v_ArrVal_829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (_ BitVec 32)) (v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_833 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| v_ArrVal_823) (_ bv0 1))) (bvslt (select (select (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse6 (store |c_#memory_int| v_ArrVal_823 v_ArrVal_825))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_822)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_823 v_ArrVal_835) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_823 v_ArrVal_829) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_823)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_823 v_ArrVal_833) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_823 v_ArrVal_827) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_824)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)))) is different from false [2022-11-19 07:26:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-19 07:26:37,398 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:26:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226759422] [2022-11-19 07:26:37,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226759422] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1853803670] [2022-11-19 07:26:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:37,399 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:26:37,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:26:37,403 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:26:37,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-11-19 07:26:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:37,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-19 07:26:37,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:37,750 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 18 treesize of output 19 [2022-11-19 07:26:37,850 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-19 07:26:37,851 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 56 treesize of output 94 [2022-11-19 07:26:37,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:37,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:37,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:26:37,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:37,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:37,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-19 07:26:38,059 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 68 treesize of output 37 [2022-11-19 07:26:38,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,070 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 32 treesize of output 22 [2022-11-19 07:26:38,111 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 18 treesize of output 19 [2022-11-19 07:26:38,161 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:26:38,161 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-19 07:26:38,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,531 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 26 treesize of output 23 [2022-11-19 07:26:38,536 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 18 treesize of output 22 [2022-11-19 07:26:38,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:26:38,561 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 18 treesize of output 22 [2022-11-19 07:26:38,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,577 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 24 treesize of output 21 [2022-11-19 07:26:38,602 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:26:38,602 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 13 [2022-11-19 07:26:38,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:38,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:26:38,921 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 64 treesize of output 44 [2022-11-19 07:26:38,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:26:38,979 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-19 07:26:38,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 39 [2022-11-19 07:26:38,987 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 37 treesize of output 25 [2022-11-19 07:26:39,321 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:26:39,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 34 [2022-11-19 07:26:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:26:39,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:40,202 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_17| (_ BitVec 32)) (v_ArrVal_917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_920 (_ BitVec 32)) (v_ArrVal_918 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_919 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_927 (_ BitVec 32)) (v_ArrVal_916 (_ BitVec 32))) (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse1 (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_17| v_ArrVal_919))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_927)))) (.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_17| v_ArrVal_918) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_17| v_ArrVal_922) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_920)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_17| v_ArrVal_917) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_17| v_ArrVal_924) |c_ULTIMATE.start_main_~list~0#1.base|) .cse5 v_ArrVal_916)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (let ((.cse0 (select .cse3 .cse4))) (or (not (bvsle .cse0 (_ bv100 32))) (bvslt (select (select (store .cse1 .cse2 (store .cse3 .cse4 (bvadd (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_17|))))))))) is different from false [2022-11-19 07:26:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-19 07:26:40,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1853803670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171896213] [2022-11-19 07:26:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:40,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:26:40,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:26:40,952 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:26:40,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 07:26:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:41,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-19 07:26:41,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:41,150 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:26:41,150 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-19 07:26:41,163 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 18 treesize of output 19 [2022-11-19 07:26:41,176 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 18 treesize of output 19 [2022-11-19 07:26:41,277 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-19 07:26:41,278 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 56 treesize of output 94 [2022-11-19 07:26:41,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:41,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:41,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:26:41,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:41,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:41,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-19 07:26:41,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:26:41,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2022-11-19 07:26:41,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:41,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:41,506 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 32 treesize of output 22 [2022-11-19 07:26:42,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:26:42,103 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:26:42,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:42,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:42,613 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-11-19 07:26:42,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2022-11-19 07:26:42,745 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:26:42,745 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 13 [2022-11-19 07:26:42,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:42,780 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 26 treesize of output 23 [2022-11-19 07:26:42,785 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 18 treesize of output 22 [2022-11-19 07:26:42,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:42,812 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 26 treesize of output 23 [2022-11-19 07:26:42,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:42,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:42,887 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 28 treesize of output 18 [2022-11-19 07:26:42,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:42,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:26:42,959 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 18 treesize of output 22 [2022-11-19 07:26:43,619 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-19 07:26:43,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 68 [2022-11-19 07:26:43,737 INFO L321 Elim1Store]: treesize reduction 22, result has 62.1 percent of original size [2022-11-19 07:26:43,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 55 [2022-11-19 07:26:43,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:26:43,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 50 [2022-11-19 07:26:44,458 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-19 07:26:44,458 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 66 [2022-11-19 07:26:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:26:44,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:45,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:26:45,100 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 2 case distinctions, treesize of input 408 treesize of output 344 [2022-11-19 07:26:45,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:26:45,363 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 284 [2022-11-19 07:26:46,199 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_19| (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.base_19| (_ BitVec 32)) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1031 (_ BitVec 32)) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1011 (_ BitVec 32)) (v_ArrVal_1021 (_ BitVec 32))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse1 (let ((.cse11 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_19| v_ArrVal_1027))) (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1031)))) (.cse2 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_19| v_arrayElimArr_28))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1021))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_19| v_arrayElimArr_29))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1011))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse0 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_19|)) (.cse6 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_19|)) (.cse5 (select .cse3 .cse4))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_29 .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_19|) (_ bv0 1))) (bvslt (select (select (store .cse1 .cse2 (store .cse3 .cse4 (bvadd (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse5))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_28 .cse6))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_28 .cse0))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_29 .cse6))) (not (bvsle .cse5 (_ bv100 32))))))))) is different from false [2022-11-19 07:26:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-19 07:26:48,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171896213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:26:48,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 07:26:48,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9, 9, 9, 9] total 29 [2022-11-19 07:26:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669835374] [2022-11-19 07:26:48,658 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 07:26:48,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-19 07:26:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:26:48,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-19 07:26:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=536, Unknown=5, NotChecked=150, Total=812 [2022-11-19 07:26:48,660 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:55,850 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 208 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 07:26:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:26:57,464 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-11-19 07:26:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 07:26:57,465 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 07:26:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:26:57,466 INFO L225 Difference]: With dead ends: 57 [2022-11-19 07:26:57,466 INFO L226 Difference]: Without dead ends: 55 [2022-11-19 07:26:57,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=252, Invalid=1014, Unknown=6, NotChecked=210, Total=1482 [2022-11-19 07:26:57,468 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:26:57,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 55 Unchecked, 1.8s Time] [2022-11-19 07:26:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-19 07:26:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2022-11-19 07:26:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 43 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2022-11-19 07:26:57,493 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 14 [2022-11-19 07:26:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:26:57,495 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2022-11-19 07:26:57,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:26:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2022-11-19 07:26:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:26:57,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:26:57,497 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:26:57,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:57,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:57,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-11-19 07:26:58,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 07:26:58,101 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:26:58,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:26:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1483342752, now seen corresponding path program 1 times [2022-11-19 07:26:58,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:26:58,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880655539] [2022-11-19 07:26:58,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:26:58,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:26:58,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:26:58,103 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:26:58,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-19 07:26:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:26:58,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-19 07:26:58,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:26:58,379 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 18 treesize of output 19 [2022-11-19 07:26:58,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:58,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:58,427 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:26:58,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-11-19 07:26:58,481 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:26:58,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-19 07:26:58,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:58,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:58,764 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 26 treesize of output 23 [2022-11-19 07:26:58,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:58,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:58,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:58,827 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-19 07:26:58,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 07:26:58,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:26:58,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:26:58,870 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-19 07:26:58,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 07:26:58,881 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 18 treesize of output 22 [2022-11-19 07:26:59,031 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 41 treesize of output 29 [2022-11-19 07:26:59,149 INFO L321 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-11-19 07:26:59,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 58 [2022-11-19 07:26:59,156 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 40 treesize of output 28 [2022-11-19 07:26:59,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:26:59,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 81 [2022-11-19 07:26:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:26:59,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:26:59,637 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 55 treesize of output 37 [2022-11-19 07:27:00,178 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (_ BitVec 32)) (v_ArrVal_1115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1113 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.base_21| (_ BitVec 32)) (v_ArrVal_1120 (_ BitVec 32)) (v_ArrVal_1117 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_232 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_21|))) (bvsgt (select (select (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_1117))) (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_1116))))) (store .cse0 v_arrayElimCell_232 (let ((.cse1 (select .cse0 v_arrayElimCell_232)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_1113) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_1115) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3 v_ArrVal_1120)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32)))) is different from false [2022-11-19 07:27:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-19 07:27:00,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:27:00,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880655539] [2022-11-19 07:27:00,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880655539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:27:00,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [831617481] [2022-11-19 07:27:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:27:00,453 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:27:00,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:27:00,454 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:27:00,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-11-19 07:27:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:27:00,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-19 07:27:00,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:27:00,865 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 18 treesize of output 19 [2022-11-19 07:27:01,071 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-19 07:27:01,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-11-19 07:27:01,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2022-11-19 07:27:01,252 INFO L321 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2022-11-19 07:27:01,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 86 [2022-11-19 07:27:01,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,349 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 32 treesize of output 22 [2022-11-19 07:27:01,379 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 [2022-11-19 07:27:01,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-19 07:27:01,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:27:01,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2022-11-19 07:27:01,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:01,534 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 32 treesize of output 22 [2022-11-19 07:27:01,570 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 18 treesize of output 19 [2022-11-19 07:27:01,620 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:27:01,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-19 07:27:02,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:02,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:02,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:27:02,026 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 18 treesize of output 22 [2022-11-19 07:27:02,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:02,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:02,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-11-19 07:27:02,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 07:27:02,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:02,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:02,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:02,098 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-19 07:27:02,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 07:27:02,137 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-19 07:27:02,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 07:27:02,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:02,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:27:02,344 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 49 treesize of output 33 [2022-11-19 07:27:02,378 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-11-19 07:27:02,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 39 [2022-11-19 07:27:02,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-11-19 07:27:02,461 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-19 07:27:02,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2022-11-19 07:27:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:27:02,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:27:02,852 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1204 (_ BitVec 32)) (v_ArrVal_1203 (_ BitVec 32)) (v_ArrVal_1206 (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.base_23| (_ BitVec 32)) (v_ArrVal_1215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1207 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvsgt (select (select (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse6 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_23| v_ArrVal_1209))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1204)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_23| v_ArrVal_1207) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_23| v_ArrVal_1212) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1206)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_23| v_ArrVal_1213) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_23| v_ArrVal_1215) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1203)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_23|))))) is different from false [2022-11-19 07:27:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-19 07:27:03,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [831617481] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:27:03,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967420161] [2022-11-19 07:27:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:27:03,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:27:03,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:27:03,352 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:27:03,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 07:27:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:27:03,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-19 07:27:03,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:27:03,570 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:27:03,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-19 07:27:03,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:27:03,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-19 07:27:03,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:03,627 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 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-19 07:27:03,636 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 30 treesize of output 30 [2022-11-19 07:27:03,645 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 [2022-11-19 07:27:03,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:03,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:03,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:27:04,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:27:04,041 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:27:04,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:04,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:04,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:27:04,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:04,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:04,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:27:04,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:04,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:04,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:04,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 07:27:04,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:04,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:27:04,202 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-19 07:27:04,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-19 07:27:04,253 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 18 treesize of output 22 [2022-11-19 07:27:04,264 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 18 treesize of output 22 [2022-11-19 07:27:04,800 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-19 07:27:04,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 61 [2022-11-19 07:27:04,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-11-19 07:27:04,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:04,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2022-11-19 07:27:04,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2022-11-19 07:27:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:27:04,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:27:05,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:05,255 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 2 case distinctions, treesize of input 299 treesize of output 256 [2022-11-19 07:27:05,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:05,519 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 239 treesize of output 216 [2022-11-19 07:27:06,169 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1301 (_ BitVec 32)) (v_ArrVal_1300 (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.base_25| (_ BitVec 32)) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~n~0#1.offset_25| (_ BitVec 32)) (v_ArrVal_1310 (_ BitVec 32)) (v_ArrVal_1305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_25|)) (.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_25|))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_37 .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_25|) (_ bv0 1))) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_38 .cse0))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_37 .cse1))) (bvsgt (select (select (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse7 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse2 (let ((.cse10 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_25| v_ArrVal_1305))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7 v_ArrVal_1310)))) (.cse3 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_25| v_arrayElimArr_37))) (store .cse9 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7 v_ArrVal_1300))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (store .cse2 .cse3 (let ((.cse4 (select .cse2 .cse3)) (.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_25| v_arrayElimArr_38))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7 v_ArrVal_1301))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (store .cse4 .cse5 (bvadd (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse4 .cse5))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv90 32)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_38 .cse1)))))) is different from false [2022-11-19 07:27:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-19 07:27:08,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967420161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:27:08,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 07:27:08,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 7, 7, 7] total 23 [2022-11-19 07:27:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154995397] [2022-11-19 07:27:08,057 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 07:27:08,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-19 07:27:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:27:08,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-19 07:27:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=288, Unknown=3, NotChecked=114, Total=506 [2022-11-19 07:27:08,058 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:27:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:27:11,526 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2022-11-19 07:27:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:27:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 07:27:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:27:11,531 INFO L225 Difference]: With dead ends: 61 [2022-11-19 07:27:11,531 INFO L226 Difference]: Without dead ends: 54 [2022-11-19 07:27:11,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=145, Invalid=416, Unknown=3, NotChecked=138, Total=702 [2022-11-19 07:27:11,532 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:27:11,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 93 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 70 Unchecked, 1.5s Time] [2022-11-19 07:27:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-19 07:27:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2022-11-19 07:27:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:27:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2022-11-19 07:27:11,550 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 14 [2022-11-19 07:27:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:27:11,550 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2022-11-19 07:27:11,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:27:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-11-19 07:27:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:27:11,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:27:11,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:27:11,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-19 07:27:11,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-19 07:27:11,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-11-19 07:27:12,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 07:27:12,153 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:27:12,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:27:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2110558044, now seen corresponding path program 2 times [2022-11-19 07:27:12,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:27:12,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114226069] [2022-11-19 07:27:12,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:27:12,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:27:12,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:27:12,155 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 07:27:12,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-19 07:27:12,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 07:27:12,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:27:12,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-19 07:27:12,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:27:12,635 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-19 07:27:12,635 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 56 treesize of output 94 [2022-11-19 07:27:12,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:12,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:12,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:27:12,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:12,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:12,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 38 [2022-11-19 07:27:12,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:27:12,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2022-11-19 07:27:12,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:12,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:12,856 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 32 treesize of output 22 [2022-11-19 07:27:12,890 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-19 07:27:12,891 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 1 case distinctions, treesize of input 9 treesize of output 19 [2022-11-19 07:27:12,908 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 18 treesize of output 19 [2022-11-19 07:27:12,919 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 18 treesize of output 19 [2022-11-19 07:27:13,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:27:13,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-19 07:27:13,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,399 INFO L321 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-11-19 07:27:13,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 95 [2022-11-19 07:27:13,471 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-19 07:27:13,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-19 07:27:13,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,510 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 28 treesize of output 18 [2022-11-19 07:27:13,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:27:13,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-19 07:27:13,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,571 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 18 treesize of output 22 [2022-11-19 07:27:13,740 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:27:13,763 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-19 07:27:13,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,796 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 26 treesize of output 23 [2022-11-19 07:27:13,800 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 18 treesize of output 22 [2022-11-19 07:27:13,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,825 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 26 treesize of output 23 [2022-11-19 07:27:13,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,841 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 24 treesize of output 21 [2022-11-19 07:27:13,868 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:27:13,868 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 13 [2022-11-19 07:27:13,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:13,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:27:13,917 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 18 treesize of output 22 [2022-11-19 07:27:14,393 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-19 07:27:14,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 68 [2022-11-19 07:27:14,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:27:14,470 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-19 07:27:14,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 39 [2022-11-19 07:27:14,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:14,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2022-11-19 07:27:14,752 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:27:14,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 34 [2022-11-19 07:27:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:27:14,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:27:15,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:15,642 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 2 case distinctions, treesize of input 408 treesize of output 344 [2022-11-19 07:27:15,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:15,970 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 284 [2022-11-19 07:27:16,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.base_27| (_ BitVec 32)) (v_ArrVal_1447 (_ BitVec 32)) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1462 (_ BitVec 32)) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1452 (_ BitVec 32))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse11 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1454))) (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1452)))) (.cse1 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_27| v_arrayElimArr_43))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1462))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_27| v_arrayElimArr_44))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1447))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse6 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_27|)) (.cse5 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_27|)) (.cse4 (select .cse2 .cse3))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_27|) (_ bv0 1))) (bvslt (select (select (store .cse0 .cse1 (store .cse2 .cse3 (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse4))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_44 .cse5))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_44 .cse6))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_43 .cse6))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_43 .cse5))) (not (bvsle .cse4 (_ bv100 32))))))))) is different from false [2022-11-19 07:27:24,325 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1433 (_ BitVec 32)) (v_ArrVal_1432 (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.offset_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_~n~0#1.base_28| (_ BitVec 32)) (v_ArrVal_1431 (_ BitVec 1)) (|v_ULTIMATE.start_main_~n~0#1.base_27| (_ BitVec 32)) (v_ArrVal_1447 (_ BitVec 32)) (v_ArrVal_1462 (_ BitVec 32)) (v_ArrVal_1430 (_ BitVec 32)) (v_ArrVal_1452 (_ BitVec 32)) (v_ArrVal_1441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1438 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_44 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse3 (let ((.cse11 (store (let ((.cse12 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_1434))) (store .cse12 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1433))) |v_ULTIMATE.start_main_~n~0#1.base_27| v_ArrVal_1454))) (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1452)))) (.cse4 (select (select (let ((.cse10 (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_1438) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_1444) |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1430)) |v_ULTIMATE.start_main_~n~0#1.base_27| v_arrayElimArr_43))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1462))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse5 (select .cse3 .cse4)) (.cse6 (select (select (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_1441) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_1435) |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1432)) |v_ULTIMATE.start_main_~n~0#1.base_27| v_arrayElimArr_44))) (store .cse7 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse8 v_ArrVal_1447))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse9))) (let ((.cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~n~0#1.offset_27|)) (.cse2 (select .cse5 .cse6)) (.cse0 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1.offset_27|))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_44 .cse0))) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_44 .cse1))) (not (= (_ bv0 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_28| v_ArrVal_1431) |v_ULTIMATE.start_main_~n~0#1.base_27|))) (not (bvsle .cse2 (_ bv100 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_28|))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_43 .cse1))) (bvslt (select (select (store .cse3 .cse4 (store .cse5 .cse6 (bvadd .cse2 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (_ bv110 32)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_43 .cse0))))))))) is different from false [2022-11-19 07:27:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-19 07:27:30,754 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:27:30,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114226069] [2022-11-19 07:27:30,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114226069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:27:30,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1286422369] [2022-11-19 07:27:30,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:27:30,754 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 07:27:30,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 07:27:30,755 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 07:27:30,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bc2d4b4-f538-43b0-b1e8-6cf6f1f00d5d/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-19 07:27:31,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 07:27:31,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:27:31,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-19 07:27:31,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:27:31,322 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 18 treesize of output 19 [2022-11-19 07:27:31,364 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-19 07:27:31,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-19 07:27:31,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,396 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 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-19 07:27:31,404 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 30 treesize of output 30 [2022-11-19 07:27:31,411 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 [2022-11-19 07:27:31,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-11-19 07:27:31,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-11-19 07:27:31,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:27:31,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-19 07:27:31,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,762 INFO L321 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2022-11-19 07:27:31,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 31 [2022-11-19 07:27:31,838 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-19 07:27:31,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-19 07:27:31,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:31,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-19 07:27:32,149 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-19 07:27:32,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:32,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:32,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:32,258 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-19 07:27:32,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2022-11-19 07:27:32,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:32,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 47 [2022-11-19 07:27:32,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:32,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:32,310 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 26 treesize of output 23 [2022-11-19 07:27:32,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:27:32,323 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 18 treesize of output 22 [2022-11-19 07:27:32,344 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 11 treesize of output 15 [2022-11-19 07:27:32,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:32,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:32,387 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-19 07:27:32,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-19 07:27:33,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:27:33,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-11-19 07:27:33,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2022-11-19 07:27:33,193 INFO L321 Elim1Store]: treesize reduction 120, result has 24.1 percent of original size [2022-11-19 07:27:33,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 64 [2022-11-19 07:27:33,198 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 33 [2022-11-19 07:27:33,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-19 07:27:39,776 INFO L321 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2022-11-19 07:27:39,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 56 [2022-11-19 07:27:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:27:39,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:27:40,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:40,251 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 426 treesize of output 414 [2022-11-19 07:27:47,457 WARN L233 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 38 DAG size of output: 32 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-19 07:27:47,457 INFO L321 Elim1Store]: treesize reduction 43, result has 51.7 percent of original size [2022-11-19 07:27:47,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1466 treesize of output 1427 [2022-11-19 07:27:50,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:50,980 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1419 treesize of output 1427 [2022-11-19 07:27:51,121 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 851 treesize of output 839 [2022-11-19 07:27:52,749 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 6 treesize of output 4 [2022-11-19 07:27:53,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-19 07:27:54,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:27:54,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-19 07:28:19,557 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-19 07:28:19,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 07:28:19,559 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 7055 treesize of output 6973