./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/res1o.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/res1o.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64693615f2d98484fbf4ccec390e9fe8d95f9d4648b0c6cc4a2e86f0656bfacf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:53:25,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:53:25,936 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:53:25,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:53:25,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:53:25,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:53:25,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:53:25,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:53:25,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:53:25,966 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:53:25,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:53:25,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:53:25,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:53:25,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:53:25,969 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:53:25,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:53:25,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:53:25,971 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:53:25,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:53:25,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:53:25,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:53:25,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:53:25,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:53:25,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:53:25,975 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:53:25,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:53:25,976 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:53:25,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:53:25,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:53:25,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:53:25,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:53:25,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:53:25,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:53:25,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:53:25,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:53:25,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:53:25,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:53:25,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:53:25,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:53:25,979 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:53:25,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:53:25,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:53:25,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64693615f2d98484fbf4ccec390e9fe8d95f9d4648b0c6cc4a2e86f0656bfacf [2023-11-29 04:53:26,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:53:26,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:53:26,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:53:26,223 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:53:26,223 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:53:26,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-fpi/res1o.c [2023-11-29 04:53:29,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:53:29,170 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:53:29,171 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/sv-benchmarks/c/array-fpi/res1o.c [2023-11-29 04:53:29,177 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/data/6177de456/01561b60944447d3a40e0d37b5d12611/FLAG01befcf28 [2023-11-29 04:53:29,189 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/data/6177de456/01561b60944447d3a40e0d37b5d12611 [2023-11-29 04:53:29,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:53:29,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:53:29,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:53:29,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:53:29,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:53:29,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da9527b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29, skipping insertion in model container [2023-11-29 04:53:29,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,224 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:53:29,344 WARN L240 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_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/sv-benchmarks/c/array-fpi/res1o.c[588,601] [2023-11-29 04:53:29,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:53:29,374 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:53:29,389 WARN L240 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_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/sv-benchmarks/c/array-fpi/res1o.c[588,601] [2023-11-29 04:53:29,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:53:29,414 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:53:29,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29 WrapperNode [2023-11-29 04:53:29,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:53:29,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:53:29,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:53:29,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:53:29,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,452 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-11-29 04:53:29,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:53:29,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:53:29,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:53:29,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:53:29,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,483 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 8, 6, 2, 2]. 40 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0, 0]. The 5 writes are split as follows [0, 0, 3, 1, 1]. [2023-11-29 04:53:29,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:53:29,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:53:29,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:53:29,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:53:29,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (1/1) ... [2023-11-29 04:53:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:53:29,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:29,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:53:29,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:53:29,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:53:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:53:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:53:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:53:29,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:53:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:53:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:53:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:53:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:53:29,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:53:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:53:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:53:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:53:29,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:53:29,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:53:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:53:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:53:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:53:29,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:53:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 04:53:29,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:53:29,673 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:53:29,675 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:53:29,832 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:53:29,866 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:53:29,867 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 04:53:29,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:53:29 BoogieIcfgContainer [2023-11-29 04:53:29,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:53:29,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:53:29,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:53:29,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:53:29,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:53:29" (1/3) ... [2023-11-29 04:53:29,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e94f825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:53:29, skipping insertion in model container [2023-11-29 04:53:29,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:53:29" (2/3) ... [2023-11-29 04:53:29,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e94f825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:53:29, skipping insertion in model container [2023-11-29 04:53:29,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:53:29" (3/3) ... [2023-11-29 04:53:29,878 INFO L112 eAbstractionObserver]: Analyzing ICFG res1o.c [2023-11-29 04:53:29,897 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:53:29,897 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:53:29,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:53:29,947 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@66566f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:53:29,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:53:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 04:53:29,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:29,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:29,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:29,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1804282323, now seen corresponding path program 1 times [2023-11-29 04:53:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135559927] [2023-11-29 04:53:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135559927] [2023-11-29 04:53:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135559927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:30,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:53:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:53:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118790431] [2023-11-29 04:53:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:30,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:53:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:30,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:53:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:53:30,173 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:30,204 INFO L93 Difference]: Finished difference Result 33 states and 51 transitions. [2023-11-29 04:53:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:53:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 [2023-11-29 04:53:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:30,214 INFO L225 Difference]: With dead ends: 33 [2023-11-29 04:53:30,214 INFO L226 Difference]: Without dead ends: 15 [2023-11-29 04:53:30,216 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 [2023-11-29 04:53:30,220 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:30,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:53:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-29 04:53:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-29 04:53:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-29 04:53:30,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 14 [2023-11-29 04:53:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:30,247 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-29 04:53:30,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-29 04:53:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 04:53:30,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:30,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:30,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:53:30,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:30,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2062269015, now seen corresponding path program 1 times [2023-11-29 04:53:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:30,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996403829] [2023-11-29 04:53:30,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:30,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:30,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996403829] [2023-11-29 04:53:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996403829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:53:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:53:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:53:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517237190] [2023-11-29 04:53:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:53:30,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:53:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:30,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:53:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:53:30,412 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:30,458 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-11-29 04:53:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:53:30,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 [2023-11-29 04:53:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:30,459 INFO L225 Difference]: With dead ends: 29 [2023-11-29 04:53:30,459 INFO L226 Difference]: Without dead ends: 19 [2023-11-29 04:53:30,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:53:30,462 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:30,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:53:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-29 04:53:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-29 04:53:30,468 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) [2023-11-29 04:53:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-29 04:53:30,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2023-11-29 04:53:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:30,469 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-29 04:53:30,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-29 04:53:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 04:53:30,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:30,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:30,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:53:30,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:30,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1610127347, now seen corresponding path program 1 times [2023-11-29 04:53:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:30,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162199715] [2023-11-29 04:53:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162199715] [2023-11-29 04:53:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162199715] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444390241] [2023-11-29 04:53:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:31,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:31,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:31,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:31,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:53:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:31,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 04:53:31,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:31,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:31,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:31,795 INFO L378 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 40 treesize of output 17 [2023-11-29 04:53:31,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 04:53:31,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:31,990 INFO L378 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 29 treesize of output 17 [2023-11-29 04:53:31,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-29 04:53:32,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:53:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:32,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:32,150 INFO L378 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 24 treesize of output 22 [2023-11-29 04:53:32,156 INFO L378 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 38 treesize of output 36 [2023-11-29 04:53:32,266 INFO L378 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 22 treesize of output 20 [2023-11-29 04:53:32,275 INFO L378 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 34 treesize of output 32 [2023-11-29 04:53:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444390241] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:32,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2023-11-29 04:53:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924694446] [2023-11-29 04:53:32,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:32,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 04:53:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:32,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 04:53:32,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:53:32,336 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:32,576 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-11-29 04:53:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:53:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 04:53:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:32,578 INFO L225 Difference]: With dead ends: 30 [2023-11-29 04:53:32,578 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 04:53:32,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2023-11-29 04:53:32,580 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:32,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 43 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:53:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 04:53:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-11-29 04:53:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-11-29 04:53:32,589 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2023-11-29 04:53:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:32,590 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-11-29 04:53:32,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-11-29 04:53:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:53:32,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:32,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:32,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:53:32,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:32,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:32,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1605583531, now seen corresponding path program 2 times [2023-11-29 04:53:32,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:32,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621371008] [2023-11-29 04:53:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:53:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:32,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621371008] [2023-11-29 04:53:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621371008] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:32,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703498807] [2023-11-29 04:53:32,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:53:32,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:32,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:32,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:32,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:53:33,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:53:33,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:53:33,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:53:33,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:53:33,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:53:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703498807] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:33,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:33,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-29 04:53:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886877066] [2023-11-29 04:53:33,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:33,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:53:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:33,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:53:33,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:53:33,114 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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) [2023-11-29 04:53:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:33,234 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2023-11-29 04:53:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:53:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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) Word has length 19 [2023-11-29 04:53:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:33,236 INFO L225 Difference]: With dead ends: 58 [2023-11-29 04:53:33,236 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 04:53:33,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:53:33,238 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:33,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 30 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:53:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 04:53:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2023-11-29 04:53:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-29 04:53:33,245 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2023-11-29 04:53:33,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:33,245 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-29 04:53:33,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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) [2023-11-29 04:53:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-29 04:53:33,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 04:53:33,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:33,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:33,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:53:33,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:33,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:33,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 676600642, now seen corresponding path program 3 times [2023-11-29 04:53:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715335460] [2023-11-29 04:53:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:53:33,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:33,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715335460] [2023-11-29 04:53:33,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715335460] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:33,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780801879] [2023-11-29 04:53:33,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:53:33,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:33,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:33,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:53:33,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 04:53:33,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:53:33,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:53:33,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:53:33,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:53:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780801879] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:33,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:33,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-29 04:53:33,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753481560] [2023-11-29 04:53:33,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:33,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:53:33,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:33,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:53:33,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:53:33,746 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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) [2023-11-29 04:53:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:33,836 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-11-29 04:53:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:53:33,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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) Word has length 20 [2023-11-29 04:53:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:33,837 INFO L225 Difference]: With dead ends: 30 [2023-11-29 04:53:33,838 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 04:53:33,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:53:33,839 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:33,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:53:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 04:53:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-29 04:53:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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) [2023-11-29 04:53:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-29 04:53:33,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2023-11-29 04:53:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:33,845 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-29 04:53:33,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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) [2023-11-29 04:53:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-29 04:53:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 04:53:33,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:33,846 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:33,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:53:34,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:34,047 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:34,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1086526679, now seen corresponding path program 4 times [2023-11-29 04:53:34,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944669213] [2023-11-29 04:53:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:35,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:35,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944669213] [2023-11-29 04:53:35,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944669213] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:35,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345328601] [2023-11-29 04:53:35,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:53:35,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:35,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:35,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:35,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:53:35,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:53:35,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:53:35,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-29 04:53:35,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:35,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:35,564 INFO L378 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 25 treesize of output 1 [2023-11-29 04:53:35,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2023-11-29 04:53:35,776 INFO L378 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 45 treesize of output 22 [2023-11-29 04:53:35,882 INFO L349 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2023-11-29 04:53:35,883 INFO L378 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 62 treesize of output 57 [2023-11-29 04:53:35,892 INFO L378 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 36 treesize of output 13 [2023-11-29 04:53:36,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:36,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:53:36,284 INFO L378 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 29 treesize of output 17 [2023-11-29 04:53:36,340 INFO L378 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 35 treesize of output 23 [2023-11-29 04:53:36,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:36,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2023-11-29 04:53:36,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:53:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:36,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:36,676 INFO L378 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 54 treesize of output 50 [2023-11-29 04:53:36,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:36,690 INFO L378 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 828 treesize of output 780 [2023-11-29 04:53:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345328601] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:37,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 43 [2023-11-29 04:53:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573852040] [2023-11-29 04:53:37,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:37,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 04:53:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 04:53:37,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1552, Unknown=0, NotChecked=0, Total=1806 [2023-11-29 04:53:37,116 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 43 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:38,785 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-11-29 04:53:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 04:53:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 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 22 [2023-11-29 04:53:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:38,787 INFO L225 Difference]: With dead ends: 53 [2023-11-29 04:53:38,787 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 04:53:38,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=661, Invalid=4031, Unknown=0, NotChecked=0, Total=4692 [2023-11-29 04:53:38,791 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 55 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:38,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 70 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:53:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 04:53:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2023-11-29 04:53:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-11-29 04:53:38,804 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 22 [2023-11-29 04:53:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:38,804 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-11-29 04:53:38,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-11-29 04:53:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 04:53:38,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:38,805 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:38,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:53:39,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:39,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:39,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash -657335055, now seen corresponding path program 5 times [2023-11-29 04:53:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101879445] [2023-11-29 04:53:39,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:53:39,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:39,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101879445] [2023-11-29 04:53:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101879445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:39,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106618616] [2023-11-29 04:53:39,113 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:53:39,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:39,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:39,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:39,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:53:39,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 04:53:39,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:53:39,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:53:39,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:53:39,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:53:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106618616] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:39,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-29 04:53:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059442050] [2023-11-29 04:53:39,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:39,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:53:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:53:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:53:39,334 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:39,486 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2023-11-29 04:53:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:53:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 23 [2023-11-29 04:53:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:39,489 INFO L225 Difference]: With dead ends: 87 [2023-11-29 04:53:39,489 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 04:53:39,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:53:39,490 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:39,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:53:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 04:53:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2023-11-29 04:53:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-11-29 04:53:39,504 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2023-11-29 04:53:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:39,504 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-11-29 04:53:39,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-11-29 04:53:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:53:39,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:39,505 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:39,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:53:39,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:39,706 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:39,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1314888036, now seen corresponding path program 6 times [2023-11-29 04:53:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849247013] [2023-11-29 04:53:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 04:53:39,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849247013] [2023-11-29 04:53:39,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849247013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421538141] [2023-11-29 04:53:39,827 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 04:53:39,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:39,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:39,828 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:39,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 04:53:39,924 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-29 04:53:39,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:53:39,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:53:39,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 04:53:39,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 04:53:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421538141] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:40,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:40,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-29 04:53:40,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137866758] [2023-11-29 04:53:40,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:40,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:53:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:40,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:53:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:53:40,038 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:40,147 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2023-11-29 04:53:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:53:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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 25 [2023-11-29 04:53:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:40,148 INFO L225 Difference]: With dead ends: 46 [2023-11-29 04:53:40,148 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 04:53:40,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:53:40,149 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:40,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:53:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 04:53:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2023-11-29 04:53:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-29 04:53:40,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2023-11-29 04:53:40,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:40,160 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-29 04:53:40,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-29 04:53:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:53:40,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:40,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:40,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:53:40,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:40,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:40,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1213009165, now seen corresponding path program 7 times [2023-11-29 04:53:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:40,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877684497] [2023-11-29 04:53:40,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:41,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:41,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877684497] [2023-11-29 04:53:41,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877684497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:41,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177158274] [2023-11-29 04:53:41,906 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 04:53:41,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:41,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:41,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:41,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:53:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:42,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 04:53:42,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:42,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:42,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:42,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:53:42,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:53:42,354 INFO L378 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 40 treesize of output 17 [2023-11-29 04:53:42,431 INFO L378 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 44 treesize of output 21 [2023-11-29 04:53:42,510 INFO L378 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 50 treesize of output 27 [2023-11-29 04:53:42,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:42,519 INFO L378 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 3 case distinctions, treesize of input 44 treesize of output 20 [2023-11-29 04:53:42,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:42,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:53:42,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:53:42,854 INFO L378 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 29 treesize of output 17 [2023-11-29 04:53:42,920 INFO L378 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 35 treesize of output 23 [2023-11-29 04:53:42,971 INFO L378 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 40 treesize of output 28 [2023-11-29 04:53:42,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:42,975 INFO L378 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 3 case distinctions, treesize of input 45 treesize of output 21 [2023-11-29 04:53:43,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:53:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:43,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:43,424 INFO L378 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 100 treesize of output 94 [2023-11-29 04:53:43,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:43,484 INFO L378 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 880114 treesize of output 839154 [2023-11-29 04:53:44,136 INFO L378 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 100 treesize of output 94 [2023-11-29 04:53:44,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:44,187 INFO L378 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 232870 treesize of output 222630 [2023-11-29 04:53:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177158274] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:44,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:44,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 53 [2023-11-29 04:53:44,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985291263] [2023-11-29 04:53:44,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:44,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-29 04:53:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:44,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-29 04:53:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=2460, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 04:53:44,396 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 53 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:45,627 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-11-29 04:53:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 04:53:45,628 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 04:53:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:45,629 INFO L225 Difference]: With dead ends: 47 [2023-11-29 04:53:45,629 INFO L226 Difference]: Without dead ends: 43 [2023-11-29 04:53:45,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=460, Invalid=3962, Unknown=0, NotChecked=0, Total=4422 [2023-11-29 04:53:45,632 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:45,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 107 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:53:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-29 04:53:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2023-11-29 04:53:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-29 04:53:45,642 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 26 [2023-11-29 04:53:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:45,643 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-29 04:53:45,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:45,643 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-29 04:53:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:53:45,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:45,644 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:45,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 04:53:45,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:45,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:45,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1071497813, now seen corresponding path program 8 times [2023-11-29 04:53:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036387075] [2023-11-29 04:53:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 04:53:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036387075] [2023-11-29 04:53:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036387075] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353819831] [2023-11-29 04:53:46,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:53:46,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:46,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:46,007 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:46,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 04:53:46,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:53:46,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:53:46,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:53:46,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 04:53:46,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 04:53:46,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353819831] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:46,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:46,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-29 04:53:46,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716459710] [2023-11-29 04:53:46,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:46,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:53:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:46,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:53:46,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:53:46,270 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:46,446 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2023-11-29 04:53:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:53:46,447 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 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 27 [2023-11-29 04:53:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:46,448 INFO L225 Difference]: With dead ends: 78 [2023-11-29 04:53:46,448 INFO L226 Difference]: Without dead ends: 44 [2023-11-29 04:53:46,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:53:46,450 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:46,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 31 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:53:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-29 04:53:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2023-11-29 04:53:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-29 04:53:46,467 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2023-11-29 04:53:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:46,467 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-29 04:53:46,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-29 04:53:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 04:53:46,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:46,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:46,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 04:53:46,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:46,669 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:46,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 560764674, now seen corresponding path program 9 times [2023-11-29 04:53:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745740057] [2023-11-29 04:53:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 04:53:46,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:46,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745740057] [2023-11-29 04:53:46,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745740057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:46,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687668710] [2023-11-29 04:53:46,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:53:46,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:46,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:46,818 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:46,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 04:53:46,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 04:53:46,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:53:46,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:53:46,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 04:53:47,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 04:53:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687668710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:47,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-29 04:53:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363161294] [2023-11-29 04:53:47,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:53:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:47,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:53:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:53:47,098 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:47,240 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-11-29 04:53:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:53:47,241 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 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 28 [2023-11-29 04:53:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:47,241 INFO L225 Difference]: With dead ends: 40 [2023-11-29 04:53:47,241 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 04:53:47,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:53:47,243 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:47,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 34 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:53:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 04:53:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 04:53:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-11-29 04:53:47,253 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2023-11-29 04:53:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:47,253 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-11-29 04:53:47,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:53:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-11-29 04:53:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 04:53:47,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:47,254 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:47,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-29 04:53:47,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 04:53:47,454 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:53:47,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1647923369, now seen corresponding path program 10 times [2023-11-29 04:53:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:53:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293925900] [2023-11-29 04:53:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:53:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:53:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293925900] [2023-11-29 04:53:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293925900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690850979] [2023-11-29 04:53:50,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:53:50,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:53:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:53:50,139 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:53:50,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 04:53:50,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:53:50,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:53:50,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-29 04:53:50,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:50,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:50,317 INFO L378 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 23 treesize of output 1 [2023-11-29 04:53:50,367 INFO L378 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 15 [2023-11-29 04:53:50,439 INFO L378 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 46 treesize of output 29 [2023-11-29 04:53:50,515 INFO L378 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 53 treesize of output 43 [2023-11-29 04:53:50,784 INFO L378 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 40 treesize of output 17 [2023-11-29 04:53:50,869 INFO L378 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 44 treesize of output 21 [2023-11-29 04:53:50,951 INFO L378 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 50 treesize of output 27 [2023-11-29 04:53:51,032 INFO L378 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 55 treesize of output 32 [2023-11-29 04:53:51,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:51,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 24 [2023-11-29 04:53:51,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:51,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:53:51,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:53:51,402 INFO L378 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 37 treesize of output 31 [2023-11-29 04:53:51,571 INFO L378 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 29 treesize of output 17 [2023-11-29 04:53:51,651 INFO L378 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 35 treesize of output 23 [2023-11-29 04:53:51,742 INFO L378 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 40 treesize of output 28 [2023-11-29 04:53:51,836 INFO L378 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 45 treesize of output 33 [2023-11-29 04:53:51,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:51,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 25 [2023-11-29 04:53:51,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:53:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:51,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:52,729 INFO L378 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 162 treesize of output 154 [2023-11-29 04:53:53,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:53:53,024 INFO L378 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 3693409970 treesize of output 3575969458 [2023-11-29 04:53:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:53:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690850979] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:53:54,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:53:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 69 [2023-11-29 04:53:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662818777] [2023-11-29 04:53:54,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:54,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-29 04:53:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:53:54,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-29 04:53:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=4155, Unknown=0, NotChecked=0, Total=4692 [2023-11-29 04:53:54,854 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:54:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:02,126 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2023-11-29 04:54:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-29 04:54:02,126 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 69 states have internal predecessors, (79), 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 30 [2023-11-29 04:54:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:02,127 INFO L225 Difference]: With dead ends: 99 [2023-11-29 04:54:02,127 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 04:54:02,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4043 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1709, Invalid=13791, Unknown=0, NotChecked=0, Total=15500 [2023-11-29 04:54:02,131 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:02,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 167 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 04:54:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 04:54:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2023-11-29 04:54:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:54:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2023-11-29 04:54:02,161 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 30 [2023-11-29 04:54:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:02,161 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2023-11-29 04:54:02,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:54:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2023-11-29 04:54:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:54:02,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:02,162 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:54:02,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 04:54:02,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 04:54:02,363 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:02,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash 474059377, now seen corresponding path program 11 times [2023-11-29 04:54:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:54:02,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612208554] [2023-11-29 04:54:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:02,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:54:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 04:54:02,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:54:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612208554] [2023-11-29 04:54:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612208554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:54:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405220475] [2023-11-29 04:54:02,552 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:54:02,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:54:02,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:54:02,554 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:54:02,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 04:54:02,906 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-29 04:54:02,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:54:02,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:54:02,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:54:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 04:54:03,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:54:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 04:54:03,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405220475] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:54:03,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:54:03,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-11-29 04:54:03,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414238611] [2023-11-29 04:54:03,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:54:03,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:54:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:54:03,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:54:03,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:54:03,125 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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) [2023-11-29 04:54:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:03,337 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2023-11-29 04:54:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:54:03,338 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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 31 [2023-11-29 04:54:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:03,339 INFO L225 Difference]: With dead ends: 111 [2023-11-29 04:54:03,339 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 04:54:03,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2023-11-29 04:54:03,340 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 82 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:03,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 29 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:54:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 04:54:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2023-11-29 04:54:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:54:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-11-29 04:54:03,372 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2023-11-29 04:54:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:03,372 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-11-29 04:54:03,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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) [2023-11-29 04:54:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-11-29 04:54:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:54:03,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:03,373 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:54:03,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-29 04:54:03,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 04:54:03,574 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:03,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1668404264, now seen corresponding path program 12 times [2023-11-29 04:54:03,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:54:03,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889059972] [2023-11-29 04:54:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:03,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:54:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 04:54:03,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:54:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889059972] [2023-11-29 04:54:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889059972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:54:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038101547] [2023-11-29 04:54:03,779 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 04:54:03,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:54:03,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:54:03,780 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:54:03,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 04:54:03,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-29 04:54:03,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:54:03,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:54:03,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:54:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 04:54:04,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:54:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 04:54:04,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038101547] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:54:04,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:54:04,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-11-29 04:54:04,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544870600] [2023-11-29 04:54:04,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:54:04,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:54:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:54:04,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:54:04,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:54:04,102 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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) [2023-11-29 04:54:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:04,265 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2023-11-29 04:54:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:54:04,265 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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 32 [2023-11-29 04:54:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:04,266 INFO L225 Difference]: With dead ends: 45 [2023-11-29 04:54:04,266 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 04:54:04,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2023-11-29 04:54:04,267 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:04,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 26 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:54:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 04:54:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 04:54:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:54:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-11-29 04:54:04,280 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2023-11-29 04:54:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:04,280 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-11-29 04:54:04,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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) [2023-11-29 04:54:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-11-29 04:54:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 04:54:04,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:04,281 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:54:04,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 04:54:04,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 04:54:04,482 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:54:04,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:04,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1356713459, now seen corresponding path program 13 times [2023-11-29 04:54:04,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:54:04,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657825430] [2023-11-29 04:54:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:04,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:54:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:54:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:54:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657825430] [2023-11-29 04:54:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657825430] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:54:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23204160] [2023-11-29 04:54:07,490 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 04:54:07,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:54:07,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:54:07,491 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:54:07,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 04:54:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:07,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 04:54:07,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:54:07,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:54:07,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:54:07,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:54:07,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:54:07,832 INFO L378 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 37 treesize of output 31 [2023-11-29 04:54:07,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:54:08,134 INFO L378 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 40 treesize of output 17 [2023-11-29 04:54:08,235 INFO L378 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 44 treesize of output 21 [2023-11-29 04:54:08,329 INFO L378 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 50 treesize of output 27 [2023-11-29 04:54:08,419 INFO L378 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 55 treesize of output 32 [2023-11-29 04:54:08,513 INFO L378 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 60 treesize of output 37 [2023-11-29 04:54:08,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:54:08,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 28 [2023-11-29 04:54:08,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:54:08,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:54:08,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:54:08,892 INFO L378 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 37 treesize of output 31 [2023-11-29 04:54:08,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:54:09,212 INFO L378 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 29 treesize of output 17 [2023-11-29 04:54:09,309 INFO L378 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 35 treesize of output 23 [2023-11-29 04:54:09,417 INFO L378 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 40 treesize of output 28 [2023-11-29 04:54:09,524 INFO L378 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 45 treesize of output 33 [2023-11-29 04:54:09,638 INFO L378 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 50 treesize of output 38 [2023-11-29 04:54:09,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:54:09,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 29 [2023-11-29 04:54:09,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:54:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:54:09,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:54:10,981 INFO L378 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 240 treesize of output 230 [2023-11-29 04:54:17,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:54:17,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67654496720380862 treesize of output 66387859325182910 [2023-11-29 04:54:57,800 WARN L293 SmtUtils]: Spent 39.65s on a formula simplification. DAG size of input: 139284 DAG size of output: 97 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:55:02,081 INFO L378 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 240 treesize of output 230 [2023-11-29 04:55:05,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:55:06,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 310645899165650 treesize of output 304836834262994 [2023-11-29 04:55:42,023 WARN L293 SmtUtils]: Spent 35.66s on a formula simplification. DAG size of input: 85378 DAG size of output: 102 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:55:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:55:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23204160] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:42,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:55:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 77 [2023-11-29 04:55:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872995666] [2023-11-29 04:55:42,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:42,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-11-29 04:55:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-11-29 04:55:42,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=5386, Unknown=0, NotChecked=0, Total=5852 [2023-11-29 04:55:42,530 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 77 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:51,147 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-11-29 04:55:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 04:55:51,147 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 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 34 [2023-11-29 04:55:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:51,148 INFO L225 Difference]: With dead ends: 61 [2023-11-29 04:55:51,148 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 04:55:51,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2802 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=747, Invalid=8955, Unknown=0, NotChecked=0, Total=9702 [2023-11-29 04:55:51,152 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:51,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 04:55:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 04:55:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2023-11-29 04:55:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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) [2023-11-29 04:55:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-11-29 04:55:51,175 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 34 [2023-11-29 04:55:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:51,175 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-11-29 04:55:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-11-29 04:55:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 04:55:51,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:51,176 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:51,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 04:55:51,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 04:55:51,376 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:51,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash -871479467, now seen corresponding path program 14 times [2023-11-29 04:55:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:51,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876662295] [2023-11-29 04:55:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 04:55:51,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876662295] [2023-11-29 04:55:51,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876662295] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:51,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942379175] [2023-11-29 04:55:51,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:55:51,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:51,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:51,866 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:51,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 04:55:51,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:55:51,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:55:51,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:55:51,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 04:55:52,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 04:55:52,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942379175] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:52,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:55:52,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2023-11-29 04:55:52,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820324026] [2023-11-29 04:55:52,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:52,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 04:55:52,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:52,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 04:55:52,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:55:52,869 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:53,558 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2023-11-29 04:55:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:55:53,559 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 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 35 [2023-11-29 04:55:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:53,559 INFO L225 Difference]: With dead ends: 98 [2023-11-29 04:55:53,559 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 04:55:53,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2023-11-29 04:55:53,561 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:53,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:55:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 04:55:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2023-11-29 04:55:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 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) [2023-11-29 04:55:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-11-29 04:55:53,584 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 35 [2023-11-29 04:55:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:53,584 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-11-29 04:55:53,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-11-29 04:55:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 04:55:53,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:53,585 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:53,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 04:55:53,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 04:55:53,785 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:53,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash -68025662, now seen corresponding path program 15 times [2023-11-29 04:55:53,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:53,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850362376] [2023-11-29 04:55:53,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 04:55:54,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:55:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850362376] [2023-11-29 04:55:54,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850362376] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:55:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647990284] [2023-11-29 04:55:54,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:55:54,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:55:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:55:54,319 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:55:54,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 04:55:54,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 04:55:54,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:55:54,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:55:54,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 04:55:54,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 04:55:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647990284] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:55,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:55:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2023-11-29 04:55:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289366715] [2023-11-29 04:55:55,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:55,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 04:55:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:55:55,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 04:55:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:55:55,456 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:56,184 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2023-11-29 04:55:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:55:56,184 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-29 04:55:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:56,185 INFO L225 Difference]: With dead ends: 50 [2023-11-29 04:55:56,185 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 04:55:56,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2023-11-29 04:55:56,186 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:56,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 27 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:55:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 04:55:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-29 04:55:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2023-11-29 04:55:56,203 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 36 [2023-11-29 04:55:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:56,204 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2023-11-29 04:55:56,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:55:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2023-11-29 04:55:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:55:56,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:56,204 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:56,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 04:55:56,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 04:55:56,405 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:55:56,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1707963945, now seen corresponding path program 16 times [2023-11-29 04:55:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:55:56,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008044327] [2023-11-29 04:55:56,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:55:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:56:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008044327] [2023-11-29 04:56:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008044327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:56:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748180359] [2023-11-29 04:56:03,126 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:56:03,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:56:03,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:56:03,127 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:56:03,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 04:56:03,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:56:03,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:56:03,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 133 conjunts are in the unsatisfiable core [2023-11-29 04:56:03,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:56:03,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:56:03,674 INFO L378 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 23 treesize of output 1 [2023-11-29 04:56:03,876 INFO L378 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 15 [2023-11-29 04:56:04,062 INFO L378 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 46 treesize of output 29 [2023-11-29 04:56:04,289 INFO L378 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 57 treesize of output 43 [2023-11-29 04:56:04,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2023-11-29 04:56:04,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2023-11-29 04:56:05,685 INFO L378 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 40 treesize of output 17 [2023-11-29 04:56:05,976 INFO L378 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 44 treesize of output 21 [2023-11-29 04:56:06,224 INFO L378 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 50 treesize of output 27 [2023-11-29 04:56:06,564 INFO L378 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 55 treesize of output 32 [2023-11-29 04:56:06,873 INFO L378 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 60 treesize of output 37 [2023-11-29 04:56:07,162 INFO L378 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 65 treesize of output 42 [2023-11-29 04:56:07,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:56:07,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:56:07,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 104 treesize of output 200 [2023-11-29 04:56:10,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:56:10,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:56:10,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 04:56:11,021 INFO L378 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 37 treesize of output 31 [2023-11-29 04:56:11,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:56:11,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2023-11-29 04:56:12,309 INFO L378 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 29 treesize of output 17 [2023-11-29 04:56:12,582 INFO L378 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 35 treesize of output 23 [2023-11-29 04:56:12,865 INFO L378 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 40 treesize of output 28 [2023-11-29 04:56:13,215 INFO L378 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 45 treesize of output 33 [2023-11-29 04:56:13,527 INFO L378 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 50 treesize of output 38 [2023-11-29 04:56:13,845 INFO L378 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 55 treesize of output 43 [2023-11-29 04:56:13,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:56:13,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 33 [2023-11-29 04:56:14,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 04:56:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:56:14,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:56:18,270 INFO L378 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 334 treesize of output 322 [2023-11-29 04:58:09,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 04:58:09,436 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 04:58:09,438 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 04:58:09,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 04:58:09,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 04:58:09,639 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:337) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) 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.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:230) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 74 more [2023-11-29 04:58:09,642 INFO L158 Benchmark]: Toolchain (without parser) took 280449.43ms. Allocated memory was 178.3MB in the beginning and 15.9GB in the end (delta: 15.7GB). Free memory was 140.8MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. [2023-11-29 04:58:09,642 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:58:09,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.06ms. Allocated memory is still 178.3MB. Free memory was 140.8MB in the beginning and 129.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:58:09,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.05ms. Allocated memory is still 178.3MB. Free memory was 129.3MB in the beginning and 128.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:58:09,643 INFO L158 Benchmark]: Boogie Preprocessor took 51.72ms. Allocated memory is still 178.3MB. Free memory was 128.3MB in the beginning and 125.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:58:09,643 INFO L158 Benchmark]: RCFGBuilder took 361.97ms. Allocated memory is still 178.3MB. Free memory was 125.2MB in the beginning and 110.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:58:09,643 INFO L158 Benchmark]: TraceAbstraction took 279770.68ms. Allocated memory was 178.3MB in the beginning and 15.9GB in the end (delta: 15.7GB). Free memory was 110.3MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. [2023-11-29 04:58:09,644 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.06ms. Allocated memory is still 178.3MB. Free memory was 140.8MB in the beginning and 129.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.05ms. Allocated memory is still 178.3MB. Free memory was 129.3MB in the beginning and 128.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.72ms. Allocated memory is still 178.3MB. Free memory was 128.3MB in the beginning and 125.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.97ms. Allocated memory is still 178.3MB. Free memory was 125.2MB in the beginning and 110.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 279770.68ms. Allocated memory was 178.3MB in the beginning and 15.9GB in the end (delta: 15.7GB). Free memory was 110.3MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/res1o.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64693615f2d98484fbf4ccec390e9fe8d95f9d4648b0c6cc4a2e86f0656bfacf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:58:11,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:58:11,983 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:58:11,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:58:11,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:58:12,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:58:12,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:58:12,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:58:12,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:58:12,026 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:58:12,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:58:12,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:58:12,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:58:12,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:58:12,029 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:58:12,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:58:12,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:58:12,031 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:58:12,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:58:12,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:58:12,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:58:12,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:58:12,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:58:12,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:58:12,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:58:12,035 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:58:12,035 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:58:12,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:58:12,036 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:58:12,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:58:12,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:58:12,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:58:12,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:58:12,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:58:12,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:58:12,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:58:12,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:58:12,039 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:58:12,039 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:58:12,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:58:12,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:58:12,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:58:12,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:58:12,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:58:12,041 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:58:12,041 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64693615f2d98484fbf4ccec390e9fe8d95f9d4648b0c6cc4a2e86f0656bfacf [2023-11-29 04:58:12,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:58:12,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:58:12,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:58:12,345 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:58:12,346 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:58:12,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/array-fpi/res1o.c [2023-11-29 04:58:15,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:58:15,304 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:58:15,304 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/sv-benchmarks/c/array-fpi/res1o.c [2023-11-29 04:58:15,311 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/data/cb81eaa26/5594c658d4bf439c91792a7338f778d5/FLAG6358b2d86 [2023-11-29 04:58:15,325 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/data/cb81eaa26/5594c658d4bf439c91792a7338f778d5 [2023-11-29 04:58:15,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:58:15,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:58:15,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:58:15,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:58:15,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:58:15,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1b0aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15, skipping insertion in model container [2023-11-29 04:58:15,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,358 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:58:15,517 WARN L240 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_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/sv-benchmarks/c/array-fpi/res1o.c[588,601] [2023-11-29 04:58:15,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:58:15,548 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:58:15,560 WARN L240 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_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/sv-benchmarks/c/array-fpi/res1o.c[588,601] [2023-11-29 04:58:15,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:58:15,586 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:58:15,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15 WrapperNode [2023-11-29 04:58:15,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:58:15,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:58:15,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:58:15,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:58:15,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,625 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-11-29 04:58:15,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:58:15,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:58:15,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:58:15,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:58:15,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,656 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 8, 6, 2, 2]. 40 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0, 0]. The 5 writes are split as follows [0, 0, 3, 1, 1]. [2023-11-29 04:58:15,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:58:15,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:58:15,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:58:15,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:58:15,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (1/1) ... [2023-11-29 04:58:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:58:15,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:58:15,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:58:15,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:58:15,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:58:15,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:58:15,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:58:15,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:58:15,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:58:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 04:58:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:58:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-11-29 04:58:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-11-29 04:58:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-11-29 04:58:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-11-29 04:58:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#4 [2023-11-29 04:58:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:58:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:58:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:58:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:58:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:58:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 04:58:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:58:15,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:58:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-11-29 04:58:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-11-29 04:58:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-11-29 04:58:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-11-29 04:58:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#4 [2023-11-29 04:58:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:58:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:58:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:58:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:58:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:58:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 04:58:15,853 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:58:15,855 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:58:16,047 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:58:16,083 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:58:16,083 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 04:58:16,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:58:16 BoogieIcfgContainer [2023-11-29 04:58:16,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:58:16,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:58:16,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:58:16,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:58:16,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:58:15" (1/3) ... [2023-11-29 04:58:16,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b160b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:58:16, skipping insertion in model container [2023-11-29 04:58:16,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:15" (2/3) ... [2023-11-29 04:58:16,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b160b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:58:16, skipping insertion in model container [2023-11-29 04:58:16,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:58:16" (3/3) ... [2023-11-29 04:58:16,102 INFO L112 eAbstractionObserver]: Analyzing ICFG res1o.c [2023-11-29 04:58:16,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:58:16,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:58:16,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:58:16,174 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@8f5b3fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:58:16,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:58:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 04:58:16,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:16,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:16,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:16,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1804282323, now seen corresponding path program 1 times [2023-11-29 04:58:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:16,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819417457] [2023-11-29 04:58:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:16,203 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 [2023-11-29 04:58:16,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:16,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 04:58:16,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:16,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:58:16,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:16,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:16,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819417457] [2023-11-29 04:58:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819417457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:16,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:16,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:58:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742653517] [2023-11-29 04:58:16,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:16,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:58:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:58:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:58:16,407 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:16,455 INFO L93 Difference]: Finished difference Result 33 states and 51 transitions. [2023-11-29 04:58:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:58:16,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 [2023-11-29 04:58:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:16,465 INFO L225 Difference]: With dead ends: 33 [2023-11-29 04:58:16,465 INFO L226 Difference]: Without dead ends: 15 [2023-11-29 04:58:16,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:58:16,472 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:16,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:58:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-29 04:58:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-29 04:58:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-29 04:58:16,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 14 [2023-11-29 04:58:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:16,504 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-29 04:58:16,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-29 04:58:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 04:58:16,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:16,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:16,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:16,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:16,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:16,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:16,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2062269015, now seen corresponding path program 1 times [2023-11-29 04:58:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085109824] [2023-11-29 04:58:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:16,707 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 [2023-11-29 04:58:16,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:16,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 04:58:16,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:16,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:58:16,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:16,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:16,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085109824] [2023-11-29 04:58:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085109824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:16,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:58:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257650242] [2023-11-29 04:58:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:16,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:58:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:58:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:58:16,920 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:17,026 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-11-29 04:58:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:58:17,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 [2023-11-29 04:58:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:17,028 INFO L225 Difference]: With dead ends: 29 [2023-11-29 04:58:17,028 INFO L226 Difference]: Without dead ends: 19 [2023-11-29 04:58:17,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:58:17,030 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:17,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 13 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:58:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-29 04:58:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-29 04:58:17,035 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) [2023-11-29 04:58:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-29 04:58:17,036 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2023-11-29 04:58:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:17,037 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-29 04:58:17,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-29 04:58:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 04:58:17,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:17,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:17,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:58:17,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:17,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:17,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1610127347, now seen corresponding path program 1 times [2023-11-29 04:58:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506004087] [2023-11-29 04:58:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:17,243 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 [2023-11-29 04:58:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:17,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 04:58:17,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:17,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 04:58:17,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:17,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:58:17,448 INFO L378 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 [2023-11-29 04:58:17,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:58:17,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:17,800 INFO L378 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 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-29 04:58:17,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:58:18,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:18,221 INFO L378 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 1 case distinctions, treesize of input 81 treesize of output 51 [2023-11-29 04:58:18,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:18,336 INFO L378 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 107 treesize of output 77 [2023-11-29 04:58:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:18,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:58:18,659 INFO L378 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 62 treesize of output 58 [2023-11-29 04:58:18,663 INFO L378 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 98 treesize of output 94 [2023-11-29 04:58:19,359 INFO L378 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 128 treesize of output 120 [2023-11-29 04:58:19,362 INFO L378 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 190 treesize of output 182 [2023-11-29 04:58:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:24,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:24,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506004087] [2023-11-29 04:58:24,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506004087] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:58:24,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:58:24,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-11-29 04:58:24,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659893799] [2023-11-29 04:58:24,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:58:24,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 04:58:24,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 04:58:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:58:24,033 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:25,196 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-11-29 04:58:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:58:25,197 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 04:58:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:25,198 INFO L225 Difference]: With dead ends: 30 [2023-11-29 04:58:25,198 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 04:58:25,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:58:25,200 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:25,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 58 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:58:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 04:58:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-11-29 04:58:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-11-29 04:58:25,208 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2023-11-29 04:58:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:25,209 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-11-29 04:58:25,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-11-29 04:58:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 04:58:25,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:25,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:25,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:58:25,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:25,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:25,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:25,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1605583531, now seen corresponding path program 2 times [2023-11-29 04:58:25,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:25,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456484176] [2023-11-29 04:58:25,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:58:25,412 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 [2023-11-29 04:58:25,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:25,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 04:58:25,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:25,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:58:25,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:58:25,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:58:25,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:58:25,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:58:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:58:26,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456484176] [2023-11-29 04:58:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456484176] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:58:26,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:58:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-11-29 04:58:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660479839] [2023-11-29 04:58:26,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:58:26,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:58:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:58:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:58:26,108 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:26,563 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2023-11-29 04:58:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:58:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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 19 [2023-11-29 04:58:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:26,565 INFO L225 Difference]: With dead ends: 53 [2023-11-29 04:58:26,565 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 04:58:26,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:58:26,567 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:26,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:58:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 04:58:26,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-11-29 04:58:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-29 04:58:26,573 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2023-11-29 04:58:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:26,574 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-29 04:58:26,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-29 04:58:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 04:58:26,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:26,575 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:26,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:26,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:26,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:26,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:26,776 INFO L85 PathProgramCache]: Analyzing trace with hash 676600642, now seen corresponding path program 3 times [2023-11-29 04:58:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707413696] [2023-11-29 04:58:26,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:58:26,777 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 [2023-11-29 04:58:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:26,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 04:58:26,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:26,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 04:58:26,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:58:26,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:58:26,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:58:27,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:58:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 04:58:27,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:27,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707413696] [2023-11-29 04:58:27,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707413696] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:58:27,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:58:27,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-29 04:58:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302898898] [2023-11-29 04:58:27,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:58:27,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:58:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:58:27,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:58:27,570 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:28,173 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2023-11-29 04:58:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:58:28,174 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 04:58:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:28,175 INFO L225 Difference]: With dead ends: 58 [2023-11-29 04:58:28,175 INFO L226 Difference]: Without dead ends: 43 [2023-11-29 04:58:28,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2023-11-29 04:58:28,176 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:28,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 24 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:58:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-29 04:58:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2023-11-29 04:58:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-11-29 04:58:28,187 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 20 [2023-11-29 04:58:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:28,187 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-11-29 04:58:28,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-11-29 04:58:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 04:58:28,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:28,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:28,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:28,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:28,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:28,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1086526679, now seen corresponding path program 4 times [2023-11-29 04:58:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594737321] [2023-11-29 04:58:28,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:58:28,390 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 [2023-11-29 04:58:28,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:28,391 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 04:58:28,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 04:58:28,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:58:28,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:58:28,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-29 04:58:28,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:28,620 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:58:28,622 INFO L378 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 [2023-11-29 04:58:28,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:58:28,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 04:58:29,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:29,230 INFO L378 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 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-29 04:58:29,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:29,377 INFO L378 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 1 case distinctions, treesize of input 81 treesize of output 51 [2023-11-29 04:58:29,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:58:29,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 04:58:30,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:30,202 INFO L378 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 1 case distinctions, treesize of input 109 treesize of output 79 [2023-11-29 04:58:30,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:30,347 INFO L378 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 1 case distinctions, treesize of input 165 treesize of output 135 [2023-11-29 04:58:30,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:30,500 INFO L378 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 275 treesize of output 245 [2023-11-29 04:58:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:30,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:58:31,606 INFO L378 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 202 treesize of output 190 [2023-11-29 04:58:31,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:31,639 INFO L378 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 1634 treesize of output 1570 [2023-11-29 04:58:39,603 INFO L378 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 820 treesize of output 772 [2023-11-29 04:58:39,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:39,657 INFO L378 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 6050 treesize of output 5794 [2023-11-29 04:58:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:45,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594737321] [2023-11-29 04:58:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594737321] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:58:45,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:58:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-11-29 04:58:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322899096] [2023-11-29 04:58:45,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:58:45,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 04:58:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:45,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 04:58:45,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2023-11-29 04:58:45,597 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:54,315 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2023-11-29 04:58:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 04:58:54,318 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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 22 [2023-11-29 04:58:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:54,318 INFO L225 Difference]: With dead ends: 46 [2023-11-29 04:58:54,318 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 04:58:54,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 04:58:54,320 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:54,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 58 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 04:58:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 04:58:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 04:58:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-29 04:58:54,326 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2023-11-29 04:58:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:54,326 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-29 04:58:54,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-29 04:58:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 04:58:54,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:54,327 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:54,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:58:54,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:54,528 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:54,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1405857176, now seen corresponding path program 5 times [2023-11-29 04:58:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678386085] [2023-11-29 04:58:54,529 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:58:54,529 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 [2023-11-29 04:58:54,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:54,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 04:58:54,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 (8)] Waiting until timeout for monitored process [2023-11-29 04:58:54,708 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 04:58:54,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:58:54,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:58:54,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:58:55,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:58:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:58:56,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:56,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678386085] [2023-11-29 04:58:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678386085] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:58:56,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:58:56,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-11-29 04:58:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555365754] [2023-11-29 04:58:56,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:58:56,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:58:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:56,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:58:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:58:56,193 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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) [2023-11-29 04:58:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:57,401 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2023-11-29 04:58:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:58:57,402 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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 24 [2023-11-29 04:58:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:57,403 INFO L225 Difference]: With dead ends: 68 [2023-11-29 04:58:57,403 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 04:58:57,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:58:57,404 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 81 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:57,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 30 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:58:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 04:58:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2023-11-29 04:58:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-11-29 04:58:57,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 24 [2023-11-29 04:58:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:57,414 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-11-29 04:58:57,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 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) [2023-11-29 04:58:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-11-29 04:58:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:58:57,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:57,415 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:57,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 (8)] Ended with exit code 0 [2023-11-29 04:58:57,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:57,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:58:57,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1213009165, now seen corresponding path program 6 times [2023-11-29 04:58:57,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:57,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122304727] [2023-11-29 04:58:57,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 04:58:57,617 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 [2023-11-29 04:58:57,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:57,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 04:58:57,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 04:58:57,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-29 04:58:57,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:58:57,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 04:58:57,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:57,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:58:57,909 INFO L378 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 [2023-11-29 04:58:58,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:58:58,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 04:58:58,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:58,389 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 04:58:58,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:58,881 INFO L378 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 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-29 04:58:59,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:59,150 INFO L378 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 1 case distinctions, treesize of input 81 treesize of output 51 [2023-11-29 04:58:59,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:58:59,335 INFO L378 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 1 case distinctions, treesize of input 109 treesize of output 79 [2023-11-29 04:58:59,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:58:59,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 04:59:00,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:59:00,149 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 04:59:00,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:59:00,726 INFO L378 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 1 case distinctions, treesize of input 165 treesize of output 135 [2023-11-29 04:59:01,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:59:01,060 INFO L378 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 1 case distinctions, treesize of input 277 treesize of output 247 [2023-11-29 04:59:01,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:59:01,308 INFO L378 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 1 case distinctions, treesize of input 501 treesize of output 471 [2023-11-29 04:59:01,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:59:01,533 INFO L378 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 947 treesize of output 917 [2023-11-29 04:59:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:59:01,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:59:05,712 INFO L378 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 562 treesize of output 534 [2023-11-29 04:59:05,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:59:05,796 INFO L378 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 98226 treesize of output 95666 [2023-11-29 05:00:04,102 WARN L293 SmtUtils]: Spent 13.70s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:00:40,442 INFO L378 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 4524 treesize of output 4300 [2023-11-29 05:00:40,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:00:40,603 INFO L378 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 747378 treesize of output 726898 [2023-11-29 05:00:56,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv1 32))) (.cse27 (let ((.cse415 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse415 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse415 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse34 (let ((.cse414 (bvadd .cse4 .cse27))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414)))) (.cse393 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (_ bv0 32) .cse393)) (.cse19 (let ((.cse413 (bvadd .cse34 .cse4))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413)))) (.cse9 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32))))) (or (let ((.cse166 (= (_ bv8 32) .cse393)) (.cse89 (= (bvadd (_ bv4 32) .cse393) (_ bv0 32))) (.cse1 (= (bvadd (_ bv8 32) .cse393) (_ bv0 32)))) (let ((.cse110 (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse403 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse399 (bvadd (let ((.cse400 (bvadd .cse4 (let ((.cse401 (bvadd .cse4 (let ((.cse402 (bvadd .cse19 .cse403))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402)))))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401)))))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))) .cse4))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399))) .cse9) (bvsle (let ((.cse404 (bvadd .cse4 (let ((.cse405 (bvadd .cse4 (let ((.cse406 (bvadd .cse4 (let ((.cse407 (bvadd .cse403 (let ((.cse408 (bvadd .cse34 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408)))))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407)))))) (concat ((_ extract 63 32) .cse406) ((_ extract 31 0) .cse406)))))) (concat ((_ extract 63 32) .cse405) ((_ extract 31 0) .cse405)))))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404))) .cse9))))) (.cse53 (not .cse1)) (.cse153 (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse394 (bvadd .cse4 (let ((.cse395 (bvadd .cse4 (let ((.cse396 (bvadd .cse4 (let ((.cse397 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse398 (bvadd .cse34 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398)))))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397)))))) (concat ((_ extract 63 32) .cse396) ((_ extract 31 0) .cse396)))))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395)))))) (concat ((_ extract 63 32) .cse394) ((_ extract 31 0) .cse394))) .cse9))) (.cse341 (= (_ bv4 32) .cse393)) (.cse92 (forall ((v_arrayElimCell_54 (_ BitVec 32))) (bvsle (let ((.cse387 (bvadd (let ((.cse388 (bvadd .cse4 (let ((.cse389 (bvadd .cse4 (let ((.cse390 (bvadd (let ((.cse391 (bvadd (let ((.cse392 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse4))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391))) .cse4))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390)))))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389)))))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388))) .cse4))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse9))) (.cse90 (forall ((v_arrayElimCell_56 (_ BitVec 32))) (bvsle (let ((.cse383 (bvadd (let ((.cse384 (bvadd .cse4 (let ((.cse385 (bvadd .cse4 (let ((.cse386 (bvadd .cse19 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386)))))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385)))))) (concat ((_ extract 63 32) .cse384) ((_ extract 31 0) .cse384))) .cse4))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383))) .cse9))) (.cse91 (not .cse89)) (.cse334 (not .cse166)) (.cse370 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse376 (let ((.cse382 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))))) (or (bvsle (let ((.cse371 (bvadd (let ((.cse372 (bvadd .cse4 (let ((.cse373 (bvadd .cse4 (let ((.cse374 (bvadd (let ((.cse375 (bvadd .cse376 .cse4))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375))) .cse4))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374)))))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373)))))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse4))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371))) .cse9) (bvsle (let ((.cse377 (bvadd (let ((.cse378 (bvadd .cse4 (let ((.cse379 (bvadd .cse4 (let ((.cse380 (bvadd (let ((.cse381 (bvadd .cse376 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse4))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380)))))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379)))))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))) .cse4))) (concat ((_ extract 63 32) .cse377) ((_ extract 31 0) .cse377))) .cse9)))))) (and (not .cse0) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse8 (let ((.cse26 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))))) (let ((.cse14 (let ((.cse25 (bvadd .cse8 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25)))) (.cse20 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse2 (bvadd (let ((.cse3 (bvadd .cse4 (let ((.cse5 (bvadd .cse4 (let ((.cse6 (bvadd (let ((.cse7 (bvadd .cse8 .cse4))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) .cse4))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6)))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse4))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) .cse9) (bvsle (let ((.cse10 (bvadd (let ((.cse11 (bvadd .cse4 (let ((.cse12 (bvadd .cse4 (let ((.cse13 (bvadd .cse14 .cse4))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13)))))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12)))))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))) .cse4))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse9) (bvsle (let ((.cse15 (bvadd (let ((.cse16 (bvadd .cse4 (let ((.cse17 (bvadd .cse4 (let ((.cse18 (bvadd .cse19 .cse20))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18)))))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17)))))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse4))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))) .cse9) (bvsle (let ((.cse21 (bvadd .cse4 (let ((.cse22 (bvadd .cse4 (let ((.cse23 (bvadd (let ((.cse24 (bvadd .cse14 .cse20))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))) .cse4))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23)))))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22)))))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))) .cse9)))))) (or (and (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse46 (let ((.cse52 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse35 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse40 (let ((.cse45 (bvadd .cse46 .cse35))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse32 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse28 (bvadd .cse4 (let ((.cse29 (bvadd .cse4 (let ((.cse30 (bvadd .cse4 (let ((.cse31 (bvadd .cse32 (let ((.cse33 (bvadd .cse34 .cse35))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33)))))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31)))))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30)))))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29)))))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28))) .cse9) (bvsle (let ((.cse36 (bvadd .cse4 (let ((.cse37 (bvadd .cse4 (let ((.cse38 (bvadd (let ((.cse39 (bvadd .cse40 .cse32))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39))) .cse4))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37)))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse9)))) (bvsle (let ((.cse41 (bvadd (let ((.cse42 (bvadd .cse4 (let ((.cse43 (bvadd .cse4 (let ((.cse44 (bvadd .cse40 .cse4))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44)))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43)))))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse4))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41))) .cse9))))) (bvsle (let ((.cse47 (bvadd (let ((.cse48 (bvadd .cse4 (let ((.cse49 (bvadd .cse4 (let ((.cse50 (bvadd (let ((.cse51 (bvadd .cse46 .cse4))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse4))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49)))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse4))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse9)))) (or .cse53 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse59 (let ((.cse71 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71)))) (.cse65 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse54 (bvadd (let ((.cse55 (bvadd .cse4 (let ((.cse56 (bvadd .cse4 (let ((.cse57 (bvadd (let ((.cse58 (bvadd .cse59 .cse4))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse4))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57)))))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56)))))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse4))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))) .cse9) (bvsle (let ((.cse60 (bvadd (let ((.cse61 (bvadd .cse4 (let ((.cse62 (bvadd .cse4 (let ((.cse63 (bvadd (let ((.cse64 (bvadd .cse59 .cse65))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) .cse4))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63)))))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62)))))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse4))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse9) (bvsle (let ((.cse66 (bvadd .cse4 (let ((.cse67 (bvadd .cse4 (let ((.cse68 (bvadd .cse4 (let ((.cse69 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse70 (bvadd .cse34 .cse65))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70)))))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69)))))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68)))))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67)))))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))) .cse9))))) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse77 (let ((.cse88 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))))) (let ((.cse82 (let ((.cse87 (bvadd .cse77 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))))) (or (bvsle (let ((.cse72 (bvadd (let ((.cse73 (bvadd .cse4 (let ((.cse74 (bvadd .cse4 (let ((.cse75 (bvadd (let ((.cse76 (bvadd .cse77 .cse4))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse4))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75)))))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74)))))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse4))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))) .cse9) (bvsle (let ((.cse78 (bvadd (let ((.cse79 (bvadd .cse4 (let ((.cse80 (bvadd .cse4 (let ((.cse81 (bvadd .cse82 .cse4))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80)))))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse4))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse9) (bvsle (let ((.cse83 (bvadd .cse4 (let ((.cse84 (bvadd .cse4 (let ((.cse85 (bvadd (let ((.cse86 (bvadd .cse82 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse4))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85)))))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84)))))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse9))))))) .cse89) (or (and (or .cse90 .cse91 .cse92) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse98 (let ((.cse109 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109)))) (.cse103 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse93 (bvadd (let ((.cse94 (bvadd .cse4 (let ((.cse95 (bvadd .cse4 (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse98 .cse4))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse4))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse4))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) .cse9) (bvsle (let ((.cse99 (bvadd (let ((.cse100 (bvadd .cse4 (let ((.cse101 (bvadd .cse4 (let ((.cse102 (bvadd .cse19 .cse103))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102)))))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101)))))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) .cse4))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))) .cse9) (bvsle (let ((.cse104 (bvadd .cse4 (let ((.cse105 (bvadd .cse4 (let ((.cse106 (bvadd (let ((.cse107 (bvadd (let ((.cse108 (bvadd .cse98 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) .cse103))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))) .cse4))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105)))))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse9))))) (or .cse53 .cse110 .cse92) (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse116 (let ((.cse133 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))))) (or (bvsle (let ((.cse111 (bvadd (let ((.cse112 (bvadd .cse4 (let ((.cse113 (bvadd .cse4 (let ((.cse114 (bvadd (let ((.cse115 (bvadd .cse116 .cse4))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse4))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114)))))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113)))))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))) .cse4))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse9) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse127 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse121 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse117 (bvadd (let ((.cse118 (bvadd .cse4 (let ((.cse119 (bvadd .cse4 (let ((.cse120 (bvadd .cse19 .cse121))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120)))))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119)))))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse4))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse9) (bvsle (let ((.cse122 (bvadd .cse4 (let ((.cse123 (bvadd .cse4 (let ((.cse124 (bvadd .cse4 (let ((.cse125 (bvadd .cse121 (let ((.cse126 (bvadd .cse34 .cse127))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126)))))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125)))))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124)))))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123)))))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse9) (bvsle (let ((.cse128 (bvadd .cse4 (let ((.cse129 (bvadd .cse4 (let ((.cse130 (bvadd (let ((.cse131 (bvadd (let ((.cse132 (bvadd .cse116 .cse127))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse121))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))) .cse4))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130)))))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129)))))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128))) .cse9))))))) (or (and (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse146 (let ((.cse152 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse140 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse138 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse134 (bvadd .cse4 (let ((.cse135 (bvadd .cse4 (let ((.cse136 (bvadd .cse4 (let ((.cse137 (bvadd .cse138 (let ((.cse139 (bvadd .cse34 .cse140))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139)))))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137)))))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136)))))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135)))))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))) .cse9) (bvsle (let ((.cse141 (bvadd .cse4 (let ((.cse142 (bvadd .cse4 (let ((.cse143 (bvadd (let ((.cse144 (bvadd (let ((.cse145 (bvadd .cse146 .cse140))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse138))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))) .cse4))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143)))))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142)))))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse9)))) (bvsle (let ((.cse147 (bvadd (let ((.cse148 (bvadd .cse4 (let ((.cse149 (bvadd .cse4 (let ((.cse150 (bvadd (let ((.cse151 (bvadd .cse146 .cse4))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151))) .cse4))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150)))))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149)))))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))) .cse4))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147))) .cse9)))) (or .cse53 .cse153 .cse92) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse159 (let ((.cse165 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165))))) (or (bvsle (let ((.cse154 (bvadd (let ((.cse155 (bvadd .cse4 (let ((.cse156 (bvadd .cse4 (let ((.cse157 (bvadd (let ((.cse158 (bvadd .cse159 .cse4))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))) .cse4))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157)))))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156)))))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse4))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))) .cse9) (bvsle (let ((.cse160 (bvadd .cse4 (let ((.cse161 (bvadd .cse4 (let ((.cse162 (bvadd (let ((.cse163 (bvadd (let ((.cse164 (bvadd .cse159 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse4))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161)))))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160))) .cse9)))))) .cse89)) .cse166) (or .cse53 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse172 (let ((.cse189 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189)))) (.cse183 ((_ sign_extend 32) v_arrayElimCell_56)) (.cse178 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse167 (bvadd (let ((.cse168 (bvadd .cse4 (let ((.cse169 (bvadd .cse4 (let ((.cse170 (bvadd (let ((.cse171 (bvadd .cse172 .cse4))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171))) .cse4))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170)))))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169)))))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse4))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))) .cse9) (bvsle (let ((.cse173 (bvadd (let ((.cse174 (bvadd .cse4 (let ((.cse175 (bvadd .cse4 (let ((.cse176 (bvadd (let ((.cse177 (bvadd .cse172 .cse178))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177))) .cse4))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176)))))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175)))))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))) .cse4))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173))) .cse9) (bvsle (let ((.cse179 (bvadd (let ((.cse180 (bvadd .cse4 (let ((.cse181 (bvadd .cse4 (let ((.cse182 (bvadd .cse19 .cse183))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182)))))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181)))))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) .cse4))) (concat ((_ extract 63 32) .cse179) ((_ extract 31 0) .cse179))) .cse9) (bvsle (let ((.cse184 (bvadd .cse4 (let ((.cse185 (bvadd .cse4 (let ((.cse186 (bvadd .cse4 (let ((.cse187 (bvadd .cse183 (let ((.cse188 (bvadd .cse34 .cse178))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188)))))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187)))))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186)))))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185)))))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse9))))) (or (let ((.cse333 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse335 (bvadd (let ((.cse336 (bvadd .cse4 (let ((.cse337 (bvadd .cse4 (let ((.cse338 (bvadd (let ((.cse339 (bvadd (let ((.cse340 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339))) .cse4))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338)))))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337)))))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse4))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335))) .cse9)))) (and (or (and (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse194 (let ((.cse199 (bvadd (let ((.cse200 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))))) (or (bvsle (let ((.cse190 (bvadd (let ((.cse191 (bvadd .cse4 (let ((.cse192 (bvadd .cse4 (let ((.cse193 (bvadd .cse194 .cse4))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192)))))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))) .cse4))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))) .cse9) (bvsle (let ((.cse195 (bvadd .cse4 (let ((.cse196 (bvadd .cse4 (let ((.cse197 (bvadd (let ((.cse198 (bvadd .cse194 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse4))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197)))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196)))))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse9))))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse207 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse212 (let ((.cse217 (bvadd (let ((.cse218 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))) .cse207))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse205 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse201 (bvadd .cse4 (let ((.cse202 (bvadd .cse4 (let ((.cse203 (bvadd .cse4 (let ((.cse204 (bvadd .cse205 (let ((.cse206 (bvadd .cse34 .cse207))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206)))))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204)))))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203)))))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202)))))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse9) (bvsle (let ((.cse208 (bvadd .cse4 (let ((.cse209 (bvadd .cse4 (let ((.cse210 (bvadd (let ((.cse211 (bvadd .cse212 .cse205))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211))) .cse4))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210)))))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209)))))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse9)))) (bvsle (let ((.cse213 (bvadd (let ((.cse214 (bvadd .cse4 (let ((.cse215 (bvadd .cse4 (let ((.cse216 (bvadd .cse212 .cse4))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216)))))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215)))))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse4))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))) .cse9))))) (or .cse53 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse225 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse219 (bvadd (let ((.cse220 (bvadd .cse4 (let ((.cse221 (bvadd .cse4 (let ((.cse222 (bvadd (let ((.cse223 (bvadd (let ((.cse224 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse225))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse4))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222)))))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221)))))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse4))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse9) (bvsle (let ((.cse226 (bvadd .cse4 (let ((.cse227 (bvadd .cse4 (let ((.cse228 (bvadd .cse4 (let ((.cse229 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse230 (bvadd .cse34 .cse225))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230)))))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229)))))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228)))))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227)))))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse9)))))) .cse89) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse235 (let ((.cse245 (bvadd (let ((.cse246 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245)))) (.cse240 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse231 (bvadd (let ((.cse232 (bvadd .cse4 (let ((.cse233 (bvadd .cse4 (let ((.cse234 (bvadd .cse235 .cse4))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234)))))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233)))))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232))) .cse4))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse9) (bvsle (let ((.cse236 (bvadd (let ((.cse237 (bvadd .cse4 (let ((.cse238 (bvadd .cse4 (let ((.cse239 (bvadd .cse19 .cse240))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239)))))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238)))))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237))) .cse4))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse9) (bvsle (let ((.cse241 (bvadd .cse4 (let ((.cse242 (bvadd .cse4 (let ((.cse243 (bvadd (let ((.cse244 (bvadd .cse235 .cse240))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244))) .cse4))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243)))))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242)))))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241))) .cse9))))) (or .cse53 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse258 ((_ sign_extend 32) v_arrayElimCell_56)) (.cse253 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse247 (bvadd (let ((.cse248 (bvadd .cse4 (let ((.cse249 (bvadd .cse4 (let ((.cse250 (bvadd (let ((.cse251 (bvadd (let ((.cse252 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse253))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251))) .cse4))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250)))))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249)))))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse4))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) .cse9) (bvsle (let ((.cse254 (bvadd (let ((.cse255 (bvadd .cse4 (let ((.cse256 (bvadd .cse4 (let ((.cse257 (bvadd .cse19 .cse258))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257)))))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256)))))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))) .cse4))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse9) (bvsle (let ((.cse259 (bvadd .cse4 (let ((.cse260 (bvadd .cse4 (let ((.cse261 (bvadd .cse4 (let ((.cse262 (bvadd .cse258 (let ((.cse263 (bvadd .cse34 .cse253))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263)))))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262)))))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261)))))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260)))))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))) .cse9))))) (or .cse166 (and (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse268 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse264 (bvadd (let ((.cse265 (bvadd .cse4 (let ((.cse266 (bvadd .cse4 (let ((.cse267 (bvadd .cse19 .cse268))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266)))))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))) .cse4))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse9) (bvsle (let ((.cse269 (bvadd .cse4 (let ((.cse270 (bvadd .cse4 (let ((.cse271 (bvadd (let ((.cse272 (bvadd (let ((.cse273 (bvadd (let ((.cse274 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273))) .cse268))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272))) .cse4))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271)))))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270)))))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))) .cse9))))) (or .cse53 .cse110) (or .cse90 .cse91) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse285 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse279 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse275 (bvadd (let ((.cse276 (bvadd .cse4 (let ((.cse277 (bvadd .cse4 (let ((.cse278 (bvadd .cse19 .cse279))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278)))))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277)))))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))) .cse4))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse9) (bvsle (let ((.cse280 (bvadd .cse4 (let ((.cse281 (bvadd .cse4 (let ((.cse282 (bvadd .cse4 (let ((.cse283 (bvadd .cse279 (let ((.cse284 (bvadd .cse34 .cse285))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284)))))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283)))))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282)))))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281)))))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))) .cse9) (bvsle (let ((.cse286 (bvadd .cse4 (let ((.cse287 (bvadd .cse4 (let ((.cse288 (bvadd (let ((.cse289 (bvadd (let ((.cse290 (bvadd (let ((.cse291 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse285))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse279))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))) .cse4))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287)))))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse9)))) (or (and (or .cse53 .cse153) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse292 (bvadd .cse4 (let ((.cse293 (bvadd .cse4 (let ((.cse294 (bvadd (let ((.cse295 (bvadd (let ((.cse296 (bvadd (let ((.cse297 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))) .cse4))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294)))))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293)))))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))) .cse9))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse304 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse302 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse298 (bvadd .cse4 (let ((.cse299 (bvadd .cse4 (let ((.cse300 (bvadd .cse4 (let ((.cse301 (bvadd .cse302 (let ((.cse303 (bvadd .cse34 .cse304))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301)))))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299)))))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse9) (bvsle (let ((.cse305 (bvadd .cse4 (let ((.cse306 (bvadd .cse4 (let ((.cse307 (bvadd (let ((.cse308 (bvadd (let ((.cse309 (bvadd (let ((.cse310 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse304))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))) .cse302))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))) .cse4))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307)))))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306)))))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305))) .cse9))))) .cse89))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse321 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse326 (let ((.cse331 (bvadd (let ((.cse332 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))) .cse321))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse315 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse311 (bvadd (let ((.cse312 (bvadd .cse4 (let ((.cse313 (bvadd .cse4 (let ((.cse314 (bvadd .cse19 .cse315))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314)))))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))) .cse4))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse9) (bvsle (let ((.cse316 (bvadd .cse4 (let ((.cse317 (bvadd .cse4 (let ((.cse318 (bvadd .cse4 (let ((.cse319 (bvadd .cse315 (let ((.cse320 (bvadd .cse34 .cse321))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319)))))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318)))))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317)))))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316))) .cse9) (bvsle (let ((.cse322 (bvadd .cse4 (let ((.cse323 (bvadd .cse4 (let ((.cse324 (bvadd (let ((.cse325 (bvadd .cse326 .cse315))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))) .cse4))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324)))))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323)))))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))) .cse9)))) (bvsle (let ((.cse327 (bvadd (let ((.cse328 (bvadd .cse4 (let ((.cse329 (bvadd .cse4 (let ((.cse330 (bvadd .cse326 .cse4))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330)))))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329)))))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328))) .cse4))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse9))))) (or .cse333 .cse90 .cse91) (or .cse333 .cse334))) .cse341) (or (not .cse341) .cse92) (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse363 (let ((.cse369 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369))))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse352 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse357 (let ((.cse362 (bvadd .cse363 .cse352))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse346 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse342 (bvadd (let ((.cse343 (bvadd .cse4 (let ((.cse344 (bvadd .cse4 (let ((.cse345 (bvadd .cse19 .cse346))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345)))))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344)))))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))) .cse4))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))) .cse9) (bvsle (let ((.cse347 (bvadd .cse4 (let ((.cse348 (bvadd .cse4 (let ((.cse349 (bvadd .cse4 (let ((.cse350 (bvadd .cse346 (let ((.cse351 (bvadd .cse34 .cse352))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350)))))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))))) (concat ((_ extract 63 32) .cse348) ((_ extract 31 0) .cse348)))))) (concat ((_ extract 63 32) .cse347) ((_ extract 31 0) .cse347))) .cse9) (bvsle (let ((.cse353 (bvadd .cse4 (let ((.cse354 (bvadd .cse4 (let ((.cse355 (bvadd (let ((.cse356 (bvadd .cse357 .cse346))) (concat ((_ extract 63 32) .cse356) ((_ extract 31 0) .cse356))) .cse4))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355)))))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354)))))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))) .cse9)))) (bvsle (let ((.cse358 (bvadd (let ((.cse359 (bvadd .cse4 (let ((.cse360 (bvadd .cse4 (let ((.cse361 (bvadd .cse357 .cse4))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361)))))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360)))))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359))) .cse4))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))) .cse9))))) (bvsle (let ((.cse364 (bvadd (let ((.cse365 (bvadd .cse4 (let ((.cse366 (bvadd .cse4 (let ((.cse367 (bvadd (let ((.cse368 (bvadd .cse363 .cse4))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))) .cse4))) (concat ((_ extract 63 32) .cse367) ((_ extract 31 0) .cse367)))))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366)))))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse4))) (concat ((_ extract 63 32) .cse364) ((_ extract 31 0) .cse364))) .cse9)))) (or .cse90 .cse91 .cse370) (or .cse334 .cse370)))) (not (bvslt (_ bv2 32) c_~N~0)) (and .cse0 (bvsle (let ((.cse409 (bvadd (let ((.cse410 (bvadd .cse4 (let ((.cse411 (bvadd .cse4 (let ((.cse412 (bvadd .cse4 .cse19))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412)))))) (concat ((_ extract 63 32) .cse411) ((_ extract 31 0) .cse411)))))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse4))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse9)))))) is different from false [2023-11-29 05:01:00,169 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv1 32))) (.cse27 (let ((.cse415 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse415 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse415 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse34 (let ((.cse414 (bvadd .cse4 .cse27))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414)))) (.cse393 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (= (_ bv0 32) .cse393)) (.cse19 (let ((.cse413 (bvadd .cse34 .cse4))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413)))) (.cse9 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32))))) (or (let ((.cse166 (= (_ bv8 32) .cse393)) (.cse89 (= (bvadd (_ bv4 32) .cse393) (_ bv0 32))) (.cse1 (= (bvadd (_ bv8 32) .cse393) (_ bv0 32)))) (let ((.cse110 (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse403 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse399 (bvadd (let ((.cse400 (bvadd .cse4 (let ((.cse401 (bvadd .cse4 (let ((.cse402 (bvadd .cse19 .cse403))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402)))))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401)))))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))) .cse4))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399))) .cse9) (bvsle (let ((.cse404 (bvadd .cse4 (let ((.cse405 (bvadd .cse4 (let ((.cse406 (bvadd .cse4 (let ((.cse407 (bvadd .cse403 (let ((.cse408 (bvadd .cse34 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408)))))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407)))))) (concat ((_ extract 63 32) .cse406) ((_ extract 31 0) .cse406)))))) (concat ((_ extract 63 32) .cse405) ((_ extract 31 0) .cse405)))))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404))) .cse9))))) (.cse53 (not .cse1)) (.cse153 (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse394 (bvadd .cse4 (let ((.cse395 (bvadd .cse4 (let ((.cse396 (bvadd .cse4 (let ((.cse397 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse398 (bvadd .cse34 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398)))))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397)))))) (concat ((_ extract 63 32) .cse396) ((_ extract 31 0) .cse396)))))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395)))))) (concat ((_ extract 63 32) .cse394) ((_ extract 31 0) .cse394))) .cse9))) (.cse341 (= (_ bv4 32) .cse393)) (.cse92 (forall ((v_arrayElimCell_54 (_ BitVec 32))) (bvsle (let ((.cse387 (bvadd (let ((.cse388 (bvadd .cse4 (let ((.cse389 (bvadd .cse4 (let ((.cse390 (bvadd (let ((.cse391 (bvadd (let ((.cse392 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse4))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391))) .cse4))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390)))))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389)))))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388))) .cse4))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse9))) (.cse90 (forall ((v_arrayElimCell_56 (_ BitVec 32))) (bvsle (let ((.cse383 (bvadd (let ((.cse384 (bvadd .cse4 (let ((.cse385 (bvadd .cse4 (let ((.cse386 (bvadd .cse19 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386)))))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385)))))) (concat ((_ extract 63 32) .cse384) ((_ extract 31 0) .cse384))) .cse4))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383))) .cse9))) (.cse91 (not .cse89)) (.cse334 (not .cse166)) (.cse370 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse376 (let ((.cse382 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))))) (or (bvsle (let ((.cse371 (bvadd (let ((.cse372 (bvadd .cse4 (let ((.cse373 (bvadd .cse4 (let ((.cse374 (bvadd (let ((.cse375 (bvadd .cse376 .cse4))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375))) .cse4))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374)))))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373)))))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse4))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371))) .cse9) (bvsle (let ((.cse377 (bvadd (let ((.cse378 (bvadd .cse4 (let ((.cse379 (bvadd .cse4 (let ((.cse380 (bvadd (let ((.cse381 (bvadd .cse376 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse4))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380)))))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379)))))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))) .cse4))) (concat ((_ extract 63 32) .cse377) ((_ extract 31 0) .cse377))) .cse9)))))) (and (not .cse0) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse8 (let ((.cse26 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))))) (let ((.cse14 (let ((.cse25 (bvadd .cse8 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25)))) (.cse20 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse2 (bvadd (let ((.cse3 (bvadd .cse4 (let ((.cse5 (bvadd .cse4 (let ((.cse6 (bvadd (let ((.cse7 (bvadd .cse8 .cse4))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) .cse4))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6)))))) (concat ((_ extract 63 32) .cse5) ((_ extract 31 0) .cse5)))))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse4))) (concat ((_ extract 63 32) .cse2) ((_ extract 31 0) .cse2))) .cse9) (bvsle (let ((.cse10 (bvadd (let ((.cse11 (bvadd .cse4 (let ((.cse12 (bvadd .cse4 (let ((.cse13 (bvadd .cse14 .cse4))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13)))))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12)))))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))) .cse4))) (concat ((_ extract 63 32) .cse10) ((_ extract 31 0) .cse10))) .cse9) (bvsle (let ((.cse15 (bvadd (let ((.cse16 (bvadd .cse4 (let ((.cse17 (bvadd .cse4 (let ((.cse18 (bvadd .cse19 .cse20))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18)))))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17)))))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse4))) (concat ((_ extract 63 32) .cse15) ((_ extract 31 0) .cse15))) .cse9) (bvsle (let ((.cse21 (bvadd .cse4 (let ((.cse22 (bvadd .cse4 (let ((.cse23 (bvadd (let ((.cse24 (bvadd .cse14 .cse20))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))) .cse4))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23)))))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22)))))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))) .cse9)))))) (or (and (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse46 (let ((.cse52 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse35 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse40 (let ((.cse45 (bvadd .cse46 .cse35))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse32 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse28 (bvadd .cse4 (let ((.cse29 (bvadd .cse4 (let ((.cse30 (bvadd .cse4 (let ((.cse31 (bvadd .cse32 (let ((.cse33 (bvadd .cse34 .cse35))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33)))))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31)))))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30)))))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29)))))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28))) .cse9) (bvsle (let ((.cse36 (bvadd .cse4 (let ((.cse37 (bvadd .cse4 (let ((.cse38 (bvadd (let ((.cse39 (bvadd .cse40 .cse32))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39))) .cse4))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37)))))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse9)))) (bvsle (let ((.cse41 (bvadd (let ((.cse42 (bvadd .cse4 (let ((.cse43 (bvadd .cse4 (let ((.cse44 (bvadd .cse40 .cse4))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44)))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43)))))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse4))) (concat ((_ extract 63 32) .cse41) ((_ extract 31 0) .cse41))) .cse9))))) (bvsle (let ((.cse47 (bvadd (let ((.cse48 (bvadd .cse4 (let ((.cse49 (bvadd .cse4 (let ((.cse50 (bvadd (let ((.cse51 (bvadd .cse46 .cse4))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse4))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49)))))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse4))) (concat ((_ extract 63 32) .cse47) ((_ extract 31 0) .cse47))) .cse9)))) (or .cse53 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse59 (let ((.cse71 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71)))) (.cse65 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse54 (bvadd (let ((.cse55 (bvadd .cse4 (let ((.cse56 (bvadd .cse4 (let ((.cse57 (bvadd (let ((.cse58 (bvadd .cse59 .cse4))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse4))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57)))))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56)))))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse4))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))) .cse9) (bvsle (let ((.cse60 (bvadd (let ((.cse61 (bvadd .cse4 (let ((.cse62 (bvadd .cse4 (let ((.cse63 (bvadd (let ((.cse64 (bvadd .cse59 .cse65))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) .cse4))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63)))))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62)))))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse4))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60))) .cse9) (bvsle (let ((.cse66 (bvadd .cse4 (let ((.cse67 (bvadd .cse4 (let ((.cse68 (bvadd .cse4 (let ((.cse69 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse70 (bvadd .cse34 .cse65))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70)))))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69)))))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68)))))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67)))))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66))) .cse9))))) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse77 (let ((.cse88 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))))) (let ((.cse82 (let ((.cse87 (bvadd .cse77 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))))) (or (bvsle (let ((.cse72 (bvadd (let ((.cse73 (bvadd .cse4 (let ((.cse74 (bvadd .cse4 (let ((.cse75 (bvadd (let ((.cse76 (bvadd .cse77 .cse4))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse4))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75)))))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74)))))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse4))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72))) .cse9) (bvsle (let ((.cse78 (bvadd (let ((.cse79 (bvadd .cse4 (let ((.cse80 (bvadd .cse4 (let ((.cse81 (bvadd .cse82 .cse4))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80)))))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse4))) (concat ((_ extract 63 32) .cse78) ((_ extract 31 0) .cse78))) .cse9) (bvsle (let ((.cse83 (bvadd .cse4 (let ((.cse84 (bvadd .cse4 (let ((.cse85 (bvadd (let ((.cse86 (bvadd .cse82 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86))) .cse4))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85)))))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84)))))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse9))))))) .cse89) (or (and (or .cse90 .cse91 .cse92) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse98 (let ((.cse109 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109)))) (.cse103 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse93 (bvadd (let ((.cse94 (bvadd .cse4 (let ((.cse95 (bvadd .cse4 (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse98 .cse4))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse4))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95)))))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse4))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) .cse9) (bvsle (let ((.cse99 (bvadd (let ((.cse100 (bvadd .cse4 (let ((.cse101 (bvadd .cse4 (let ((.cse102 (bvadd .cse19 .cse103))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102)))))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101)))))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) .cse4))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99))) .cse9) (bvsle (let ((.cse104 (bvadd .cse4 (let ((.cse105 (bvadd .cse4 (let ((.cse106 (bvadd (let ((.cse107 (bvadd (let ((.cse108 (bvadd .cse98 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) .cse103))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))) .cse4))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105)))))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse9))))) (or .cse53 .cse110 .cse92) (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse116 (let ((.cse133 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))))) (or (bvsle (let ((.cse111 (bvadd (let ((.cse112 (bvadd .cse4 (let ((.cse113 (bvadd .cse4 (let ((.cse114 (bvadd (let ((.cse115 (bvadd .cse116 .cse4))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse4))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114)))))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113)))))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))) .cse4))) (concat ((_ extract 63 32) .cse111) ((_ extract 31 0) .cse111))) .cse9) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse127 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse121 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse117 (bvadd (let ((.cse118 (bvadd .cse4 (let ((.cse119 (bvadd .cse4 (let ((.cse120 (bvadd .cse19 .cse121))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120)))))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119)))))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse4))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117))) .cse9) (bvsle (let ((.cse122 (bvadd .cse4 (let ((.cse123 (bvadd .cse4 (let ((.cse124 (bvadd .cse4 (let ((.cse125 (bvadd .cse121 (let ((.cse126 (bvadd .cse34 .cse127))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126)))))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125)))))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124)))))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123)))))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))) .cse9) (bvsle (let ((.cse128 (bvadd .cse4 (let ((.cse129 (bvadd .cse4 (let ((.cse130 (bvadd (let ((.cse131 (bvadd (let ((.cse132 (bvadd .cse116 .cse127))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse121))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131))) .cse4))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130)))))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129)))))) (concat ((_ extract 63 32) .cse128) ((_ extract 31 0) .cse128))) .cse9))))))) (or (and (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse146 (let ((.cse152 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse140 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse138 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse134 (bvadd .cse4 (let ((.cse135 (bvadd .cse4 (let ((.cse136 (bvadd .cse4 (let ((.cse137 (bvadd .cse138 (let ((.cse139 (bvadd .cse34 .cse140))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139)))))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137)))))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136)))))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135)))))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))) .cse9) (bvsle (let ((.cse141 (bvadd .cse4 (let ((.cse142 (bvadd .cse4 (let ((.cse143 (bvadd (let ((.cse144 (bvadd (let ((.cse145 (bvadd .cse146 .cse140))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse138))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144))) .cse4))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143)))))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142)))))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse9)))) (bvsle (let ((.cse147 (bvadd (let ((.cse148 (bvadd .cse4 (let ((.cse149 (bvadd .cse4 (let ((.cse150 (bvadd (let ((.cse151 (bvadd .cse146 .cse4))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151))) .cse4))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150)))))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149)))))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))) .cse4))) (concat ((_ extract 63 32) .cse147) ((_ extract 31 0) .cse147))) .cse9)))) (or .cse53 .cse153 .cse92) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse159 (let ((.cse165 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165))))) (or (bvsle (let ((.cse154 (bvadd (let ((.cse155 (bvadd .cse4 (let ((.cse156 (bvadd .cse4 (let ((.cse157 (bvadd (let ((.cse158 (bvadd .cse159 .cse4))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158))) .cse4))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157)))))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156)))))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse4))) (concat ((_ extract 63 32) .cse154) ((_ extract 31 0) .cse154))) .cse9) (bvsle (let ((.cse160 (bvadd .cse4 (let ((.cse161 (bvadd .cse4 (let ((.cse162 (bvadd (let ((.cse163 (bvadd (let ((.cse164 (bvadd .cse159 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse4))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161)))))) (concat ((_ extract 63 32) .cse160) ((_ extract 31 0) .cse160))) .cse9)))))) .cse89)) .cse166) (or .cse53 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse172 (let ((.cse189 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189)))) (.cse183 ((_ sign_extend 32) v_arrayElimCell_56)) (.cse178 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse167 (bvadd (let ((.cse168 (bvadd .cse4 (let ((.cse169 (bvadd .cse4 (let ((.cse170 (bvadd (let ((.cse171 (bvadd .cse172 .cse4))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171))) .cse4))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170)))))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169)))))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse4))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))) .cse9) (bvsle (let ((.cse173 (bvadd (let ((.cse174 (bvadd .cse4 (let ((.cse175 (bvadd .cse4 (let ((.cse176 (bvadd (let ((.cse177 (bvadd .cse172 .cse178))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177))) .cse4))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176)))))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175)))))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))) .cse4))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173))) .cse9) (bvsle (let ((.cse179 (bvadd (let ((.cse180 (bvadd .cse4 (let ((.cse181 (bvadd .cse4 (let ((.cse182 (bvadd .cse19 .cse183))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182)))))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181)))))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) .cse4))) (concat ((_ extract 63 32) .cse179) ((_ extract 31 0) .cse179))) .cse9) (bvsle (let ((.cse184 (bvadd .cse4 (let ((.cse185 (bvadd .cse4 (let ((.cse186 (bvadd .cse4 (let ((.cse187 (bvadd .cse183 (let ((.cse188 (bvadd .cse34 .cse178))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188)))))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187)))))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186)))))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185)))))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse9))))) (or (let ((.cse333 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse335 (bvadd (let ((.cse336 (bvadd .cse4 (let ((.cse337 (bvadd .cse4 (let ((.cse338 (bvadd (let ((.cse339 (bvadd (let ((.cse340 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339))) .cse4))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338)))))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337)))))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse4))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335))) .cse9)))) (and (or (and (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse194 (let ((.cse199 (bvadd (let ((.cse200 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))))) (or (bvsle (let ((.cse190 (bvadd (let ((.cse191 (bvadd .cse4 (let ((.cse192 (bvadd .cse4 (let ((.cse193 (bvadd .cse194 .cse4))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192)))))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))) .cse4))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190))) .cse9) (bvsle (let ((.cse195 (bvadd .cse4 (let ((.cse196 (bvadd .cse4 (let ((.cse197 (bvadd (let ((.cse198 (bvadd .cse194 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198))) .cse4))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197)))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196)))))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse9))))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse207 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse212 (let ((.cse217 (bvadd (let ((.cse218 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))) .cse207))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse205 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse201 (bvadd .cse4 (let ((.cse202 (bvadd .cse4 (let ((.cse203 (bvadd .cse4 (let ((.cse204 (bvadd .cse205 (let ((.cse206 (bvadd .cse34 .cse207))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206)))))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204)))))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203)))))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202)))))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse9) (bvsle (let ((.cse208 (bvadd .cse4 (let ((.cse209 (bvadd .cse4 (let ((.cse210 (bvadd (let ((.cse211 (bvadd .cse212 .cse205))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211))) .cse4))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210)))))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209)))))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))) .cse9)))) (bvsle (let ((.cse213 (bvadd (let ((.cse214 (bvadd .cse4 (let ((.cse215 (bvadd .cse4 (let ((.cse216 (bvadd .cse212 .cse4))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216)))))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215)))))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse4))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213))) .cse9))))) (or .cse53 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse225 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse219 (bvadd (let ((.cse220 (bvadd .cse4 (let ((.cse221 (bvadd .cse4 (let ((.cse222 (bvadd (let ((.cse223 (bvadd (let ((.cse224 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse225))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse4))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222)))))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221)))))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse4))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse9) (bvsle (let ((.cse226 (bvadd .cse4 (let ((.cse227 (bvadd .cse4 (let ((.cse228 (bvadd .cse4 (let ((.cse229 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse230 (bvadd .cse34 .cse225))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230)))))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229)))))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228)))))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227)))))) (concat ((_ extract 63 32) .cse226) ((_ extract 31 0) .cse226))) .cse9)))))) .cse89) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse235 (let ((.cse245 (bvadd (let ((.cse246 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245)))) (.cse240 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse231 (bvadd (let ((.cse232 (bvadd .cse4 (let ((.cse233 (bvadd .cse4 (let ((.cse234 (bvadd .cse235 .cse4))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234)))))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233)))))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232))) .cse4))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse9) (bvsle (let ((.cse236 (bvadd (let ((.cse237 (bvadd .cse4 (let ((.cse238 (bvadd .cse4 (let ((.cse239 (bvadd .cse19 .cse240))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239)))))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238)))))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237))) .cse4))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse9) (bvsle (let ((.cse241 (bvadd .cse4 (let ((.cse242 (bvadd .cse4 (let ((.cse243 (bvadd (let ((.cse244 (bvadd .cse235 .cse240))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244))) .cse4))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243)))))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242)))))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241))) .cse9))))) (or .cse53 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse258 ((_ sign_extend 32) v_arrayElimCell_56)) (.cse253 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse247 (bvadd (let ((.cse248 (bvadd .cse4 (let ((.cse249 (bvadd .cse4 (let ((.cse250 (bvadd (let ((.cse251 (bvadd (let ((.cse252 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse253))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251))) .cse4))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250)))))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249)))))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse4))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) .cse9) (bvsle (let ((.cse254 (bvadd (let ((.cse255 (bvadd .cse4 (let ((.cse256 (bvadd .cse4 (let ((.cse257 (bvadd .cse19 .cse258))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257)))))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256)))))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))) .cse4))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254))) .cse9) (bvsle (let ((.cse259 (bvadd .cse4 (let ((.cse260 (bvadd .cse4 (let ((.cse261 (bvadd .cse4 (let ((.cse262 (bvadd .cse258 (let ((.cse263 (bvadd .cse34 .cse253))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263)))))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262)))))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261)))))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260)))))) (concat ((_ extract 63 32) .cse259) ((_ extract 31 0) .cse259))) .cse9))))) (or .cse166 (and (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse268 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse264 (bvadd (let ((.cse265 (bvadd .cse4 (let ((.cse266 (bvadd .cse4 (let ((.cse267 (bvadd .cse19 .cse268))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266)))))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))) .cse4))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse9) (bvsle (let ((.cse269 (bvadd .cse4 (let ((.cse270 (bvadd .cse4 (let ((.cse271 (bvadd (let ((.cse272 (bvadd (let ((.cse273 (bvadd (let ((.cse274 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273))) .cse268))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272))) .cse4))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271)))))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270)))))) (concat ((_ extract 63 32) .cse269) ((_ extract 31 0) .cse269))) .cse9))))) (or .cse53 .cse110) (or .cse90 .cse91) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse285 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse279 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse275 (bvadd (let ((.cse276 (bvadd .cse4 (let ((.cse277 (bvadd .cse4 (let ((.cse278 (bvadd .cse19 .cse279))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278)))))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277)))))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))) .cse4))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) .cse9) (bvsle (let ((.cse280 (bvadd .cse4 (let ((.cse281 (bvadd .cse4 (let ((.cse282 (bvadd .cse4 (let ((.cse283 (bvadd .cse279 (let ((.cse284 (bvadd .cse34 .cse285))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284)))))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283)))))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282)))))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281)))))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))) .cse9) (bvsle (let ((.cse286 (bvadd .cse4 (let ((.cse287 (bvadd .cse4 (let ((.cse288 (bvadd (let ((.cse289 (bvadd (let ((.cse290 (bvadd (let ((.cse291 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse285))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse279))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289))) .cse4))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287)))))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse9)))) (or (and (or .cse53 .cse153) (or .cse1 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse292 (bvadd .cse4 (let ((.cse293 (bvadd .cse4 (let ((.cse294 (bvadd (let ((.cse295 (bvadd (let ((.cse296 (bvadd (let ((.cse297 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))) .cse4))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294)))))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293)))))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))) .cse9))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse304 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse302 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse298 (bvadd .cse4 (let ((.cse299 (bvadd .cse4 (let ((.cse300 (bvadd .cse4 (let ((.cse301 (bvadd .cse302 (let ((.cse303 (bvadd .cse34 .cse304))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301)))))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299)))))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) .cse9) (bvsle (let ((.cse305 (bvadd .cse4 (let ((.cse306 (bvadd .cse4 (let ((.cse307 (bvadd (let ((.cse308 (bvadd (let ((.cse309 (bvadd (let ((.cse310 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse304))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))) .cse302))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))) .cse4))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307)))))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306)))))) (concat ((_ extract 63 32) .cse305) ((_ extract 31 0) .cse305))) .cse9))))) .cse89))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse321 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse326 (let ((.cse331 (bvadd (let ((.cse332 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))) .cse321))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse315 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse311 (bvadd (let ((.cse312 (bvadd .cse4 (let ((.cse313 (bvadd .cse4 (let ((.cse314 (bvadd .cse19 .cse315))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314)))))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))) .cse4))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse9) (bvsle (let ((.cse316 (bvadd .cse4 (let ((.cse317 (bvadd .cse4 (let ((.cse318 (bvadd .cse4 (let ((.cse319 (bvadd .cse315 (let ((.cse320 (bvadd .cse34 .cse321))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319)))))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318)))))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317)))))) (concat ((_ extract 63 32) .cse316) ((_ extract 31 0) .cse316))) .cse9) (bvsle (let ((.cse322 (bvadd .cse4 (let ((.cse323 (bvadd .cse4 (let ((.cse324 (bvadd (let ((.cse325 (bvadd .cse326 .cse315))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325))) .cse4))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324)))))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323)))))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))) .cse9)))) (bvsle (let ((.cse327 (bvadd (let ((.cse328 (bvadd .cse4 (let ((.cse329 (bvadd .cse4 (let ((.cse330 (bvadd .cse326 .cse4))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330)))))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329)))))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328))) .cse4))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse9))))) (or .cse333 .cse90 .cse91) (or .cse333 .cse334))) .cse341) (or (not .cse341) .cse92) (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse363 (let ((.cse369 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369))))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse352 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse357 (let ((.cse362 (bvadd .cse363 .cse352))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse346 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse342 (bvadd (let ((.cse343 (bvadd .cse4 (let ((.cse344 (bvadd .cse4 (let ((.cse345 (bvadd .cse19 .cse346))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345)))))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344)))))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))) .cse4))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))) .cse9) (bvsle (let ((.cse347 (bvadd .cse4 (let ((.cse348 (bvadd .cse4 (let ((.cse349 (bvadd .cse4 (let ((.cse350 (bvadd .cse346 (let ((.cse351 (bvadd .cse34 .cse352))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350)))))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))))) (concat ((_ extract 63 32) .cse348) ((_ extract 31 0) .cse348)))))) (concat ((_ extract 63 32) .cse347) ((_ extract 31 0) .cse347))) .cse9) (bvsle (let ((.cse353 (bvadd .cse4 (let ((.cse354 (bvadd .cse4 (let ((.cse355 (bvadd (let ((.cse356 (bvadd .cse357 .cse346))) (concat ((_ extract 63 32) .cse356) ((_ extract 31 0) .cse356))) .cse4))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355)))))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354)))))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))) .cse9)))) (bvsle (let ((.cse358 (bvadd (let ((.cse359 (bvadd .cse4 (let ((.cse360 (bvadd .cse4 (let ((.cse361 (bvadd .cse357 .cse4))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361)))))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360)))))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359))) .cse4))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))) .cse9))))) (bvsle (let ((.cse364 (bvadd (let ((.cse365 (bvadd .cse4 (let ((.cse366 (bvadd .cse4 (let ((.cse367 (bvadd (let ((.cse368 (bvadd .cse363 .cse4))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))) .cse4))) (concat ((_ extract 63 32) .cse367) ((_ extract 31 0) .cse367)))))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366)))))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse4))) (concat ((_ extract 63 32) .cse364) ((_ extract 31 0) .cse364))) .cse9)))) (or .cse90 .cse91 .cse370) (or .cse334 .cse370)))) (not (bvslt (_ bv2 32) c_~N~0)) (and .cse0 (bvsle (let ((.cse409 (bvadd (let ((.cse410 (bvadd .cse4 (let ((.cse411 (bvadd .cse4 (let ((.cse412 (bvadd .cse4 .cse19))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412)))))) (concat ((_ extract 63 32) .cse411) ((_ extract 31 0) .cse411)))))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse4))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse9)))))) is different from true [2023-11-29 05:01:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 05:01:09,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:01:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122304727] [2023-11-29 05:01:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122304727] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:01:09,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:01:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2023-11-29 05:01:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217768461] [2023-11-29 05:01:09,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:01:09,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 05:01:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:01:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 05:01:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1280, Unknown=7, NotChecked=74, Total=1560 [2023-11-29 05:01:09,643 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 40 states, 40 states have (on average 1.25) internal successors, (50), 40 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) [2023-11-29 05:01:12,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:15,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:18,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:27,200 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse417 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select .cse417 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse416 (select .cse417 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (and (= ((_ extract 31 0) (_ bv0 64)) .cse0) (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (not (bvsle c_~N~0 (_ bv0 32))) (let ((.cse5 ((_ sign_extend 32) (_ bv1 32))) (.cse28 (concat .cse416 .cse0))) (let ((.cse35 (let ((.cse415 (bvadd .cse5 .cse28))) (concat ((_ extract 63 32) .cse415) ((_ extract 31 0) .cse415)))) (.cse394 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (= (_ bv0 32) .cse394)) (.cse20 (let ((.cse414 (bvadd .cse35 .cse5))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414)))) (.cse10 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32))))) (or (let ((.cse167 (= (_ bv8 32) .cse394)) (.cse90 (= (bvadd (_ bv4 32) .cse394) (_ bv0 32))) (.cse2 (= (bvadd (_ bv8 32) .cse394) (_ bv0 32)))) (let ((.cse111 (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse404 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse400 (bvadd (let ((.cse401 (bvadd .cse5 (let ((.cse402 (bvadd .cse5 (let ((.cse403 (bvadd .cse20 .cse404))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403)))))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402)))))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401))) .cse5))) (concat ((_ extract 63 32) .cse400) ((_ extract 31 0) .cse400))) .cse10) (bvsle (let ((.cse405 (bvadd .cse5 (let ((.cse406 (bvadd .cse5 (let ((.cse407 (bvadd .cse5 (let ((.cse408 (bvadd .cse404 (let ((.cse409 (bvadd .cse35 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409)))))) (concat ((_ extract 63 32) .cse408) ((_ extract 31 0) .cse408)))))) (concat ((_ extract 63 32) .cse407) ((_ extract 31 0) .cse407)))))) (concat ((_ extract 63 32) .cse406) ((_ extract 31 0) .cse406)))))) (concat ((_ extract 63 32) .cse405) ((_ extract 31 0) .cse405))) .cse10))))) (.cse54 (not .cse2)) (.cse154 (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse395 (bvadd .cse5 (let ((.cse396 (bvadd .cse5 (let ((.cse397 (bvadd .cse5 (let ((.cse398 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse399 (bvadd .cse35 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399)))))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398)))))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397)))))) (concat ((_ extract 63 32) .cse396) ((_ extract 31 0) .cse396)))))) (concat ((_ extract 63 32) .cse395) ((_ extract 31 0) .cse395))) .cse10))) (.cse342 (= (_ bv4 32) .cse394)) (.cse93 (forall ((v_arrayElimCell_54 (_ BitVec 32))) (bvsle (let ((.cse388 (bvadd (let ((.cse389 (bvadd .cse5 (let ((.cse390 (bvadd .cse5 (let ((.cse391 (bvadd (let ((.cse392 (bvadd (let ((.cse393 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse393) ((_ extract 31 0) .cse393))) .cse5))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse5))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391)))))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390)))))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389))) .cse5))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388))) .cse10))) (.cse91 (forall ((v_arrayElimCell_56 (_ BitVec 32))) (bvsle (let ((.cse384 (bvadd (let ((.cse385 (bvadd .cse5 (let ((.cse386 (bvadd .cse5 (let ((.cse387 (bvadd .cse20 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387)))))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386)))))) (concat ((_ extract 63 32) .cse385) ((_ extract 31 0) .cse385))) .cse5))) (concat ((_ extract 63 32) .cse384) ((_ extract 31 0) .cse384))) .cse10))) (.cse92 (not .cse90)) (.cse335 (not .cse167)) (.cse371 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse377 (let ((.cse383 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383))))) (or (bvsle (let ((.cse372 (bvadd (let ((.cse373 (bvadd .cse5 (let ((.cse374 (bvadd .cse5 (let ((.cse375 (bvadd (let ((.cse376 (bvadd .cse377 .cse5))) (concat ((_ extract 63 32) .cse376) ((_ extract 31 0) .cse376))) .cse5))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375)))))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374)))))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))) .cse5))) (concat ((_ extract 63 32) .cse372) ((_ extract 31 0) .cse372))) .cse10) (bvsle (let ((.cse378 (bvadd (let ((.cse379 (bvadd .cse5 (let ((.cse380 (bvadd .cse5 (let ((.cse381 (bvadd (let ((.cse382 (bvadd .cse377 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))) .cse5))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381)))))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380)))))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379))) .cse5))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))) .cse10)))))) (and (not .cse1) (or .cse2 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse9 (let ((.cse27 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse27) ((_ extract 31 0) .cse27))))) (let ((.cse15 (let ((.cse26 (bvadd .cse9 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26)))) (.cse21 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse3 (bvadd (let ((.cse4 (bvadd .cse5 (let ((.cse6 (bvadd .cse5 (let ((.cse7 (bvadd (let ((.cse8 (bvadd .cse9 .cse5))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse5))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7)))))) (concat ((_ extract 63 32) .cse6) ((_ extract 31 0) .cse6)))))) (concat ((_ extract 63 32) .cse4) ((_ extract 31 0) .cse4))) .cse5))) (concat ((_ extract 63 32) .cse3) ((_ extract 31 0) .cse3))) .cse10) (bvsle (let ((.cse11 (bvadd (let ((.cse12 (bvadd .cse5 (let ((.cse13 (bvadd .cse5 (let ((.cse14 (bvadd .cse15 .cse5))) (concat ((_ extract 63 32) .cse14) ((_ extract 31 0) .cse14)))))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13)))))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12))) .cse5))) (concat ((_ extract 63 32) .cse11) ((_ extract 31 0) .cse11))) .cse10) (bvsle (let ((.cse16 (bvadd (let ((.cse17 (bvadd .cse5 (let ((.cse18 (bvadd .cse5 (let ((.cse19 (bvadd .cse20 .cse21))) (concat ((_ extract 63 32) .cse19) ((_ extract 31 0) .cse19)))))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18)))))) (concat ((_ extract 63 32) .cse17) ((_ extract 31 0) .cse17))) .cse5))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))) .cse10) (bvsle (let ((.cse22 (bvadd .cse5 (let ((.cse23 (bvadd .cse5 (let ((.cse24 (bvadd (let ((.cse25 (bvadd .cse15 .cse21))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25))) .cse5))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24)))))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23)))))) (concat ((_ extract 63 32) .cse22) ((_ extract 31 0) .cse22))) .cse10)))))) (or (and (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse47 (let ((.cse53 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse36 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse41 (let ((.cse46 (bvadd .cse47 .cse36))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse33 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse29 (bvadd .cse5 (let ((.cse30 (bvadd .cse5 (let ((.cse31 (bvadd .cse5 (let ((.cse32 (bvadd .cse33 (let ((.cse34 (bvadd .cse35 .cse36))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34)))))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32)))))) (concat ((_ extract 63 32) .cse31) ((_ extract 31 0) .cse31)))))) (concat ((_ extract 63 32) .cse30) ((_ extract 31 0) .cse30)))))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29))) .cse10) (bvsle (let ((.cse37 (bvadd .cse5 (let ((.cse38 (bvadd .cse5 (let ((.cse39 (bvadd (let ((.cse40 (bvadd .cse41 .cse33))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40))) .cse5))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39)))))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37))) .cse10)))) (bvsle (let ((.cse42 (bvadd (let ((.cse43 (bvadd .cse5 (let ((.cse44 (bvadd .cse5 (let ((.cse45 (bvadd .cse41 .cse5))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45)))))) (concat ((_ extract 63 32) .cse44) ((_ extract 31 0) .cse44)))))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))) .cse5))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse10))))) (bvsle (let ((.cse48 (bvadd (let ((.cse49 (bvadd .cse5 (let ((.cse50 (bvadd .cse5 (let ((.cse51 (bvadd (let ((.cse52 (bvadd .cse47 .cse5))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse5))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51)))))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50)))))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))) .cse5))) (concat ((_ extract 63 32) .cse48) ((_ extract 31 0) .cse48))) .cse10)))) (or .cse54 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse60 (let ((.cse72 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse72) ((_ extract 31 0) .cse72)))) (.cse66 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse55 (bvadd (let ((.cse56 (bvadd .cse5 (let ((.cse57 (bvadd .cse5 (let ((.cse58 (bvadd (let ((.cse59 (bvadd .cse60 .cse5))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse5))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58)))))) (concat ((_ extract 63 32) .cse57) ((_ extract 31 0) .cse57)))))) (concat ((_ extract 63 32) .cse56) ((_ extract 31 0) .cse56))) .cse5))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse10) (bvsle (let ((.cse61 (bvadd (let ((.cse62 (bvadd .cse5 (let ((.cse63 (bvadd .cse5 (let ((.cse64 (bvadd (let ((.cse65 (bvadd .cse60 .cse66))) (concat ((_ extract 63 32) .cse65) ((_ extract 31 0) .cse65))) .cse5))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64)))))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63)))))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))) .cse5))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) .cse10) (bvsle (let ((.cse67 (bvadd .cse5 (let ((.cse68 (bvadd .cse5 (let ((.cse69 (bvadd .cse5 (let ((.cse70 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse71 (bvadd .cse35 .cse66))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71)))))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70)))))) (concat ((_ extract 63 32) .cse69) ((_ extract 31 0) .cse69)))))) (concat ((_ extract 63 32) .cse68) ((_ extract 31 0) .cse68)))))) (concat ((_ extract 63 32) .cse67) ((_ extract 31 0) .cse67))) .cse10))))) (or .cse2 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse78 (let ((.cse89 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))))) (let ((.cse83 (let ((.cse88 (bvadd .cse78 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))))) (or (bvsle (let ((.cse73 (bvadd (let ((.cse74 (bvadd .cse5 (let ((.cse75 (bvadd .cse5 (let ((.cse76 (bvadd (let ((.cse77 (bvadd .cse78 .cse5))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77))) .cse5))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76)))))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75)))))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse5))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse10) (bvsle (let ((.cse79 (bvadd (let ((.cse80 (bvadd .cse5 (let ((.cse81 (bvadd .cse5 (let ((.cse82 (bvadd .cse83 .cse5))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82)))))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81)))))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))) .cse5))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))) .cse10) (bvsle (let ((.cse84 (bvadd .cse5 (let ((.cse85 (bvadd .cse5 (let ((.cse86 (bvadd (let ((.cse87 (bvadd .cse83 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse87) ((_ extract 31 0) .cse87))) .cse5))) (concat ((_ extract 63 32) .cse86) ((_ extract 31 0) .cse86)))))) (concat ((_ extract 63 32) .cse85) ((_ extract 31 0) .cse85)))))) (concat ((_ extract 63 32) .cse84) ((_ extract 31 0) .cse84))) .cse10))))))) .cse90) (or (and (or .cse91 .cse92 .cse93) (or .cse2 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse99 (let ((.cse110 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110)))) (.cse104 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse94 (bvadd (let ((.cse95 (bvadd .cse5 (let ((.cse96 (bvadd .cse5 (let ((.cse97 (bvadd (let ((.cse98 (bvadd .cse99 .cse5))) (concat ((_ extract 63 32) .cse98) ((_ extract 31 0) .cse98))) .cse5))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97)))))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96)))))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))) .cse5))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse10) (bvsle (let ((.cse100 (bvadd (let ((.cse101 (bvadd .cse5 (let ((.cse102 (bvadd .cse5 (let ((.cse103 (bvadd .cse20 .cse104))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103)))))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102)))))) (concat ((_ extract 63 32) .cse101) ((_ extract 31 0) .cse101))) .cse5))) (concat ((_ extract 63 32) .cse100) ((_ extract 31 0) .cse100))) .cse10) (bvsle (let ((.cse105 (bvadd .cse5 (let ((.cse106 (bvadd .cse5 (let ((.cse107 (bvadd (let ((.cse108 (bvadd (let ((.cse109 (bvadd .cse99 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse104))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) .cse5))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107)))))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse10))))) (or .cse54 .cse111 .cse93) (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse117 (let ((.cse134 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse134) ((_ extract 31 0) .cse134))))) (or (bvsle (let ((.cse112 (bvadd (let ((.cse113 (bvadd .cse5 (let ((.cse114 (bvadd .cse5 (let ((.cse115 (bvadd (let ((.cse116 (bvadd .cse117 .cse5))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse5))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115)))))) (concat ((_ extract 63 32) .cse114) ((_ extract 31 0) .cse114)))))) (concat ((_ extract 63 32) .cse113) ((_ extract 31 0) .cse113))) .cse5))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112))) .cse10) (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse128 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse122 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse118 (bvadd (let ((.cse119 (bvadd .cse5 (let ((.cse120 (bvadd .cse5 (let ((.cse121 (bvadd .cse20 .cse122))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120)))))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) .cse5))) (concat ((_ extract 63 32) .cse118) ((_ extract 31 0) .cse118))) .cse10) (bvsle (let ((.cse123 (bvadd .cse5 (let ((.cse124 (bvadd .cse5 (let ((.cse125 (bvadd .cse5 (let ((.cse126 (bvadd .cse122 (let ((.cse127 (bvadd .cse35 .cse128))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127)))))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126)))))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125)))))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124)))))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))) .cse10) (bvsle (let ((.cse129 (bvadd .cse5 (let ((.cse130 (bvadd .cse5 (let ((.cse131 (bvadd (let ((.cse132 (bvadd (let ((.cse133 (bvadd .cse117 .cse128))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse122))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse5))) (concat ((_ extract 63 32) .cse131) ((_ extract 31 0) .cse131)))))) (concat ((_ extract 63 32) .cse130) ((_ extract 31 0) .cse130)))))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129))) .cse10))))))) (or (and (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse147 (let ((.cse153 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse141 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse139 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse135 (bvadd .cse5 (let ((.cse136 (bvadd .cse5 (let ((.cse137 (bvadd .cse5 (let ((.cse138 (bvadd .cse139 (let ((.cse140 (bvadd .cse35 .cse141))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138)))))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137)))))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136)))))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse10) (bvsle (let ((.cse142 (bvadd .cse5 (let ((.cse143 (bvadd .cse5 (let ((.cse144 (bvadd (let ((.cse145 (bvadd (let ((.cse146 (bvadd .cse147 .cse141))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146))) .cse139))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse5))) (concat ((_ extract 63 32) .cse144) ((_ extract 31 0) .cse144)))))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143)))))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142))) .cse10)))) (bvsle (let ((.cse148 (bvadd (let ((.cse149 (bvadd .cse5 (let ((.cse150 (bvadd .cse5 (let ((.cse151 (bvadd (let ((.cse152 (bvadd .cse147 .cse5))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))) .cse5))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151)))))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150)))))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) .cse5))) (concat ((_ extract 63 32) .cse148) ((_ extract 31 0) .cse148))) .cse10)))) (or .cse54 .cse154 .cse93) (or .cse2 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse160 (let ((.cse166 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166))))) (or (bvsle (let ((.cse155 (bvadd (let ((.cse156 (bvadd .cse5 (let ((.cse157 (bvadd .cse5 (let ((.cse158 (bvadd (let ((.cse159 (bvadd .cse160 .cse5))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159))) .cse5))) (concat ((_ extract 63 32) .cse158) ((_ extract 31 0) .cse158)))))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157)))))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse5))) (concat ((_ extract 63 32) .cse155) ((_ extract 31 0) .cse155))) .cse10) (bvsle (let ((.cse161 (bvadd .cse5 (let ((.cse162 (bvadd .cse5 (let ((.cse163 (bvadd (let ((.cse164 (bvadd (let ((.cse165 (bvadd .cse160 ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165))) ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164))) .cse5))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163)))))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162)))))) (concat ((_ extract 63 32) .cse161) ((_ extract 31 0) .cse161))) .cse10)))))) .cse90)) .cse167) (or .cse54 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse173 (let ((.cse190 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse190) ((_ extract 31 0) .cse190)))) (.cse184 ((_ sign_extend 32) v_arrayElimCell_56)) (.cse179 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse168 (bvadd (let ((.cse169 (bvadd .cse5 (let ((.cse170 (bvadd .cse5 (let ((.cse171 (bvadd (let ((.cse172 (bvadd .cse173 .cse5))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))) .cse5))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171)))))) (concat ((_ extract 63 32) .cse170) ((_ extract 31 0) .cse170)))))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169))) .cse5))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse10) (bvsle (let ((.cse174 (bvadd (let ((.cse175 (bvadd .cse5 (let ((.cse176 (bvadd .cse5 (let ((.cse177 (bvadd (let ((.cse178 (bvadd .cse173 .cse179))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178))) .cse5))) (concat ((_ extract 63 32) .cse177) ((_ extract 31 0) .cse177)))))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176)))))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse5))) (concat ((_ extract 63 32) .cse174) ((_ extract 31 0) .cse174))) .cse10) (bvsle (let ((.cse180 (bvadd (let ((.cse181 (bvadd .cse5 (let ((.cse182 (bvadd .cse5 (let ((.cse183 (bvadd .cse20 .cse184))) (concat ((_ extract 63 32) .cse183) ((_ extract 31 0) .cse183)))))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182)))))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse5))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) .cse10) (bvsle (let ((.cse185 (bvadd .cse5 (let ((.cse186 (bvadd .cse5 (let ((.cse187 (bvadd .cse5 (let ((.cse188 (bvadd .cse184 (let ((.cse189 (bvadd .cse35 .cse179))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189)))))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188)))))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187)))))) (concat ((_ extract 63 32) .cse186) ((_ extract 31 0) .cse186)))))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185))) .cse10))))) (or (let ((.cse334 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse336 (bvadd (let ((.cse337 (bvadd .cse5 (let ((.cse338 (bvadd .cse5 (let ((.cse339 (bvadd (let ((.cse340 (bvadd (let ((.cse341 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse341) ((_ extract 31 0) .cse341))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse340) ((_ extract 31 0) .cse340))) .cse5))) (concat ((_ extract 63 32) .cse339) ((_ extract 31 0) .cse339)))))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338)))))) (concat ((_ extract 63 32) .cse337) ((_ extract 31 0) .cse337))) .cse5))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse10)))) (and (or (and (or .cse2 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse195 (let ((.cse200 (bvadd (let ((.cse201 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))))) (or (bvsle (let ((.cse191 (bvadd (let ((.cse192 (bvadd .cse5 (let ((.cse193 (bvadd .cse5 (let ((.cse194 (bvadd .cse195 .cse5))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194)))))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193)))))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))) .cse5))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))) .cse10) (bvsle (let ((.cse196 (bvadd .cse5 (let ((.cse197 (bvadd .cse5 (let ((.cse198 (bvadd (let ((.cse199 (bvadd .cse195 ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))) .cse5))) (concat ((_ extract 63 32) .cse198) ((_ extract 31 0) .cse198)))))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197)))))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196))) .cse10))))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse208 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse213 (let ((.cse218 (bvadd (let ((.cse219 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse208))) (concat ((_ extract 63 32) .cse218) ((_ extract 31 0) .cse218))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse206 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse202 (bvadd .cse5 (let ((.cse203 (bvadd .cse5 (let ((.cse204 (bvadd .cse5 (let ((.cse205 (bvadd .cse206 (let ((.cse207 (bvadd .cse35 .cse208))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207)))))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205)))))) (concat ((_ extract 63 32) .cse204) ((_ extract 31 0) .cse204)))))) (concat ((_ extract 63 32) .cse203) ((_ extract 31 0) .cse203)))))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202))) .cse10) (bvsle (let ((.cse209 (bvadd .cse5 (let ((.cse210 (bvadd .cse5 (let ((.cse211 (bvadd (let ((.cse212 (bvadd .cse213 .cse206))) (concat ((_ extract 63 32) .cse212) ((_ extract 31 0) .cse212))) .cse5))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211)))))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210)))))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse10)))) (bvsle (let ((.cse214 (bvadd (let ((.cse215 (bvadd .cse5 (let ((.cse216 (bvadd .cse5 (let ((.cse217 (bvadd .cse213 .cse5))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217)))))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216)))))) (concat ((_ extract 63 32) .cse215) ((_ extract 31 0) .cse215))) .cse5))) (concat ((_ extract 63 32) .cse214) ((_ extract 31 0) .cse214))) .cse10))))) (or .cse54 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse226 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse220 (bvadd (let ((.cse221 (bvadd .cse5 (let ((.cse222 (bvadd .cse5 (let ((.cse223 (bvadd (let ((.cse224 (bvadd (let ((.cse225 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))) .cse226))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse5))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223)))))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222)))))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221))) .cse5))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse10) (bvsle (let ((.cse227 (bvadd .cse5 (let ((.cse228 (bvadd .cse5 (let ((.cse229 (bvadd .cse5 (let ((.cse230 (bvadd ((_ sign_extend 32) v_arrayElimCell_56) (let ((.cse231 (bvadd .cse35 .cse226))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231)))))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230)))))) (concat ((_ extract 63 32) .cse229) ((_ extract 31 0) .cse229)))))) (concat ((_ extract 63 32) .cse228) ((_ extract 31 0) .cse228)))))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227))) .cse10)))))) .cse90) (or .cse2 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse236 (let ((.cse246 (bvadd (let ((.cse247 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse247) ((_ extract 31 0) .cse247))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse246) ((_ extract 31 0) .cse246)))) (.cse241 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse232 (bvadd (let ((.cse233 (bvadd .cse5 (let ((.cse234 (bvadd .cse5 (let ((.cse235 (bvadd .cse236 .cse5))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235)))))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234)))))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))) .cse5))) (concat ((_ extract 63 32) .cse232) ((_ extract 31 0) .cse232))) .cse10) (bvsle (let ((.cse237 (bvadd (let ((.cse238 (bvadd .cse5 (let ((.cse239 (bvadd .cse5 (let ((.cse240 (bvadd .cse20 .cse241))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240)))))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239)))))) (concat ((_ extract 63 32) .cse238) ((_ extract 31 0) .cse238))) .cse5))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237))) .cse10) (bvsle (let ((.cse242 (bvadd .cse5 (let ((.cse243 (bvadd .cse5 (let ((.cse244 (bvadd (let ((.cse245 (bvadd .cse236 .cse241))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245))) .cse5))) (concat ((_ extract 63 32) .cse244) ((_ extract 31 0) .cse244)))))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243)))))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse10))))) (or .cse54 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse259 ((_ sign_extend 32) v_arrayElimCell_56)) (.cse254 ((_ sign_extend 32) v_arrayElimCell_55))) (or (bvsle (let ((.cse248 (bvadd (let ((.cse249 (bvadd .cse5 (let ((.cse250 (bvadd .cse5 (let ((.cse251 (bvadd (let ((.cse252 (bvadd (let ((.cse253 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse254))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse5))) (concat ((_ extract 63 32) .cse251) ((_ extract 31 0) .cse251)))))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250)))))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse5))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse10) (bvsle (let ((.cse255 (bvadd (let ((.cse256 (bvadd .cse5 (let ((.cse257 (bvadd .cse5 (let ((.cse258 (bvadd .cse20 .cse259))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258)))))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257)))))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse5))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))) .cse10) (bvsle (let ((.cse260 (bvadd .cse5 (let ((.cse261 (bvadd .cse5 (let ((.cse262 (bvadd .cse5 (let ((.cse263 (bvadd .cse259 (let ((.cse264 (bvadd .cse35 .cse254))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264)))))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263)))))) (concat ((_ extract 63 32) .cse262) ((_ extract 31 0) .cse262)))))) (concat ((_ extract 63 32) .cse261) ((_ extract 31 0) .cse261)))))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260))) .cse10))))) (or .cse167 (and (or .cse2 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse269 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse265 (bvadd (let ((.cse266 (bvadd .cse5 (let ((.cse267 (bvadd .cse5 (let ((.cse268 (bvadd .cse20 .cse269))) (concat ((_ extract 63 32) .cse268) ((_ extract 31 0) .cse268)))))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267)))))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse5))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265))) .cse10) (bvsle (let ((.cse270 (bvadd .cse5 (let ((.cse271 (bvadd .cse5 (let ((.cse272 (bvadd (let ((.cse273 (bvadd (let ((.cse274 (bvadd (let ((.cse275 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse275) ((_ extract 31 0) .cse275))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse274) ((_ extract 31 0) .cse274))) .cse269))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273))) .cse5))) (concat ((_ extract 63 32) .cse272) ((_ extract 31 0) .cse272)))))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271)))))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))) .cse10))))) (or .cse54 .cse111) (or .cse91 .cse92) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse286 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse280 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse276 (bvadd (let ((.cse277 (bvadd .cse5 (let ((.cse278 (bvadd .cse5 (let ((.cse279 (bvadd .cse20 .cse280))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279)))))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278)))))) (concat ((_ extract 63 32) .cse277) ((_ extract 31 0) .cse277))) .cse5))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))) .cse10) (bvsle (let ((.cse281 (bvadd .cse5 (let ((.cse282 (bvadd .cse5 (let ((.cse283 (bvadd .cse5 (let ((.cse284 (bvadd .cse280 (let ((.cse285 (bvadd .cse35 .cse286))) (concat ((_ extract 63 32) .cse285) ((_ extract 31 0) .cse285)))))) (concat ((_ extract 63 32) .cse284) ((_ extract 31 0) .cse284)))))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283)))))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282)))))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281))) .cse10) (bvsle (let ((.cse287 (bvadd .cse5 (let ((.cse288 (bvadd .cse5 (let ((.cse289 (bvadd (let ((.cse290 (bvadd (let ((.cse291 (bvadd (let ((.cse292 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse292) ((_ extract 31 0) .cse292))) .cse286))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))) .cse280))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse5))) (concat ((_ extract 63 32) .cse289) ((_ extract 31 0) .cse289)))))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))) .cse10)))) (or (and (or .cse54 .cse154) (or .cse2 (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (bvsle (let ((.cse293 (bvadd .cse5 (let ((.cse294 (bvadd .cse5 (let ((.cse295 (bvadd (let ((.cse296 (bvadd (let ((.cse297 (bvadd (let ((.cse298 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298))) ((_ sign_extend 32) v_arrayElimCell_55)))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) ((_ sign_extend 32) v_arrayElimCell_56)))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) .cse5))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295)))))) (concat ((_ extract 63 32) .cse294) ((_ extract 31 0) .cse294)))))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293))) .cse10))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_56 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse305 ((_ sign_extend 32) v_arrayElimCell_55)) (.cse303 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse299 (bvadd .cse5 (let ((.cse300 (bvadd .cse5 (let ((.cse301 (bvadd .cse5 (let ((.cse302 (bvadd .cse303 (let ((.cse304 (bvadd .cse35 .cse305))) (concat ((_ extract 63 32) .cse304) ((_ extract 31 0) .cse304)))))) (concat ((_ extract 63 32) .cse302) ((_ extract 31 0) .cse302)))))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301)))))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300)))))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse10) (bvsle (let ((.cse306 (bvadd .cse5 (let ((.cse307 (bvadd .cse5 (let ((.cse308 (bvadd (let ((.cse309 (bvadd (let ((.cse310 (bvadd (let ((.cse311 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse305))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse303))) (concat ((_ extract 63 32) .cse309) ((_ extract 31 0) .cse309))) .cse5))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308)))))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307)))))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))) .cse10))))) .cse90))) (forall ((v_arrayElimCell_54 (_ BitVec 32)) (v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse322 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse327 (let ((.cse332 (bvadd (let ((.cse333 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333))) .cse322))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse316 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse312 (bvadd (let ((.cse313 (bvadd .cse5 (let ((.cse314 (bvadd .cse5 (let ((.cse315 (bvadd .cse20 .cse316))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315)))))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314)))))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313))) .cse5))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))) .cse10) (bvsle (let ((.cse317 (bvadd .cse5 (let ((.cse318 (bvadd .cse5 (let ((.cse319 (bvadd .cse5 (let ((.cse320 (bvadd .cse316 (let ((.cse321 (bvadd .cse35 .cse322))) (concat ((_ extract 63 32) .cse321) ((_ extract 31 0) .cse321)))))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319)))))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318)))))) (concat ((_ extract 63 32) .cse317) ((_ extract 31 0) .cse317))) .cse10) (bvsle (let ((.cse323 (bvadd .cse5 (let ((.cse324 (bvadd .cse5 (let ((.cse325 (bvadd (let ((.cse326 (bvadd .cse327 .cse316))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))) .cse5))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325)))))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324)))))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))) .cse10)))) (bvsle (let ((.cse328 (bvadd (let ((.cse329 (bvadd .cse5 (let ((.cse330 (bvadd .cse5 (let ((.cse331 (bvadd .cse327 .cse5))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331)))))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330)))))) (concat ((_ extract 63 32) .cse329) ((_ extract 31 0) .cse329))) .cse5))) (concat ((_ extract 63 32) .cse328) ((_ extract 31 0) .cse328))) .cse10))))) (or .cse334 .cse91 .cse92) (or .cse334 .cse335))) .cse342) (or (not .cse342) .cse93) (forall ((v_arrayElimCell_54 (_ BitVec 32))) (let ((.cse364 (let ((.cse370 (bvadd .cse28 ((_ sign_extend 32) v_arrayElimCell_54)))) (concat ((_ extract 63 32) .cse370) ((_ extract 31 0) .cse370))))) (or (forall ((v_arrayElimCell_55 (_ BitVec 32))) (let ((.cse353 ((_ sign_extend 32) v_arrayElimCell_55))) (let ((.cse358 (let ((.cse363 (bvadd .cse364 .cse353))) (concat ((_ extract 63 32) .cse363) ((_ extract 31 0) .cse363))))) (or (forall ((v_arrayElimCell_56 (_ BitVec 32))) (let ((.cse347 ((_ sign_extend 32) v_arrayElimCell_56))) (or (bvsle (let ((.cse343 (bvadd (let ((.cse344 (bvadd .cse5 (let ((.cse345 (bvadd .cse5 (let ((.cse346 (bvadd .cse20 .cse347))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346)))))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345)))))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) .cse5))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))) .cse10) (bvsle (let ((.cse348 (bvadd .cse5 (let ((.cse349 (bvadd .cse5 (let ((.cse350 (bvadd .cse5 (let ((.cse351 (bvadd .cse347 (let ((.cse352 (bvadd .cse35 .cse353))) (concat ((_ extract 63 32) .cse352) ((_ extract 31 0) .cse352)))))) (concat ((_ extract 63 32) .cse351) ((_ extract 31 0) .cse351)))))) (concat ((_ extract 63 32) .cse350) ((_ extract 31 0) .cse350)))))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))))) (concat ((_ extract 63 32) .cse348) ((_ extract 31 0) .cse348))) .cse10) (bvsle (let ((.cse354 (bvadd .cse5 (let ((.cse355 (bvadd .cse5 (let ((.cse356 (bvadd (let ((.cse357 (bvadd .cse358 .cse347))) (concat ((_ extract 63 32) .cse357) ((_ extract 31 0) .cse357))) .cse5))) (concat ((_ extract 63 32) .cse356) ((_ extract 31 0) .cse356)))))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355)))))) (concat ((_ extract 63 32) .cse354) ((_ extract 31 0) .cse354))) .cse10)))) (bvsle (let ((.cse359 (bvadd (let ((.cse360 (bvadd .cse5 (let ((.cse361 (bvadd .cse5 (let ((.cse362 (bvadd .cse358 .cse5))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362)))))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361)))))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360))) .cse5))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359))) .cse10))))) (bvsle (let ((.cse365 (bvadd (let ((.cse366 (bvadd .cse5 (let ((.cse367 (bvadd .cse5 (let ((.cse368 (bvadd (let ((.cse369 (bvadd .cse364 .cse5))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369))) .cse5))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368)))))) (concat ((_ extract 63 32) .cse367) ((_ extract 31 0) .cse367)))))) (concat ((_ extract 63 32) .cse366) ((_ extract 31 0) .cse366))) .cse5))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365))) .cse10)))) (or .cse91 .cse92 .cse371) (or .cse335 .cse371)))) (not (bvslt (_ bv2 32) c_~N~0)) (and .cse1 (bvsle (let ((.cse410 (bvadd (let ((.cse411 (bvadd .cse5 (let ((.cse412 (bvadd .cse5 (let ((.cse413 (bvadd .cse5 .cse20))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413)))))) (concat ((_ extract 63 32) .cse412) ((_ extract 31 0) .cse412)))))) (concat ((_ extract 63 32) .cse411) ((_ extract 31 0) .cse411))) .cse5))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse10)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (bvule c_~N~0 (_ bv536870911 32)) (= .cse416 ((_ extract 63 32) (_ bv0 64)))))) is different from true [2023-11-29 05:01:29,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:30,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:36,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:38,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:42,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:47,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:50,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:01:58,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:01,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:07,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:08,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:11,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:16,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:23,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:33,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:36,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:02:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:02:36,857 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-11-29 05:02:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 05:02:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.25) internal successors, (50), 40 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) Word has length 26 [2023-11-29 05:02:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:02:36,954 INFO L225 Difference]: With dead ends: 54 [2023-11-29 05:02:36,954 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 05:02:36,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 150.3s TimeCoverageRelationStatistics Valid=339, Invalid=2210, Unknown=9, NotChecked=198, Total=2756 [2023-11-29 05:02:36,956 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 48.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:02:36,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 540 Invalid, 1 Unknown, 72 Unchecked, 48.4s Time] [2023-11-29 05:02:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 05:02:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 05:02:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:02:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-29 05:02:36,981 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2023-11-29 05:02:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:02:36,981 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-29 05:02:36,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.25) internal successors, (50), 40 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) [2023-11-29 05:02:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-29 05:02:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:02:36,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:02:36,983 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:02:36,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:02:37,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:02:37,183 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:02:37,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:02:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 560764674, now seen corresponding path program 7 times [2023-11-29 05:02:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:02:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980366854] [2023-11-29 05:02:37,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 05:02:37,184 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 [2023-11-29 05:02:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:02:37,185 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:02:37,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 (10)] Waiting until timeout for monitored process [2023-11-29 05:02:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:02:37,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:02:37,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:02:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:02:38,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:02:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:02:40,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:02:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980366854] [2023-11-29 05:02:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980366854] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:02:40,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:02:40,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-11-29 05:02:40,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372083731] [2023-11-29 05:02:40,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:02:40,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 05:02:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:02:40,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 05:02:40,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:02:40,398 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:02:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:02:43,008 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2023-11-29 05:02:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:02:43,009 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 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 28 [2023-11-29 05:02:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:02:43,010 INFO L225 Difference]: With dead ends: 78 [2023-11-29 05:02:43,010 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 05:02:43,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2023-11-29 05:02:43,011 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 81 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:02:43,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 42 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 05:02:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 05:02:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2023-11-29 05:02:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:02:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2023-11-29 05:02:43,031 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 28 [2023-11-29 05:02:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:02:43,031 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2023-11-29 05:02:43,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:02:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2023-11-29 05:02:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 05:02:43,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:02:43,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:02:43,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 (10)] Ended with exit code 0 [2023-11-29 05:02:43,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 05:02:43,233 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:02:43,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:02:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1647923369, now seen corresponding path program 8 times [2023-11-29 05:02:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:02:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701436088] [2023-11-29 05:02:43,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:02:43,234 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 [2023-11-29 05:02:43,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:02:43,234 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 05:02:43,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ee95f76-a997-44a5-bf19-2cdfc92e71e6/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 05:02:43,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:02:43,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:02:43,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 05:02:43,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:02:43,646 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:02:43,647 INFO L378 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 [2023-11-29 05:02:43,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:02:44,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:02:44,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:44,342 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 05:02:44,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:44,651 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 05:02:45,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:45,647 INFO L378 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 1 case distinctions, treesize of input 67 treesize of output 37 [2023-11-29 05:02:46,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:46,073 INFO L378 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 1 case distinctions, treesize of input 81 treesize of output 51 [2023-11-29 05:02:46,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:46,387 INFO L378 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 1 case distinctions, treesize of input 109 treesize of output 79 [2023-11-29 05:02:46,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:46,740 INFO L378 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 1 case distinctions, treesize of input 165 treesize of output 135 [2023-11-29 05:02:47,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:02:47,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 05:02:47,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:47,971 INFO L378 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 05:02:48,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:48,395 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 05:02:49,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:49,344 INFO L378 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 1 case distinctions, treesize of input 277 treesize of output 247 [2023-11-29 05:02:49,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:49,745 INFO L378 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 1 case distinctions, treesize of input 501 treesize of output 471 [2023-11-29 05:02:50,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:50,168 INFO L378 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 1 case distinctions, treesize of input 949 treesize of output 919 [2023-11-29 05:02:50,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:50,612 INFO L378 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 1 case distinctions, treesize of input 1845 treesize of output 1815 [2023-11-29 05:02:51,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:02:51,045 INFO L378 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 3635 treesize of output 3605 [2023-11-29 05:02:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:02:51,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:02,862 INFO L378 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 1426 treesize of output 1366 [2023-11-29 05:03:03,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:03:03,226 INFO L378 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 24228890 treesize of output 23868442 [2023-11-29 05:04:25,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ sign_extend 32) (_ bv1 32))) (.cse27 (let ((.cse1042 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse1042 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse1042 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse67 (let ((.cse1041 (bvadd .cse9 .cse27))) (concat ((_ extract 63 32) .cse1041) ((_ extract 31 0) .cse1041))))) (let ((.cse20 (let ((.cse1040 (bvadd .cse67 .cse9))) (concat ((_ extract 63 32) .cse1040) ((_ extract 31 0) .cse1040)))) (.cse1018 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse41 (= (_ bv8 32) .cse1018)) (.cse6 (= (_ bv0 32) (bvadd (_ bv12 32) .cse1018))) (.cse5 (= (_ bv12 32) .cse1018)) (.cse154 (= (bvadd (_ bv8 32) .cse1018) (_ bv0 32))) (.cse22 (let ((.cse1039 (bvadd .cse9 .cse20))) (concat ((_ extract 63 32) .cse1039) ((_ extract 31 0) .cse1039)))) (.cse11 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32))))) (let ((.cse0 (forall ((v_arrayElimCell_88 (_ BitVec 32))) (bvsle (let ((.cse1038 (bvadd .cse22 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse1038) ((_ extract 31 0) .cse1038))) .cse11))) (.cse425 (not .cse154)) (.cse3 (forall ((v_arrayElimCell_91 (_ BitVec 32))) (bvsle (let ((.cse1034 (bvadd (let ((.cse1035 (bvadd .cse9 (let ((.cse1036 (bvadd (let ((.cse1037 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1037) ((_ extract 31 0) .cse1037))) .cse9))) (concat ((_ extract 63 32) .cse1036) ((_ extract 31 0) .cse1036)))))) (concat ((_ extract 63 32) .cse1035) ((_ extract 31 0) .cse1035))) .cse9))) (concat ((_ extract 63 32) .cse1034) ((_ extract 31 0) .cse1034))) .cse11))) (.cse268 (not .cse5)) (.cse269 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (bvsle (let ((.cse1030 (bvadd .cse9 (let ((.cse1031 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse1032 (bvadd (let ((.cse1033 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1033) ((_ extract 31 0) .cse1033))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse1032) ((_ extract 31 0) .cse1032)))))) (concat ((_ extract 63 32) .cse1031) ((_ extract 31 0) .cse1031)))))) (concat ((_ extract 63 32) .cse1030) ((_ extract 31 0) .cse1030))) .cse11))) (.cse155 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse1025 (let ((.cse1028 (bvadd (let ((.cse1029 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1029) ((_ extract 31 0) .cse1029))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse1028) ((_ extract 31 0) .cse1028))))) (or (bvsle (let ((.cse1023 (bvadd (let ((.cse1024 (bvadd .cse9 .cse1025))) (concat ((_ extract 63 32) .cse1024) ((_ extract 31 0) .cse1024))) .cse9))) (concat ((_ extract 63 32) .cse1023) ((_ extract 31 0) .cse1023))) .cse11) (bvsle (let ((.cse1026 (bvadd .cse9 (let ((.cse1027 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse1025))) (concat ((_ extract 63 32) .cse1027) ((_ extract 31 0) .cse1027)))))) (concat ((_ extract 63 32) .cse1026) ((_ extract 31 0) .cse1026))) .cse11))))) (.cse87 (not .cse6)) (.cse84 (not .cse41)) (.cse86 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (bvsle (let ((.cse1019 (bvadd (let ((.cse1020 (bvadd .cse9 (let ((.cse1021 (bvadd (let ((.cse1022 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1022) ((_ extract 31 0) .cse1022))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse1021) ((_ extract 31 0) .cse1021)))))) (concat ((_ extract 63 32) .cse1020) ((_ extract 31 0) .cse1020))) .cse9))) (concat ((_ extract 63 32) .cse1019) ((_ extract 31 0) .cse1019))) .cse11))) (.cse2 (= (_ bv4 32) .cse1018)) (.cse4 (= (_ bv0 32) .cse1018)) (.cse1 (= (bvadd (_ bv4 32) .cse1018) (_ bv0 32)))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (let ((.cse85 (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse539 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse537 (bvadd (let ((.cse538 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse20))) (concat ((_ extract 63 32) .cse538) ((_ extract 31 0) .cse538))) .cse539))) (concat ((_ extract 63 32) .cse537) ((_ extract 31 0) .cse537))) .cse11) (bvsle (let ((.cse540 (bvadd .cse22 .cse539))) (concat ((_ extract 63 32) .cse540) ((_ extract 31 0) .cse540))) .cse11)))))) (and (or .cse5 (and (or .cse6 (and (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse17 (let ((.cse26 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse15 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse14 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse10 (let ((.cse16 (bvadd .cse17 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))))) (or (bvsle (let ((.cse7 (bvadd (let ((.cse8 (bvadd .cse9 .cse10))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse9))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) .cse11) (bvsle (let ((.cse12 (bvadd (let ((.cse13 (bvadd .cse14 .cse10))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))) .cse15))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12))) .cse11)))) (bvsle (let ((.cse18 (bvadd (let ((.cse19 (bvadd .cse14 .cse20))) (concat ((_ extract 63 32) .cse19) ((_ extract 31 0) .cse19))) .cse15))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18))) .cse11)))) (bvsle (let ((.cse21 (bvadd .cse22 .cse15))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))) .cse11)))) (bvsle (let ((.cse23 (bvadd (let ((.cse24 (bvadd .cse9 (let ((.cse25 (bvadd .cse17 .cse9))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25)))))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))) .cse9))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse30 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse35 (let ((.cse40 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40)))) (.cse31 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse28 (bvadd (let ((.cse29 (bvadd .cse30 .cse20))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29))) .cse31))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28))) .cse11) (bvsle (let ((.cse32 (bvadd (let ((.cse33 (bvadd .cse30 (let ((.cse34 (bvadd .cse35 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34)))))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))) .cse31))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))) .cse11) (bvsle (let ((.cse36 (bvadd (let ((.cse37 (bvadd .cse9 (let ((.cse38 (bvadd .cse35 .cse9))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37))) .cse9))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse11) (bvsle (let ((.cse39 (bvadd .cse22 .cse31))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39))) .cse11)))) .cse41) (or (and (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse48 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse47 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse44 (let ((.cse49 (bvadd (let ((.cse50 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))))) (or (bvsle (let ((.cse42 (bvadd (let ((.cse43 (bvadd .cse9 .cse44))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))) .cse9))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse11) (bvsle (let ((.cse45 (bvadd (let ((.cse46 (bvadd .cse47 .cse44))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))) .cse48))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))) .cse11)))) (bvsle (let ((.cse51 (bvadd (let ((.cse52 (bvadd .cse47 .cse20))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse48))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse11)))) (bvsle (let ((.cse53 (bvadd .cse22 .cse48))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse56 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse57 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse54 (bvadd (let ((.cse55 (bvadd .cse56 .cse20))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse57))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))) .cse11) (bvsle (let ((.cse58 (bvadd (let ((.cse59 (bvadd .cse56 (let ((.cse60 (bvadd (let ((.cse61 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60)))))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse57))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse11) (bvsle (let ((.cse62 (bvadd .cse22 .cse57))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))) .cse11)))) .cse41)) .cse2))) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse69 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse65 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse68 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse63 (bvadd (let ((.cse64 (bvadd .cse65 (let ((.cse66 (bvadd .cse67 .cse68))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66)))))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) .cse69))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse78 (let ((.cse80 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))))) (let ((.cse72 (let ((.cse79 (bvadd .cse78 .cse68))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))))) (or (bvsle (let ((.cse70 (bvadd (let ((.cse71 (bvadd .cse9 .cse72))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71))) .cse9))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse11) (bvsle (let ((.cse73 (bvadd (let ((.cse74 (bvadd .cse65 .cse72))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse69))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse11) (bvsle (let ((.cse75 (bvadd (let ((.cse76 (bvadd .cse9 (let ((.cse77 (bvadd .cse78 .cse9))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77)))))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse9))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse11)))))))) (bvsle (let ((.cse81 (bvadd (let ((.cse82 (bvadd .cse65 .cse20))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse69))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) .cse11)))) (bvsle (let ((.cse83 (bvadd .cse22 .cse69))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse11)))) (or .cse84 .cse85 .cse86) (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse90 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse92 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse88 (bvadd (let ((.cse89 (bvadd .cse90 (let ((.cse91 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))) .cse92))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) .cse11) (bvsle (let ((.cse93 (bvadd (let ((.cse94 (bvadd .cse90 .cse20))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse92))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) .cse11) (bvsle (let ((.cse95 (bvadd .cse22 .cse92))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))) .cse11))))) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse98 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse100 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse101 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse98 (let ((.cse99 (bvadd .cse67 .cse100))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99)))))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse101))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))) .cse11) (bvsle (let ((.cse102 (bvadd (let ((.cse103 (bvadd .cse98 .cse20))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse101))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) .cse11) (bvsle (let ((.cse104 (bvadd (let ((.cse105 (bvadd .cse98 (let ((.cse106 (bvadd (let ((.cse107 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))) .cse100))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse101))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse11) (bvsle (let ((.cse108 (bvadd .cse22 .cse101))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) .cse11)))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse114 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse111 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse113 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse109 (bvadd (let ((.cse110 (bvadd .cse111 (let ((.cse112 (bvadd .cse67 .cse113))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110))) .cse114))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse118 (let ((.cse122 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))))) (or (bvsle (let ((.cse115 (bvadd (let ((.cse116 (bvadd .cse111 (let ((.cse117 (bvadd .cse118 .cse113))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117)))))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse114))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse11) (bvsle (let ((.cse119 (bvadd (let ((.cse120 (bvadd .cse9 (let ((.cse121 (bvadd .cse118 .cse9))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))) .cse9))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) .cse11))))))) (bvsle (let ((.cse123 (bvadd (let ((.cse124 (bvadd .cse111 .cse20))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) .cse114))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))) .cse11)))) (bvsle (let ((.cse125 (bvadd .cse22 .cse114))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse11))))) .cse41) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse130 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse128 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse134 (let ((.cse140 (bvadd (let ((.cse141 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse130))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))) (.cse131 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse126 (bvadd (let ((.cse127 (bvadd .cse128 (let ((.cse129 (bvadd .cse67 .cse130))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129)))))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127))) .cse131))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) .cse11) (bvsle (let ((.cse132 (bvadd (let ((.cse133 (bvadd .cse9 .cse134))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse9))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse11) (bvsle (let ((.cse135 (bvadd (let ((.cse136 (bvadd .cse128 .cse20))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse131))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse11) (bvsle (let ((.cse137 (bvadd (let ((.cse138 (bvadd .cse128 .cse134))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse131))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse11) (bvsle (let ((.cse139 (bvadd .cse22 .cse131))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139))) .cse11))))) .cse2))) (or .cse84 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse148 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse147 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse144 (let ((.cse152 (bvadd (let ((.cse153 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))))) (or (bvsle (let ((.cse142 (bvadd (let ((.cse143 (bvadd .cse9 .cse144))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))) .cse9))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142))) .cse11) (bvsle (let ((.cse145 (bvadd (let ((.cse146 (bvadd .cse147 .cse20))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146))) .cse148))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse11) (bvsle (let ((.cse149 (bvadd .cse22 .cse148))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) .cse11) (bvsle (let ((.cse150 (bvadd .cse9 (let ((.cse151 (bvadd .cse147 .cse144))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151)))))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150))) .cse11))))) (or .cse154 (and (or .cse84 .cse155 .cse0) (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse161 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse158 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse160 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse156 (bvadd (let ((.cse157 (bvadd .cse158 (let ((.cse159 (bvadd .cse67 .cse160))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159)))))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157))) .cse161))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse11) (bvsle (let ((.cse162 (bvadd .cse22 .cse161))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162))) .cse11) (bvsle (let ((.cse163 (bvadd .cse9 (let ((.cse164 (bvadd .cse158 (let ((.cse165 (bvadd (let ((.cse166 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166))) .cse160))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165)))))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164)))))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse11))))) (or (and (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse170 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse167 (bvadd (let ((.cse168 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse169 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169)))))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse170))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))) .cse11) (bvsle (let ((.cse171 (bvadd .cse22 .cse170))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171))) .cse11))))) (or .cse6 (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse174 (let ((.cse179 (bvadd (let ((.cse180 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse179) ((_ extract 31 0) .cse179)))) (.cse177 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse172 (bvadd (let ((.cse173 (bvadd .cse9 .cse174))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173))) .cse9))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))) .cse11) (bvsle (let ((.cse175 (bvadd (let ((.cse176 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse174))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) .cse177))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse11) (bvsle (let ((.cse178 (bvadd .cse22 .cse177))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178))) .cse11)))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse186 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse190 (let ((.cse192 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))))) (let ((.cse183 (let ((.cse191 (bvadd .cse190 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))))) (or (bvsle (let ((.cse181 (bvadd (let ((.cse182 (bvadd .cse9 .cse183))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))) .cse9))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse11) (bvsle (let ((.cse184 (bvadd (let ((.cse185 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse183))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185))) .cse186))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse11) (bvsle (let ((.cse187 (bvadd (let ((.cse188 (bvadd .cse9 (let ((.cse189 (bvadd .cse190 .cse9))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189)))))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188))) .cse9))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))) .cse11))))) (bvsle (let ((.cse193 (bvadd .cse22 .cse186))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193))) .cse11)))) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse198 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse194 (bvadd (let ((.cse195 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse196 (bvadd (let ((.cse197 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196)))))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse198))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194))) .cse11) (bvsle (let ((.cse199 (bvadd .cse22 .cse198))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))) .cse11)))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse204 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse203 (let ((.cse208 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))))) (or (bvsle (let ((.cse200 (bvadd (let ((.cse201 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse202 (bvadd .cse203 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202)))))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse204))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) .cse11) (bvsle (let ((.cse205 (bvadd (let ((.cse206 (bvadd .cse9 (let ((.cse207 (bvadd .cse203 .cse9))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207)))))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206))) .cse9))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))) .cse11)))) (bvsle (let ((.cse209 (bvadd .cse22 .cse204))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse11))))) .cse41))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse214 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse212 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse218 (let ((.cse222 (bvadd (let ((.cse223 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse214))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222)))) (.cse215 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse210 (bvadd (let ((.cse211 (bvadd .cse212 (let ((.cse213 (bvadd .cse67 .cse214))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213)))))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211))) .cse215))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) .cse11) (bvsle (let ((.cse216 (bvadd (let ((.cse217 (bvadd .cse9 .cse218))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))) .cse9))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216))) .cse11) (bvsle (let ((.cse219 (bvadd (let ((.cse220 (bvadd .cse212 .cse218))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse215))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse11) (bvsle (let ((.cse221 (bvadd .cse22 .cse215))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221))) .cse11))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse229 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse226 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse228 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse224 (bvadd (let ((.cse225 (bvadd .cse226 (let ((.cse227 (bvadd .cse67 .cse228))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227)))))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))) .cse229))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse238 (let ((.cse240 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))))) (let ((.cse232 (let ((.cse239 (bvadd .cse238 .cse228))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))))) (or (bvsle (let ((.cse230 (bvadd (let ((.cse231 (bvadd .cse9 .cse232))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse9))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230))) .cse11) (bvsle (let ((.cse233 (bvadd (let ((.cse234 (bvadd .cse226 .cse232))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234))) .cse229))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))) .cse11) (bvsle (let ((.cse235 (bvadd (let ((.cse236 (bvadd .cse9 (let ((.cse237 (bvadd .cse238 .cse9))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237)))))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse9))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))) .cse11)))))))) (bvsle (let ((.cse241 (bvadd .cse22 .cse229))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241))) .cse11)))) (or .cse84 .cse0 .cse86) (or .cse41 (and (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse247 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse244 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse246 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse242 (bvadd (let ((.cse243 (bvadd .cse244 (let ((.cse245 (bvadd .cse67 .cse246))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245)))))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse247))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse251 (let ((.cse255 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))))) (or (bvsle (let ((.cse248 (bvadd (let ((.cse249 (bvadd .cse244 (let ((.cse250 (bvadd .cse251 .cse246))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250)))))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse247))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse11) (bvsle (let ((.cse252 (bvadd (let ((.cse253 (bvadd .cse9 (let ((.cse254 (bvadd .cse251 .cse9))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254)))))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse9))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse11))))))) (bvsle (let ((.cse256 (bvadd .cse22 .cse247))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse259 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse261 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse262 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse257 (bvadd (let ((.cse258 (bvadd .cse259 (let ((.cse260 (bvadd .cse67 .cse261))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260)))))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258))) .cse262))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257))) .cse11) (bvsle (let ((.cse263 (bvadd (let ((.cse264 (bvadd .cse259 (let ((.cse265 (bvadd (let ((.cse266 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse261))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265)))))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse262))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse11) (bvsle (let ((.cse267 (bvadd .cse22 .cse262))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267))) .cse11)))) .cse2)))) .cse5) (or .cse268 .cse0 .cse269) (or .cse41 (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse272 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse274 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse275 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse277 (let ((.cse280 (bvadd .cse272 (let ((.cse281 (bvadd (let ((.cse282 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse274))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281)))))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))))) (or (bvsle (let ((.cse270 (bvadd (let ((.cse271 (bvadd .cse272 (let ((.cse273 (bvadd .cse67 .cse274))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273)))))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))) .cse275))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))) .cse11) (bvsle (let ((.cse276 (bvadd .cse277 .cse275))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))) .cse11) (bvsle (let ((.cse278 (bvadd .cse22 .cse275))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278))) .cse11) (bvsle (let ((.cse279 (bvadd .cse9 .cse277))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) .cse11))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse285 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse292 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse294 ((_ sign_extend 32) v_arrayElimCell_89))) (or (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse289 (let ((.cse295 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))))) (let ((.cse284 (let ((.cse291 (bvadd .cse292 (let ((.cse293 (bvadd .cse289 .cse294))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293)))))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))))) (or (bvsle (let ((.cse283 (bvadd .cse284 .cse285))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283))) .cse11) (bvsle (let ((.cse286 (bvadd (let ((.cse287 (bvadd .cse9 (let ((.cse288 (bvadd .cse289 .cse9))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))) .cse9))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse11) (bvsle (let ((.cse290 (bvadd .cse9 .cse284))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse11))))) (bvsle (let ((.cse296 (bvadd (let ((.cse297 (bvadd .cse292 (let ((.cse298 (bvadd .cse67 .cse294))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298)))))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse285))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) .cse11)))) (bvsle (let ((.cse299 (bvadd .cse22 .cse285))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse11)))))) (or .cse6 (and (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse309 (let ((.cse314 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse305 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse302 (let ((.cse308 (bvadd .cse309 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))))) (let ((.cse304 (let ((.cse307 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse302))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307))))) (or (bvsle (let ((.cse300 (bvadd (let ((.cse301 (bvadd .cse9 .cse302))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))) .cse9))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300))) .cse11) (bvsle (let ((.cse303 (bvadd .cse304 .cse305))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303))) .cse11) (bvsle (let ((.cse306 (bvadd .cse9 .cse304))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))) .cse11))))) (bvsle (let ((.cse310 (bvadd .cse22 .cse305))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse11)))) (bvsle (let ((.cse311 (bvadd (let ((.cse312 (bvadd .cse9 (let ((.cse313 (bvadd .cse309 .cse9))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))) .cse9))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse321 (let ((.cse326 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))))) (let ((.cse317 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse316 (let ((.cse324 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse325 (bvadd .cse321 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325)))))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324))))) (or (bvsle (let ((.cse315 (bvadd .cse316 .cse317))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315))) .cse11) (bvsle (let ((.cse318 (bvadd (let ((.cse319 (bvadd .cse9 (let ((.cse320 (bvadd .cse321 .cse9))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))) .cse9))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse11) (bvsle (let ((.cse322 (bvadd .cse22 .cse317))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))) .cse11) (bvsle (let ((.cse323 (bvadd .cse9 .cse316))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))) .cse11))))) .cse41) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse329 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse328 (let ((.cse332 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse333 (bvadd (let ((.cse334 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse334) ((_ extract 31 0) .cse334))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333)))))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))))) (or (bvsle (let ((.cse327 (bvadd .cse328 .cse329))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse11) (bvsle (let ((.cse330 (bvadd .cse22 .cse329))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))) .cse11) (bvsle (let ((.cse331 (bvadd .cse9 .cse328))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))) .cse11)))) .cse41) (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse340 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse337 (let ((.cse343 (bvadd (let ((.cse344 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))))) (let ((.cse339 (let ((.cse342 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse337))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))))) (or (bvsle (let ((.cse335 (bvadd (let ((.cse336 (bvadd .cse9 .cse337))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse9))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335))) .cse11) (bvsle (let ((.cse338 (bvadd .cse339 .cse340))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338))) .cse11) (bvsle (let ((.cse341 (bvadd .cse9 .cse339))) (concat ((_ extract 63 32) .cse341) ((_ extract 31 0) .cse341))) .cse11))))) (bvsle (let ((.cse345 (bvadd .cse22 .cse340))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345))) .cse11))))) .cse2))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse350 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse348 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse354 (let ((.cse360 (bvadd (let ((.cse361 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361))) .cse350))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360))))) (let ((.cse351 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse356 (let ((.cse359 (bvadd .cse348 .cse354))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359))))) (or (bvsle (let ((.cse346 (bvadd (let ((.cse347 (bvadd .cse348 (let ((.cse349 (bvadd .cse67 .cse350))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))))) (concat ((_ extract 63 32) .cse347) ((_ extract 31 0) .cse347))) .cse351))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346))) .cse11) (bvsle (let ((.cse352 (bvadd (let ((.cse353 (bvadd .cse9 .cse354))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))) .cse9))) (concat ((_ extract 63 32) .cse352) ((_ extract 31 0) .cse352))) .cse11) (bvsle (let ((.cse355 (bvadd .cse356 .cse351))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))) .cse11) (bvsle (let ((.cse357 (bvadd .cse22 .cse351))) (concat ((_ extract 63 32) .cse357) ((_ extract 31 0) .cse357))) .cse11) (bvsle (let ((.cse358 (bvadd .cse9 .cse356))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))) .cse11)))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse367 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse364 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse366 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse362 (bvadd (let ((.cse363 (bvadd .cse364 (let ((.cse365 (bvadd .cse67 .cse366))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365)))))) (concat ((_ extract 63 32) .cse363) ((_ extract 31 0) .cse363))) .cse367))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse376 (let ((.cse380 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380))))) (let ((.cse370 (let ((.cse379 (bvadd .cse376 .cse366))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379))))) (let ((.cse372 (let ((.cse378 (bvadd .cse364 .cse370))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))))) (or (bvsle (let ((.cse368 (bvadd (let ((.cse369 (bvadd .cse9 .cse370))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369))) .cse9))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))) .cse11) (bvsle (let ((.cse371 (bvadd .cse372 .cse367))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371))) .cse11) (bvsle (let ((.cse373 (bvadd (let ((.cse374 (bvadd .cse9 (let ((.cse375 (bvadd .cse376 .cse9))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375)))))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374))) .cse9))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))) .cse11) (bvsle (let ((.cse377 (bvadd .cse9 .cse372))) (concat ((_ extract 63 32) .cse377) ((_ extract 31 0) .cse377))) .cse11))))))))) (bvsle (let ((.cse381 (bvadd .cse22 .cse367))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse11)))))) (or .cse268 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse385 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse384 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse382 (bvadd (let ((.cse383 (bvadd .cse384 .cse20))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383))) .cse385))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))) .cse11) (bvsle (let ((.cse386 (bvadd .cse22 .cse385))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386))) .cse11) (bvsle (let ((.cse387 (bvadd .cse9 (let ((.cse388 (bvadd .cse384 (let ((.cse389 (bvadd (let ((.cse390 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389)))))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388)))))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse11))))) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse393 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse395 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse396 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse400 (let ((.cse403 (bvadd .cse393 (let ((.cse404 (bvadd (let ((.cse405 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse405) ((_ extract 31 0) .cse405))) .cse395))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404)))))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403))))) (or (bvsle (let ((.cse391 (bvadd (let ((.cse392 (bvadd .cse393 (let ((.cse394 (bvadd .cse67 .cse395))) (concat ((_ extract 63 32) .cse394) ((_ extract 31 0) .cse394)))))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse396))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391))) .cse11) (bvsle (let ((.cse397 (bvadd (let ((.cse398 (bvadd .cse393 .cse20))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))) .cse396))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397))) .cse11) (bvsle (let ((.cse399 (bvadd .cse400 .cse396))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399))) .cse11) (bvsle (let ((.cse401 (bvadd .cse22 .cse396))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401))) .cse11) (bvsle (let ((.cse402 (bvadd .cse9 .cse400))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402))) .cse11))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse408 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse415 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse417 ((_ sign_extend 32) v_arrayElimCell_89))) (or (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse412 (let ((.cse418 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse418) ((_ extract 31 0) .cse418))))) (let ((.cse407 (let ((.cse414 (bvadd .cse415 (let ((.cse416 (bvadd .cse412 .cse417))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416)))))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414))))) (or (bvsle (let ((.cse406 (bvadd .cse407 .cse408))) (concat ((_ extract 63 32) .cse406) ((_ extract 31 0) .cse406))) .cse11) (bvsle (let ((.cse409 (bvadd (let ((.cse410 (bvadd .cse9 (let ((.cse411 (bvadd .cse412 .cse9))) (concat ((_ extract 63 32) .cse411) ((_ extract 31 0) .cse411)))))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse9))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse11) (bvsle (let ((.cse413 (bvadd .cse9 .cse407))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413))) .cse11))))) (bvsle (let ((.cse419 (bvadd (let ((.cse420 (bvadd .cse415 (let ((.cse421 (bvadd .cse67 .cse417))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421)))))) (concat ((_ extract 63 32) .cse420) ((_ extract 31 0) .cse420))) .cse408))) (concat ((_ extract 63 32) .cse419) ((_ extract 31 0) .cse419))) .cse11)))) (bvsle (let ((.cse422 (bvadd (let ((.cse423 (bvadd .cse415 .cse20))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))) .cse408))) (concat ((_ extract 63 32) .cse422) ((_ extract 31 0) .cse422))) .cse11)))) (bvsle (let ((.cse424 (bvadd .cse22 .cse408))) (concat ((_ extract 63 32) .cse424) ((_ extract 31 0) .cse424))) .cse11))))) .cse41) (or .cse425 .cse85) (or .cse2 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse430 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse428 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse434 (let ((.cse442 (bvadd (let ((.cse443 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse443) ((_ extract 31 0) .cse443))) .cse430))) (concat ((_ extract 63 32) .cse442) ((_ extract 31 0) .cse442))))) (let ((.cse431 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse438 (let ((.cse441 (bvadd .cse428 .cse434))) (concat ((_ extract 63 32) .cse441) ((_ extract 31 0) .cse441))))) (or (bvsle (let ((.cse426 (bvadd (let ((.cse427 (bvadd .cse428 (let ((.cse429 (bvadd .cse67 .cse430))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429)))))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427))) .cse431))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426))) .cse11) (bvsle (let ((.cse432 (bvadd (let ((.cse433 (bvadd .cse9 .cse434))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))) .cse9))) (concat ((_ extract 63 32) .cse432) ((_ extract 31 0) .cse432))) .cse11) (bvsle (let ((.cse435 (bvadd (let ((.cse436 (bvadd .cse428 .cse20))) (concat ((_ extract 63 32) .cse436) ((_ extract 31 0) .cse436))) .cse431))) (concat ((_ extract 63 32) .cse435) ((_ extract 31 0) .cse435))) .cse11) (bvsle (let ((.cse437 (bvadd .cse438 .cse431))) (concat ((_ extract 63 32) .cse437) ((_ extract 31 0) .cse437))) .cse11) (bvsle (let ((.cse439 (bvadd .cse22 .cse431))) (concat ((_ extract 63 32) .cse439) ((_ extract 31 0) .cse439))) .cse11) (bvsle (let ((.cse440 (bvadd .cse9 .cse438))) (concat ((_ extract 63 32) .cse440) ((_ extract 31 0) .cse440))) .cse11))))))) (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse449 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse446 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse448 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse444 (bvadd (let ((.cse445 (bvadd .cse446 (let ((.cse447 (bvadd .cse67 .cse448))) (concat ((_ extract 63 32) .cse447) ((_ extract 31 0) .cse447)))))) (concat ((_ extract 63 32) .cse445) ((_ extract 31 0) .cse445))) .cse449))) (concat ((_ extract 63 32) .cse444) ((_ extract 31 0) .cse444))) .cse11) (bvsle (let ((.cse450 (bvadd (let ((.cse451 (bvadd .cse446 .cse20))) (concat ((_ extract 63 32) .cse451) ((_ extract 31 0) .cse451))) .cse449))) (concat ((_ extract 63 32) .cse450) ((_ extract 31 0) .cse450))) .cse11) (bvsle (let ((.cse452 (bvadd .cse22 .cse449))) (concat ((_ extract 63 32) .cse452) ((_ extract 31 0) .cse452))) .cse11) (bvsle (let ((.cse453 (bvadd .cse9 (let ((.cse454 (bvadd .cse446 (let ((.cse455 (bvadd (let ((.cse456 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse456) ((_ extract 31 0) .cse456))) .cse448))) (concat ((_ extract 63 32) .cse455) ((_ extract 31 0) .cse455)))))) (concat ((_ extract 63 32) .cse454) ((_ extract 31 0) .cse454)))))) (concat ((_ extract 63 32) .cse453) ((_ extract 31 0) .cse453))) .cse11))))) (or .cse6 (and (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse459 ((_ sign_extend 32) v_arrayElimCell_90))) (let ((.cse460 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse462 (let ((.cse465 (bvadd .cse459 (let ((.cse466 (bvadd (let ((.cse467 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse467) ((_ extract 31 0) .cse467))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse466) ((_ extract 31 0) .cse466)))))) (concat ((_ extract 63 32) .cse465) ((_ extract 31 0) .cse465))))) (or (bvsle (let ((.cse457 (bvadd (let ((.cse458 (bvadd .cse459 .cse20))) (concat ((_ extract 63 32) .cse458) ((_ extract 31 0) .cse458))) .cse460))) (concat ((_ extract 63 32) .cse457) ((_ extract 31 0) .cse457))) .cse11) (bvsle (let ((.cse461 (bvadd .cse462 .cse460))) (concat ((_ extract 63 32) .cse461) ((_ extract 31 0) .cse461))) .cse11) (bvsle (let ((.cse463 (bvadd .cse22 .cse460))) (concat ((_ extract 63 32) .cse463) ((_ extract 31 0) .cse463))) .cse11) (bvsle (let ((.cse464 (bvadd .cse9 .cse462))) (concat ((_ extract 63 32) .cse464) ((_ extract 31 0) .cse464))) .cse11))))) .cse41) (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse471 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse470 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse468 (bvadd (let ((.cse469 (bvadd .cse470 .cse20))) (concat ((_ extract 63 32) .cse469) ((_ extract 31 0) .cse469))) .cse471))) (concat ((_ extract 63 32) .cse468) ((_ extract 31 0) .cse468))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse474 (let ((.cse479 (bvadd (let ((.cse480 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse480) ((_ extract 31 0) .cse480))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse479) ((_ extract 31 0) .cse479))))) (let ((.cse476 (let ((.cse478 (bvadd .cse470 .cse474))) (concat ((_ extract 63 32) .cse478) ((_ extract 31 0) .cse478))))) (or (bvsle (let ((.cse472 (bvadd (let ((.cse473 (bvadd .cse9 .cse474))) (concat ((_ extract 63 32) .cse473) ((_ extract 31 0) .cse473))) .cse9))) (concat ((_ extract 63 32) .cse472) ((_ extract 31 0) .cse472))) .cse11) (bvsle (let ((.cse475 (bvadd .cse476 .cse471))) (concat ((_ extract 63 32) .cse475) ((_ extract 31 0) .cse475))) .cse11) (bvsle (let ((.cse477 (bvadd .cse9 .cse476))) (concat ((_ extract 63 32) .cse477) ((_ extract 31 0) .cse477))) .cse11)))))))) (bvsle (let ((.cse481 (bvadd .cse22 .cse471))) (concat ((_ extract 63 32) .cse481) ((_ extract 31 0) .cse481))) .cse11))))) .cse2) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse494 (let ((.cse499 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse499) ((_ extract 31 0) .cse499))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse485 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse484 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse482 (bvadd (let ((.cse483 (bvadd .cse484 .cse20))) (concat ((_ extract 63 32) .cse483) ((_ extract 31 0) .cse483))) .cse485))) (concat ((_ extract 63 32) .cse482) ((_ extract 31 0) .cse482))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse488 (let ((.cse493 (bvadd .cse494 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse493) ((_ extract 31 0) .cse493))))) (let ((.cse490 (let ((.cse492 (bvadd .cse484 .cse488))) (concat ((_ extract 63 32) .cse492) ((_ extract 31 0) .cse492))))) (or (bvsle (let ((.cse486 (bvadd (let ((.cse487 (bvadd .cse9 .cse488))) (concat ((_ extract 63 32) .cse487) ((_ extract 31 0) .cse487))) .cse9))) (concat ((_ extract 63 32) .cse486) ((_ extract 31 0) .cse486))) .cse11) (bvsle (let ((.cse489 (bvadd .cse490 .cse485))) (concat ((_ extract 63 32) .cse489) ((_ extract 31 0) .cse489))) .cse11) (bvsle (let ((.cse491 (bvadd .cse9 .cse490))) (concat ((_ extract 63 32) .cse491) ((_ extract 31 0) .cse491))) .cse11)))))))) (bvsle (let ((.cse495 (bvadd .cse22 .cse485))) (concat ((_ extract 63 32) .cse495) ((_ extract 31 0) .cse495))) .cse11)))) (bvsle (let ((.cse496 (bvadd (let ((.cse497 (bvadd .cse9 (let ((.cse498 (bvadd .cse494 .cse9))) (concat ((_ extract 63 32) .cse498) ((_ extract 31 0) .cse498)))))) (concat ((_ extract 63 32) .cse497) ((_ extract 31 0) .cse497))) .cse9))) (concat ((_ extract 63 32) .cse496) ((_ extract 31 0) .cse496))) .cse11)))) (or .cse41 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse502 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse509 (let ((.cse514 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse514) ((_ extract 31 0) .cse514))))) (let ((.cse503 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse505 (let ((.cse512 (bvadd .cse502 (let ((.cse513 (bvadd .cse509 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse513) ((_ extract 31 0) .cse513)))))) (concat ((_ extract 63 32) .cse512) ((_ extract 31 0) .cse512))))) (or (bvsle (let ((.cse500 (bvadd (let ((.cse501 (bvadd .cse502 .cse20))) (concat ((_ extract 63 32) .cse501) ((_ extract 31 0) .cse501))) .cse503))) (concat ((_ extract 63 32) .cse500) ((_ extract 31 0) .cse500))) .cse11) (bvsle (let ((.cse504 (bvadd .cse505 .cse503))) (concat ((_ extract 63 32) .cse504) ((_ extract 31 0) .cse504))) .cse11) (bvsle (let ((.cse506 (bvadd (let ((.cse507 (bvadd .cse9 (let ((.cse508 (bvadd .cse509 .cse9))) (concat ((_ extract 63 32) .cse508) ((_ extract 31 0) .cse508)))))) (concat ((_ extract 63 32) .cse507) ((_ extract 31 0) .cse507))) .cse9))) (concat ((_ extract 63 32) .cse506) ((_ extract 31 0) .cse506))) .cse11) (bvsle (let ((.cse510 (bvadd .cse22 .cse503))) (concat ((_ extract 63 32) .cse510) ((_ extract 31 0) .cse510))) .cse11) (bvsle (let ((.cse511 (bvadd .cse9 .cse505))) (concat ((_ extract 63 32) .cse511) ((_ extract 31 0) .cse511))) .cse11)))))))) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse520 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse517 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse519 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse515 (bvadd (let ((.cse516 (bvadd .cse517 (let ((.cse518 (bvadd .cse67 .cse519))) (concat ((_ extract 63 32) .cse518) ((_ extract 31 0) .cse518)))))) (concat ((_ extract 63 32) .cse516) ((_ extract 31 0) .cse516))) .cse520))) (concat ((_ extract 63 32) .cse515) ((_ extract 31 0) .cse515))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse529 (let ((.cse533 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse533) ((_ extract 31 0) .cse533))))) (let ((.cse523 (let ((.cse532 (bvadd .cse529 .cse519))) (concat ((_ extract 63 32) .cse532) ((_ extract 31 0) .cse532))))) (let ((.cse525 (let ((.cse531 (bvadd .cse517 .cse523))) (concat ((_ extract 63 32) .cse531) ((_ extract 31 0) .cse531))))) (or (bvsle (let ((.cse521 (bvadd (let ((.cse522 (bvadd .cse9 .cse523))) (concat ((_ extract 63 32) .cse522) ((_ extract 31 0) .cse522))) .cse9))) (concat ((_ extract 63 32) .cse521) ((_ extract 31 0) .cse521))) .cse11) (bvsle (let ((.cse524 (bvadd .cse525 .cse520))) (concat ((_ extract 63 32) .cse524) ((_ extract 31 0) .cse524))) .cse11) (bvsle (let ((.cse526 (bvadd (let ((.cse527 (bvadd .cse9 (let ((.cse528 (bvadd .cse529 .cse9))) (concat ((_ extract 63 32) .cse528) ((_ extract 31 0) .cse528)))))) (concat ((_ extract 63 32) .cse527) ((_ extract 31 0) .cse527))) .cse9))) (concat ((_ extract 63 32) .cse526) ((_ extract 31 0) .cse526))) .cse11) (bvsle (let ((.cse530 (bvadd .cse9 .cse525))) (concat ((_ extract 63 32) .cse530) ((_ extract 31 0) .cse530))) .cse11))))))))) (bvsle (let ((.cse534 (bvadd (let ((.cse535 (bvadd .cse517 .cse20))) (concat ((_ extract 63 32) .cse535) ((_ extract 31 0) .cse535))) .cse520))) (concat ((_ extract 63 32) .cse534) ((_ extract 31 0) .cse534))) .cse11)))) (bvsle (let ((.cse536 (bvadd .cse22 .cse520))) (concat ((_ extract 63 32) .cse536) ((_ extract 31 0) .cse536))) .cse11))))))) (or (let ((.cse541 (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (bvsle (let ((.cse1015 (bvadd (let ((.cse1016 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse20))) (concat ((_ extract 63 32) .cse1016) ((_ extract 31 0) .cse1016))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse1015) ((_ extract 31 0) .cse1015))) .cse11)))) (and (or .cse425 .cse541) (or .cse5 (let ((.cse542 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse661 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse663 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse659 (bvadd (let ((.cse660 (bvadd .cse661 (let ((.cse662 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse662) ((_ extract 31 0) .cse662)))))) (concat ((_ extract 63 32) .cse660) ((_ extract 31 0) .cse660))) .cse663))) (concat ((_ extract 63 32) .cse659) ((_ extract 31 0) .cse659))) .cse11) (bvsle (let ((.cse664 (bvadd (let ((.cse665 (bvadd .cse661 .cse20))) (concat ((_ extract 63 32) .cse665) ((_ extract 31 0) .cse665))) .cse663))) (concat ((_ extract 63 32) .cse664) ((_ extract 31 0) .cse664))) .cse11)))))) (and (or .cse3 .cse87 .cse542) (or .cse84 .cse541 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse546 (let ((.cse550 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse550) ((_ extract 31 0) .cse550))))) (or (bvsle (let ((.cse543 (bvadd (let ((.cse544 (bvadd .cse9 (let ((.cse545 (bvadd .cse546 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse545) ((_ extract 31 0) .cse545)))))) (concat ((_ extract 63 32) .cse544) ((_ extract 31 0) .cse544))) .cse9))) (concat ((_ extract 63 32) .cse543) ((_ extract 31 0) .cse543))) .cse11) (bvsle (let ((.cse547 (bvadd (let ((.cse548 (bvadd .cse9 (let ((.cse549 (bvadd .cse546 .cse9))) (concat ((_ extract 63 32) .cse549) ((_ extract 31 0) .cse549)))))) (concat ((_ extract 63 32) .cse548) ((_ extract 31 0) .cse548))) .cse9))) (concat ((_ extract 63 32) .cse547) ((_ extract 31 0) .cse547))) .cse11))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse553 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse555 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse556 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse562 (let ((.cse566 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse566) ((_ extract 31 0) .cse566))))) (or (bvsle (let ((.cse551 (bvadd (let ((.cse552 (bvadd .cse553 (let ((.cse554 (bvadd .cse67 .cse555))) (concat ((_ extract 63 32) .cse554) ((_ extract 31 0) .cse554)))))) (concat ((_ extract 63 32) .cse552) ((_ extract 31 0) .cse552))) .cse556))) (concat ((_ extract 63 32) .cse551) ((_ extract 31 0) .cse551))) .cse11) (bvsle (let ((.cse557 (bvadd (let ((.cse558 (bvadd .cse553 .cse20))) (concat ((_ extract 63 32) .cse558) ((_ extract 31 0) .cse558))) .cse556))) (concat ((_ extract 63 32) .cse557) ((_ extract 31 0) .cse557))) .cse11) (bvsle (let ((.cse559 (bvadd (let ((.cse560 (bvadd .cse553 (let ((.cse561 (bvadd .cse562 .cse555))) (concat ((_ extract 63 32) .cse561) ((_ extract 31 0) .cse561)))))) (concat ((_ extract 63 32) .cse560) ((_ extract 31 0) .cse560))) .cse556))) (concat ((_ extract 63 32) .cse559) ((_ extract 31 0) .cse559))) .cse11) (bvsle (let ((.cse563 (bvadd (let ((.cse564 (bvadd .cse9 (let ((.cse565 (bvadd .cse562 .cse9))) (concat ((_ extract 63 32) .cse565) ((_ extract 31 0) .cse565)))))) (concat ((_ extract 63 32) .cse564) ((_ extract 31 0) .cse564))) .cse9))) (concat ((_ extract 63 32) .cse563) ((_ extract 31 0) .cse563))) .cse11)))) .cse41) (or (and (or .cse84 .cse541 .cse86) (or .cse87 .cse542) (or .cse6 (and (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse572 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse573 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse569 (let ((.cse574 (bvadd (let ((.cse575 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse575) ((_ extract 31 0) .cse575))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse574) ((_ extract 31 0) .cse574))))) (or (bvsle (let ((.cse567 (bvadd (let ((.cse568 (bvadd .cse9 .cse569))) (concat ((_ extract 63 32) .cse568) ((_ extract 31 0) .cse568))) .cse9))) (concat ((_ extract 63 32) .cse567) ((_ extract 31 0) .cse567))) .cse11) (bvsle (let ((.cse570 (bvadd (let ((.cse571 (bvadd .cse572 .cse569))) (concat ((_ extract 63 32) .cse571) ((_ extract 31 0) .cse571))) .cse573))) (concat ((_ extract 63 32) .cse570) ((_ extract 31 0) .cse570))) .cse11)))) (bvsle (let ((.cse576 (bvadd (let ((.cse577 (bvadd .cse572 .cse20))) (concat ((_ extract 63 32) .cse577) ((_ extract 31 0) .cse577))) .cse573))) (concat ((_ extract 63 32) .cse576) ((_ extract 31 0) .cse576))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse580 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse581 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse578 (bvadd (let ((.cse579 (bvadd .cse580 .cse20))) (concat ((_ extract 63 32) .cse579) ((_ extract 31 0) .cse579))) .cse581))) (concat ((_ extract 63 32) .cse578) ((_ extract 31 0) .cse578))) .cse11) (bvsle (let ((.cse582 (bvadd (let ((.cse583 (bvadd .cse580 (let ((.cse584 (bvadd (let ((.cse585 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse585) ((_ extract 31 0) .cse585))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse584) ((_ extract 31 0) .cse584)))))) (concat ((_ extract 63 32) .cse583) ((_ extract 31 0) .cse583))) .cse581))) (concat ((_ extract 63 32) .cse582) ((_ extract 31 0) .cse582))) .cse11)))) .cse41))) (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse588 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse589 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse586 (bvadd (let ((.cse587 (bvadd .cse588 .cse20))) (concat ((_ extract 63 32) .cse587) ((_ extract 31 0) .cse587))) .cse589))) (concat ((_ extract 63 32) .cse586) ((_ extract 31 0) .cse586))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse593 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse596 (let ((.cse599 (bvadd (let ((.cse600 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse600) ((_ extract 31 0) .cse600))) .cse593))) (concat ((_ extract 63 32) .cse599) ((_ extract 31 0) .cse599))))) (or (bvsle (let ((.cse590 (bvadd (let ((.cse591 (bvadd .cse588 (let ((.cse592 (bvadd .cse67 .cse593))) (concat ((_ extract 63 32) .cse592) ((_ extract 31 0) .cse592)))))) (concat ((_ extract 63 32) .cse591) ((_ extract 31 0) .cse591))) .cse589))) (concat ((_ extract 63 32) .cse590) ((_ extract 31 0) .cse590))) .cse11) (bvsle (let ((.cse594 (bvadd (let ((.cse595 (bvadd .cse9 .cse596))) (concat ((_ extract 63 32) .cse595) ((_ extract 31 0) .cse595))) .cse9))) (concat ((_ extract 63 32) .cse594) ((_ extract 31 0) .cse594))) .cse11) (bvsle (let ((.cse597 (bvadd (let ((.cse598 (bvadd .cse588 .cse596))) (concat ((_ extract 63 32) .cse598) ((_ extract 31 0) .cse598))) .cse589))) (concat ((_ extract 63 32) .cse597) ((_ extract 31 0) .cse597))) .cse11)))))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse603 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse605 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse606 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse601 (bvadd (let ((.cse602 (bvadd .cse603 (let ((.cse604 (bvadd .cse67 .cse605))) (concat ((_ extract 63 32) .cse604) ((_ extract 31 0) .cse604)))))) (concat ((_ extract 63 32) .cse602) ((_ extract 31 0) .cse602))) .cse606))) (concat ((_ extract 63 32) .cse601) ((_ extract 31 0) .cse601))) .cse11) (bvsle (let ((.cse607 (bvadd (let ((.cse608 (bvadd .cse603 .cse20))) (concat ((_ extract 63 32) .cse608) ((_ extract 31 0) .cse608))) .cse606))) (concat ((_ extract 63 32) .cse607) ((_ extract 31 0) .cse607))) .cse11) (bvsle (let ((.cse609 (bvadd (let ((.cse610 (bvadd .cse603 (let ((.cse611 (bvadd (let ((.cse612 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse612) ((_ extract 31 0) .cse612))) .cse605))) (concat ((_ extract 63 32) .cse611) ((_ extract 31 0) .cse611)))))) (concat ((_ extract 63 32) .cse610) ((_ extract 31 0) .cse610))) .cse606))) (concat ((_ extract 63 32) .cse609) ((_ extract 31 0) .cse609))) .cse11)))) .cse41)) .cse2) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse627 (let ((.cse631 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse631) ((_ extract 31 0) .cse631))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse615 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse616 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse613 (bvadd (let ((.cse614 (bvadd .cse615 .cse20))) (concat ((_ extract 63 32) .cse614) ((_ extract 31 0) .cse614))) .cse616))) (concat ((_ extract 63 32) .cse613) ((_ extract 31 0) .cse613))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse620 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse623 (let ((.cse626 (bvadd .cse627 .cse620))) (concat ((_ extract 63 32) .cse626) ((_ extract 31 0) .cse626))))) (or (bvsle (let ((.cse617 (bvadd (let ((.cse618 (bvadd .cse615 (let ((.cse619 (bvadd .cse67 .cse620))) (concat ((_ extract 63 32) .cse619) ((_ extract 31 0) .cse619)))))) (concat ((_ extract 63 32) .cse618) ((_ extract 31 0) .cse618))) .cse616))) (concat ((_ extract 63 32) .cse617) ((_ extract 31 0) .cse617))) .cse11) (bvsle (let ((.cse621 (bvadd (let ((.cse622 (bvadd .cse9 .cse623))) (concat ((_ extract 63 32) .cse622) ((_ extract 31 0) .cse622))) .cse9))) (concat ((_ extract 63 32) .cse621) ((_ extract 31 0) .cse621))) .cse11) (bvsle (let ((.cse624 (bvadd (let ((.cse625 (bvadd .cse615 .cse623))) (concat ((_ extract 63 32) .cse625) ((_ extract 31 0) .cse625))) .cse616))) (concat ((_ extract 63 32) .cse624) ((_ extract 31 0) .cse624))) .cse11)))))))) (bvsle (let ((.cse628 (bvadd (let ((.cse629 (bvadd .cse9 (let ((.cse630 (bvadd .cse627 .cse9))) (concat ((_ extract 63 32) .cse630) ((_ extract 31 0) .cse630)))))) (concat ((_ extract 63 32) .cse629) ((_ extract 31 0) .cse629))) .cse9))) (concat ((_ extract 63 32) .cse628) ((_ extract 31 0) .cse628))) .cse11)))) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse634 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse635 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse639 (let ((.cse643 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse643) ((_ extract 31 0) .cse643))))) (or (bvsle (let ((.cse632 (bvadd (let ((.cse633 (bvadd .cse634 .cse20))) (concat ((_ extract 63 32) .cse633) ((_ extract 31 0) .cse633))) .cse635))) (concat ((_ extract 63 32) .cse632) ((_ extract 31 0) .cse632))) .cse11) (bvsle (let ((.cse636 (bvadd (let ((.cse637 (bvadd .cse634 (let ((.cse638 (bvadd .cse639 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse638) ((_ extract 31 0) .cse638)))))) (concat ((_ extract 63 32) .cse637) ((_ extract 31 0) .cse637))) .cse635))) (concat ((_ extract 63 32) .cse636) ((_ extract 31 0) .cse636))) .cse11) (bvsle (let ((.cse640 (bvadd (let ((.cse641 (bvadd .cse9 (let ((.cse642 (bvadd .cse639 .cse9))) (concat ((_ extract 63 32) .cse642) ((_ extract 31 0) .cse642)))))) (concat ((_ extract 63 32) .cse641) ((_ extract 31 0) .cse641))) .cse9))) (concat ((_ extract 63 32) .cse640) ((_ extract 31 0) .cse640))) .cse11)))) .cse41) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse652 (let ((.cse658 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse658) ((_ extract 31 0) .cse658))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse649 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse650 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse646 (let ((.cse651 (bvadd .cse652 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse651) ((_ extract 31 0) .cse651))))) (or (bvsle (let ((.cse644 (bvadd (let ((.cse645 (bvadd .cse9 .cse646))) (concat ((_ extract 63 32) .cse645) ((_ extract 31 0) .cse645))) .cse9))) (concat ((_ extract 63 32) .cse644) ((_ extract 31 0) .cse644))) .cse11) (bvsle (let ((.cse647 (bvadd (let ((.cse648 (bvadd .cse649 .cse646))) (concat ((_ extract 63 32) .cse648) ((_ extract 31 0) .cse648))) .cse650))) (concat ((_ extract 63 32) .cse647) ((_ extract 31 0) .cse647))) .cse11)))) (bvsle (let ((.cse653 (bvadd (let ((.cse654 (bvadd .cse649 .cse20))) (concat ((_ extract 63 32) .cse654) ((_ extract 31 0) .cse654))) .cse650))) (concat ((_ extract 63 32) .cse653) ((_ extract 31 0) .cse653))) .cse11)))) (bvsle (let ((.cse655 (bvadd (let ((.cse656 (bvadd .cse9 (let ((.cse657 (bvadd .cse652 .cse9))) (concat ((_ extract 63 32) .cse657) ((_ extract 31 0) .cse657)))))) (concat ((_ extract 63 32) .cse656) ((_ extract 31 0) .cse656))) .cse9))) (concat ((_ extract 63 32) .cse655) ((_ extract 31 0) .cse655))) .cse11))))) .cse6)))) (not .cse4) (or (and (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse675 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse668 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse677 ((_ sign_extend 32) v_arrayElimCell_89))) (or (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse672 (let ((.cse678 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse678) ((_ extract 31 0) .cse678))))) (let ((.cse667 (let ((.cse674 (bvadd .cse675 (let ((.cse676 (bvadd .cse672 .cse677))) (concat ((_ extract 63 32) .cse676) ((_ extract 31 0) .cse676)))))) (concat ((_ extract 63 32) .cse674) ((_ extract 31 0) .cse674))))) (or (bvsle (let ((.cse666 (bvadd .cse667 .cse668))) (concat ((_ extract 63 32) .cse666) ((_ extract 31 0) .cse666))) .cse11) (bvsle (let ((.cse669 (bvadd (let ((.cse670 (bvadd .cse9 (let ((.cse671 (bvadd .cse672 .cse9))) (concat ((_ extract 63 32) .cse671) ((_ extract 31 0) .cse671)))))) (concat ((_ extract 63 32) .cse670) ((_ extract 31 0) .cse670))) .cse9))) (concat ((_ extract 63 32) .cse669) ((_ extract 31 0) .cse669))) .cse11) (bvsle (let ((.cse673 (bvadd .cse9 .cse667))) (concat ((_ extract 63 32) .cse673) ((_ extract 31 0) .cse673))) .cse11))))) (bvsle (let ((.cse679 (bvadd (let ((.cse680 (bvadd .cse675 (let ((.cse681 (bvadd .cse67 .cse677))) (concat ((_ extract 63 32) .cse681) ((_ extract 31 0) .cse681)))))) (concat ((_ extract 63 32) .cse680) ((_ extract 31 0) .cse680))) .cse668))) (concat ((_ extract 63 32) .cse679) ((_ extract 31 0) .cse679))) .cse11)))) (bvsle (let ((.cse682 (bvadd (let ((.cse683 (bvadd .cse675 .cse20))) (concat ((_ extract 63 32) .cse683) ((_ extract 31 0) .cse683))) .cse668))) (concat ((_ extract 63 32) .cse682) ((_ extract 31 0) .cse682))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse686 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse688 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse689 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse693 (let ((.cse695 (bvadd .cse686 (let ((.cse696 (bvadd (let ((.cse697 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse697) ((_ extract 31 0) .cse697))) .cse688))) (concat ((_ extract 63 32) .cse696) ((_ extract 31 0) .cse696)))))) (concat ((_ extract 63 32) .cse695) ((_ extract 31 0) .cse695))))) (or (bvsle (let ((.cse684 (bvadd (let ((.cse685 (bvadd .cse686 (let ((.cse687 (bvadd .cse67 .cse688))) (concat ((_ extract 63 32) .cse687) ((_ extract 31 0) .cse687)))))) (concat ((_ extract 63 32) .cse685) ((_ extract 31 0) .cse685))) .cse689))) (concat ((_ extract 63 32) .cse684) ((_ extract 31 0) .cse684))) .cse11) (bvsle (let ((.cse690 (bvadd (let ((.cse691 (bvadd .cse686 .cse20))) (concat ((_ extract 63 32) .cse691) ((_ extract 31 0) .cse691))) .cse689))) (concat ((_ extract 63 32) .cse690) ((_ extract 31 0) .cse690))) .cse11) (bvsle (let ((.cse692 (bvadd .cse693 .cse689))) (concat ((_ extract 63 32) .cse692) ((_ extract 31 0) .cse692))) .cse11) (bvsle (let ((.cse694 (bvadd .cse9 .cse693))) (concat ((_ extract 63 32) .cse694) ((_ extract 31 0) .cse694))) .cse11))))) .cse2)) .cse41) (or .cse84 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse703 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse700 (let ((.cse706 (bvadd (let ((.cse707 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse707) ((_ extract 31 0) .cse707))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse706) ((_ extract 31 0) .cse706))))) (or (bvsle (let ((.cse698 (bvadd (let ((.cse699 (bvadd .cse9 .cse700))) (concat ((_ extract 63 32) .cse699) ((_ extract 31 0) .cse699))) .cse9))) (concat ((_ extract 63 32) .cse698) ((_ extract 31 0) .cse698))) .cse11) (bvsle (let ((.cse701 (bvadd (let ((.cse702 (bvadd .cse703 .cse20))) (concat ((_ extract 63 32) .cse702) ((_ extract 31 0) .cse702))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse701) ((_ extract 31 0) .cse701))) .cse11) (bvsle (let ((.cse704 (bvadd .cse9 (let ((.cse705 (bvadd .cse703 .cse700))) (concat ((_ extract 63 32) .cse705) ((_ extract 31 0) .cse705)))))) (concat ((_ extract 63 32) .cse704) ((_ extract 31 0) .cse704))) .cse11))))) (or .cse6 (and (or (and (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse711 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse710 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse708 (bvadd (let ((.cse709 (bvadd .cse710 .cse20))) (concat ((_ extract 63 32) .cse709) ((_ extract 31 0) .cse709))) .cse711))) (concat ((_ extract 63 32) .cse708) ((_ extract 31 0) .cse708))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse714 (let ((.cse719 (bvadd (let ((.cse720 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse720) ((_ extract 31 0) .cse720))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse719) ((_ extract 31 0) .cse719))))) (let ((.cse716 (let ((.cse718 (bvadd .cse710 .cse714))) (concat ((_ extract 63 32) .cse718) ((_ extract 31 0) .cse718))))) (or (bvsle (let ((.cse712 (bvadd (let ((.cse713 (bvadd .cse9 .cse714))) (concat ((_ extract 63 32) .cse713) ((_ extract 31 0) .cse713))) .cse9))) (concat ((_ extract 63 32) .cse712) ((_ extract 31 0) .cse712))) .cse11) (bvsle (let ((.cse715 (bvadd .cse716 .cse711))) (concat ((_ extract 63 32) .cse715) ((_ extract 31 0) .cse715))) .cse11) (bvsle (let ((.cse717 (bvadd .cse9 .cse716))) (concat ((_ extract 63 32) .cse717) ((_ extract 31 0) .cse717))) .cse11)))))))) (or .cse41 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse723 ((_ sign_extend 32) v_arrayElimCell_90))) (let ((.cse724 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse726 (let ((.cse728 (bvadd .cse723 (let ((.cse729 (bvadd (let ((.cse730 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse730) ((_ extract 31 0) .cse730))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse729) ((_ extract 31 0) .cse729)))))) (concat ((_ extract 63 32) .cse728) ((_ extract 31 0) .cse728))))) (or (bvsle (let ((.cse721 (bvadd (let ((.cse722 (bvadd .cse723 .cse20))) (concat ((_ extract 63 32) .cse722) ((_ extract 31 0) .cse722))) .cse724))) (concat ((_ extract 63 32) .cse721) ((_ extract 31 0) .cse721))) .cse11) (bvsle (let ((.cse725 (bvadd .cse726 .cse724))) (concat ((_ extract 63 32) .cse725) ((_ extract 31 0) .cse725))) .cse11) (bvsle (let ((.cse727 (bvadd .cse9 .cse726))) (concat ((_ extract 63 32) .cse727) ((_ extract 31 0) .cse727))) .cse11))))))) .cse2) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse733 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse740 (let ((.cse744 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse744) ((_ extract 31 0) .cse744))))) (let ((.cse734 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse736 (let ((.cse742 (bvadd .cse733 (let ((.cse743 (bvadd .cse740 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse743) ((_ extract 31 0) .cse743)))))) (concat ((_ extract 63 32) .cse742) ((_ extract 31 0) .cse742))))) (or (bvsle (let ((.cse731 (bvadd (let ((.cse732 (bvadd .cse733 .cse20))) (concat ((_ extract 63 32) .cse732) ((_ extract 31 0) .cse732))) .cse734))) (concat ((_ extract 63 32) .cse731) ((_ extract 31 0) .cse731))) .cse11) (bvsle (let ((.cse735 (bvadd .cse736 .cse734))) (concat ((_ extract 63 32) .cse735) ((_ extract 31 0) .cse735))) .cse11) (bvsle (let ((.cse737 (bvadd (let ((.cse738 (bvadd .cse9 (let ((.cse739 (bvadd .cse740 .cse9))) (concat ((_ extract 63 32) .cse739) ((_ extract 31 0) .cse739)))))) (concat ((_ extract 63 32) .cse738) ((_ extract 31 0) .cse738))) .cse9))) (concat ((_ extract 63 32) .cse737) ((_ extract 31 0) .cse737))) .cse11) (bvsle (let ((.cse741 (bvadd .cse9 .cse736))) (concat ((_ extract 63 32) .cse741) ((_ extract 31 0) .cse741))) .cse11))))) .cse41) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse757 (let ((.cse761 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse761) ((_ extract 31 0) .cse761))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse748 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse747 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse745 (bvadd (let ((.cse746 (bvadd .cse747 .cse20))) (concat ((_ extract 63 32) .cse746) ((_ extract 31 0) .cse746))) .cse748))) (concat ((_ extract 63 32) .cse745) ((_ extract 31 0) .cse745))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse751 (let ((.cse756 (bvadd .cse757 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse756) ((_ extract 31 0) .cse756))))) (let ((.cse753 (let ((.cse755 (bvadd .cse747 .cse751))) (concat ((_ extract 63 32) .cse755) ((_ extract 31 0) .cse755))))) (or (bvsle (let ((.cse749 (bvadd (let ((.cse750 (bvadd .cse9 .cse751))) (concat ((_ extract 63 32) .cse750) ((_ extract 31 0) .cse750))) .cse9))) (concat ((_ extract 63 32) .cse749) ((_ extract 31 0) .cse749))) .cse11) (bvsle (let ((.cse752 (bvadd .cse753 .cse748))) (concat ((_ extract 63 32) .cse752) ((_ extract 31 0) .cse752))) .cse11) (bvsle (let ((.cse754 (bvadd .cse9 .cse753))) (concat ((_ extract 63 32) .cse754) ((_ extract 31 0) .cse754))) .cse11)))))))) (bvsle (let ((.cse758 (bvadd (let ((.cse759 (bvadd .cse9 (let ((.cse760 (bvadd .cse757 .cse9))) (concat ((_ extract 63 32) .cse760) ((_ extract 31 0) .cse760)))))) (concat ((_ extract 63 32) .cse759) ((_ extract 31 0) .cse759))) .cse9))) (concat ((_ extract 63 32) .cse758) ((_ extract 31 0) .cse758))) .cse11)))))) (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse767 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse764 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse766 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse762 (bvadd (let ((.cse763 (bvadd .cse764 (let ((.cse765 (bvadd .cse67 .cse766))) (concat ((_ extract 63 32) .cse765) ((_ extract 31 0) .cse765)))))) (concat ((_ extract 63 32) .cse763) ((_ extract 31 0) .cse763))) .cse767))) (concat ((_ extract 63 32) .cse762) ((_ extract 31 0) .cse762))) .cse11) (bvsle (let ((.cse768 (bvadd (let ((.cse769 (bvadd .cse764 .cse20))) (concat ((_ extract 63 32) .cse769) ((_ extract 31 0) .cse769))) .cse767))) (concat ((_ extract 63 32) .cse768) ((_ extract 31 0) .cse768))) .cse11) (bvsle (let ((.cse770 (bvadd .cse9 (let ((.cse771 (bvadd .cse764 (let ((.cse772 (bvadd (let ((.cse773 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse773) ((_ extract 31 0) .cse773))) .cse766))) (concat ((_ extract 63 32) .cse772) ((_ extract 31 0) .cse772)))))) (concat ((_ extract 63 32) .cse771) ((_ extract 31 0) .cse771)))))) (concat ((_ extract 63 32) .cse770) ((_ extract 31 0) .cse770))) .cse11))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse778 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse776 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse782 (let ((.cse789 (bvadd (let ((.cse790 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse790) ((_ extract 31 0) .cse790))) .cse778))) (concat ((_ extract 63 32) .cse789) ((_ extract 31 0) .cse789))))) (let ((.cse779 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse786 (let ((.cse788 (bvadd .cse776 .cse782))) (concat ((_ extract 63 32) .cse788) ((_ extract 31 0) .cse788))))) (or (bvsle (let ((.cse774 (bvadd (let ((.cse775 (bvadd .cse776 (let ((.cse777 (bvadd .cse67 .cse778))) (concat ((_ extract 63 32) .cse777) ((_ extract 31 0) .cse777)))))) (concat ((_ extract 63 32) .cse775) ((_ extract 31 0) .cse775))) .cse779))) (concat ((_ extract 63 32) .cse774) ((_ extract 31 0) .cse774))) .cse11) (bvsle (let ((.cse780 (bvadd (let ((.cse781 (bvadd .cse9 .cse782))) (concat ((_ extract 63 32) .cse781) ((_ extract 31 0) .cse781))) .cse9))) (concat ((_ extract 63 32) .cse780) ((_ extract 31 0) .cse780))) .cse11) (bvsle (let ((.cse783 (bvadd (let ((.cse784 (bvadd .cse776 .cse20))) (concat ((_ extract 63 32) .cse784) ((_ extract 31 0) .cse784))) .cse779))) (concat ((_ extract 63 32) .cse783) ((_ extract 31 0) .cse783))) .cse11) (bvsle (let ((.cse785 (bvadd .cse786 .cse779))) (concat ((_ extract 63 32) .cse785) ((_ extract 31 0) .cse785))) .cse11) (bvsle (let ((.cse787 (bvadd .cse9 .cse786))) (concat ((_ extract 63 32) .cse787) ((_ extract 31 0) .cse787))) .cse11)))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse793 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse796 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse795 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse791 (bvadd (let ((.cse792 (bvadd .cse793 (let ((.cse794 (bvadd .cse67 .cse795))) (concat ((_ extract 63 32) .cse794) ((_ extract 31 0) .cse794)))))) (concat ((_ extract 63 32) .cse792) ((_ extract 31 0) .cse792))) .cse796))) (concat ((_ extract 63 32) .cse791) ((_ extract 31 0) .cse791))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse805 (let ((.cse809 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse809) ((_ extract 31 0) .cse809))))) (let ((.cse799 (let ((.cse808 (bvadd .cse805 .cse795))) (concat ((_ extract 63 32) .cse808) ((_ extract 31 0) .cse808))))) (let ((.cse801 (let ((.cse807 (bvadd .cse793 .cse799))) (concat ((_ extract 63 32) .cse807) ((_ extract 31 0) .cse807))))) (or (bvsle (let ((.cse797 (bvadd (let ((.cse798 (bvadd .cse9 .cse799))) (concat ((_ extract 63 32) .cse798) ((_ extract 31 0) .cse798))) .cse9))) (concat ((_ extract 63 32) .cse797) ((_ extract 31 0) .cse797))) .cse11) (bvsle (let ((.cse800 (bvadd .cse801 .cse796))) (concat ((_ extract 63 32) .cse800) ((_ extract 31 0) .cse800))) .cse11) (bvsle (let ((.cse802 (bvadd (let ((.cse803 (bvadd .cse9 (let ((.cse804 (bvadd .cse805 .cse9))) (concat ((_ extract 63 32) .cse804) ((_ extract 31 0) .cse804)))))) (concat ((_ extract 63 32) .cse803) ((_ extract 31 0) .cse803))) .cse9))) (concat ((_ extract 63 32) .cse802) ((_ extract 31 0) .cse802))) .cse11) (bvsle (let ((.cse806 (bvadd .cse9 .cse801))) (concat ((_ extract 63 32) .cse806) ((_ extract 31 0) .cse806))) .cse11))))))))) (bvsle (let ((.cse810 (bvadd (let ((.cse811 (bvadd .cse793 .cse20))) (concat ((_ extract 63 32) .cse811) ((_ extract 31 0) .cse811))) .cse796))) (concat ((_ extract 63 32) .cse810) ((_ extract 31 0) .cse810))) .cse11)))) (or .cse268 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse814 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse812 (bvadd (let ((.cse813 (bvadd .cse814 .cse20))) (concat ((_ extract 63 32) .cse813) ((_ extract 31 0) .cse813))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse812) ((_ extract 31 0) .cse812))) .cse11) (bvsle (let ((.cse815 (bvadd .cse9 (let ((.cse816 (bvadd .cse814 (let ((.cse817 (bvadd (let ((.cse818 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse818) ((_ extract 31 0) .cse818))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse817) ((_ extract 31 0) .cse817)))))) (concat ((_ extract 63 32) .cse816) ((_ extract 31 0) .cse816)))))) (concat ((_ extract 63 32) .cse815) ((_ extract 31 0) .cse815))) .cse11))))) (or .cse154 (and (or .cse268 .cse269) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse823 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse821 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse827 (let ((.cse832 (bvadd (let ((.cse833 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse833) ((_ extract 31 0) .cse833))) .cse823))) (concat ((_ extract 63 32) .cse832) ((_ extract 31 0) .cse832))))) (let ((.cse824 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse829 (let ((.cse831 (bvadd .cse821 .cse827))) (concat ((_ extract 63 32) .cse831) ((_ extract 31 0) .cse831))))) (or (bvsle (let ((.cse819 (bvadd (let ((.cse820 (bvadd .cse821 (let ((.cse822 (bvadd .cse67 .cse823))) (concat ((_ extract 63 32) .cse822) ((_ extract 31 0) .cse822)))))) (concat ((_ extract 63 32) .cse820) ((_ extract 31 0) .cse820))) .cse824))) (concat ((_ extract 63 32) .cse819) ((_ extract 31 0) .cse819))) .cse11) (bvsle (let ((.cse825 (bvadd (let ((.cse826 (bvadd .cse9 .cse827))) (concat ((_ extract 63 32) .cse826) ((_ extract 31 0) .cse826))) .cse9))) (concat ((_ extract 63 32) .cse825) ((_ extract 31 0) .cse825))) .cse11) (bvsle (let ((.cse828 (bvadd .cse829 .cse824))) (concat ((_ extract 63 32) .cse828) ((_ extract 31 0) .cse828))) .cse11) (bvsle (let ((.cse830 (bvadd .cse9 .cse829))) (concat ((_ extract 63 32) .cse830) ((_ extract 31 0) .cse830))) .cse11)))))) .cse2) (or .cse6 (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse839 (let ((.cse843 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse843) ((_ extract 31 0) .cse843))))) (let ((.cse835 (let ((.cse841 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse842 (bvadd .cse839 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse842) ((_ extract 31 0) .cse842)))))) (concat ((_ extract 63 32) .cse841) ((_ extract 31 0) .cse841))))) (or (bvsle (let ((.cse834 (bvadd .cse835 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse834) ((_ extract 31 0) .cse834))) .cse11) (bvsle (let ((.cse836 (bvadd (let ((.cse837 (bvadd .cse9 (let ((.cse838 (bvadd .cse839 .cse9))) (concat ((_ extract 63 32) .cse838) ((_ extract 31 0) .cse838)))))) (concat ((_ extract 63 32) .cse837) ((_ extract 31 0) .cse837))) .cse9))) (concat ((_ extract 63 32) .cse836) ((_ extract 31 0) .cse836))) .cse11) (bvsle (let ((.cse840 (bvadd .cse9 .cse835))) (concat ((_ extract 63 32) .cse840) ((_ extract 31 0) .cse840))) .cse11))))) .cse41) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse852 (let ((.cse856 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse856) ((_ extract 31 0) .cse856))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse846 (let ((.cse851 (bvadd .cse852 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse851) ((_ extract 31 0) .cse851))))) (let ((.cse848 (let ((.cse850 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse846))) (concat ((_ extract 63 32) .cse850) ((_ extract 31 0) .cse850))))) (or (bvsle (let ((.cse844 (bvadd (let ((.cse845 (bvadd .cse9 .cse846))) (concat ((_ extract 63 32) .cse845) ((_ extract 31 0) .cse845))) .cse9))) (concat ((_ extract 63 32) .cse844) ((_ extract 31 0) .cse844))) .cse11) (bvsle (let ((.cse847 (bvadd .cse848 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse847) ((_ extract 31 0) .cse847))) .cse11) (bvsle (let ((.cse849 (bvadd .cse9 .cse848))) (concat ((_ extract 63 32) .cse849) ((_ extract 31 0) .cse849))) .cse11))))) (bvsle (let ((.cse853 (bvadd (let ((.cse854 (bvadd .cse9 (let ((.cse855 (bvadd .cse852 .cse9))) (concat ((_ extract 63 32) .cse855) ((_ extract 31 0) .cse855)))))) (concat ((_ extract 63 32) .cse854) ((_ extract 31 0) .cse854))) .cse9))) (concat ((_ extract 63 32) .cse853) ((_ extract 31 0) .cse853))) .cse11)))) (or (and (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse859 (let ((.cse864 (bvadd (let ((.cse865 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse865) ((_ extract 31 0) .cse865))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse864) ((_ extract 31 0) .cse864))))) (let ((.cse861 (let ((.cse863 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse859))) (concat ((_ extract 63 32) .cse863) ((_ extract 31 0) .cse863))))) (or (bvsle (let ((.cse857 (bvadd (let ((.cse858 (bvadd .cse9 .cse859))) (concat ((_ extract 63 32) .cse858) ((_ extract 31 0) .cse858))) .cse9))) (concat ((_ extract 63 32) .cse857) ((_ extract 31 0) .cse857))) .cse11) (bvsle (let ((.cse860 (bvadd .cse861 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse860) ((_ extract 31 0) .cse860))) .cse11) (bvsle (let ((.cse862 (bvadd .cse9 .cse861))) (concat ((_ extract 63 32) .cse862) ((_ extract 31 0) .cse862))) .cse11))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse867 (let ((.cse869 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse870 (bvadd (let ((.cse871 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse871) ((_ extract 31 0) .cse871))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse870) ((_ extract 31 0) .cse870)))))) (concat ((_ extract 63 32) .cse869) ((_ extract 31 0) .cse869))))) (or (bvsle (let ((.cse866 (bvadd .cse867 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse866) ((_ extract 31 0) .cse866))) .cse11) (bvsle (let ((.cse868 (bvadd .cse9 .cse867))) (concat ((_ extract 63 32) .cse868) ((_ extract 31 0) .cse868))) .cse11)))) .cse41)) .cse2))) (or .cse84 .cse155) (or (and (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse881 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse883 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse874 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse878 (let ((.cse884 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse884) ((_ extract 31 0) .cse884))))) (let ((.cse873 (let ((.cse880 (bvadd .cse881 (let ((.cse882 (bvadd .cse878 .cse883))) (concat ((_ extract 63 32) .cse882) ((_ extract 31 0) .cse882)))))) (concat ((_ extract 63 32) .cse880) ((_ extract 31 0) .cse880))))) (or (bvsle (let ((.cse872 (bvadd .cse873 .cse874))) (concat ((_ extract 63 32) .cse872) ((_ extract 31 0) .cse872))) .cse11) (bvsle (let ((.cse875 (bvadd (let ((.cse876 (bvadd .cse9 (let ((.cse877 (bvadd .cse878 .cse9))) (concat ((_ extract 63 32) .cse877) ((_ extract 31 0) .cse877)))))) (concat ((_ extract 63 32) .cse876) ((_ extract 31 0) .cse876))) .cse9))) (concat ((_ extract 63 32) .cse875) ((_ extract 31 0) .cse875))) .cse11) (bvsle (let ((.cse879 (bvadd .cse9 .cse873))) (concat ((_ extract 63 32) .cse879) ((_ extract 31 0) .cse879))) .cse11))))) (bvsle (let ((.cse885 (bvadd (let ((.cse886 (bvadd .cse881 (let ((.cse887 (bvadd .cse67 .cse883))) (concat ((_ extract 63 32) .cse887) ((_ extract 31 0) .cse887)))))) (concat ((_ extract 63 32) .cse886) ((_ extract 31 0) .cse886))) .cse874))) (concat ((_ extract 63 32) .cse885) ((_ extract 31 0) .cse885))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse890 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse892 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse893 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse895 (let ((.cse897 (bvadd .cse890 (let ((.cse898 (bvadd (let ((.cse899 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse899) ((_ extract 31 0) .cse899))) .cse892))) (concat ((_ extract 63 32) .cse898) ((_ extract 31 0) .cse898)))))) (concat ((_ extract 63 32) .cse897) ((_ extract 31 0) .cse897))))) (or (bvsle (let ((.cse888 (bvadd (let ((.cse889 (bvadd .cse890 (let ((.cse891 (bvadd .cse67 .cse892))) (concat ((_ extract 63 32) .cse891) ((_ extract 31 0) .cse891)))))) (concat ((_ extract 63 32) .cse889) ((_ extract 31 0) .cse889))) .cse893))) (concat ((_ extract 63 32) .cse888) ((_ extract 31 0) .cse888))) .cse11) (bvsle (let ((.cse894 (bvadd .cse895 .cse893))) (concat ((_ extract 63 32) .cse894) ((_ extract 31 0) .cse894))) .cse11) (bvsle (let ((.cse896 (bvadd .cse9 .cse895))) (concat ((_ extract 63 32) .cse896) ((_ extract 31 0) .cse896))) .cse11))))) .cse2)) .cse41) (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse905 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse902 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse904 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse900 (bvadd (let ((.cse901 (bvadd .cse902 (let ((.cse903 (bvadd .cse67 .cse904))) (concat ((_ extract 63 32) .cse903) ((_ extract 31 0) .cse903)))))) (concat ((_ extract 63 32) .cse901) ((_ extract 31 0) .cse901))) .cse905))) (concat ((_ extract 63 32) .cse900) ((_ extract 31 0) .cse900))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse914 (let ((.cse918 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse918) ((_ extract 31 0) .cse918))))) (let ((.cse908 (let ((.cse917 (bvadd .cse914 .cse904))) (concat ((_ extract 63 32) .cse917) ((_ extract 31 0) .cse917))))) (let ((.cse910 (let ((.cse916 (bvadd .cse902 .cse908))) (concat ((_ extract 63 32) .cse916) ((_ extract 31 0) .cse916))))) (or (bvsle (let ((.cse906 (bvadd (let ((.cse907 (bvadd .cse9 .cse908))) (concat ((_ extract 63 32) .cse907) ((_ extract 31 0) .cse907))) .cse9))) (concat ((_ extract 63 32) .cse906) ((_ extract 31 0) .cse906))) .cse11) (bvsle (let ((.cse909 (bvadd .cse910 .cse905))) (concat ((_ extract 63 32) .cse909) ((_ extract 31 0) .cse909))) .cse11) (bvsle (let ((.cse911 (bvadd (let ((.cse912 (bvadd .cse9 (let ((.cse913 (bvadd .cse914 .cse9))) (concat ((_ extract 63 32) .cse913) ((_ extract 31 0) .cse913)))))) (concat ((_ extract 63 32) .cse912) ((_ extract 31 0) .cse912))) .cse9))) (concat ((_ extract 63 32) .cse911) ((_ extract 31 0) .cse911))) .cse11) (bvsle (let ((.cse915 (bvadd .cse9 .cse910))) (concat ((_ extract 63 32) .cse915) ((_ extract 31 0) .cse915))) .cse11))))))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse921 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse923 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse919 (bvadd (let ((.cse920 (bvadd .cse921 (let ((.cse922 (bvadd .cse67 .cse923))) (concat ((_ extract 63 32) .cse922) ((_ extract 31 0) .cse922)))))) (concat ((_ extract 63 32) .cse920) ((_ extract 31 0) .cse920))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse919) ((_ extract 31 0) .cse919))) .cse11) (bvsle (let ((.cse924 (bvadd .cse9 (let ((.cse925 (bvadd .cse921 (let ((.cse926 (bvadd (let ((.cse927 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse927) ((_ extract 31 0) .cse927))) .cse923))) (concat ((_ extract 63 32) .cse926) ((_ extract 31 0) .cse926)))))) (concat ((_ extract 63 32) .cse925) ((_ extract 31 0) .cse925)))))) (concat ((_ extract 63 32) .cse924) ((_ extract 31 0) .cse924))) .cse11)))) .cse87) (or .cse5 (and (or .cse6 (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse931 (let ((.cse935 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse935) ((_ extract 31 0) .cse935))))) (or (bvsle (let ((.cse928 (bvadd (let ((.cse929 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse930 (bvadd .cse931 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse930) ((_ extract 31 0) .cse930)))))) (concat ((_ extract 63 32) .cse929) ((_ extract 31 0) .cse929))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse928) ((_ extract 31 0) .cse928))) .cse11) (bvsle (let ((.cse932 (bvadd (let ((.cse933 (bvadd .cse9 (let ((.cse934 (bvadd .cse931 .cse9))) (concat ((_ extract 63 32) .cse934) ((_ extract 31 0) .cse934)))))) (concat ((_ extract 63 32) .cse933) ((_ extract 31 0) .cse933))) .cse9))) (concat ((_ extract 63 32) .cse932) ((_ extract 31 0) .cse932))) .cse11)))) .cse41) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (bvsle (let ((.cse936 (bvadd (let ((.cse937 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse938 (bvadd (let ((.cse939 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse939) ((_ extract 31 0) .cse939))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse938) ((_ extract 31 0) .cse938)))))) (concat ((_ extract 63 32) .cse937) ((_ extract 31 0) .cse937))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse936) ((_ extract 31 0) .cse936))) .cse11)) .cse41) (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse942 (let ((.cse945 (bvadd (let ((.cse946 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse946) ((_ extract 31 0) .cse946))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse945) ((_ extract 31 0) .cse945))))) (or (bvsle (let ((.cse940 (bvadd (let ((.cse941 (bvadd .cse9 .cse942))) (concat ((_ extract 63 32) .cse941) ((_ extract 31 0) .cse941))) .cse9))) (concat ((_ extract 63 32) .cse940) ((_ extract 31 0) .cse940))) .cse11) (bvsle (let ((.cse943 (bvadd (let ((.cse944 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse942))) (concat ((_ extract 63 32) .cse944) ((_ extract 31 0) .cse944))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse943) ((_ extract 31 0) .cse943))) .cse11))))) .cse2) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse950 (let ((.cse957 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse957) ((_ extract 31 0) .cse957))))) (or (bvsle (let ((.cse947 (bvadd (let ((.cse948 (bvadd .cse9 (let ((.cse949 (bvadd .cse950 .cse9))) (concat ((_ extract 63 32) .cse949) ((_ extract 31 0) .cse949)))))) (concat ((_ extract 63 32) .cse948) ((_ extract 31 0) .cse948))) .cse9))) (concat ((_ extract 63 32) .cse947) ((_ extract 31 0) .cse947))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse953 (let ((.cse956 (bvadd .cse950 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse956) ((_ extract 31 0) .cse956))))) (or (bvsle (let ((.cse951 (bvadd (let ((.cse952 (bvadd .cse9 .cse953))) (concat ((_ extract 63 32) .cse952) ((_ extract 31 0) .cse952))) .cse9))) (concat ((_ extract 63 32) .cse951) ((_ extract 31 0) .cse951))) .cse11) (bvsle (let ((.cse954 (bvadd (let ((.cse955 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse953))) (concat ((_ extract 63 32) .cse955) ((_ extract 31 0) .cse955))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse954) ((_ extract 31 0) .cse954))) .cse11))))))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (bvsle (let ((.cse958 (bvadd (let ((.cse959 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse960 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse960) ((_ extract 31 0) .cse960)))))) (concat ((_ extract 63 32) .cse959) ((_ extract 31 0) .cse959))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse958) ((_ extract 31 0) .cse958))) .cse11)) .cse87) (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse963 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse966 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse965 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse961 (bvadd (let ((.cse962 (bvadd .cse963 (let ((.cse964 (bvadd .cse67 .cse965))) (concat ((_ extract 63 32) .cse964) ((_ extract 31 0) .cse964)))))) (concat ((_ extract 63 32) .cse962) ((_ extract 31 0) .cse962))) .cse966))) (concat ((_ extract 63 32) .cse961) ((_ extract 31 0) .cse961))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse975 (let ((.cse977 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse977) ((_ extract 31 0) .cse977))))) (let ((.cse969 (let ((.cse976 (bvadd .cse975 .cse965))) (concat ((_ extract 63 32) .cse976) ((_ extract 31 0) .cse976))))) (or (bvsle (let ((.cse967 (bvadd (let ((.cse968 (bvadd .cse9 .cse969))) (concat ((_ extract 63 32) .cse968) ((_ extract 31 0) .cse968))) .cse9))) (concat ((_ extract 63 32) .cse967) ((_ extract 31 0) .cse967))) .cse11) (bvsle (let ((.cse970 (bvadd (let ((.cse971 (bvadd .cse963 .cse969))) (concat ((_ extract 63 32) .cse971) ((_ extract 31 0) .cse971))) .cse966))) (concat ((_ extract 63 32) .cse970) ((_ extract 31 0) .cse970))) .cse11) (bvsle (let ((.cse972 (bvadd (let ((.cse973 (bvadd .cse9 (let ((.cse974 (bvadd .cse975 .cse9))) (concat ((_ extract 63 32) .cse974) ((_ extract 31 0) .cse974)))))) (concat ((_ extract 63 32) .cse973) ((_ extract 31 0) .cse973))) .cse9))) (concat ((_ extract 63 32) .cse972) ((_ extract 31 0) .cse972))) .cse11)))))))) (or .cse84 .cse86) (or .cse41 (and (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse980 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse982 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse983 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse978 (bvadd (let ((.cse979 (bvadd .cse980 (let ((.cse981 (bvadd .cse67 .cse982))) (concat ((_ extract 63 32) .cse981) ((_ extract 31 0) .cse981)))))) (concat ((_ extract 63 32) .cse979) ((_ extract 31 0) .cse979))) .cse983))) (concat ((_ extract 63 32) .cse978) ((_ extract 31 0) .cse978))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse987 (let ((.cse991 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse991) ((_ extract 31 0) .cse991))))) (or (bvsle (let ((.cse984 (bvadd (let ((.cse985 (bvadd .cse980 (let ((.cse986 (bvadd .cse987 .cse982))) (concat ((_ extract 63 32) .cse986) ((_ extract 31 0) .cse986)))))) (concat ((_ extract 63 32) .cse985) ((_ extract 31 0) .cse985))) .cse983))) (concat ((_ extract 63 32) .cse984) ((_ extract 31 0) .cse984))) .cse11) (bvsle (let ((.cse988 (bvadd (let ((.cse989 (bvadd .cse9 (let ((.cse990 (bvadd .cse987 .cse9))) (concat ((_ extract 63 32) .cse990) ((_ extract 31 0) .cse990)))))) (concat ((_ extract 63 32) .cse989) ((_ extract 31 0) .cse989))) .cse9))) (concat ((_ extract 63 32) .cse988) ((_ extract 31 0) .cse988))) .cse11))))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse994 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse996 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse997 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse992 (bvadd (let ((.cse993 (bvadd .cse994 (let ((.cse995 (bvadd .cse67 .cse996))) (concat ((_ extract 63 32) .cse995) ((_ extract 31 0) .cse995)))))) (concat ((_ extract 63 32) .cse993) ((_ extract 31 0) .cse993))) .cse997))) (concat ((_ extract 63 32) .cse992) ((_ extract 31 0) .cse992))) .cse11) (bvsle (let ((.cse998 (bvadd (let ((.cse999 (bvadd .cse994 (let ((.cse1000 (bvadd (let ((.cse1001 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1001) ((_ extract 31 0) .cse1001))) .cse996))) (concat ((_ extract 63 32) .cse1000) ((_ extract 31 0) .cse1000)))))) (concat ((_ extract 63 32) .cse999) ((_ extract 31 0) .cse999))) .cse997))) (concat ((_ extract 63 32) .cse998) ((_ extract 31 0) .cse998))) .cse11)))) .cse2))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse1006 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse1004 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse1010 (let ((.cse1013 (bvadd (let ((.cse1014 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1014) ((_ extract 31 0) .cse1014))) .cse1006))) (concat ((_ extract 63 32) .cse1013) ((_ extract 31 0) .cse1013)))) (.cse1007 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse1002 (bvadd (let ((.cse1003 (bvadd .cse1004 (let ((.cse1005 (bvadd .cse67 .cse1006))) (concat ((_ extract 63 32) .cse1005) ((_ extract 31 0) .cse1005)))))) (concat ((_ extract 63 32) .cse1003) ((_ extract 31 0) .cse1003))) .cse1007))) (concat ((_ extract 63 32) .cse1002) ((_ extract 31 0) .cse1002))) .cse11) (bvsle (let ((.cse1008 (bvadd (let ((.cse1009 (bvadd .cse9 .cse1010))) (concat ((_ extract 63 32) .cse1009) ((_ extract 31 0) .cse1009))) .cse9))) (concat ((_ extract 63 32) .cse1008) ((_ extract 31 0) .cse1008))) .cse11) (bvsle (let ((.cse1011 (bvadd (let ((.cse1012 (bvadd .cse1004 .cse1010))) (concat ((_ extract 63 32) .cse1012) ((_ extract 31 0) .cse1012))) .cse1007))) (concat ((_ extract 63 32) .cse1011) ((_ extract 31 0) .cse1011))) .cse11))))) .cse2))))))) (and .cse4 (bvsle (let ((.cse1017 (bvadd .cse9 .cse22))) (concat ((_ extract 63 32) .cse1017) ((_ extract 31 0) .cse1017))) .cse11)) .cse1))))))) is different from false [2023-11-29 05:04:29,758 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ sign_extend 32) (_ bv1 32))) (.cse27 (let ((.cse1042 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (concat (select .cse1042 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (select .cse1042 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse67 (let ((.cse1041 (bvadd .cse9 .cse27))) (concat ((_ extract 63 32) .cse1041) ((_ extract 31 0) .cse1041))))) (let ((.cse20 (let ((.cse1040 (bvadd .cse67 .cse9))) (concat ((_ extract 63 32) .cse1040) ((_ extract 31 0) .cse1040)))) (.cse1018 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse41 (= (_ bv8 32) .cse1018)) (.cse6 (= (_ bv0 32) (bvadd (_ bv12 32) .cse1018))) (.cse5 (= (_ bv12 32) .cse1018)) (.cse154 (= (bvadd (_ bv8 32) .cse1018) (_ bv0 32))) (.cse22 (let ((.cse1039 (bvadd .cse9 .cse20))) (concat ((_ extract 63 32) .cse1039) ((_ extract 31 0) .cse1039)))) (.cse11 ((_ sign_extend 32) (bvmul c_~N~0 (_ bv2 32))))) (let ((.cse0 (forall ((v_arrayElimCell_88 (_ BitVec 32))) (bvsle (let ((.cse1038 (bvadd .cse22 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse1038) ((_ extract 31 0) .cse1038))) .cse11))) (.cse425 (not .cse154)) (.cse3 (forall ((v_arrayElimCell_91 (_ BitVec 32))) (bvsle (let ((.cse1034 (bvadd (let ((.cse1035 (bvadd .cse9 (let ((.cse1036 (bvadd (let ((.cse1037 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1037) ((_ extract 31 0) .cse1037))) .cse9))) (concat ((_ extract 63 32) .cse1036) ((_ extract 31 0) .cse1036)))))) (concat ((_ extract 63 32) .cse1035) ((_ extract 31 0) .cse1035))) .cse9))) (concat ((_ extract 63 32) .cse1034) ((_ extract 31 0) .cse1034))) .cse11))) (.cse268 (not .cse5)) (.cse269 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (bvsle (let ((.cse1030 (bvadd .cse9 (let ((.cse1031 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse1032 (bvadd (let ((.cse1033 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1033) ((_ extract 31 0) .cse1033))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse1032) ((_ extract 31 0) .cse1032)))))) (concat ((_ extract 63 32) .cse1031) ((_ extract 31 0) .cse1031)))))) (concat ((_ extract 63 32) .cse1030) ((_ extract 31 0) .cse1030))) .cse11))) (.cse155 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse1025 (let ((.cse1028 (bvadd (let ((.cse1029 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1029) ((_ extract 31 0) .cse1029))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse1028) ((_ extract 31 0) .cse1028))))) (or (bvsle (let ((.cse1023 (bvadd (let ((.cse1024 (bvadd .cse9 .cse1025))) (concat ((_ extract 63 32) .cse1024) ((_ extract 31 0) .cse1024))) .cse9))) (concat ((_ extract 63 32) .cse1023) ((_ extract 31 0) .cse1023))) .cse11) (bvsle (let ((.cse1026 (bvadd .cse9 (let ((.cse1027 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse1025))) (concat ((_ extract 63 32) .cse1027) ((_ extract 31 0) .cse1027)))))) (concat ((_ extract 63 32) .cse1026) ((_ extract 31 0) .cse1026))) .cse11))))) (.cse87 (not .cse6)) (.cse84 (not .cse41)) (.cse86 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (bvsle (let ((.cse1019 (bvadd (let ((.cse1020 (bvadd .cse9 (let ((.cse1021 (bvadd (let ((.cse1022 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1022) ((_ extract 31 0) .cse1022))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse1021) ((_ extract 31 0) .cse1021)))))) (concat ((_ extract 63 32) .cse1020) ((_ extract 31 0) .cse1020))) .cse9))) (concat ((_ extract 63 32) .cse1019) ((_ extract 31 0) .cse1019))) .cse11))) (.cse2 (= (_ bv4 32) .cse1018)) (.cse4 (= (_ bv0 32) .cse1018)) (.cse1 (= (bvadd (_ bv4 32) .cse1018) (_ bv0 32)))) (and (or .cse0 (not .cse1)) (or (not .cse2) .cse3) (or .cse4 (let ((.cse85 (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse539 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse537 (bvadd (let ((.cse538 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse20))) (concat ((_ extract 63 32) .cse538) ((_ extract 31 0) .cse538))) .cse539))) (concat ((_ extract 63 32) .cse537) ((_ extract 31 0) .cse537))) .cse11) (bvsle (let ((.cse540 (bvadd .cse22 .cse539))) (concat ((_ extract 63 32) .cse540) ((_ extract 31 0) .cse540))) .cse11)))))) (and (or .cse5 (and (or .cse6 (and (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse17 (let ((.cse26 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse26) ((_ extract 31 0) .cse26))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse15 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse14 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse10 (let ((.cse16 (bvadd .cse17 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse16) ((_ extract 31 0) .cse16))))) (or (bvsle (let ((.cse7 (bvadd (let ((.cse8 (bvadd .cse9 .cse10))) (concat ((_ extract 63 32) .cse8) ((_ extract 31 0) .cse8))) .cse9))) (concat ((_ extract 63 32) .cse7) ((_ extract 31 0) .cse7))) .cse11) (bvsle (let ((.cse12 (bvadd (let ((.cse13 (bvadd .cse14 .cse10))) (concat ((_ extract 63 32) .cse13) ((_ extract 31 0) .cse13))) .cse15))) (concat ((_ extract 63 32) .cse12) ((_ extract 31 0) .cse12))) .cse11)))) (bvsle (let ((.cse18 (bvadd (let ((.cse19 (bvadd .cse14 .cse20))) (concat ((_ extract 63 32) .cse19) ((_ extract 31 0) .cse19))) .cse15))) (concat ((_ extract 63 32) .cse18) ((_ extract 31 0) .cse18))) .cse11)))) (bvsle (let ((.cse21 (bvadd .cse22 .cse15))) (concat ((_ extract 63 32) .cse21) ((_ extract 31 0) .cse21))) .cse11)))) (bvsle (let ((.cse23 (bvadd (let ((.cse24 (bvadd .cse9 (let ((.cse25 (bvadd .cse17 .cse9))) (concat ((_ extract 63 32) .cse25) ((_ extract 31 0) .cse25)))))) (concat ((_ extract 63 32) .cse24) ((_ extract 31 0) .cse24))) .cse9))) (concat ((_ extract 63 32) .cse23) ((_ extract 31 0) .cse23))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse30 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse35 (let ((.cse40 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse40) ((_ extract 31 0) .cse40)))) (.cse31 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse28 (bvadd (let ((.cse29 (bvadd .cse30 .cse20))) (concat ((_ extract 63 32) .cse29) ((_ extract 31 0) .cse29))) .cse31))) (concat ((_ extract 63 32) .cse28) ((_ extract 31 0) .cse28))) .cse11) (bvsle (let ((.cse32 (bvadd (let ((.cse33 (bvadd .cse30 (let ((.cse34 (bvadd .cse35 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse34) ((_ extract 31 0) .cse34)))))) (concat ((_ extract 63 32) .cse33) ((_ extract 31 0) .cse33))) .cse31))) (concat ((_ extract 63 32) .cse32) ((_ extract 31 0) .cse32))) .cse11) (bvsle (let ((.cse36 (bvadd (let ((.cse37 (bvadd .cse9 (let ((.cse38 (bvadd .cse35 .cse9))) (concat ((_ extract 63 32) .cse38) ((_ extract 31 0) .cse38)))))) (concat ((_ extract 63 32) .cse37) ((_ extract 31 0) .cse37))) .cse9))) (concat ((_ extract 63 32) .cse36) ((_ extract 31 0) .cse36))) .cse11) (bvsle (let ((.cse39 (bvadd .cse22 .cse31))) (concat ((_ extract 63 32) .cse39) ((_ extract 31 0) .cse39))) .cse11)))) .cse41) (or (and (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse48 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse47 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse44 (let ((.cse49 (bvadd (let ((.cse50 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse50) ((_ extract 31 0) .cse50))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse49) ((_ extract 31 0) .cse49))))) (or (bvsle (let ((.cse42 (bvadd (let ((.cse43 (bvadd .cse9 .cse44))) (concat ((_ extract 63 32) .cse43) ((_ extract 31 0) .cse43))) .cse9))) (concat ((_ extract 63 32) .cse42) ((_ extract 31 0) .cse42))) .cse11) (bvsle (let ((.cse45 (bvadd (let ((.cse46 (bvadd .cse47 .cse44))) (concat ((_ extract 63 32) .cse46) ((_ extract 31 0) .cse46))) .cse48))) (concat ((_ extract 63 32) .cse45) ((_ extract 31 0) .cse45))) .cse11)))) (bvsle (let ((.cse51 (bvadd (let ((.cse52 (bvadd .cse47 .cse20))) (concat ((_ extract 63 32) .cse52) ((_ extract 31 0) .cse52))) .cse48))) (concat ((_ extract 63 32) .cse51) ((_ extract 31 0) .cse51))) .cse11)))) (bvsle (let ((.cse53 (bvadd .cse22 .cse48))) (concat ((_ extract 63 32) .cse53) ((_ extract 31 0) .cse53))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse56 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse57 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse54 (bvadd (let ((.cse55 (bvadd .cse56 .cse20))) (concat ((_ extract 63 32) .cse55) ((_ extract 31 0) .cse55))) .cse57))) (concat ((_ extract 63 32) .cse54) ((_ extract 31 0) .cse54))) .cse11) (bvsle (let ((.cse58 (bvadd (let ((.cse59 (bvadd .cse56 (let ((.cse60 (bvadd (let ((.cse61 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse61) ((_ extract 31 0) .cse61))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse60) ((_ extract 31 0) .cse60)))))) (concat ((_ extract 63 32) .cse59) ((_ extract 31 0) .cse59))) .cse57))) (concat ((_ extract 63 32) .cse58) ((_ extract 31 0) .cse58))) .cse11) (bvsle (let ((.cse62 (bvadd .cse22 .cse57))) (concat ((_ extract 63 32) .cse62) ((_ extract 31 0) .cse62))) .cse11)))) .cse41)) .cse2))) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse69 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse65 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse68 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse63 (bvadd (let ((.cse64 (bvadd .cse65 (let ((.cse66 (bvadd .cse67 .cse68))) (concat ((_ extract 63 32) .cse66) ((_ extract 31 0) .cse66)))))) (concat ((_ extract 63 32) .cse64) ((_ extract 31 0) .cse64))) .cse69))) (concat ((_ extract 63 32) .cse63) ((_ extract 31 0) .cse63))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse78 (let ((.cse80 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse80) ((_ extract 31 0) .cse80))))) (let ((.cse72 (let ((.cse79 (bvadd .cse78 .cse68))) (concat ((_ extract 63 32) .cse79) ((_ extract 31 0) .cse79))))) (or (bvsle (let ((.cse70 (bvadd (let ((.cse71 (bvadd .cse9 .cse72))) (concat ((_ extract 63 32) .cse71) ((_ extract 31 0) .cse71))) .cse9))) (concat ((_ extract 63 32) .cse70) ((_ extract 31 0) .cse70))) .cse11) (bvsle (let ((.cse73 (bvadd (let ((.cse74 (bvadd .cse65 .cse72))) (concat ((_ extract 63 32) .cse74) ((_ extract 31 0) .cse74))) .cse69))) (concat ((_ extract 63 32) .cse73) ((_ extract 31 0) .cse73))) .cse11) (bvsle (let ((.cse75 (bvadd (let ((.cse76 (bvadd .cse9 (let ((.cse77 (bvadd .cse78 .cse9))) (concat ((_ extract 63 32) .cse77) ((_ extract 31 0) .cse77)))))) (concat ((_ extract 63 32) .cse76) ((_ extract 31 0) .cse76))) .cse9))) (concat ((_ extract 63 32) .cse75) ((_ extract 31 0) .cse75))) .cse11)))))))) (bvsle (let ((.cse81 (bvadd (let ((.cse82 (bvadd .cse65 .cse20))) (concat ((_ extract 63 32) .cse82) ((_ extract 31 0) .cse82))) .cse69))) (concat ((_ extract 63 32) .cse81) ((_ extract 31 0) .cse81))) .cse11)))) (bvsle (let ((.cse83 (bvadd .cse22 .cse69))) (concat ((_ extract 63 32) .cse83) ((_ extract 31 0) .cse83))) .cse11)))) (or .cse84 .cse85 .cse86) (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse90 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse92 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse88 (bvadd (let ((.cse89 (bvadd .cse90 (let ((.cse91 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse91) ((_ extract 31 0) .cse91)))))) (concat ((_ extract 63 32) .cse89) ((_ extract 31 0) .cse89))) .cse92))) (concat ((_ extract 63 32) .cse88) ((_ extract 31 0) .cse88))) .cse11) (bvsle (let ((.cse93 (bvadd (let ((.cse94 (bvadd .cse90 .cse20))) (concat ((_ extract 63 32) .cse94) ((_ extract 31 0) .cse94))) .cse92))) (concat ((_ extract 63 32) .cse93) ((_ extract 31 0) .cse93))) .cse11) (bvsle (let ((.cse95 (bvadd .cse22 .cse92))) (concat ((_ extract 63 32) .cse95) ((_ extract 31 0) .cse95))) .cse11))))) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse98 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse100 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse101 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse96 (bvadd (let ((.cse97 (bvadd .cse98 (let ((.cse99 (bvadd .cse67 .cse100))) (concat ((_ extract 63 32) .cse99) ((_ extract 31 0) .cse99)))))) (concat ((_ extract 63 32) .cse97) ((_ extract 31 0) .cse97))) .cse101))) (concat ((_ extract 63 32) .cse96) ((_ extract 31 0) .cse96))) .cse11) (bvsle (let ((.cse102 (bvadd (let ((.cse103 (bvadd .cse98 .cse20))) (concat ((_ extract 63 32) .cse103) ((_ extract 31 0) .cse103))) .cse101))) (concat ((_ extract 63 32) .cse102) ((_ extract 31 0) .cse102))) .cse11) (bvsle (let ((.cse104 (bvadd (let ((.cse105 (bvadd .cse98 (let ((.cse106 (bvadd (let ((.cse107 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse107) ((_ extract 31 0) .cse107))) .cse100))) (concat ((_ extract 63 32) .cse106) ((_ extract 31 0) .cse106)))))) (concat ((_ extract 63 32) .cse105) ((_ extract 31 0) .cse105))) .cse101))) (concat ((_ extract 63 32) .cse104) ((_ extract 31 0) .cse104))) .cse11) (bvsle (let ((.cse108 (bvadd .cse22 .cse101))) (concat ((_ extract 63 32) .cse108) ((_ extract 31 0) .cse108))) .cse11)))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse114 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse111 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse113 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse109 (bvadd (let ((.cse110 (bvadd .cse111 (let ((.cse112 (bvadd .cse67 .cse113))) (concat ((_ extract 63 32) .cse112) ((_ extract 31 0) .cse112)))))) (concat ((_ extract 63 32) .cse110) ((_ extract 31 0) .cse110))) .cse114))) (concat ((_ extract 63 32) .cse109) ((_ extract 31 0) .cse109))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse118 (let ((.cse122 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse122) ((_ extract 31 0) .cse122))))) (or (bvsle (let ((.cse115 (bvadd (let ((.cse116 (bvadd .cse111 (let ((.cse117 (bvadd .cse118 .cse113))) (concat ((_ extract 63 32) .cse117) ((_ extract 31 0) .cse117)))))) (concat ((_ extract 63 32) .cse116) ((_ extract 31 0) .cse116))) .cse114))) (concat ((_ extract 63 32) .cse115) ((_ extract 31 0) .cse115))) .cse11) (bvsle (let ((.cse119 (bvadd (let ((.cse120 (bvadd .cse9 (let ((.cse121 (bvadd .cse118 .cse9))) (concat ((_ extract 63 32) .cse121) ((_ extract 31 0) .cse121)))))) (concat ((_ extract 63 32) .cse120) ((_ extract 31 0) .cse120))) .cse9))) (concat ((_ extract 63 32) .cse119) ((_ extract 31 0) .cse119))) .cse11))))))) (bvsle (let ((.cse123 (bvadd (let ((.cse124 (bvadd .cse111 .cse20))) (concat ((_ extract 63 32) .cse124) ((_ extract 31 0) .cse124))) .cse114))) (concat ((_ extract 63 32) .cse123) ((_ extract 31 0) .cse123))) .cse11)))) (bvsle (let ((.cse125 (bvadd .cse22 .cse114))) (concat ((_ extract 63 32) .cse125) ((_ extract 31 0) .cse125))) .cse11))))) .cse41) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse130 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse128 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse134 (let ((.cse140 (bvadd (let ((.cse141 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse141) ((_ extract 31 0) .cse141))) .cse130))) (concat ((_ extract 63 32) .cse140) ((_ extract 31 0) .cse140)))) (.cse131 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse126 (bvadd (let ((.cse127 (bvadd .cse128 (let ((.cse129 (bvadd .cse67 .cse130))) (concat ((_ extract 63 32) .cse129) ((_ extract 31 0) .cse129)))))) (concat ((_ extract 63 32) .cse127) ((_ extract 31 0) .cse127))) .cse131))) (concat ((_ extract 63 32) .cse126) ((_ extract 31 0) .cse126))) .cse11) (bvsle (let ((.cse132 (bvadd (let ((.cse133 (bvadd .cse9 .cse134))) (concat ((_ extract 63 32) .cse133) ((_ extract 31 0) .cse133))) .cse9))) (concat ((_ extract 63 32) .cse132) ((_ extract 31 0) .cse132))) .cse11) (bvsle (let ((.cse135 (bvadd (let ((.cse136 (bvadd .cse128 .cse20))) (concat ((_ extract 63 32) .cse136) ((_ extract 31 0) .cse136))) .cse131))) (concat ((_ extract 63 32) .cse135) ((_ extract 31 0) .cse135))) .cse11) (bvsle (let ((.cse137 (bvadd (let ((.cse138 (bvadd .cse128 .cse134))) (concat ((_ extract 63 32) .cse138) ((_ extract 31 0) .cse138))) .cse131))) (concat ((_ extract 63 32) .cse137) ((_ extract 31 0) .cse137))) .cse11) (bvsle (let ((.cse139 (bvadd .cse22 .cse131))) (concat ((_ extract 63 32) .cse139) ((_ extract 31 0) .cse139))) .cse11))))) .cse2))) (or .cse84 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse148 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse147 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse144 (let ((.cse152 (bvadd (let ((.cse153 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse153) ((_ extract 31 0) .cse153))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse152) ((_ extract 31 0) .cse152))))) (or (bvsle (let ((.cse142 (bvadd (let ((.cse143 (bvadd .cse9 .cse144))) (concat ((_ extract 63 32) .cse143) ((_ extract 31 0) .cse143))) .cse9))) (concat ((_ extract 63 32) .cse142) ((_ extract 31 0) .cse142))) .cse11) (bvsle (let ((.cse145 (bvadd (let ((.cse146 (bvadd .cse147 .cse20))) (concat ((_ extract 63 32) .cse146) ((_ extract 31 0) .cse146))) .cse148))) (concat ((_ extract 63 32) .cse145) ((_ extract 31 0) .cse145))) .cse11) (bvsle (let ((.cse149 (bvadd .cse22 .cse148))) (concat ((_ extract 63 32) .cse149) ((_ extract 31 0) .cse149))) .cse11) (bvsle (let ((.cse150 (bvadd .cse9 (let ((.cse151 (bvadd .cse147 .cse144))) (concat ((_ extract 63 32) .cse151) ((_ extract 31 0) .cse151)))))) (concat ((_ extract 63 32) .cse150) ((_ extract 31 0) .cse150))) .cse11))))) (or .cse154 (and (or .cse84 .cse155 .cse0) (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse161 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse158 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse160 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse156 (bvadd (let ((.cse157 (bvadd .cse158 (let ((.cse159 (bvadd .cse67 .cse160))) (concat ((_ extract 63 32) .cse159) ((_ extract 31 0) .cse159)))))) (concat ((_ extract 63 32) .cse157) ((_ extract 31 0) .cse157))) .cse161))) (concat ((_ extract 63 32) .cse156) ((_ extract 31 0) .cse156))) .cse11) (bvsle (let ((.cse162 (bvadd .cse22 .cse161))) (concat ((_ extract 63 32) .cse162) ((_ extract 31 0) .cse162))) .cse11) (bvsle (let ((.cse163 (bvadd .cse9 (let ((.cse164 (bvadd .cse158 (let ((.cse165 (bvadd (let ((.cse166 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse166) ((_ extract 31 0) .cse166))) .cse160))) (concat ((_ extract 63 32) .cse165) ((_ extract 31 0) .cse165)))))) (concat ((_ extract 63 32) .cse164) ((_ extract 31 0) .cse164)))))) (concat ((_ extract 63 32) .cse163) ((_ extract 31 0) .cse163))) .cse11))))) (or (and (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse170 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse167 (bvadd (let ((.cse168 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse169 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse169) ((_ extract 31 0) .cse169)))))) (concat ((_ extract 63 32) .cse168) ((_ extract 31 0) .cse168))) .cse170))) (concat ((_ extract 63 32) .cse167) ((_ extract 31 0) .cse167))) .cse11) (bvsle (let ((.cse171 (bvadd .cse22 .cse170))) (concat ((_ extract 63 32) .cse171) ((_ extract 31 0) .cse171))) .cse11))))) (or .cse6 (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse174 (let ((.cse179 (bvadd (let ((.cse180 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse180) ((_ extract 31 0) .cse180))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse179) ((_ extract 31 0) .cse179)))) (.cse177 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse172 (bvadd (let ((.cse173 (bvadd .cse9 .cse174))) (concat ((_ extract 63 32) .cse173) ((_ extract 31 0) .cse173))) .cse9))) (concat ((_ extract 63 32) .cse172) ((_ extract 31 0) .cse172))) .cse11) (bvsle (let ((.cse175 (bvadd (let ((.cse176 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse174))) (concat ((_ extract 63 32) .cse176) ((_ extract 31 0) .cse176))) .cse177))) (concat ((_ extract 63 32) .cse175) ((_ extract 31 0) .cse175))) .cse11) (bvsle (let ((.cse178 (bvadd .cse22 .cse177))) (concat ((_ extract 63 32) .cse178) ((_ extract 31 0) .cse178))) .cse11)))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse186 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse190 (let ((.cse192 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse192) ((_ extract 31 0) .cse192))))) (let ((.cse183 (let ((.cse191 (bvadd .cse190 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse191) ((_ extract 31 0) .cse191))))) (or (bvsle (let ((.cse181 (bvadd (let ((.cse182 (bvadd .cse9 .cse183))) (concat ((_ extract 63 32) .cse182) ((_ extract 31 0) .cse182))) .cse9))) (concat ((_ extract 63 32) .cse181) ((_ extract 31 0) .cse181))) .cse11) (bvsle (let ((.cse184 (bvadd (let ((.cse185 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse183))) (concat ((_ extract 63 32) .cse185) ((_ extract 31 0) .cse185))) .cse186))) (concat ((_ extract 63 32) .cse184) ((_ extract 31 0) .cse184))) .cse11) (bvsle (let ((.cse187 (bvadd (let ((.cse188 (bvadd .cse9 (let ((.cse189 (bvadd .cse190 .cse9))) (concat ((_ extract 63 32) .cse189) ((_ extract 31 0) .cse189)))))) (concat ((_ extract 63 32) .cse188) ((_ extract 31 0) .cse188))) .cse9))) (concat ((_ extract 63 32) .cse187) ((_ extract 31 0) .cse187))) .cse11))))) (bvsle (let ((.cse193 (bvadd .cse22 .cse186))) (concat ((_ extract 63 32) .cse193) ((_ extract 31 0) .cse193))) .cse11)))) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse198 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse194 (bvadd (let ((.cse195 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse196 (bvadd (let ((.cse197 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse197) ((_ extract 31 0) .cse197))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse196) ((_ extract 31 0) .cse196)))))) (concat ((_ extract 63 32) .cse195) ((_ extract 31 0) .cse195))) .cse198))) (concat ((_ extract 63 32) .cse194) ((_ extract 31 0) .cse194))) .cse11) (bvsle (let ((.cse199 (bvadd .cse22 .cse198))) (concat ((_ extract 63 32) .cse199) ((_ extract 31 0) .cse199))) .cse11)))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse204 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse203 (let ((.cse208 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse208) ((_ extract 31 0) .cse208))))) (or (bvsle (let ((.cse200 (bvadd (let ((.cse201 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse202 (bvadd .cse203 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse202) ((_ extract 31 0) .cse202)))))) (concat ((_ extract 63 32) .cse201) ((_ extract 31 0) .cse201))) .cse204))) (concat ((_ extract 63 32) .cse200) ((_ extract 31 0) .cse200))) .cse11) (bvsle (let ((.cse205 (bvadd (let ((.cse206 (bvadd .cse9 (let ((.cse207 (bvadd .cse203 .cse9))) (concat ((_ extract 63 32) .cse207) ((_ extract 31 0) .cse207)))))) (concat ((_ extract 63 32) .cse206) ((_ extract 31 0) .cse206))) .cse9))) (concat ((_ extract 63 32) .cse205) ((_ extract 31 0) .cse205))) .cse11)))) (bvsle (let ((.cse209 (bvadd .cse22 .cse204))) (concat ((_ extract 63 32) .cse209) ((_ extract 31 0) .cse209))) .cse11))))) .cse41))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse214 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse212 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse218 (let ((.cse222 (bvadd (let ((.cse223 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse223) ((_ extract 31 0) .cse223))) .cse214))) (concat ((_ extract 63 32) .cse222) ((_ extract 31 0) .cse222)))) (.cse215 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse210 (bvadd (let ((.cse211 (bvadd .cse212 (let ((.cse213 (bvadd .cse67 .cse214))) (concat ((_ extract 63 32) .cse213) ((_ extract 31 0) .cse213)))))) (concat ((_ extract 63 32) .cse211) ((_ extract 31 0) .cse211))) .cse215))) (concat ((_ extract 63 32) .cse210) ((_ extract 31 0) .cse210))) .cse11) (bvsle (let ((.cse216 (bvadd (let ((.cse217 (bvadd .cse9 .cse218))) (concat ((_ extract 63 32) .cse217) ((_ extract 31 0) .cse217))) .cse9))) (concat ((_ extract 63 32) .cse216) ((_ extract 31 0) .cse216))) .cse11) (bvsle (let ((.cse219 (bvadd (let ((.cse220 (bvadd .cse212 .cse218))) (concat ((_ extract 63 32) .cse220) ((_ extract 31 0) .cse220))) .cse215))) (concat ((_ extract 63 32) .cse219) ((_ extract 31 0) .cse219))) .cse11) (bvsle (let ((.cse221 (bvadd .cse22 .cse215))) (concat ((_ extract 63 32) .cse221) ((_ extract 31 0) .cse221))) .cse11))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse229 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse226 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse228 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse224 (bvadd (let ((.cse225 (bvadd .cse226 (let ((.cse227 (bvadd .cse67 .cse228))) (concat ((_ extract 63 32) .cse227) ((_ extract 31 0) .cse227)))))) (concat ((_ extract 63 32) .cse225) ((_ extract 31 0) .cse225))) .cse229))) (concat ((_ extract 63 32) .cse224) ((_ extract 31 0) .cse224))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse238 (let ((.cse240 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse240) ((_ extract 31 0) .cse240))))) (let ((.cse232 (let ((.cse239 (bvadd .cse238 .cse228))) (concat ((_ extract 63 32) .cse239) ((_ extract 31 0) .cse239))))) (or (bvsle (let ((.cse230 (bvadd (let ((.cse231 (bvadd .cse9 .cse232))) (concat ((_ extract 63 32) .cse231) ((_ extract 31 0) .cse231))) .cse9))) (concat ((_ extract 63 32) .cse230) ((_ extract 31 0) .cse230))) .cse11) (bvsle (let ((.cse233 (bvadd (let ((.cse234 (bvadd .cse226 .cse232))) (concat ((_ extract 63 32) .cse234) ((_ extract 31 0) .cse234))) .cse229))) (concat ((_ extract 63 32) .cse233) ((_ extract 31 0) .cse233))) .cse11) (bvsle (let ((.cse235 (bvadd (let ((.cse236 (bvadd .cse9 (let ((.cse237 (bvadd .cse238 .cse9))) (concat ((_ extract 63 32) .cse237) ((_ extract 31 0) .cse237)))))) (concat ((_ extract 63 32) .cse236) ((_ extract 31 0) .cse236))) .cse9))) (concat ((_ extract 63 32) .cse235) ((_ extract 31 0) .cse235))) .cse11)))))))) (bvsle (let ((.cse241 (bvadd .cse22 .cse229))) (concat ((_ extract 63 32) .cse241) ((_ extract 31 0) .cse241))) .cse11)))) (or .cse84 .cse0 .cse86) (or .cse41 (and (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse247 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse244 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse246 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse242 (bvadd (let ((.cse243 (bvadd .cse244 (let ((.cse245 (bvadd .cse67 .cse246))) (concat ((_ extract 63 32) .cse245) ((_ extract 31 0) .cse245)))))) (concat ((_ extract 63 32) .cse243) ((_ extract 31 0) .cse243))) .cse247))) (concat ((_ extract 63 32) .cse242) ((_ extract 31 0) .cse242))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse251 (let ((.cse255 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse255) ((_ extract 31 0) .cse255))))) (or (bvsle (let ((.cse248 (bvadd (let ((.cse249 (bvadd .cse244 (let ((.cse250 (bvadd .cse251 .cse246))) (concat ((_ extract 63 32) .cse250) ((_ extract 31 0) .cse250)))))) (concat ((_ extract 63 32) .cse249) ((_ extract 31 0) .cse249))) .cse247))) (concat ((_ extract 63 32) .cse248) ((_ extract 31 0) .cse248))) .cse11) (bvsle (let ((.cse252 (bvadd (let ((.cse253 (bvadd .cse9 (let ((.cse254 (bvadd .cse251 .cse9))) (concat ((_ extract 63 32) .cse254) ((_ extract 31 0) .cse254)))))) (concat ((_ extract 63 32) .cse253) ((_ extract 31 0) .cse253))) .cse9))) (concat ((_ extract 63 32) .cse252) ((_ extract 31 0) .cse252))) .cse11))))))) (bvsle (let ((.cse256 (bvadd .cse22 .cse247))) (concat ((_ extract 63 32) .cse256) ((_ extract 31 0) .cse256))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse259 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse261 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse262 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse257 (bvadd (let ((.cse258 (bvadd .cse259 (let ((.cse260 (bvadd .cse67 .cse261))) (concat ((_ extract 63 32) .cse260) ((_ extract 31 0) .cse260)))))) (concat ((_ extract 63 32) .cse258) ((_ extract 31 0) .cse258))) .cse262))) (concat ((_ extract 63 32) .cse257) ((_ extract 31 0) .cse257))) .cse11) (bvsle (let ((.cse263 (bvadd (let ((.cse264 (bvadd .cse259 (let ((.cse265 (bvadd (let ((.cse266 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse266) ((_ extract 31 0) .cse266))) .cse261))) (concat ((_ extract 63 32) .cse265) ((_ extract 31 0) .cse265)))))) (concat ((_ extract 63 32) .cse264) ((_ extract 31 0) .cse264))) .cse262))) (concat ((_ extract 63 32) .cse263) ((_ extract 31 0) .cse263))) .cse11) (bvsle (let ((.cse267 (bvadd .cse22 .cse262))) (concat ((_ extract 63 32) .cse267) ((_ extract 31 0) .cse267))) .cse11)))) .cse2)))) .cse5) (or .cse268 .cse0 .cse269) (or .cse41 (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse272 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse274 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse275 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse277 (let ((.cse280 (bvadd .cse272 (let ((.cse281 (bvadd (let ((.cse282 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse282) ((_ extract 31 0) .cse282))) .cse274))) (concat ((_ extract 63 32) .cse281) ((_ extract 31 0) .cse281)))))) (concat ((_ extract 63 32) .cse280) ((_ extract 31 0) .cse280))))) (or (bvsle (let ((.cse270 (bvadd (let ((.cse271 (bvadd .cse272 (let ((.cse273 (bvadd .cse67 .cse274))) (concat ((_ extract 63 32) .cse273) ((_ extract 31 0) .cse273)))))) (concat ((_ extract 63 32) .cse271) ((_ extract 31 0) .cse271))) .cse275))) (concat ((_ extract 63 32) .cse270) ((_ extract 31 0) .cse270))) .cse11) (bvsle (let ((.cse276 (bvadd .cse277 .cse275))) (concat ((_ extract 63 32) .cse276) ((_ extract 31 0) .cse276))) .cse11) (bvsle (let ((.cse278 (bvadd .cse22 .cse275))) (concat ((_ extract 63 32) .cse278) ((_ extract 31 0) .cse278))) .cse11) (bvsle (let ((.cse279 (bvadd .cse9 .cse277))) (concat ((_ extract 63 32) .cse279) ((_ extract 31 0) .cse279))) .cse11))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse285 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse292 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse294 ((_ sign_extend 32) v_arrayElimCell_89))) (or (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse289 (let ((.cse295 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse295) ((_ extract 31 0) .cse295))))) (let ((.cse284 (let ((.cse291 (bvadd .cse292 (let ((.cse293 (bvadd .cse289 .cse294))) (concat ((_ extract 63 32) .cse293) ((_ extract 31 0) .cse293)))))) (concat ((_ extract 63 32) .cse291) ((_ extract 31 0) .cse291))))) (or (bvsle (let ((.cse283 (bvadd .cse284 .cse285))) (concat ((_ extract 63 32) .cse283) ((_ extract 31 0) .cse283))) .cse11) (bvsle (let ((.cse286 (bvadd (let ((.cse287 (bvadd .cse9 (let ((.cse288 (bvadd .cse289 .cse9))) (concat ((_ extract 63 32) .cse288) ((_ extract 31 0) .cse288)))))) (concat ((_ extract 63 32) .cse287) ((_ extract 31 0) .cse287))) .cse9))) (concat ((_ extract 63 32) .cse286) ((_ extract 31 0) .cse286))) .cse11) (bvsle (let ((.cse290 (bvadd .cse9 .cse284))) (concat ((_ extract 63 32) .cse290) ((_ extract 31 0) .cse290))) .cse11))))) (bvsle (let ((.cse296 (bvadd (let ((.cse297 (bvadd .cse292 (let ((.cse298 (bvadd .cse67 .cse294))) (concat ((_ extract 63 32) .cse298) ((_ extract 31 0) .cse298)))))) (concat ((_ extract 63 32) .cse297) ((_ extract 31 0) .cse297))) .cse285))) (concat ((_ extract 63 32) .cse296) ((_ extract 31 0) .cse296))) .cse11)))) (bvsle (let ((.cse299 (bvadd .cse22 .cse285))) (concat ((_ extract 63 32) .cse299) ((_ extract 31 0) .cse299))) .cse11)))))) (or .cse6 (and (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse309 (let ((.cse314 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse314) ((_ extract 31 0) .cse314))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse305 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse302 (let ((.cse308 (bvadd .cse309 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse308) ((_ extract 31 0) .cse308))))) (let ((.cse304 (let ((.cse307 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse302))) (concat ((_ extract 63 32) .cse307) ((_ extract 31 0) .cse307))))) (or (bvsle (let ((.cse300 (bvadd (let ((.cse301 (bvadd .cse9 .cse302))) (concat ((_ extract 63 32) .cse301) ((_ extract 31 0) .cse301))) .cse9))) (concat ((_ extract 63 32) .cse300) ((_ extract 31 0) .cse300))) .cse11) (bvsle (let ((.cse303 (bvadd .cse304 .cse305))) (concat ((_ extract 63 32) .cse303) ((_ extract 31 0) .cse303))) .cse11) (bvsle (let ((.cse306 (bvadd .cse9 .cse304))) (concat ((_ extract 63 32) .cse306) ((_ extract 31 0) .cse306))) .cse11))))) (bvsle (let ((.cse310 (bvadd .cse22 .cse305))) (concat ((_ extract 63 32) .cse310) ((_ extract 31 0) .cse310))) .cse11)))) (bvsle (let ((.cse311 (bvadd (let ((.cse312 (bvadd .cse9 (let ((.cse313 (bvadd .cse309 .cse9))) (concat ((_ extract 63 32) .cse313) ((_ extract 31 0) .cse313)))))) (concat ((_ extract 63 32) .cse312) ((_ extract 31 0) .cse312))) .cse9))) (concat ((_ extract 63 32) .cse311) ((_ extract 31 0) .cse311))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse321 (let ((.cse326 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse326) ((_ extract 31 0) .cse326))))) (let ((.cse317 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse316 (let ((.cse324 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse325 (bvadd .cse321 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse325) ((_ extract 31 0) .cse325)))))) (concat ((_ extract 63 32) .cse324) ((_ extract 31 0) .cse324))))) (or (bvsle (let ((.cse315 (bvadd .cse316 .cse317))) (concat ((_ extract 63 32) .cse315) ((_ extract 31 0) .cse315))) .cse11) (bvsle (let ((.cse318 (bvadd (let ((.cse319 (bvadd .cse9 (let ((.cse320 (bvadd .cse321 .cse9))) (concat ((_ extract 63 32) .cse320) ((_ extract 31 0) .cse320)))))) (concat ((_ extract 63 32) .cse319) ((_ extract 31 0) .cse319))) .cse9))) (concat ((_ extract 63 32) .cse318) ((_ extract 31 0) .cse318))) .cse11) (bvsle (let ((.cse322 (bvadd .cse22 .cse317))) (concat ((_ extract 63 32) .cse322) ((_ extract 31 0) .cse322))) .cse11) (bvsle (let ((.cse323 (bvadd .cse9 .cse316))) (concat ((_ extract 63 32) .cse323) ((_ extract 31 0) .cse323))) .cse11))))) .cse41) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse329 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse328 (let ((.cse332 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse333 (bvadd (let ((.cse334 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse334) ((_ extract 31 0) .cse334))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse333) ((_ extract 31 0) .cse333)))))) (concat ((_ extract 63 32) .cse332) ((_ extract 31 0) .cse332))))) (or (bvsle (let ((.cse327 (bvadd .cse328 .cse329))) (concat ((_ extract 63 32) .cse327) ((_ extract 31 0) .cse327))) .cse11) (bvsle (let ((.cse330 (bvadd .cse22 .cse329))) (concat ((_ extract 63 32) .cse330) ((_ extract 31 0) .cse330))) .cse11) (bvsle (let ((.cse331 (bvadd .cse9 .cse328))) (concat ((_ extract 63 32) .cse331) ((_ extract 31 0) .cse331))) .cse11)))) .cse41) (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse340 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse337 (let ((.cse343 (bvadd (let ((.cse344 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse344) ((_ extract 31 0) .cse344))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse343) ((_ extract 31 0) .cse343))))) (let ((.cse339 (let ((.cse342 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse337))) (concat ((_ extract 63 32) .cse342) ((_ extract 31 0) .cse342))))) (or (bvsle (let ((.cse335 (bvadd (let ((.cse336 (bvadd .cse9 .cse337))) (concat ((_ extract 63 32) .cse336) ((_ extract 31 0) .cse336))) .cse9))) (concat ((_ extract 63 32) .cse335) ((_ extract 31 0) .cse335))) .cse11) (bvsle (let ((.cse338 (bvadd .cse339 .cse340))) (concat ((_ extract 63 32) .cse338) ((_ extract 31 0) .cse338))) .cse11) (bvsle (let ((.cse341 (bvadd .cse9 .cse339))) (concat ((_ extract 63 32) .cse341) ((_ extract 31 0) .cse341))) .cse11))))) (bvsle (let ((.cse345 (bvadd .cse22 .cse340))) (concat ((_ extract 63 32) .cse345) ((_ extract 31 0) .cse345))) .cse11))))) .cse2))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse350 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse348 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse354 (let ((.cse360 (bvadd (let ((.cse361 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse361) ((_ extract 31 0) .cse361))) .cse350))) (concat ((_ extract 63 32) .cse360) ((_ extract 31 0) .cse360))))) (let ((.cse351 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse356 (let ((.cse359 (bvadd .cse348 .cse354))) (concat ((_ extract 63 32) .cse359) ((_ extract 31 0) .cse359))))) (or (bvsle (let ((.cse346 (bvadd (let ((.cse347 (bvadd .cse348 (let ((.cse349 (bvadd .cse67 .cse350))) (concat ((_ extract 63 32) .cse349) ((_ extract 31 0) .cse349)))))) (concat ((_ extract 63 32) .cse347) ((_ extract 31 0) .cse347))) .cse351))) (concat ((_ extract 63 32) .cse346) ((_ extract 31 0) .cse346))) .cse11) (bvsle (let ((.cse352 (bvadd (let ((.cse353 (bvadd .cse9 .cse354))) (concat ((_ extract 63 32) .cse353) ((_ extract 31 0) .cse353))) .cse9))) (concat ((_ extract 63 32) .cse352) ((_ extract 31 0) .cse352))) .cse11) (bvsle (let ((.cse355 (bvadd .cse356 .cse351))) (concat ((_ extract 63 32) .cse355) ((_ extract 31 0) .cse355))) .cse11) (bvsle (let ((.cse357 (bvadd .cse22 .cse351))) (concat ((_ extract 63 32) .cse357) ((_ extract 31 0) .cse357))) .cse11) (bvsle (let ((.cse358 (bvadd .cse9 .cse356))) (concat ((_ extract 63 32) .cse358) ((_ extract 31 0) .cse358))) .cse11)))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse367 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse364 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse366 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse362 (bvadd (let ((.cse363 (bvadd .cse364 (let ((.cse365 (bvadd .cse67 .cse366))) (concat ((_ extract 63 32) .cse365) ((_ extract 31 0) .cse365)))))) (concat ((_ extract 63 32) .cse363) ((_ extract 31 0) .cse363))) .cse367))) (concat ((_ extract 63 32) .cse362) ((_ extract 31 0) .cse362))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse376 (let ((.cse380 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse380) ((_ extract 31 0) .cse380))))) (let ((.cse370 (let ((.cse379 (bvadd .cse376 .cse366))) (concat ((_ extract 63 32) .cse379) ((_ extract 31 0) .cse379))))) (let ((.cse372 (let ((.cse378 (bvadd .cse364 .cse370))) (concat ((_ extract 63 32) .cse378) ((_ extract 31 0) .cse378))))) (or (bvsle (let ((.cse368 (bvadd (let ((.cse369 (bvadd .cse9 .cse370))) (concat ((_ extract 63 32) .cse369) ((_ extract 31 0) .cse369))) .cse9))) (concat ((_ extract 63 32) .cse368) ((_ extract 31 0) .cse368))) .cse11) (bvsle (let ((.cse371 (bvadd .cse372 .cse367))) (concat ((_ extract 63 32) .cse371) ((_ extract 31 0) .cse371))) .cse11) (bvsle (let ((.cse373 (bvadd (let ((.cse374 (bvadd .cse9 (let ((.cse375 (bvadd .cse376 .cse9))) (concat ((_ extract 63 32) .cse375) ((_ extract 31 0) .cse375)))))) (concat ((_ extract 63 32) .cse374) ((_ extract 31 0) .cse374))) .cse9))) (concat ((_ extract 63 32) .cse373) ((_ extract 31 0) .cse373))) .cse11) (bvsle (let ((.cse377 (bvadd .cse9 .cse372))) (concat ((_ extract 63 32) .cse377) ((_ extract 31 0) .cse377))) .cse11))))))))) (bvsle (let ((.cse381 (bvadd .cse22 .cse367))) (concat ((_ extract 63 32) .cse381) ((_ extract 31 0) .cse381))) .cse11)))))) (or .cse268 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse385 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse384 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse382 (bvadd (let ((.cse383 (bvadd .cse384 .cse20))) (concat ((_ extract 63 32) .cse383) ((_ extract 31 0) .cse383))) .cse385))) (concat ((_ extract 63 32) .cse382) ((_ extract 31 0) .cse382))) .cse11) (bvsle (let ((.cse386 (bvadd .cse22 .cse385))) (concat ((_ extract 63 32) .cse386) ((_ extract 31 0) .cse386))) .cse11) (bvsle (let ((.cse387 (bvadd .cse9 (let ((.cse388 (bvadd .cse384 (let ((.cse389 (bvadd (let ((.cse390 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse390) ((_ extract 31 0) .cse390))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse389) ((_ extract 31 0) .cse389)))))) (concat ((_ extract 63 32) .cse388) ((_ extract 31 0) .cse388)))))) (concat ((_ extract 63 32) .cse387) ((_ extract 31 0) .cse387))) .cse11))))) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse393 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse395 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse396 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse400 (let ((.cse403 (bvadd .cse393 (let ((.cse404 (bvadd (let ((.cse405 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse405) ((_ extract 31 0) .cse405))) .cse395))) (concat ((_ extract 63 32) .cse404) ((_ extract 31 0) .cse404)))))) (concat ((_ extract 63 32) .cse403) ((_ extract 31 0) .cse403))))) (or (bvsle (let ((.cse391 (bvadd (let ((.cse392 (bvadd .cse393 (let ((.cse394 (bvadd .cse67 .cse395))) (concat ((_ extract 63 32) .cse394) ((_ extract 31 0) .cse394)))))) (concat ((_ extract 63 32) .cse392) ((_ extract 31 0) .cse392))) .cse396))) (concat ((_ extract 63 32) .cse391) ((_ extract 31 0) .cse391))) .cse11) (bvsle (let ((.cse397 (bvadd (let ((.cse398 (bvadd .cse393 .cse20))) (concat ((_ extract 63 32) .cse398) ((_ extract 31 0) .cse398))) .cse396))) (concat ((_ extract 63 32) .cse397) ((_ extract 31 0) .cse397))) .cse11) (bvsle (let ((.cse399 (bvadd .cse400 .cse396))) (concat ((_ extract 63 32) .cse399) ((_ extract 31 0) .cse399))) .cse11) (bvsle (let ((.cse401 (bvadd .cse22 .cse396))) (concat ((_ extract 63 32) .cse401) ((_ extract 31 0) .cse401))) .cse11) (bvsle (let ((.cse402 (bvadd .cse9 .cse400))) (concat ((_ extract 63 32) .cse402) ((_ extract 31 0) .cse402))) .cse11))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse408 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse415 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse417 ((_ sign_extend 32) v_arrayElimCell_89))) (or (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse412 (let ((.cse418 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse418) ((_ extract 31 0) .cse418))))) (let ((.cse407 (let ((.cse414 (bvadd .cse415 (let ((.cse416 (bvadd .cse412 .cse417))) (concat ((_ extract 63 32) .cse416) ((_ extract 31 0) .cse416)))))) (concat ((_ extract 63 32) .cse414) ((_ extract 31 0) .cse414))))) (or (bvsle (let ((.cse406 (bvadd .cse407 .cse408))) (concat ((_ extract 63 32) .cse406) ((_ extract 31 0) .cse406))) .cse11) (bvsle (let ((.cse409 (bvadd (let ((.cse410 (bvadd .cse9 (let ((.cse411 (bvadd .cse412 .cse9))) (concat ((_ extract 63 32) .cse411) ((_ extract 31 0) .cse411)))))) (concat ((_ extract 63 32) .cse410) ((_ extract 31 0) .cse410))) .cse9))) (concat ((_ extract 63 32) .cse409) ((_ extract 31 0) .cse409))) .cse11) (bvsle (let ((.cse413 (bvadd .cse9 .cse407))) (concat ((_ extract 63 32) .cse413) ((_ extract 31 0) .cse413))) .cse11))))) (bvsle (let ((.cse419 (bvadd (let ((.cse420 (bvadd .cse415 (let ((.cse421 (bvadd .cse67 .cse417))) (concat ((_ extract 63 32) .cse421) ((_ extract 31 0) .cse421)))))) (concat ((_ extract 63 32) .cse420) ((_ extract 31 0) .cse420))) .cse408))) (concat ((_ extract 63 32) .cse419) ((_ extract 31 0) .cse419))) .cse11)))) (bvsle (let ((.cse422 (bvadd (let ((.cse423 (bvadd .cse415 .cse20))) (concat ((_ extract 63 32) .cse423) ((_ extract 31 0) .cse423))) .cse408))) (concat ((_ extract 63 32) .cse422) ((_ extract 31 0) .cse422))) .cse11)))) (bvsle (let ((.cse424 (bvadd .cse22 .cse408))) (concat ((_ extract 63 32) .cse424) ((_ extract 31 0) .cse424))) .cse11))))) .cse41) (or .cse425 .cse85) (or .cse2 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse430 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse428 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse434 (let ((.cse442 (bvadd (let ((.cse443 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse443) ((_ extract 31 0) .cse443))) .cse430))) (concat ((_ extract 63 32) .cse442) ((_ extract 31 0) .cse442))))) (let ((.cse431 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse438 (let ((.cse441 (bvadd .cse428 .cse434))) (concat ((_ extract 63 32) .cse441) ((_ extract 31 0) .cse441))))) (or (bvsle (let ((.cse426 (bvadd (let ((.cse427 (bvadd .cse428 (let ((.cse429 (bvadd .cse67 .cse430))) (concat ((_ extract 63 32) .cse429) ((_ extract 31 0) .cse429)))))) (concat ((_ extract 63 32) .cse427) ((_ extract 31 0) .cse427))) .cse431))) (concat ((_ extract 63 32) .cse426) ((_ extract 31 0) .cse426))) .cse11) (bvsle (let ((.cse432 (bvadd (let ((.cse433 (bvadd .cse9 .cse434))) (concat ((_ extract 63 32) .cse433) ((_ extract 31 0) .cse433))) .cse9))) (concat ((_ extract 63 32) .cse432) ((_ extract 31 0) .cse432))) .cse11) (bvsle (let ((.cse435 (bvadd (let ((.cse436 (bvadd .cse428 .cse20))) (concat ((_ extract 63 32) .cse436) ((_ extract 31 0) .cse436))) .cse431))) (concat ((_ extract 63 32) .cse435) ((_ extract 31 0) .cse435))) .cse11) (bvsle (let ((.cse437 (bvadd .cse438 .cse431))) (concat ((_ extract 63 32) .cse437) ((_ extract 31 0) .cse437))) .cse11) (bvsle (let ((.cse439 (bvadd .cse22 .cse431))) (concat ((_ extract 63 32) .cse439) ((_ extract 31 0) .cse439))) .cse11) (bvsle (let ((.cse440 (bvadd .cse9 .cse438))) (concat ((_ extract 63 32) .cse440) ((_ extract 31 0) .cse440))) .cse11))))))) (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse449 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse446 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse448 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse444 (bvadd (let ((.cse445 (bvadd .cse446 (let ((.cse447 (bvadd .cse67 .cse448))) (concat ((_ extract 63 32) .cse447) ((_ extract 31 0) .cse447)))))) (concat ((_ extract 63 32) .cse445) ((_ extract 31 0) .cse445))) .cse449))) (concat ((_ extract 63 32) .cse444) ((_ extract 31 0) .cse444))) .cse11) (bvsle (let ((.cse450 (bvadd (let ((.cse451 (bvadd .cse446 .cse20))) (concat ((_ extract 63 32) .cse451) ((_ extract 31 0) .cse451))) .cse449))) (concat ((_ extract 63 32) .cse450) ((_ extract 31 0) .cse450))) .cse11) (bvsle (let ((.cse452 (bvadd .cse22 .cse449))) (concat ((_ extract 63 32) .cse452) ((_ extract 31 0) .cse452))) .cse11) (bvsle (let ((.cse453 (bvadd .cse9 (let ((.cse454 (bvadd .cse446 (let ((.cse455 (bvadd (let ((.cse456 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse456) ((_ extract 31 0) .cse456))) .cse448))) (concat ((_ extract 63 32) .cse455) ((_ extract 31 0) .cse455)))))) (concat ((_ extract 63 32) .cse454) ((_ extract 31 0) .cse454)))))) (concat ((_ extract 63 32) .cse453) ((_ extract 31 0) .cse453))) .cse11))))) (or .cse6 (and (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse459 ((_ sign_extend 32) v_arrayElimCell_90))) (let ((.cse460 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse462 (let ((.cse465 (bvadd .cse459 (let ((.cse466 (bvadd (let ((.cse467 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse467) ((_ extract 31 0) .cse467))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse466) ((_ extract 31 0) .cse466)))))) (concat ((_ extract 63 32) .cse465) ((_ extract 31 0) .cse465))))) (or (bvsle (let ((.cse457 (bvadd (let ((.cse458 (bvadd .cse459 .cse20))) (concat ((_ extract 63 32) .cse458) ((_ extract 31 0) .cse458))) .cse460))) (concat ((_ extract 63 32) .cse457) ((_ extract 31 0) .cse457))) .cse11) (bvsle (let ((.cse461 (bvadd .cse462 .cse460))) (concat ((_ extract 63 32) .cse461) ((_ extract 31 0) .cse461))) .cse11) (bvsle (let ((.cse463 (bvadd .cse22 .cse460))) (concat ((_ extract 63 32) .cse463) ((_ extract 31 0) .cse463))) .cse11) (bvsle (let ((.cse464 (bvadd .cse9 .cse462))) (concat ((_ extract 63 32) .cse464) ((_ extract 31 0) .cse464))) .cse11))))) .cse41) (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse471 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse470 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse468 (bvadd (let ((.cse469 (bvadd .cse470 .cse20))) (concat ((_ extract 63 32) .cse469) ((_ extract 31 0) .cse469))) .cse471))) (concat ((_ extract 63 32) .cse468) ((_ extract 31 0) .cse468))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse474 (let ((.cse479 (bvadd (let ((.cse480 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse480) ((_ extract 31 0) .cse480))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse479) ((_ extract 31 0) .cse479))))) (let ((.cse476 (let ((.cse478 (bvadd .cse470 .cse474))) (concat ((_ extract 63 32) .cse478) ((_ extract 31 0) .cse478))))) (or (bvsle (let ((.cse472 (bvadd (let ((.cse473 (bvadd .cse9 .cse474))) (concat ((_ extract 63 32) .cse473) ((_ extract 31 0) .cse473))) .cse9))) (concat ((_ extract 63 32) .cse472) ((_ extract 31 0) .cse472))) .cse11) (bvsle (let ((.cse475 (bvadd .cse476 .cse471))) (concat ((_ extract 63 32) .cse475) ((_ extract 31 0) .cse475))) .cse11) (bvsle (let ((.cse477 (bvadd .cse9 .cse476))) (concat ((_ extract 63 32) .cse477) ((_ extract 31 0) .cse477))) .cse11)))))))) (bvsle (let ((.cse481 (bvadd .cse22 .cse471))) (concat ((_ extract 63 32) .cse481) ((_ extract 31 0) .cse481))) .cse11))))) .cse2) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse494 (let ((.cse499 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse499) ((_ extract 31 0) .cse499))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse485 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse484 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse482 (bvadd (let ((.cse483 (bvadd .cse484 .cse20))) (concat ((_ extract 63 32) .cse483) ((_ extract 31 0) .cse483))) .cse485))) (concat ((_ extract 63 32) .cse482) ((_ extract 31 0) .cse482))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse488 (let ((.cse493 (bvadd .cse494 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse493) ((_ extract 31 0) .cse493))))) (let ((.cse490 (let ((.cse492 (bvadd .cse484 .cse488))) (concat ((_ extract 63 32) .cse492) ((_ extract 31 0) .cse492))))) (or (bvsle (let ((.cse486 (bvadd (let ((.cse487 (bvadd .cse9 .cse488))) (concat ((_ extract 63 32) .cse487) ((_ extract 31 0) .cse487))) .cse9))) (concat ((_ extract 63 32) .cse486) ((_ extract 31 0) .cse486))) .cse11) (bvsle (let ((.cse489 (bvadd .cse490 .cse485))) (concat ((_ extract 63 32) .cse489) ((_ extract 31 0) .cse489))) .cse11) (bvsle (let ((.cse491 (bvadd .cse9 .cse490))) (concat ((_ extract 63 32) .cse491) ((_ extract 31 0) .cse491))) .cse11)))))))) (bvsle (let ((.cse495 (bvadd .cse22 .cse485))) (concat ((_ extract 63 32) .cse495) ((_ extract 31 0) .cse495))) .cse11)))) (bvsle (let ((.cse496 (bvadd (let ((.cse497 (bvadd .cse9 (let ((.cse498 (bvadd .cse494 .cse9))) (concat ((_ extract 63 32) .cse498) ((_ extract 31 0) .cse498)))))) (concat ((_ extract 63 32) .cse497) ((_ extract 31 0) .cse497))) .cse9))) (concat ((_ extract 63 32) .cse496) ((_ extract 31 0) .cse496))) .cse11)))) (or .cse41 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse502 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse509 (let ((.cse514 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse514) ((_ extract 31 0) .cse514))))) (let ((.cse503 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse505 (let ((.cse512 (bvadd .cse502 (let ((.cse513 (bvadd .cse509 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse513) ((_ extract 31 0) .cse513)))))) (concat ((_ extract 63 32) .cse512) ((_ extract 31 0) .cse512))))) (or (bvsle (let ((.cse500 (bvadd (let ((.cse501 (bvadd .cse502 .cse20))) (concat ((_ extract 63 32) .cse501) ((_ extract 31 0) .cse501))) .cse503))) (concat ((_ extract 63 32) .cse500) ((_ extract 31 0) .cse500))) .cse11) (bvsle (let ((.cse504 (bvadd .cse505 .cse503))) (concat ((_ extract 63 32) .cse504) ((_ extract 31 0) .cse504))) .cse11) (bvsle (let ((.cse506 (bvadd (let ((.cse507 (bvadd .cse9 (let ((.cse508 (bvadd .cse509 .cse9))) (concat ((_ extract 63 32) .cse508) ((_ extract 31 0) .cse508)))))) (concat ((_ extract 63 32) .cse507) ((_ extract 31 0) .cse507))) .cse9))) (concat ((_ extract 63 32) .cse506) ((_ extract 31 0) .cse506))) .cse11) (bvsle (let ((.cse510 (bvadd .cse22 .cse503))) (concat ((_ extract 63 32) .cse510) ((_ extract 31 0) .cse510))) .cse11) (bvsle (let ((.cse511 (bvadd .cse9 .cse505))) (concat ((_ extract 63 32) .cse511) ((_ extract 31 0) .cse511))) .cse11)))))))) (forall ((v_arrayElimCell_88 (_ BitVec 32))) (let ((.cse520 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse517 ((_ sign_extend 32) v_arrayElimCell_90))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse519 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse515 (bvadd (let ((.cse516 (bvadd .cse517 (let ((.cse518 (bvadd .cse67 .cse519))) (concat ((_ extract 63 32) .cse518) ((_ extract 31 0) .cse518)))))) (concat ((_ extract 63 32) .cse516) ((_ extract 31 0) .cse516))) .cse520))) (concat ((_ extract 63 32) .cse515) ((_ extract 31 0) .cse515))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse529 (let ((.cse533 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse533) ((_ extract 31 0) .cse533))))) (let ((.cse523 (let ((.cse532 (bvadd .cse529 .cse519))) (concat ((_ extract 63 32) .cse532) ((_ extract 31 0) .cse532))))) (let ((.cse525 (let ((.cse531 (bvadd .cse517 .cse523))) (concat ((_ extract 63 32) .cse531) ((_ extract 31 0) .cse531))))) (or (bvsle (let ((.cse521 (bvadd (let ((.cse522 (bvadd .cse9 .cse523))) (concat ((_ extract 63 32) .cse522) ((_ extract 31 0) .cse522))) .cse9))) (concat ((_ extract 63 32) .cse521) ((_ extract 31 0) .cse521))) .cse11) (bvsle (let ((.cse524 (bvadd .cse525 .cse520))) (concat ((_ extract 63 32) .cse524) ((_ extract 31 0) .cse524))) .cse11) (bvsle (let ((.cse526 (bvadd (let ((.cse527 (bvadd .cse9 (let ((.cse528 (bvadd .cse529 .cse9))) (concat ((_ extract 63 32) .cse528) ((_ extract 31 0) .cse528)))))) (concat ((_ extract 63 32) .cse527) ((_ extract 31 0) .cse527))) .cse9))) (concat ((_ extract 63 32) .cse526) ((_ extract 31 0) .cse526))) .cse11) (bvsle (let ((.cse530 (bvadd .cse9 .cse525))) (concat ((_ extract 63 32) .cse530) ((_ extract 31 0) .cse530))) .cse11))))))))) (bvsle (let ((.cse534 (bvadd (let ((.cse535 (bvadd .cse517 .cse20))) (concat ((_ extract 63 32) .cse535) ((_ extract 31 0) .cse535))) .cse520))) (concat ((_ extract 63 32) .cse534) ((_ extract 31 0) .cse534))) .cse11)))) (bvsle (let ((.cse536 (bvadd .cse22 .cse520))) (concat ((_ extract 63 32) .cse536) ((_ extract 31 0) .cse536))) .cse11))))))) (or (let ((.cse541 (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (bvsle (let ((.cse1015 (bvadd (let ((.cse1016 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse20))) (concat ((_ extract 63 32) .cse1016) ((_ extract 31 0) .cse1016))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse1015) ((_ extract 31 0) .cse1015))) .cse11)))) (and (or .cse425 .cse541) (or .cse5 (let ((.cse542 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse661 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse663 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse659 (bvadd (let ((.cse660 (bvadd .cse661 (let ((.cse662 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse662) ((_ extract 31 0) .cse662)))))) (concat ((_ extract 63 32) .cse660) ((_ extract 31 0) .cse660))) .cse663))) (concat ((_ extract 63 32) .cse659) ((_ extract 31 0) .cse659))) .cse11) (bvsle (let ((.cse664 (bvadd (let ((.cse665 (bvadd .cse661 .cse20))) (concat ((_ extract 63 32) .cse665) ((_ extract 31 0) .cse665))) .cse663))) (concat ((_ extract 63 32) .cse664) ((_ extract 31 0) .cse664))) .cse11)))))) (and (or .cse3 .cse87 .cse542) (or .cse84 .cse541 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse546 (let ((.cse550 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse550) ((_ extract 31 0) .cse550))))) (or (bvsle (let ((.cse543 (bvadd (let ((.cse544 (bvadd .cse9 (let ((.cse545 (bvadd .cse546 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse545) ((_ extract 31 0) .cse545)))))) (concat ((_ extract 63 32) .cse544) ((_ extract 31 0) .cse544))) .cse9))) (concat ((_ extract 63 32) .cse543) ((_ extract 31 0) .cse543))) .cse11) (bvsle (let ((.cse547 (bvadd (let ((.cse548 (bvadd .cse9 (let ((.cse549 (bvadd .cse546 .cse9))) (concat ((_ extract 63 32) .cse549) ((_ extract 31 0) .cse549)))))) (concat ((_ extract 63 32) .cse548) ((_ extract 31 0) .cse548))) .cse9))) (concat ((_ extract 63 32) .cse547) ((_ extract 31 0) .cse547))) .cse11))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse553 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse555 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse556 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse562 (let ((.cse566 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse566) ((_ extract 31 0) .cse566))))) (or (bvsle (let ((.cse551 (bvadd (let ((.cse552 (bvadd .cse553 (let ((.cse554 (bvadd .cse67 .cse555))) (concat ((_ extract 63 32) .cse554) ((_ extract 31 0) .cse554)))))) (concat ((_ extract 63 32) .cse552) ((_ extract 31 0) .cse552))) .cse556))) (concat ((_ extract 63 32) .cse551) ((_ extract 31 0) .cse551))) .cse11) (bvsle (let ((.cse557 (bvadd (let ((.cse558 (bvadd .cse553 .cse20))) (concat ((_ extract 63 32) .cse558) ((_ extract 31 0) .cse558))) .cse556))) (concat ((_ extract 63 32) .cse557) ((_ extract 31 0) .cse557))) .cse11) (bvsle (let ((.cse559 (bvadd (let ((.cse560 (bvadd .cse553 (let ((.cse561 (bvadd .cse562 .cse555))) (concat ((_ extract 63 32) .cse561) ((_ extract 31 0) .cse561)))))) (concat ((_ extract 63 32) .cse560) ((_ extract 31 0) .cse560))) .cse556))) (concat ((_ extract 63 32) .cse559) ((_ extract 31 0) .cse559))) .cse11) (bvsle (let ((.cse563 (bvadd (let ((.cse564 (bvadd .cse9 (let ((.cse565 (bvadd .cse562 .cse9))) (concat ((_ extract 63 32) .cse565) ((_ extract 31 0) .cse565)))))) (concat ((_ extract 63 32) .cse564) ((_ extract 31 0) .cse564))) .cse9))) (concat ((_ extract 63 32) .cse563) ((_ extract 31 0) .cse563))) .cse11)))) .cse41) (or (and (or .cse84 .cse541 .cse86) (or .cse87 .cse542) (or .cse6 (and (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse572 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse573 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse569 (let ((.cse574 (bvadd (let ((.cse575 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse575) ((_ extract 31 0) .cse575))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse574) ((_ extract 31 0) .cse574))))) (or (bvsle (let ((.cse567 (bvadd (let ((.cse568 (bvadd .cse9 .cse569))) (concat ((_ extract 63 32) .cse568) ((_ extract 31 0) .cse568))) .cse9))) (concat ((_ extract 63 32) .cse567) ((_ extract 31 0) .cse567))) .cse11) (bvsle (let ((.cse570 (bvadd (let ((.cse571 (bvadd .cse572 .cse569))) (concat ((_ extract 63 32) .cse571) ((_ extract 31 0) .cse571))) .cse573))) (concat ((_ extract 63 32) .cse570) ((_ extract 31 0) .cse570))) .cse11)))) (bvsle (let ((.cse576 (bvadd (let ((.cse577 (bvadd .cse572 .cse20))) (concat ((_ extract 63 32) .cse577) ((_ extract 31 0) .cse577))) .cse573))) (concat ((_ extract 63 32) .cse576) ((_ extract 31 0) .cse576))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse580 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse581 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse578 (bvadd (let ((.cse579 (bvadd .cse580 .cse20))) (concat ((_ extract 63 32) .cse579) ((_ extract 31 0) .cse579))) .cse581))) (concat ((_ extract 63 32) .cse578) ((_ extract 31 0) .cse578))) .cse11) (bvsle (let ((.cse582 (bvadd (let ((.cse583 (bvadd .cse580 (let ((.cse584 (bvadd (let ((.cse585 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse585) ((_ extract 31 0) .cse585))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse584) ((_ extract 31 0) .cse584)))))) (concat ((_ extract 63 32) .cse583) ((_ extract 31 0) .cse583))) .cse581))) (concat ((_ extract 63 32) .cse582) ((_ extract 31 0) .cse582))) .cse11)))) .cse41))) (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse588 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse589 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse586 (bvadd (let ((.cse587 (bvadd .cse588 .cse20))) (concat ((_ extract 63 32) .cse587) ((_ extract 31 0) .cse587))) .cse589))) (concat ((_ extract 63 32) .cse586) ((_ extract 31 0) .cse586))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse593 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse596 (let ((.cse599 (bvadd (let ((.cse600 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse600) ((_ extract 31 0) .cse600))) .cse593))) (concat ((_ extract 63 32) .cse599) ((_ extract 31 0) .cse599))))) (or (bvsle (let ((.cse590 (bvadd (let ((.cse591 (bvadd .cse588 (let ((.cse592 (bvadd .cse67 .cse593))) (concat ((_ extract 63 32) .cse592) ((_ extract 31 0) .cse592)))))) (concat ((_ extract 63 32) .cse591) ((_ extract 31 0) .cse591))) .cse589))) (concat ((_ extract 63 32) .cse590) ((_ extract 31 0) .cse590))) .cse11) (bvsle (let ((.cse594 (bvadd (let ((.cse595 (bvadd .cse9 .cse596))) (concat ((_ extract 63 32) .cse595) ((_ extract 31 0) .cse595))) .cse9))) (concat ((_ extract 63 32) .cse594) ((_ extract 31 0) .cse594))) .cse11) (bvsle (let ((.cse597 (bvadd (let ((.cse598 (bvadd .cse588 .cse596))) (concat ((_ extract 63 32) .cse598) ((_ extract 31 0) .cse598))) .cse589))) (concat ((_ extract 63 32) .cse597) ((_ extract 31 0) .cse597))) .cse11)))))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse603 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse605 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse606 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse601 (bvadd (let ((.cse602 (bvadd .cse603 (let ((.cse604 (bvadd .cse67 .cse605))) (concat ((_ extract 63 32) .cse604) ((_ extract 31 0) .cse604)))))) (concat ((_ extract 63 32) .cse602) ((_ extract 31 0) .cse602))) .cse606))) (concat ((_ extract 63 32) .cse601) ((_ extract 31 0) .cse601))) .cse11) (bvsle (let ((.cse607 (bvadd (let ((.cse608 (bvadd .cse603 .cse20))) (concat ((_ extract 63 32) .cse608) ((_ extract 31 0) .cse608))) .cse606))) (concat ((_ extract 63 32) .cse607) ((_ extract 31 0) .cse607))) .cse11) (bvsle (let ((.cse609 (bvadd (let ((.cse610 (bvadd .cse603 (let ((.cse611 (bvadd (let ((.cse612 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse612) ((_ extract 31 0) .cse612))) .cse605))) (concat ((_ extract 63 32) .cse611) ((_ extract 31 0) .cse611)))))) (concat ((_ extract 63 32) .cse610) ((_ extract 31 0) .cse610))) .cse606))) (concat ((_ extract 63 32) .cse609) ((_ extract 31 0) .cse609))) .cse11)))) .cse41)) .cse2) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse627 (let ((.cse631 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse631) ((_ extract 31 0) .cse631))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse615 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse616 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse613 (bvadd (let ((.cse614 (bvadd .cse615 .cse20))) (concat ((_ extract 63 32) .cse614) ((_ extract 31 0) .cse614))) .cse616))) (concat ((_ extract 63 32) .cse613) ((_ extract 31 0) .cse613))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse620 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse623 (let ((.cse626 (bvadd .cse627 .cse620))) (concat ((_ extract 63 32) .cse626) ((_ extract 31 0) .cse626))))) (or (bvsle (let ((.cse617 (bvadd (let ((.cse618 (bvadd .cse615 (let ((.cse619 (bvadd .cse67 .cse620))) (concat ((_ extract 63 32) .cse619) ((_ extract 31 0) .cse619)))))) (concat ((_ extract 63 32) .cse618) ((_ extract 31 0) .cse618))) .cse616))) (concat ((_ extract 63 32) .cse617) ((_ extract 31 0) .cse617))) .cse11) (bvsle (let ((.cse621 (bvadd (let ((.cse622 (bvadd .cse9 .cse623))) (concat ((_ extract 63 32) .cse622) ((_ extract 31 0) .cse622))) .cse9))) (concat ((_ extract 63 32) .cse621) ((_ extract 31 0) .cse621))) .cse11) (bvsle (let ((.cse624 (bvadd (let ((.cse625 (bvadd .cse615 .cse623))) (concat ((_ extract 63 32) .cse625) ((_ extract 31 0) .cse625))) .cse616))) (concat ((_ extract 63 32) .cse624) ((_ extract 31 0) .cse624))) .cse11)))))))) (bvsle (let ((.cse628 (bvadd (let ((.cse629 (bvadd .cse9 (let ((.cse630 (bvadd .cse627 .cse9))) (concat ((_ extract 63 32) .cse630) ((_ extract 31 0) .cse630)))))) (concat ((_ extract 63 32) .cse629) ((_ extract 31 0) .cse629))) .cse9))) (concat ((_ extract 63 32) .cse628) ((_ extract 31 0) .cse628))) .cse11)))) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse634 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse635 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse639 (let ((.cse643 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse643) ((_ extract 31 0) .cse643))))) (or (bvsle (let ((.cse632 (bvadd (let ((.cse633 (bvadd .cse634 .cse20))) (concat ((_ extract 63 32) .cse633) ((_ extract 31 0) .cse633))) .cse635))) (concat ((_ extract 63 32) .cse632) ((_ extract 31 0) .cse632))) .cse11) (bvsle (let ((.cse636 (bvadd (let ((.cse637 (bvadd .cse634 (let ((.cse638 (bvadd .cse639 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse638) ((_ extract 31 0) .cse638)))))) (concat ((_ extract 63 32) .cse637) ((_ extract 31 0) .cse637))) .cse635))) (concat ((_ extract 63 32) .cse636) ((_ extract 31 0) .cse636))) .cse11) (bvsle (let ((.cse640 (bvadd (let ((.cse641 (bvadd .cse9 (let ((.cse642 (bvadd .cse639 .cse9))) (concat ((_ extract 63 32) .cse642) ((_ extract 31 0) .cse642)))))) (concat ((_ extract 63 32) .cse641) ((_ extract 31 0) .cse641))) .cse9))) (concat ((_ extract 63 32) .cse640) ((_ extract 31 0) .cse640))) .cse11)))) .cse41) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse652 (let ((.cse658 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse658) ((_ extract 31 0) .cse658))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse649 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse650 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse646 (let ((.cse651 (bvadd .cse652 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse651) ((_ extract 31 0) .cse651))))) (or (bvsle (let ((.cse644 (bvadd (let ((.cse645 (bvadd .cse9 .cse646))) (concat ((_ extract 63 32) .cse645) ((_ extract 31 0) .cse645))) .cse9))) (concat ((_ extract 63 32) .cse644) ((_ extract 31 0) .cse644))) .cse11) (bvsle (let ((.cse647 (bvadd (let ((.cse648 (bvadd .cse649 .cse646))) (concat ((_ extract 63 32) .cse648) ((_ extract 31 0) .cse648))) .cse650))) (concat ((_ extract 63 32) .cse647) ((_ extract 31 0) .cse647))) .cse11)))) (bvsle (let ((.cse653 (bvadd (let ((.cse654 (bvadd .cse649 .cse20))) (concat ((_ extract 63 32) .cse654) ((_ extract 31 0) .cse654))) .cse650))) (concat ((_ extract 63 32) .cse653) ((_ extract 31 0) .cse653))) .cse11)))) (bvsle (let ((.cse655 (bvadd (let ((.cse656 (bvadd .cse9 (let ((.cse657 (bvadd .cse652 .cse9))) (concat ((_ extract 63 32) .cse657) ((_ extract 31 0) .cse657)))))) (concat ((_ extract 63 32) .cse656) ((_ extract 31 0) .cse656))) .cse9))) (concat ((_ extract 63 32) .cse655) ((_ extract 31 0) .cse655))) .cse11))))) .cse6)))) (not .cse4) (or (and (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse675 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse668 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse677 ((_ sign_extend 32) v_arrayElimCell_89))) (or (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse672 (let ((.cse678 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse678) ((_ extract 31 0) .cse678))))) (let ((.cse667 (let ((.cse674 (bvadd .cse675 (let ((.cse676 (bvadd .cse672 .cse677))) (concat ((_ extract 63 32) .cse676) ((_ extract 31 0) .cse676)))))) (concat ((_ extract 63 32) .cse674) ((_ extract 31 0) .cse674))))) (or (bvsle (let ((.cse666 (bvadd .cse667 .cse668))) (concat ((_ extract 63 32) .cse666) ((_ extract 31 0) .cse666))) .cse11) (bvsle (let ((.cse669 (bvadd (let ((.cse670 (bvadd .cse9 (let ((.cse671 (bvadd .cse672 .cse9))) (concat ((_ extract 63 32) .cse671) ((_ extract 31 0) .cse671)))))) (concat ((_ extract 63 32) .cse670) ((_ extract 31 0) .cse670))) .cse9))) (concat ((_ extract 63 32) .cse669) ((_ extract 31 0) .cse669))) .cse11) (bvsle (let ((.cse673 (bvadd .cse9 .cse667))) (concat ((_ extract 63 32) .cse673) ((_ extract 31 0) .cse673))) .cse11))))) (bvsle (let ((.cse679 (bvadd (let ((.cse680 (bvadd .cse675 (let ((.cse681 (bvadd .cse67 .cse677))) (concat ((_ extract 63 32) .cse681) ((_ extract 31 0) .cse681)))))) (concat ((_ extract 63 32) .cse680) ((_ extract 31 0) .cse680))) .cse668))) (concat ((_ extract 63 32) .cse679) ((_ extract 31 0) .cse679))) .cse11)))) (bvsle (let ((.cse682 (bvadd (let ((.cse683 (bvadd .cse675 .cse20))) (concat ((_ extract 63 32) .cse683) ((_ extract 31 0) .cse683))) .cse668))) (concat ((_ extract 63 32) .cse682) ((_ extract 31 0) .cse682))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse686 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse688 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse689 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse693 (let ((.cse695 (bvadd .cse686 (let ((.cse696 (bvadd (let ((.cse697 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse697) ((_ extract 31 0) .cse697))) .cse688))) (concat ((_ extract 63 32) .cse696) ((_ extract 31 0) .cse696)))))) (concat ((_ extract 63 32) .cse695) ((_ extract 31 0) .cse695))))) (or (bvsle (let ((.cse684 (bvadd (let ((.cse685 (bvadd .cse686 (let ((.cse687 (bvadd .cse67 .cse688))) (concat ((_ extract 63 32) .cse687) ((_ extract 31 0) .cse687)))))) (concat ((_ extract 63 32) .cse685) ((_ extract 31 0) .cse685))) .cse689))) (concat ((_ extract 63 32) .cse684) ((_ extract 31 0) .cse684))) .cse11) (bvsle (let ((.cse690 (bvadd (let ((.cse691 (bvadd .cse686 .cse20))) (concat ((_ extract 63 32) .cse691) ((_ extract 31 0) .cse691))) .cse689))) (concat ((_ extract 63 32) .cse690) ((_ extract 31 0) .cse690))) .cse11) (bvsle (let ((.cse692 (bvadd .cse693 .cse689))) (concat ((_ extract 63 32) .cse692) ((_ extract 31 0) .cse692))) .cse11) (bvsle (let ((.cse694 (bvadd .cse9 .cse693))) (concat ((_ extract 63 32) .cse694) ((_ extract 31 0) .cse694))) .cse11))))) .cse2)) .cse41) (or .cse84 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse703 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse700 (let ((.cse706 (bvadd (let ((.cse707 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse707) ((_ extract 31 0) .cse707))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse706) ((_ extract 31 0) .cse706))))) (or (bvsle (let ((.cse698 (bvadd (let ((.cse699 (bvadd .cse9 .cse700))) (concat ((_ extract 63 32) .cse699) ((_ extract 31 0) .cse699))) .cse9))) (concat ((_ extract 63 32) .cse698) ((_ extract 31 0) .cse698))) .cse11) (bvsle (let ((.cse701 (bvadd (let ((.cse702 (bvadd .cse703 .cse20))) (concat ((_ extract 63 32) .cse702) ((_ extract 31 0) .cse702))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse701) ((_ extract 31 0) .cse701))) .cse11) (bvsle (let ((.cse704 (bvadd .cse9 (let ((.cse705 (bvadd .cse703 .cse700))) (concat ((_ extract 63 32) .cse705) ((_ extract 31 0) .cse705)))))) (concat ((_ extract 63 32) .cse704) ((_ extract 31 0) .cse704))) .cse11))))) (or .cse6 (and (or (and (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse711 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse710 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse708 (bvadd (let ((.cse709 (bvadd .cse710 .cse20))) (concat ((_ extract 63 32) .cse709) ((_ extract 31 0) .cse709))) .cse711))) (concat ((_ extract 63 32) .cse708) ((_ extract 31 0) .cse708))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse714 (let ((.cse719 (bvadd (let ((.cse720 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse720) ((_ extract 31 0) .cse720))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse719) ((_ extract 31 0) .cse719))))) (let ((.cse716 (let ((.cse718 (bvadd .cse710 .cse714))) (concat ((_ extract 63 32) .cse718) ((_ extract 31 0) .cse718))))) (or (bvsle (let ((.cse712 (bvadd (let ((.cse713 (bvadd .cse9 .cse714))) (concat ((_ extract 63 32) .cse713) ((_ extract 31 0) .cse713))) .cse9))) (concat ((_ extract 63 32) .cse712) ((_ extract 31 0) .cse712))) .cse11) (bvsle (let ((.cse715 (bvadd .cse716 .cse711))) (concat ((_ extract 63 32) .cse715) ((_ extract 31 0) .cse715))) .cse11) (bvsle (let ((.cse717 (bvadd .cse9 .cse716))) (concat ((_ extract 63 32) .cse717) ((_ extract 31 0) .cse717))) .cse11)))))))) (or .cse41 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse723 ((_ sign_extend 32) v_arrayElimCell_90))) (let ((.cse724 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse726 (let ((.cse728 (bvadd .cse723 (let ((.cse729 (bvadd (let ((.cse730 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse730) ((_ extract 31 0) .cse730))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse729) ((_ extract 31 0) .cse729)))))) (concat ((_ extract 63 32) .cse728) ((_ extract 31 0) .cse728))))) (or (bvsle (let ((.cse721 (bvadd (let ((.cse722 (bvadd .cse723 .cse20))) (concat ((_ extract 63 32) .cse722) ((_ extract 31 0) .cse722))) .cse724))) (concat ((_ extract 63 32) .cse721) ((_ extract 31 0) .cse721))) .cse11) (bvsle (let ((.cse725 (bvadd .cse726 .cse724))) (concat ((_ extract 63 32) .cse725) ((_ extract 31 0) .cse725))) .cse11) (bvsle (let ((.cse727 (bvadd .cse9 .cse726))) (concat ((_ extract 63 32) .cse727) ((_ extract 31 0) .cse727))) .cse11))))))) .cse2) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse733 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse740 (let ((.cse744 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse744) ((_ extract 31 0) .cse744))))) (let ((.cse734 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse736 (let ((.cse742 (bvadd .cse733 (let ((.cse743 (bvadd .cse740 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse743) ((_ extract 31 0) .cse743)))))) (concat ((_ extract 63 32) .cse742) ((_ extract 31 0) .cse742))))) (or (bvsle (let ((.cse731 (bvadd (let ((.cse732 (bvadd .cse733 .cse20))) (concat ((_ extract 63 32) .cse732) ((_ extract 31 0) .cse732))) .cse734))) (concat ((_ extract 63 32) .cse731) ((_ extract 31 0) .cse731))) .cse11) (bvsle (let ((.cse735 (bvadd .cse736 .cse734))) (concat ((_ extract 63 32) .cse735) ((_ extract 31 0) .cse735))) .cse11) (bvsle (let ((.cse737 (bvadd (let ((.cse738 (bvadd .cse9 (let ((.cse739 (bvadd .cse740 .cse9))) (concat ((_ extract 63 32) .cse739) ((_ extract 31 0) .cse739)))))) (concat ((_ extract 63 32) .cse738) ((_ extract 31 0) .cse738))) .cse9))) (concat ((_ extract 63 32) .cse737) ((_ extract 31 0) .cse737))) .cse11) (bvsle (let ((.cse741 (bvadd .cse9 .cse736))) (concat ((_ extract 63 32) .cse741) ((_ extract 31 0) .cse741))) .cse11))))) .cse41) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse757 (let ((.cse761 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse761) ((_ extract 31 0) .cse761))))) (or (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse748 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse747 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse745 (bvadd (let ((.cse746 (bvadd .cse747 .cse20))) (concat ((_ extract 63 32) .cse746) ((_ extract 31 0) .cse746))) .cse748))) (concat ((_ extract 63 32) .cse745) ((_ extract 31 0) .cse745))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse751 (let ((.cse756 (bvadd .cse757 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse756) ((_ extract 31 0) .cse756))))) (let ((.cse753 (let ((.cse755 (bvadd .cse747 .cse751))) (concat ((_ extract 63 32) .cse755) ((_ extract 31 0) .cse755))))) (or (bvsle (let ((.cse749 (bvadd (let ((.cse750 (bvadd .cse9 .cse751))) (concat ((_ extract 63 32) .cse750) ((_ extract 31 0) .cse750))) .cse9))) (concat ((_ extract 63 32) .cse749) ((_ extract 31 0) .cse749))) .cse11) (bvsle (let ((.cse752 (bvadd .cse753 .cse748))) (concat ((_ extract 63 32) .cse752) ((_ extract 31 0) .cse752))) .cse11) (bvsle (let ((.cse754 (bvadd .cse9 .cse753))) (concat ((_ extract 63 32) .cse754) ((_ extract 31 0) .cse754))) .cse11)))))))) (bvsle (let ((.cse758 (bvadd (let ((.cse759 (bvadd .cse9 (let ((.cse760 (bvadd .cse757 .cse9))) (concat ((_ extract 63 32) .cse760) ((_ extract 31 0) .cse760)))))) (concat ((_ extract 63 32) .cse759) ((_ extract 31 0) .cse759))) .cse9))) (concat ((_ extract 63 32) .cse758) ((_ extract 31 0) .cse758))) .cse11)))))) (or .cse87 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse767 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse764 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse766 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse762 (bvadd (let ((.cse763 (bvadd .cse764 (let ((.cse765 (bvadd .cse67 .cse766))) (concat ((_ extract 63 32) .cse765) ((_ extract 31 0) .cse765)))))) (concat ((_ extract 63 32) .cse763) ((_ extract 31 0) .cse763))) .cse767))) (concat ((_ extract 63 32) .cse762) ((_ extract 31 0) .cse762))) .cse11) (bvsle (let ((.cse768 (bvadd (let ((.cse769 (bvadd .cse764 .cse20))) (concat ((_ extract 63 32) .cse769) ((_ extract 31 0) .cse769))) .cse767))) (concat ((_ extract 63 32) .cse768) ((_ extract 31 0) .cse768))) .cse11) (bvsle (let ((.cse770 (bvadd .cse9 (let ((.cse771 (bvadd .cse764 (let ((.cse772 (bvadd (let ((.cse773 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse773) ((_ extract 31 0) .cse773))) .cse766))) (concat ((_ extract 63 32) .cse772) ((_ extract 31 0) .cse772)))))) (concat ((_ extract 63 32) .cse771) ((_ extract 31 0) .cse771)))))) (concat ((_ extract 63 32) .cse770) ((_ extract 31 0) .cse770))) .cse11))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse778 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse776 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse782 (let ((.cse789 (bvadd (let ((.cse790 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse790) ((_ extract 31 0) .cse790))) .cse778))) (concat ((_ extract 63 32) .cse789) ((_ extract 31 0) .cse789))))) (let ((.cse779 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse786 (let ((.cse788 (bvadd .cse776 .cse782))) (concat ((_ extract 63 32) .cse788) ((_ extract 31 0) .cse788))))) (or (bvsle (let ((.cse774 (bvadd (let ((.cse775 (bvadd .cse776 (let ((.cse777 (bvadd .cse67 .cse778))) (concat ((_ extract 63 32) .cse777) ((_ extract 31 0) .cse777)))))) (concat ((_ extract 63 32) .cse775) ((_ extract 31 0) .cse775))) .cse779))) (concat ((_ extract 63 32) .cse774) ((_ extract 31 0) .cse774))) .cse11) (bvsle (let ((.cse780 (bvadd (let ((.cse781 (bvadd .cse9 .cse782))) (concat ((_ extract 63 32) .cse781) ((_ extract 31 0) .cse781))) .cse9))) (concat ((_ extract 63 32) .cse780) ((_ extract 31 0) .cse780))) .cse11) (bvsle (let ((.cse783 (bvadd (let ((.cse784 (bvadd .cse776 .cse20))) (concat ((_ extract 63 32) .cse784) ((_ extract 31 0) .cse784))) .cse779))) (concat ((_ extract 63 32) .cse783) ((_ extract 31 0) .cse783))) .cse11) (bvsle (let ((.cse785 (bvadd .cse786 .cse779))) (concat ((_ extract 63 32) .cse785) ((_ extract 31 0) .cse785))) .cse11) (bvsle (let ((.cse787 (bvadd .cse9 .cse786))) (concat ((_ extract 63 32) .cse787) ((_ extract 31 0) .cse787))) .cse11)))))) .cse2) (forall ((v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse793 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse796 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32))) (let ((.cse795 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse791 (bvadd (let ((.cse792 (bvadd .cse793 (let ((.cse794 (bvadd .cse67 .cse795))) (concat ((_ extract 63 32) .cse794) ((_ extract 31 0) .cse794)))))) (concat ((_ extract 63 32) .cse792) ((_ extract 31 0) .cse792))) .cse796))) (concat ((_ extract 63 32) .cse791) ((_ extract 31 0) .cse791))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse805 (let ((.cse809 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse809) ((_ extract 31 0) .cse809))))) (let ((.cse799 (let ((.cse808 (bvadd .cse805 .cse795))) (concat ((_ extract 63 32) .cse808) ((_ extract 31 0) .cse808))))) (let ((.cse801 (let ((.cse807 (bvadd .cse793 .cse799))) (concat ((_ extract 63 32) .cse807) ((_ extract 31 0) .cse807))))) (or (bvsle (let ((.cse797 (bvadd (let ((.cse798 (bvadd .cse9 .cse799))) (concat ((_ extract 63 32) .cse798) ((_ extract 31 0) .cse798))) .cse9))) (concat ((_ extract 63 32) .cse797) ((_ extract 31 0) .cse797))) .cse11) (bvsle (let ((.cse800 (bvadd .cse801 .cse796))) (concat ((_ extract 63 32) .cse800) ((_ extract 31 0) .cse800))) .cse11) (bvsle (let ((.cse802 (bvadd (let ((.cse803 (bvadd .cse9 (let ((.cse804 (bvadd .cse805 .cse9))) (concat ((_ extract 63 32) .cse804) ((_ extract 31 0) .cse804)))))) (concat ((_ extract 63 32) .cse803) ((_ extract 31 0) .cse803))) .cse9))) (concat ((_ extract 63 32) .cse802) ((_ extract 31 0) .cse802))) .cse11) (bvsle (let ((.cse806 (bvadd .cse9 .cse801))) (concat ((_ extract 63 32) .cse806) ((_ extract 31 0) .cse806))) .cse11))))))))) (bvsle (let ((.cse810 (bvadd (let ((.cse811 (bvadd .cse793 .cse20))) (concat ((_ extract 63 32) .cse811) ((_ extract 31 0) .cse811))) .cse796))) (concat ((_ extract 63 32) .cse810) ((_ extract 31 0) .cse810))) .cse11)))) (or .cse268 (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse814 ((_ sign_extend 32) v_arrayElimCell_90))) (or (bvsle (let ((.cse812 (bvadd (let ((.cse813 (bvadd .cse814 .cse20))) (concat ((_ extract 63 32) .cse813) ((_ extract 31 0) .cse813))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse812) ((_ extract 31 0) .cse812))) .cse11) (bvsle (let ((.cse815 (bvadd .cse9 (let ((.cse816 (bvadd .cse814 (let ((.cse817 (bvadd (let ((.cse818 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse818) ((_ extract 31 0) .cse818))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse817) ((_ extract 31 0) .cse817)))))) (concat ((_ extract 63 32) .cse816) ((_ extract 31 0) .cse816)))))) (concat ((_ extract 63 32) .cse815) ((_ extract 31 0) .cse815))) .cse11))))) (or .cse154 (and (or .cse268 .cse269) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse823 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse821 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse827 (let ((.cse832 (bvadd (let ((.cse833 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse833) ((_ extract 31 0) .cse833))) .cse823))) (concat ((_ extract 63 32) .cse832) ((_ extract 31 0) .cse832))))) (let ((.cse824 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse829 (let ((.cse831 (bvadd .cse821 .cse827))) (concat ((_ extract 63 32) .cse831) ((_ extract 31 0) .cse831))))) (or (bvsle (let ((.cse819 (bvadd (let ((.cse820 (bvadd .cse821 (let ((.cse822 (bvadd .cse67 .cse823))) (concat ((_ extract 63 32) .cse822) ((_ extract 31 0) .cse822)))))) (concat ((_ extract 63 32) .cse820) ((_ extract 31 0) .cse820))) .cse824))) (concat ((_ extract 63 32) .cse819) ((_ extract 31 0) .cse819))) .cse11) (bvsle (let ((.cse825 (bvadd (let ((.cse826 (bvadd .cse9 .cse827))) (concat ((_ extract 63 32) .cse826) ((_ extract 31 0) .cse826))) .cse9))) (concat ((_ extract 63 32) .cse825) ((_ extract 31 0) .cse825))) .cse11) (bvsle (let ((.cse828 (bvadd .cse829 .cse824))) (concat ((_ extract 63 32) .cse828) ((_ extract 31 0) .cse828))) .cse11) (bvsle (let ((.cse830 (bvadd .cse9 .cse829))) (concat ((_ extract 63 32) .cse830) ((_ extract 31 0) .cse830))) .cse11)))))) .cse2) (or .cse6 (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse839 (let ((.cse843 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse843) ((_ extract 31 0) .cse843))))) (let ((.cse835 (let ((.cse841 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse842 (bvadd .cse839 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse842) ((_ extract 31 0) .cse842)))))) (concat ((_ extract 63 32) .cse841) ((_ extract 31 0) .cse841))))) (or (bvsle (let ((.cse834 (bvadd .cse835 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse834) ((_ extract 31 0) .cse834))) .cse11) (bvsle (let ((.cse836 (bvadd (let ((.cse837 (bvadd .cse9 (let ((.cse838 (bvadd .cse839 .cse9))) (concat ((_ extract 63 32) .cse838) ((_ extract 31 0) .cse838)))))) (concat ((_ extract 63 32) .cse837) ((_ extract 31 0) .cse837))) .cse9))) (concat ((_ extract 63 32) .cse836) ((_ extract 31 0) .cse836))) .cse11) (bvsle (let ((.cse840 (bvadd .cse9 .cse835))) (concat ((_ extract 63 32) .cse840) ((_ extract 31 0) .cse840))) .cse11))))) .cse41) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse852 (let ((.cse856 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse856) ((_ extract 31 0) .cse856))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse846 (let ((.cse851 (bvadd .cse852 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse851) ((_ extract 31 0) .cse851))))) (let ((.cse848 (let ((.cse850 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse846))) (concat ((_ extract 63 32) .cse850) ((_ extract 31 0) .cse850))))) (or (bvsle (let ((.cse844 (bvadd (let ((.cse845 (bvadd .cse9 .cse846))) (concat ((_ extract 63 32) .cse845) ((_ extract 31 0) .cse845))) .cse9))) (concat ((_ extract 63 32) .cse844) ((_ extract 31 0) .cse844))) .cse11) (bvsle (let ((.cse847 (bvadd .cse848 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse847) ((_ extract 31 0) .cse847))) .cse11) (bvsle (let ((.cse849 (bvadd .cse9 .cse848))) (concat ((_ extract 63 32) .cse849) ((_ extract 31 0) .cse849))) .cse11))))) (bvsle (let ((.cse853 (bvadd (let ((.cse854 (bvadd .cse9 (let ((.cse855 (bvadd .cse852 .cse9))) (concat ((_ extract 63 32) .cse855) ((_ extract 31 0) .cse855)))))) (concat ((_ extract 63 32) .cse854) ((_ extract 31 0) .cse854))) .cse9))) (concat ((_ extract 63 32) .cse853) ((_ extract 31 0) .cse853))) .cse11)))) (or (and (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse859 (let ((.cse864 (bvadd (let ((.cse865 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse865) ((_ extract 31 0) .cse865))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse864) ((_ extract 31 0) .cse864))))) (let ((.cse861 (let ((.cse863 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse859))) (concat ((_ extract 63 32) .cse863) ((_ extract 31 0) .cse863))))) (or (bvsle (let ((.cse857 (bvadd (let ((.cse858 (bvadd .cse9 .cse859))) (concat ((_ extract 63 32) .cse858) ((_ extract 31 0) .cse858))) .cse9))) (concat ((_ extract 63 32) .cse857) ((_ extract 31 0) .cse857))) .cse11) (bvsle (let ((.cse860 (bvadd .cse861 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse860) ((_ extract 31 0) .cse860))) .cse11) (bvsle (let ((.cse862 (bvadd .cse9 .cse861))) (concat ((_ extract 63 32) .cse862) ((_ extract 31 0) .cse862))) .cse11))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse867 (let ((.cse869 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse870 (bvadd (let ((.cse871 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse871) ((_ extract 31 0) .cse871))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse870) ((_ extract 31 0) .cse870)))))) (concat ((_ extract 63 32) .cse869) ((_ extract 31 0) .cse869))))) (or (bvsle (let ((.cse866 (bvadd .cse867 ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse866) ((_ extract 31 0) .cse866))) .cse11) (bvsle (let ((.cse868 (bvadd .cse9 .cse867))) (concat ((_ extract 63 32) .cse868) ((_ extract 31 0) .cse868))) .cse11)))) .cse41)) .cse2))) (or .cse84 .cse155) (or (and (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse881 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse883 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse874 ((_ sign_extend 32) v_arrayElimCell_88))) (or (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse878 (let ((.cse884 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse884) ((_ extract 31 0) .cse884))))) (let ((.cse873 (let ((.cse880 (bvadd .cse881 (let ((.cse882 (bvadd .cse878 .cse883))) (concat ((_ extract 63 32) .cse882) ((_ extract 31 0) .cse882)))))) (concat ((_ extract 63 32) .cse880) ((_ extract 31 0) .cse880))))) (or (bvsle (let ((.cse872 (bvadd .cse873 .cse874))) (concat ((_ extract 63 32) .cse872) ((_ extract 31 0) .cse872))) .cse11) (bvsle (let ((.cse875 (bvadd (let ((.cse876 (bvadd .cse9 (let ((.cse877 (bvadd .cse878 .cse9))) (concat ((_ extract 63 32) .cse877) ((_ extract 31 0) .cse877)))))) (concat ((_ extract 63 32) .cse876) ((_ extract 31 0) .cse876))) .cse9))) (concat ((_ extract 63 32) .cse875) ((_ extract 31 0) .cse875))) .cse11) (bvsle (let ((.cse879 (bvadd .cse9 .cse873))) (concat ((_ extract 63 32) .cse879) ((_ extract 31 0) .cse879))) .cse11))))) (bvsle (let ((.cse885 (bvadd (let ((.cse886 (bvadd .cse881 (let ((.cse887 (bvadd .cse67 .cse883))) (concat ((_ extract 63 32) .cse887) ((_ extract 31 0) .cse887)))))) (concat ((_ extract 63 32) .cse886) ((_ extract 31 0) .cse886))) .cse874))) (concat ((_ extract 63 32) .cse885) ((_ extract 31 0) .cse885))) .cse11)))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse890 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse892 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse893 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse895 (let ((.cse897 (bvadd .cse890 (let ((.cse898 (bvadd (let ((.cse899 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse899) ((_ extract 31 0) .cse899))) .cse892))) (concat ((_ extract 63 32) .cse898) ((_ extract 31 0) .cse898)))))) (concat ((_ extract 63 32) .cse897) ((_ extract 31 0) .cse897))))) (or (bvsle (let ((.cse888 (bvadd (let ((.cse889 (bvadd .cse890 (let ((.cse891 (bvadd .cse67 .cse892))) (concat ((_ extract 63 32) .cse891) ((_ extract 31 0) .cse891)))))) (concat ((_ extract 63 32) .cse889) ((_ extract 31 0) .cse889))) .cse893))) (concat ((_ extract 63 32) .cse888) ((_ extract 31 0) .cse888))) .cse11) (bvsle (let ((.cse894 (bvadd .cse895 .cse893))) (concat ((_ extract 63 32) .cse894) ((_ extract 31 0) .cse894))) .cse11) (bvsle (let ((.cse896 (bvadd .cse9 .cse895))) (concat ((_ extract 63 32) .cse896) ((_ extract 31 0) .cse896))) .cse11))))) .cse2)) .cse41) (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse905 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse902 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse904 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse900 (bvadd (let ((.cse901 (bvadd .cse902 (let ((.cse903 (bvadd .cse67 .cse904))) (concat ((_ extract 63 32) .cse903) ((_ extract 31 0) .cse903)))))) (concat ((_ extract 63 32) .cse901) ((_ extract 31 0) .cse901))) .cse905))) (concat ((_ extract 63 32) .cse900) ((_ extract 31 0) .cse900))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse914 (let ((.cse918 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse918) ((_ extract 31 0) .cse918))))) (let ((.cse908 (let ((.cse917 (bvadd .cse914 .cse904))) (concat ((_ extract 63 32) .cse917) ((_ extract 31 0) .cse917))))) (let ((.cse910 (let ((.cse916 (bvadd .cse902 .cse908))) (concat ((_ extract 63 32) .cse916) ((_ extract 31 0) .cse916))))) (or (bvsle (let ((.cse906 (bvadd (let ((.cse907 (bvadd .cse9 .cse908))) (concat ((_ extract 63 32) .cse907) ((_ extract 31 0) .cse907))) .cse9))) (concat ((_ extract 63 32) .cse906) ((_ extract 31 0) .cse906))) .cse11) (bvsle (let ((.cse909 (bvadd .cse910 .cse905))) (concat ((_ extract 63 32) .cse909) ((_ extract 31 0) .cse909))) .cse11) (bvsle (let ((.cse911 (bvadd (let ((.cse912 (bvadd .cse9 (let ((.cse913 (bvadd .cse914 .cse9))) (concat ((_ extract 63 32) .cse913) ((_ extract 31 0) .cse913)))))) (concat ((_ extract 63 32) .cse912) ((_ extract 31 0) .cse912))) .cse9))) (concat ((_ extract 63 32) .cse911) ((_ extract 31 0) .cse911))) .cse11) (bvsle (let ((.cse915 (bvadd .cse9 .cse910))) (concat ((_ extract 63 32) .cse915) ((_ extract 31 0) .cse915))) .cse11))))))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse921 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse923 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse919 (bvadd (let ((.cse920 (bvadd .cse921 (let ((.cse922 (bvadd .cse67 .cse923))) (concat ((_ extract 63 32) .cse922) ((_ extract 31 0) .cse922)))))) (concat ((_ extract 63 32) .cse920) ((_ extract 31 0) .cse920))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse919) ((_ extract 31 0) .cse919))) .cse11) (bvsle (let ((.cse924 (bvadd .cse9 (let ((.cse925 (bvadd .cse921 (let ((.cse926 (bvadd (let ((.cse927 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse927) ((_ extract 31 0) .cse927))) .cse923))) (concat ((_ extract 63 32) .cse926) ((_ extract 31 0) .cse926)))))) (concat ((_ extract 63 32) .cse925) ((_ extract 31 0) .cse925)))))) (concat ((_ extract 63 32) .cse924) ((_ extract 31 0) .cse924))) .cse11)))) .cse87) (or .cse5 (and (or .cse6 (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse931 (let ((.cse935 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse935) ((_ extract 31 0) .cse935))))) (or (bvsle (let ((.cse928 (bvadd (let ((.cse929 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse930 (bvadd .cse931 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse930) ((_ extract 31 0) .cse930)))))) (concat ((_ extract 63 32) .cse929) ((_ extract 31 0) .cse929))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse928) ((_ extract 31 0) .cse928))) .cse11) (bvsle (let ((.cse932 (bvadd (let ((.cse933 (bvadd .cse9 (let ((.cse934 (bvadd .cse931 .cse9))) (concat ((_ extract 63 32) .cse934) ((_ extract 31 0) .cse934)))))) (concat ((_ extract 63 32) .cse933) ((_ extract 31 0) .cse933))) .cse9))) (concat ((_ extract 63 32) .cse932) ((_ extract 31 0) .cse932))) .cse11)))) .cse41) (or (and (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (bvsle (let ((.cse936 (bvadd (let ((.cse937 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse938 (bvadd (let ((.cse939 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse939) ((_ extract 31 0) .cse939))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse938) ((_ extract 31 0) .cse938)))))) (concat ((_ extract 63 32) .cse937) ((_ extract 31 0) .cse937))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse936) ((_ extract 31 0) .cse936))) .cse11)) .cse41) (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse942 (let ((.cse945 (bvadd (let ((.cse946 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse946) ((_ extract 31 0) .cse946))) ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse945) ((_ extract 31 0) .cse945))))) (or (bvsle (let ((.cse940 (bvadd (let ((.cse941 (bvadd .cse9 .cse942))) (concat ((_ extract 63 32) .cse941) ((_ extract 31 0) .cse941))) .cse9))) (concat ((_ extract 63 32) .cse940) ((_ extract 31 0) .cse940))) .cse11) (bvsle (let ((.cse943 (bvadd (let ((.cse944 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse942))) (concat ((_ extract 63 32) .cse944) ((_ extract 31 0) .cse944))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse943) ((_ extract 31 0) .cse943))) .cse11))))) .cse2) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse950 (let ((.cse957 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse957) ((_ extract 31 0) .cse957))))) (or (bvsle (let ((.cse947 (bvadd (let ((.cse948 (bvadd .cse9 (let ((.cse949 (bvadd .cse950 .cse9))) (concat ((_ extract 63 32) .cse949) ((_ extract 31 0) .cse949)))))) (concat ((_ extract 63 32) .cse948) ((_ extract 31 0) .cse948))) .cse9))) (concat ((_ extract 63 32) .cse947) ((_ extract 31 0) .cse947))) .cse11) (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse953 (let ((.cse956 (bvadd .cse950 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse956) ((_ extract 31 0) .cse956))))) (or (bvsle (let ((.cse951 (bvadd (let ((.cse952 (bvadd .cse9 .cse953))) (concat ((_ extract 63 32) .cse952) ((_ extract 31 0) .cse952))) .cse9))) (concat ((_ extract 63 32) .cse951) ((_ extract 31 0) .cse951))) .cse11) (bvsle (let ((.cse954 (bvadd (let ((.cse955 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) .cse953))) (concat ((_ extract 63 32) .cse955) ((_ extract 31 0) .cse955))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse954) ((_ extract 31 0) .cse954))) .cse11))))))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (bvsle (let ((.cse958 (bvadd (let ((.cse959 (bvadd ((_ sign_extend 32) v_arrayElimCell_90) (let ((.cse960 (bvadd .cse67 ((_ sign_extend 32) v_arrayElimCell_89)))) (concat ((_ extract 63 32) .cse960) ((_ extract 31 0) .cse960)))))) (concat ((_ extract 63 32) .cse959) ((_ extract 31 0) .cse959))) ((_ sign_extend 32) v_arrayElimCell_88)))) (concat ((_ extract 63 32) .cse958) ((_ extract 31 0) .cse958))) .cse11)) .cse87) (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse963 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse966 ((_ sign_extend 32) v_arrayElimCell_88)) (.cse965 ((_ sign_extend 32) v_arrayElimCell_89))) (or (bvsle (let ((.cse961 (bvadd (let ((.cse962 (bvadd .cse963 (let ((.cse964 (bvadd .cse67 .cse965))) (concat ((_ extract 63 32) .cse964) ((_ extract 31 0) .cse964)))))) (concat ((_ extract 63 32) .cse962) ((_ extract 31 0) .cse962))) .cse966))) (concat ((_ extract 63 32) .cse961) ((_ extract 31 0) .cse961))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse975 (let ((.cse977 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse977) ((_ extract 31 0) .cse977))))) (let ((.cse969 (let ((.cse976 (bvadd .cse975 .cse965))) (concat ((_ extract 63 32) .cse976) ((_ extract 31 0) .cse976))))) (or (bvsle (let ((.cse967 (bvadd (let ((.cse968 (bvadd .cse9 .cse969))) (concat ((_ extract 63 32) .cse968) ((_ extract 31 0) .cse968))) .cse9))) (concat ((_ extract 63 32) .cse967) ((_ extract 31 0) .cse967))) .cse11) (bvsle (let ((.cse970 (bvadd (let ((.cse971 (bvadd .cse963 .cse969))) (concat ((_ extract 63 32) .cse971) ((_ extract 31 0) .cse971))) .cse966))) (concat ((_ extract 63 32) .cse970) ((_ extract 31 0) .cse970))) .cse11) (bvsle (let ((.cse972 (bvadd (let ((.cse973 (bvadd .cse9 (let ((.cse974 (bvadd .cse975 .cse9))) (concat ((_ extract 63 32) .cse974) ((_ extract 31 0) .cse974)))))) (concat ((_ extract 63 32) .cse973) ((_ extract 31 0) .cse973))) .cse9))) (concat ((_ extract 63 32) .cse972) ((_ extract 31 0) .cse972))) .cse11)))))))) (or .cse84 .cse86) (or .cse41 (and (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32))) (let ((.cse980 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse982 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse983 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse978 (bvadd (let ((.cse979 (bvadd .cse980 (let ((.cse981 (bvadd .cse67 .cse982))) (concat ((_ extract 63 32) .cse981) ((_ extract 31 0) .cse981)))))) (concat ((_ extract 63 32) .cse979) ((_ extract 31 0) .cse979))) .cse983))) (concat ((_ extract 63 32) .cse978) ((_ extract 31 0) .cse978))) .cse11) (forall ((v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse987 (let ((.cse991 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse991) ((_ extract 31 0) .cse991))))) (or (bvsle (let ((.cse984 (bvadd (let ((.cse985 (bvadd .cse980 (let ((.cse986 (bvadd .cse987 .cse982))) (concat ((_ extract 63 32) .cse986) ((_ extract 31 0) .cse986)))))) (concat ((_ extract 63 32) .cse985) ((_ extract 31 0) .cse985))) .cse983))) (concat ((_ extract 63 32) .cse984) ((_ extract 31 0) .cse984))) .cse11) (bvsle (let ((.cse988 (bvadd (let ((.cse989 (bvadd .cse9 (let ((.cse990 (bvadd .cse987 .cse9))) (concat ((_ extract 63 32) .cse990) ((_ extract 31 0) .cse990)))))) (concat ((_ extract 63 32) .cse989) ((_ extract 31 0) .cse989))) .cse9))) (concat ((_ extract 63 32) .cse988) ((_ extract 31 0) .cse988))) .cse11))))))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse994 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse996 ((_ sign_extend 32) v_arrayElimCell_89)) (.cse997 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse992 (bvadd (let ((.cse993 (bvadd .cse994 (let ((.cse995 (bvadd .cse67 .cse996))) (concat ((_ extract 63 32) .cse995) ((_ extract 31 0) .cse995)))))) (concat ((_ extract 63 32) .cse993) ((_ extract 31 0) .cse993))) .cse997))) (concat ((_ extract 63 32) .cse992) ((_ extract 31 0) .cse992))) .cse11) (bvsle (let ((.cse998 (bvadd (let ((.cse999 (bvadd .cse994 (let ((.cse1000 (bvadd (let ((.cse1001 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1001) ((_ extract 31 0) .cse1001))) .cse996))) (concat ((_ extract 63 32) .cse1000) ((_ extract 31 0) .cse1000)))))) (concat ((_ extract 63 32) .cse999) ((_ extract 31 0) .cse999))) .cse997))) (concat ((_ extract 63 32) .cse998) ((_ extract 31 0) .cse998))) .cse11)))) .cse2))) (or (forall ((v_arrayElimCell_89 (_ BitVec 32)) (v_arrayElimCell_88 (_ BitVec 32)) (v_arrayElimCell_90 (_ BitVec 32)) (v_arrayElimCell_91 (_ BitVec 32))) (let ((.cse1006 ((_ sign_extend 32) v_arrayElimCell_89))) (let ((.cse1004 ((_ sign_extend 32) v_arrayElimCell_90)) (.cse1010 (let ((.cse1013 (bvadd (let ((.cse1014 (bvadd .cse27 ((_ sign_extend 32) v_arrayElimCell_91)))) (concat ((_ extract 63 32) .cse1014) ((_ extract 31 0) .cse1014))) .cse1006))) (concat ((_ extract 63 32) .cse1013) ((_ extract 31 0) .cse1013)))) (.cse1007 ((_ sign_extend 32) v_arrayElimCell_88))) (or (bvsle (let ((.cse1002 (bvadd (let ((.cse1003 (bvadd .cse1004 (let ((.cse1005 (bvadd .cse67 .cse1006))) (concat ((_ extract 63 32) .cse1005) ((_ extract 31 0) .cse1005)))))) (concat ((_ extract 63 32) .cse1003) ((_ extract 31 0) .cse1003))) .cse1007))) (concat ((_ extract 63 32) .cse1002) ((_ extract 31 0) .cse1002))) .cse11) (bvsle (let ((.cse1008 (bvadd (let ((.cse1009 (bvadd .cse9 .cse1010))) (concat ((_ extract 63 32) .cse1009) ((_ extract 31 0) .cse1009))) .cse9))) (concat ((_ extract 63 32) .cse1008) ((_ extract 31 0) .cse1008))) .cse11) (bvsle (let ((.cse1011 (bvadd (let ((.cse1012 (bvadd .cse1004 .cse1010))) (concat ((_ extract 63 32) .cse1012) ((_ extract 31 0) .cse1012))) .cse1007))) (concat ((_ extract 63 32) .cse1011) ((_ extract 31 0) .cse1011))) .cse11))))) .cse2))))))) (and .cse4 (bvsle (let ((.cse1017 (bvadd .cse9 .cse22))) (concat ((_ extract 63 32) .cse1017) ((_ extract 31 0) .cse1017))) .cse11)) .cse1))))))) is different from true [2023-11-29 05:05:16,314 INFO L378 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 22876 treesize of output 21916 [2023-11-29 05:05:16,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:05:16,865 INFO L378 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 375760886 treesize of output 369993718