./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 02:17:10,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 02:17:10,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 02:17:10,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 02:17:10,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 02:17:10,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 02:17:10,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 02:17:10,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 02:17:10,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 02:17:10,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 02:17:10,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 02:17:10,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 02:17:10,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 02:17:10,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 02:17:10,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 02:17:10,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 02:17:10,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 02:17:10,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 02:17:10,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 02:17:10,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 02:17:10,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 02:17:10,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 02:17:10,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 02:17:10,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 02:17:10,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 02:17:10,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 02:17:10,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 02:17:10,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 02:17:10,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 02:17:10,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 02:17:10,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 02:17:10,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 02:17:10,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 02:17:10,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 02:17:10,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 02:17:10,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 02:17:10,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 02:17:10,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 02:17:10,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 02:17:10,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 02:17:10,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 02:17:10,432 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 02:17:10,464 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 02:17:10,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 02:17:10,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 02:17:10,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 02:17:10,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 02:17:10,467 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 02:17:10,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 02:17:10,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 02:17:10,468 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 02:17:10,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 02:17:10,469 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 02:17:10,469 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 02:17:10,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 02:17:10,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 02:17:10,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 02:17:10,470 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 02:17:10,470 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 02:17:10,470 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 02:17:10,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 02:17:10,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 02:17:10,471 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 02:17:10,471 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 02:17:10,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 02:17:10,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 02:17:10,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 02:17:10,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:17:10,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 02:17:10,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 02:17:10,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 02:17:10,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 02:17:10,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 02:17:10,473 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 02:17:10,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 02:17:10,473 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 02:17:10,473 INFO L138 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 02:17:10,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 02:17:10,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 02:17:10,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 02:17:10,786 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 02:17:10,788 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 02:17:10,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-09-01 02:17:11,954 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 02:17:12,171 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 02:17:12,172 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-09-01 02:17:12,179 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642cc4141/e058ccc29d1749c4812262da9ba07388/FLAGf53143814 [2023-09-01 02:17:12,201 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642cc4141/e058ccc29d1749c4812262da9ba07388 [2023-09-01 02:17:12,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 02:17:12,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 02:17:12,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 02:17:12,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 02:17:12,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 02:17:12,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:17:12" (1/1) ... [2023-09-01 02:17:12,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371ab520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:12, skipping insertion in model container [2023-09-01 02:17:12,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:17:12" (1/1) ... [2023-09-01 02:17:12,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 02:17:12,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 02:17:12,429 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2023-09-01 02:17:12,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:17:12,462 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-09-01 02:17:12,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1493c169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:12, skipping insertion in model container [2023-09-01 02:17:12,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 02:17:12,464 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-09-01 02:17:12,466 INFO L158 Benchmark]: Toolchain (without parser) took 258.72ms. Allocated memory is still 65.0MB. Free memory was 32.7MB in the beginning and 36.7MB in the end (delta: -3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 02:17:12,466 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 52.4MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 02:17:12,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.30ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 36.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-09-01 02:17:12,469 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 52.4MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 33.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.30ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 36.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 112]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) 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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 02:17:14,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 02:17:14,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 02:17:14,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 02:17:14,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 02:17:14,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 02:17:14,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 02:17:14,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 02:17:14,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 02:17:14,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 02:17:14,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 02:17:14,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 02:17:14,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 02:17:14,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 02:17:14,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 02:17:14,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 02:17:14,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 02:17:14,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 02:17:14,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 02:17:14,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 02:17:14,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 02:17:14,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 02:17:14,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 02:17:14,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 02:17:14,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 02:17:14,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 02:17:14,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 02:17:14,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 02:17:14,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 02:17:14,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 02:17:14,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 02:17:14,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 02:17:14,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 02:17:14,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 02:17:14,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 02:17:14,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 02:17:14,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 02:17:14,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 02:17:14,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 02:17:14,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 02:17:14,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 02:17:14,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-09-01 02:17:14,328 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 02:17:14,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 02:17:14,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 02:17:14,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 02:17:14,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 02:17:14,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 02:17:14,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 02:17:14,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 02:17:14,332 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 02:17:14,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 02:17:14,333 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 02:17:14,333 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 02:17:14,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 02:17:14,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 02:17:14,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 02:17:14,334 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 02:17:14,334 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 02:17:14,334 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 02:17:14,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 02:17:14,335 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 02:17:14,335 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-09-01 02:17:14,335 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-09-01 02:17:14,335 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 02:17:14,335 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 02:17:14,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 02:17:14,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 02:17:14,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 02:17:14,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:17:14,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 02:17:14,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 02:17:14,337 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-09-01 02:17:14,337 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-09-01 02:17:14,337 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 02:17:14,338 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 02:17:14,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 02:17:14,338 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-09-01 02:17:14,338 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 02:17:14,338 INFO L138 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 02:17:14,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 02:17:14,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 02:17:14,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 02:17:14,674 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 02:17:14,674 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 02:17:14,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-09-01 02:17:15,828 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 02:17:16,028 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 02:17:16,029 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-09-01 02:17:16,034 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442528d2a/2932a764c31748568bdfbf0e72d6a615/FLAG72c024ec9 [2023-09-01 02:17:16,046 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442528d2a/2932a764c31748568bdfbf0e72d6a615 [2023-09-01 02:17:16,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 02:17:16,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 02:17:16,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 02:17:16,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 02:17:16,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 02:17:16,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d3bbdfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16, skipping insertion in model container [2023-09-01 02:17:16,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 02:17:16,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 02:17:16,284 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2023-09-01 02:17:16,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:17:16,323 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-09-01 02:17:16,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 02:17:16,362 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2023-09-01 02:17:16,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:17:16,382 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 02:17:16,414 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c[2755,2768] [2023-09-01 02:17:16,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 02:17:16,438 INFO L208 MainTranslator]: Completed translation [2023-09-01 02:17:16,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16 WrapperNode [2023-09-01 02:17:16,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 02:17:16,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 02:17:16,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 02:17:16,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 02:17:16,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,511 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 269 [2023-09-01 02:17:16,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 02:17:16,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 02:17:16,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 02:17:16,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 02:17:16,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,582 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 02:17:16,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 02:17:16,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 02:17:16,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 02:17:16,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (1/1) ... [2023-09-01 02:17:16,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 02:17:16,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 02:17:16,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 02:17:16,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 02:17:16,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 02:17:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 02:17:16,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 02:17:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 02:17:16,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 02:17:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-09-01 02:17:16,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 02:17:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 02:17:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-09-01 02:17:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 02:17:16,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 02:17:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 02:17:16,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-09-01 02:17:16,659 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 02:17:16,786 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 02:17:16,787 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 02:17:17,407 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 02:17:17,432 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 02:17:17,432 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-01 02:17:17,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:17:17 BoogieIcfgContainer [2023-09-01 02:17:17,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 02:17:17,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 02:17:17,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 02:17:17,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 02:17:17,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 02:17:16" (1/3) ... [2023-09-01 02:17:17,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa930ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:17:17, skipping insertion in model container [2023-09-01 02:17:17,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 02:17:16" (2/3) ... [2023-09-01 02:17:17,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa930ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 02:17:17, skipping insertion in model container [2023-09-01 02:17:17,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 02:17:17" (3/3) ... [2023-09-01 02:17:17,442 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2023-09-01 02:17:17,456 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 02:17:17,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-09-01 02:17:17,457 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 02:17:17,583 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 02:17:17,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 333 places, 354 transitions, 724 flow [2023-09-01 02:17:17,782 INFO L130 PetriNetUnfolder]: 28/352 cut-off events. [2023-09-01 02:17:17,783 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 02:17:17,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 352 events. 28/352 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 873 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 231. Up to 2 conditions per place. [2023-09-01 02:17:17,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 333 places, 354 transitions, 724 flow [2023-09-01 02:17:17,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 348 transitions, 708 flow [2023-09-01 02:17:17,813 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 02:17:17,823 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 327 places, 348 transitions, 708 flow [2023-09-01 02:17:17,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 327 places, 348 transitions, 708 flow [2023-09-01 02:17:17,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 348 transitions, 708 flow [2023-09-01 02:17:17,907 INFO L130 PetriNetUnfolder]: 28/348 cut-off events. [2023-09-01 02:17:17,907 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 02:17:17,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 348 events. 28/348 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 873 event pairs, 0 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 231. Up to 2 conditions per place. [2023-09-01 02:17:17,928 INFO L119 LiptonReduction]: Number of co-enabled transitions 28296 [2023-09-01 02:17:45,417 INFO L134 LiptonReduction]: Checked pairs total: 26570 [2023-09-01 02:17:45,417 INFO L136 LiptonReduction]: Total number of compositions: 433 [2023-09-01 02:17:45,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 02:17:45,447 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@327bdedf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 02:17:45,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-09-01 02:17:45,452 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-09-01 02:17:45,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 02:17:45,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:45,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-09-01 02:17:45,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:45,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 47968, now seen corresponding path program 1 times [2023-09-01 02:17:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:45,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747098282] [2023-09-01 02:17:45,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:45,474 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-09-01 02:17:45,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:45,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:45,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:45,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-09-01 02:17:45,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:45,705 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2023-09-01 02:17:45,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2023-09-01 02:17:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:45,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:45,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747098282] [2023-09-01 02:17:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747098282] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:45,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:17:45,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084676743] [2023-09-01 02:17:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:45,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:17:45,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:45,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:17:45,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:17:45,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 787 [2023-09-01 02:17:45,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-09-01 02:17:45,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:45,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 787 [2023-09-01 02:17:45,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:46,206 INFO L130 PetriNetUnfolder]: 230/373 cut-off events. [2023-09-01 02:17:46,206 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-09-01 02:17:46,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 373 events. 230/373 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1268 event pairs, 161 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 676. Up to 373 conditions per place. [2023-09-01 02:17:46,210 INFO L137 encePairwiseOnDemand]: 776/787 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-09-01 02:17:46,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 136 flow [2023-09-01 02:17:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:17:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:17:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2023-09-01 02:17:46,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4239728928420161 [2023-09-01 02:17:46,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1001 transitions. [2023-09-01 02:17:46,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1001 transitions. [2023-09-01 02:17:46,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:46,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1001 transitions. [2023-09-01 02:17:46,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 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-09-01 02:17:46,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:46,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:46,296 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 94 flow. Second operand 3 states and 1001 transitions. [2023-09-01 02:17:46,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 136 flow [2023-09-01 02:17:46,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 02:17:46,302 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 68 flow [2023-09-01 02:17:46,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2023-09-01 02:17:46,309 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -12 predicate places. [2023-09-01 02:17:46,310 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 68 flow [2023-09-01 02:17:46,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-09-01 02:17:46,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:46,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-09-01 02:17:46,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Ended with exit code 0 [2023-09-01 02:17:46,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:46,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:46,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash 48127, now seen corresponding path program 1 times [2023-09-01 02:17:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911788098] [2023-09-01 02:17:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:46,526 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-09-01 02:17:46,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:46,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:46,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:46,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 02:17:46,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:46,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 02:17:46,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 02:17:46,639 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-09-01 02:17:46,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-09-01 02:17:46,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-09-01 02:17:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:46,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:46,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:46,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911788098] [2023-09-01 02:17:46,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911788098] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:46,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:46,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:17:46,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737301722] [2023-09-01 02:17:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:46,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:17:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:17:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:17:46,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 787 [2023-09-01 02:17:46,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-09-01 02:17:46,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:46,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 787 [2023-09-01 02:17:46,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:47,113 INFO L130 PetriNetUnfolder]: 178/296 cut-off events. [2023-09-01 02:17:47,113 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 02:17:47,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 296 events. 178/296 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 948 event pairs, 123 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 597. Up to 296 conditions per place. [2023-09-01 02:17:47,116 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-09-01 02:17:47,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 122 flow [2023-09-01 02:17:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:17:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:17:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 991 transitions. [2023-09-01 02:17:47,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197373994070309 [2023-09-01 02:17:47,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 991 transitions. [2023-09-01 02:17:47,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 991 transitions. [2023-09-01 02:17:47,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:47,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 991 transitions. [2023-09-01 02:17:47,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-09-01 02:17:47,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:47,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:47,134 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 68 flow. Second operand 3 states and 991 transitions. [2023-09-01 02:17:47,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 122 flow [2023-09-01 02:17:47,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:17:47,136 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 65 flow [2023-09-01 02:17:47,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2023-09-01 02:17:47,139 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -13 predicate places. [2023-09-01 02:17:47,139 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 65 flow [2023-09-01 02:17:47,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-09-01 02:17:47,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:47,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-09-01 02:17:47,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-09-01 02:17:47,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:47,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:47,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash 48125, now seen corresponding path program 1 times [2023-09-01 02:17:47,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:47,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751733735] [2023-09-01 02:17:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:47,353 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-09-01 02:17:47,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:47,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:47,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:47,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 02:17:47,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:47,463 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2023-09-01 02:17:47,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 33 [2023-09-01 02:17:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:47,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:47,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751733735] [2023-09-01 02:17:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751733735] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:17:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106685170] [2023-09-01 02:17:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:47,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:17:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:17:47,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:17:47,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 787 [2023-09-01 02:17:47,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 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-09-01 02:17:47,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:47,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 787 [2023-09-01 02:17:47,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:47,774 INFO L130 PetriNetUnfolder]: 126/219 cut-off events. [2023-09-01 02:17:47,775 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 02:17:47,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 219 events. 126/219 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 654 event pairs, 85 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 443. Up to 219 conditions per place. [2023-09-01 02:17:47,776 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-09-01 02:17:47,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 115 flow [2023-09-01 02:17:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:17:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:17:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 980 transitions. [2023-09-01 02:17:47,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41507835662854725 [2023-09-01 02:17:47,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 980 transitions. [2023-09-01 02:17:47,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 980 transitions. [2023-09-01 02:17:47,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:47,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 980 transitions. [2023-09-01 02:17:47,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 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-09-01 02:17:47,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:47,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:47,788 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 65 flow. Second operand 3 states and 980 transitions. [2023-09-01 02:17:47,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 115 flow [2023-09-01 02:17:47,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:17:47,789 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 62 flow [2023-09-01 02:17:47,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2023-09-01 02:17:47,790 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -14 predicate places. [2023-09-01 02:17:47,790 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 62 flow [2023-09-01 02:17:47,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 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-09-01 02:17:47,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:47,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-09-01 02:17:47,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-09-01 02:17:48,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:48,007 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:48,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash 47969, now seen corresponding path program 1 times [2023-09-01 02:17:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:48,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298908069] [2023-09-01 02:17:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:48,008 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-09-01 02:17:48,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:48,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:48,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:48,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2023-09-01 02:17:48,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:48,135 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:17:48,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:17:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:48,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:48,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298908069] [2023-09-01 02:17:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298908069] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:17:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879150867] [2023-09-01 02:17:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:48,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:17:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:17:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:17:48,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 787 [2023-09-01 02:17:48,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-09-01 02:17:48,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:48,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 787 [2023-09-01 02:17:48,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:48,686 INFO L130 PetriNetUnfolder]: 251/436 cut-off events. [2023-09-01 02:17:48,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 02:17:48,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 436 events. 251/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1687 event pairs, 170 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 884. Up to 220 conditions per place. [2023-09-01 02:17:48,689 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 50 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-09-01 02:17:48,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 52 transitions, 220 flow [2023-09-01 02:17:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:17:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:17:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2023-09-01 02:17:48,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290554849639983 [2023-09-01 02:17:48,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1013 transitions. [2023-09-01 02:17:48,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1013 transitions. [2023-09-01 02:17:48,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:48,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1013 transitions. [2023-09-01 02:17:48,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 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-09-01 02:17:48,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:48,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:48,714 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 62 flow. Second operand 3 states and 1013 transitions. [2023-09-01 02:17:48,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 52 transitions, 220 flow [2023-09-01 02:17:48,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 52 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:17:48,716 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 73 flow [2023-09-01 02:17:48,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-09-01 02:17:48,718 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -12 predicate places. [2023-09-01 02:17:48,718 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 73 flow [2023-09-01 02:17:48,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-09-01 02:17:48,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:48,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 02:17:48,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:48,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:48,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:48,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1492321, now seen corresponding path program 1 times [2023-09-01 02:17:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701764029] [2023-09-01 02:17:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:48,930 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-09-01 02:17:48,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:48,931 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:48,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:48,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2023-09-01 02:17:48,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:49,043 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:17:49,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:17:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:49,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:17:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:49,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:49,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701764029] [2023-09-01 02:17:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701764029] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:17:49,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:17:49,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2023-09-01 02:17:49,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663192388] [2023-09-01 02:17:49,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 02:17:49,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 02:17:49,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 02:17:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-09-01 02:17:50,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 787 [2023-09-01 02:17:50,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 73 flow. Second operand has 6 states, 6 states have (on average 316.0) internal successors, (1896), 6 states have internal predecessors, (1896), 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-09-01 02:17:50,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:50,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 787 [2023-09-01 02:17:50,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:50,771 INFO L130 PetriNetUnfolder]: 378/657 cut-off events. [2023-09-01 02:17:50,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 02:17:50,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 657 events. 378/657 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2846 event pairs, 255 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 1340. Up to 219 conditions per place. [2023-09-01 02:17:50,774 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 74 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2023-09-01 02:17:50,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 81 transitions, 355 flow [2023-09-01 02:17:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 02:17:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 02:17:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1974 transitions. [2023-09-01 02:17:50,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41804320203303685 [2023-09-01 02:17:50,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1974 transitions. [2023-09-01 02:17:50,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1974 transitions. [2023-09-01 02:17:50,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:50,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1974 transitions. [2023-09-01 02:17:50,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 329.0) internal successors, (1974), 6 states have internal predecessors, (1974), 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-09-01 02:17:50,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 787.0) internal successors, (5509), 7 states have internal predecessors, (5509), 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-09-01 02:17:50,793 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 787.0) internal successors, (5509), 7 states have internal predecessors, (5509), 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-09-01 02:17:50,793 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 73 flow. Second operand 6 states and 1974 transitions. [2023-09-01 02:17:50,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 81 transitions, 355 flow [2023-09-01 02:17:50,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 81 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:17:50,796 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 125 flow [2023-09-01 02:17:50,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-09-01 02:17:50,796 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-09-01 02:17:50,796 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 125 flow [2023-09-01 02:17:50,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.0) internal successors, (1896), 6 states have internal predecessors, (1896), 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-09-01 02:17:50,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:50,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-09-01 02:17:50,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:51,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:51,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:51,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 46282859, now seen corresponding path program 1 times [2023-09-01 02:17:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:51,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7105353] [2023-09-01 02:17:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:51,005 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-09-01 02:17:51,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:51,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:51,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:51,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-01 02:17:51,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:51,120 INFO L321 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2023-09-01 02:17:51,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 22 [2023-09-01 02:17:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:51,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:51,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7105353] [2023-09-01 02:17:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7105353] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:51,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:17:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190917618] [2023-09-01 02:17:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:51,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:17:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:17:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:17:51,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 787 [2023-09-01 02:17:51,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 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-09-01 02:17:51,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:51,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 787 [2023-09-01 02:17:51,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:51,426 INFO L130 PetriNetUnfolder]: 345/594 cut-off events. [2023-09-01 02:17:51,426 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-09-01 02:17:51,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 594 events. 345/594 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2526 event pairs, 231 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 1234. Up to 594 conditions per place. [2023-09-01 02:17:51,429 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-09-01 02:17:51,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 183 flow [2023-09-01 02:17:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:17:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:17:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2023-09-01 02:17:51,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142312579415502 [2023-09-01 02:17:51,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 978 transitions. [2023-09-01 02:17:51,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 978 transitions. [2023-09-01 02:17:51,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:51,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 978 transitions. [2023-09-01 02:17:51,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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-09-01 02:17:51,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:51,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:51,440 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 125 flow. Second operand 3 states and 978 transitions. [2023-09-01 02:17:51,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 183 flow [2023-09-01 02:17:51,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 173 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-09-01 02:17:51,442 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 113 flow [2023-09-01 02:17:51,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-09-01 02:17:51,443 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2023-09-01 02:17:51,443 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 113 flow [2023-09-01 02:17:51,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 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-09-01 02:17:51,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:51,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-09-01 02:17:51,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-09-01 02:17:51,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:51,654 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:51,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 46282857, now seen corresponding path program 1 times [2023-09-01 02:17:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214311250] [2023-09-01 02:17:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:51,655 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-09-01 02:17:51,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:51,656 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:51,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:51,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 02:17:51,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:51,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 02:17:51,761 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-09-01 02:17:51,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2023-09-01 02:17:51,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-09-01 02:17:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:51,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:51,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:51,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214311250] [2023-09-01 02:17:51,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214311250] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 02:17:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008986375] [2023-09-01 02:17:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:51,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 02:17:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 02:17:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 02:17:51,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 787 [2023-09-01 02:17:51,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 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-09-01 02:17:51,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:51,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 787 [2023-09-01 02:17:51,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:52,136 INFO L130 PetriNetUnfolder]: 312/531 cut-off events. [2023-09-01 02:17:52,136 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-09-01 02:17:52,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 531 events. 312/531 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2186 event pairs, 207 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 1104. Up to 531 conditions per place. [2023-09-01 02:17:52,139 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-09-01 02:17:52,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 167 flow [2023-09-01 02:17:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 02:17:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 02:17:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2023-09-01 02:17:52,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171961033460398 [2023-09-01 02:17:52,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 985 transitions. [2023-09-01 02:17:52,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 985 transitions. [2023-09-01 02:17:52,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:52,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 985 transitions. [2023-09-01 02:17:52,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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-09-01 02:17:52,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:52,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 787.0) internal successors, (3148), 4 states have internal predecessors, (3148), 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-09-01 02:17:52,149 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 113 flow. Second operand 3 states and 985 transitions. [2023-09-01 02:17:52,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 167 flow [2023-09-01 02:17:52,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:17:52,151 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 110 flow [2023-09-01 02:17:52,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-09-01 02:17:52,152 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2023-09-01 02:17:52,152 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 110 flow [2023-09-01 02:17:52,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 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-09-01 02:17:52,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:52,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-09-01 02:17:52,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-09-01 02:17:52,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:52,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:52,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash 46282755, now seen corresponding path program 1 times [2023-09-01 02:17:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:52,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39994746] [2023-09-01 02:17:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:52,367 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-09-01 02:17:52,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:52,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:52,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:52,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-01 02:17:52,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:52,462 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2023-09-01 02:17:52,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2023-09-01 02:17:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:52,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:52,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:52,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39994746] [2023-09-01 02:17:52,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39994746] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:52,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:52,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 02:17:52,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874064367] [2023-09-01 02:17:52,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:52,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 02:17:52,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:52,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 02:17:52,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 02:17:52,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 787 [2023-09-01 02:17:52,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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-09-01 02:17:52,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:52,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 787 [2023-09-01 02:17:52,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:52,848 INFO L130 PetriNetUnfolder]: 213/366 cut-off events. [2023-09-01 02:17:52,848 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-09-01 02:17:52,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 366 events. 213/366 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1316 event pairs, 126 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 771. Up to 359 conditions per place. [2023-09-01 02:17:52,850 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 23 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2023-09-01 02:17:52,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 160 flow [2023-09-01 02:17:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 02:17:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 02:17:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1247 transitions. [2023-09-01 02:17:52,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39612452350698857 [2023-09-01 02:17:52,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1247 transitions. [2023-09-01 02:17:52,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1247 transitions. [2023-09-01 02:17:52,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:52,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1247 transitions. [2023-09-01 02:17:52,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 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-09-01 02:17:52,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 787.0) internal successors, (3935), 5 states have internal predecessors, (3935), 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-09-01 02:17:52,863 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 787.0) internal successors, (3935), 5 states have internal predecessors, (3935), 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-09-01 02:17:52,863 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 110 flow. Second operand 4 states and 1247 transitions. [2023-09-01 02:17:52,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 160 flow [2023-09-01 02:17:52,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 02:17:52,864 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 113 flow [2023-09-01 02:17:52,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-09-01 02:17:52,865 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2023-09-01 02:17:52,865 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 113 flow [2023-09-01 02:17:52,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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-09-01 02:17:52,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:52,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-09-01 02:17:52,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-09-01 02:17:53,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:53,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:53,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:53,070 INFO L85 PathProgramCache]: Analyzing trace with hash 46282756, now seen corresponding path program 1 times [2023-09-01 02:17:53,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:53,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309363334] [2023-09-01 02:17:53,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:53,070 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-09-01 02:17:53,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:53,071 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:53,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:53,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 02:17:53,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:53,187 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:17:53,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:17:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:53,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:53,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:53,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309363334] [2023-09-01 02:17:53,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309363334] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:53,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:53,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 02:17:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706445021] [2023-09-01 02:17:53,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:53,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 02:17:53,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 02:17:53,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 02:17:53,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 787 [2023-09-01 02:17:53,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 316.0) internal successors, (1264), 4 states have internal predecessors, (1264), 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-09-01 02:17:53,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:53,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 787 [2023-09-01 02:17:53,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:53,835 INFO L130 PetriNetUnfolder]: 387/660 cut-off events. [2023-09-01 02:17:53,835 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-09-01 02:17:53,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 660 events. 387/660 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2797 event pairs, 99 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 1376. Up to 406 conditions per place. [2023-09-01 02:17:53,838 INFO L137 encePairwiseOnDemand]: 782/787 looper letters, 36 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2023-09-01 02:17:53,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 230 flow [2023-09-01 02:17:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 02:17:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 02:17:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1297 transitions. [2023-09-01 02:17:53,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41200762388818296 [2023-09-01 02:17:53,842 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1297 transitions. [2023-09-01 02:17:53,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1297 transitions. [2023-09-01 02:17:53,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:53,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1297 transitions. [2023-09-01 02:17:53,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 324.25) internal successors, (1297), 4 states have internal predecessors, (1297), 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-09-01 02:17:53,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 787.0) internal successors, (3935), 5 states have internal predecessors, (3935), 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-09-01 02:17:53,850 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 787.0) internal successors, (3935), 5 states have internal predecessors, (3935), 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-09-01 02:17:53,850 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 113 flow. Second operand 4 states and 1297 transitions. [2023-09-01 02:17:53,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 230 flow [2023-09-01 02:17:53,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 02:17:53,852 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 135 flow [2023-09-01 02:17:53,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-09-01 02:17:53,853 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-09-01 02:17:53,853 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 135 flow [2023-09-01 02:17:53,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 316.0) internal successors, (1264), 4 states have internal predecessors, (1264), 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-09-01 02:17:53,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:53,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 02:17:53,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-09-01 02:17:54,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:54,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:54,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1528187091, now seen corresponding path program 1 times [2023-09-01 02:17:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080686512] [2023-09-01 02:17:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:54,064 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-09-01 02:17:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:54,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:54,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:54,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 02:17:54,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:54,192 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:17:54,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:17:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:54,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:54,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:54,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080686512] [2023-09-01 02:17:54,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080686512] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:54,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 02:17:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491820426] [2023-09-01 02:17:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:54,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 02:17:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:54,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 02:17:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 02:17:54,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 787 [2023-09-01 02:17:54,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 316.5) internal successors, (1266), 4 states have internal predecessors, (1266), 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-09-01 02:17:54,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:54,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 787 [2023-09-01 02:17:54,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:54,955 INFO L130 PetriNetUnfolder]: 597/1014 cut-off events. [2023-09-01 02:17:54,956 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2023-09-01 02:17:54,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 1014 events. 597/1014 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4833 event pairs, 159 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 2341. Up to 598 conditions per place. [2023-09-01 02:17:54,961 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-09-01 02:17:54,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 267 flow [2023-09-01 02:17:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 02:17:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 02:17:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1295 transitions. [2023-09-01 02:17:54,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113722998729352 [2023-09-01 02:17:54,965 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1295 transitions. [2023-09-01 02:17:54,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1295 transitions. [2023-09-01 02:17:54,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:54,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1295 transitions. [2023-09-01 02:17:54,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 323.75) internal successors, (1295), 4 states have internal predecessors, (1295), 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-09-01 02:17:54,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 787.0) internal successors, (3935), 5 states have internal predecessors, (3935), 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-09-01 02:17:54,973 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 787.0) internal successors, (3935), 5 states have internal predecessors, (3935), 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-09-01 02:17:54,973 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 135 flow. Second operand 4 states and 1295 transitions. [2023-09-01 02:17:54,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 267 flow [2023-09-01 02:17:54,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 02:17:54,976 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 148 flow [2023-09-01 02:17:54,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-09-01 02:17:54,978 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-09-01 02:17:54,978 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 148 flow [2023-09-01 02:17:54,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 316.5) internal successors, (1266), 4 states have internal predecessors, (1266), 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-09-01 02:17:54,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:54,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-09-01 02:17:54,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2023-09-01 02:17:55,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:55,189 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:55,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1528328236, now seen corresponding path program 1 times [2023-09-01 02:17:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:55,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821093960] [2023-09-01 02:17:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:17:55,189 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-09-01 02:17:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:55,191 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:55,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-09-01 02:17:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:17:55,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-09-01 02:17:55,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:55,332 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:17:55,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:17:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:55,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 02:17:55,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821093960] [2023-09-01 02:17:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821093960] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 02:17:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 02:17:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 02:17:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282566780] [2023-09-01 02:17:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 02:17:55,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 02:17:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 02:17:55,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 02:17:55,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 787 [2023-09-01 02:17:55,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 310.5) internal successors, (1242), 4 states have internal predecessors, (1242), 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-09-01 02:17:55,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:17:55,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 787 [2023-09-01 02:17:55,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:17:56,154 INFO L130 PetriNetUnfolder]: 408/707 cut-off events. [2023-09-01 02:17:56,154 INFO L131 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2023-09-01 02:17:56,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 707 events. 408/707 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3038 event pairs, 289 based on Foata normal form. 6/573 useless extension candidates. Maximal degree in co-relation 1769. Up to 679 conditions per place. [2023-09-01 02:17:56,158 INFO L137 encePairwiseOnDemand]: 781/787 looper letters, 38 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-09-01 02:17:56,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 266 flow [2023-09-01 02:17:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 02:17:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 02:17:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1272 transitions. [2023-09-01 02:17:56,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4040660736975858 [2023-09-01 02:17:56,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1272 transitions. [2023-09-01 02:17:56,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1272 transitions. [2023-09-01 02:17:56,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:17:56,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1272 transitions. [2023-09-01 02:17:56,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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-09-01 02:17:56,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 787.0) internal successors, (3935), 5 states have internal predecessors, (3935), 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-09-01 02:17:56,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 787.0) internal successors, (3935), 5 states have internal predecessors, (3935), 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-09-01 02:17:56,170 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 148 flow. Second operand 4 states and 1272 transitions. [2023-09-01 02:17:56,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 266 flow [2023-09-01 02:17:56,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 02:17:56,172 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 171 flow [2023-09-01 02:17:56,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-09-01 02:17:56,173 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2023-09-01 02:17:56,173 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 171 flow [2023-09-01 02:17:56,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 310.5) internal successors, (1242), 4 states have internal predecessors, (1242), 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-09-01 02:17:56,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:17:56,174 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-09-01 02:17:56,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-09-01 02:17:56,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:56,384 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:17:56,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:17:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1513306977, now seen corresponding path program 2 times [2023-09-01 02:17:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:17:56,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095460404] [2023-09-01 02:17:56,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:17:56,385 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-09-01 02:17:56,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:17:56,386 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:17:56,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-09-01 02:17:56,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:17:56,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:17:56,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2023-09-01 02:17:56,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:17:56,529 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:17:56,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:17:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:56,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:17:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:17:57,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:17:57,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095460404] [2023-09-01 02:17:57,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095460404] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:17:57,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:17:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-09-01 02:17:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401840775] [2023-09-01 02:17:57,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 02:17:57,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 02:17:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:17:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 02:17:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-09-01 02:18:00,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 787 [2023-09-01 02:18:00,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 171 flow. Second operand has 12 states, 12 states have (on average 317.0) internal successors, (3804), 12 states have internal predecessors, (3804), 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-09-01 02:18:00,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:18:00,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 787 [2023-09-01 02:18:00,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:18:03,981 INFO L130 PetriNetUnfolder]: 1793/3057 cut-off events. [2023-09-01 02:18:03,982 INFO L131 PetriNetUnfolder]: For 1287/1287 co-relation queries the response was YES. [2023-09-01 02:18:03,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 3057 events. 1793/3057 cut-off events. For 1287/1287 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16823 event pairs, 1269 based on Foata normal form. 6/2649 useless extension candidates. Maximal degree in co-relation 8055. Up to 631 conditions per place. [2023-09-01 02:18:03,999 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 202 selfloop transitions, 12 changer transitions 0/214 dead transitions. [2023-09-01 02:18:03,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 214 transitions, 1266 flow [2023-09-01 02:18:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 02:18:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 02:18:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3985 transitions. [2023-09-01 02:18:04,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42196103346039815 [2023-09-01 02:18:04,011 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3985 transitions. [2023-09-01 02:18:04,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3985 transitions. [2023-09-01 02:18:04,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:18:04,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3985 transitions. [2023-09-01 02:18:04,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 332.0833333333333) internal successors, (3985), 12 states have internal predecessors, (3985), 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-09-01 02:18:04,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 787.0) internal successors, (10231), 13 states have internal predecessors, (10231), 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-09-01 02:18:04,049 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 787.0) internal successors, (10231), 13 states have internal predecessors, (10231), 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-09-01 02:18:04,050 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 171 flow. Second operand 12 states and 3985 transitions. [2023-09-01 02:18:04,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 214 transitions, 1266 flow [2023-09-01 02:18:04,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 214 transitions, 1256 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 02:18:04,054 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 264 flow [2023-09-01 02:18:04,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=264, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-09-01 02:18:04,055 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-09-01 02:18:04,055 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 264 flow [2023-09-01 02:18:04,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 317.0) internal successors, (3804), 12 states have internal predecessors, (3804), 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-09-01 02:18:04,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:18:04,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:18:04,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-09-01 02:18:04,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:18:04,266 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:18:04,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:18:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash -317097428, now seen corresponding path program 1 times [2023-09-01 02:18:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:18:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865999918] [2023-09-01 02:18:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:18:04,267 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-09-01 02:18:04,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:18:04,268 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:18:04,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (14)] Waiting until timeout for monitored process [2023-09-01 02:18:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:18:04,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjunts are in the unsatisfiable core [2023-09-01 02:18:04,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:18:04,402 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:18:04,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:18:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 02:18:04,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:18:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 02:18:04,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:18:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865999918] [2023-09-01 02:18:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865999918] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:18:04,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:18:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-09-01 02:18:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148685901] [2023-09-01 02:18:04,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 02:18:04,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:18:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:18:04,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:18:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:18:06,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 787 [2023-09-01 02:18:06,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 38 transitions, 264 flow. Second operand has 10 states, 10 states have (on average 304.4) internal successors, (3044), 10 states have internal predecessors, (3044), 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-09-01 02:18:06,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:18:06,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 787 [2023-09-01 02:18:06,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:18:09,711 INFO L130 PetriNetUnfolder]: 3728/6216 cut-off events. [2023-09-01 02:18:09,711 INFO L131 PetriNetUnfolder]: For 1486/1486 co-relation queries the response was YES. [2023-09-01 02:18:09,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16382 conditions, 6216 events. 3728/6216 cut-off events. For 1486/1486 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 37746 event pairs, 90 based on Foata normal form. 378/5658 useless extension candidates. Maximal degree in co-relation 16353. Up to 1477 conditions per place. [2023-09-01 02:18:09,750 INFO L137 encePairwiseOnDemand]: 778/787 looper letters, 91 selfloop transitions, 21 changer transitions 0/112 dead transitions. [2023-09-01 02:18:09,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 722 flow [2023-09-01 02:18:09,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 02:18:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 02:18:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2823 transitions. [2023-09-01 02:18:09,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39855993223210506 [2023-09-01 02:18:09,758 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2823 transitions. [2023-09-01 02:18:09,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2823 transitions. [2023-09-01 02:18:09,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:18:09,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2823 transitions. [2023-09-01 02:18:09,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 313.6666666666667) internal successors, (2823), 9 states have internal predecessors, (2823), 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-09-01 02:18:09,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 787.0) internal successors, (7870), 10 states have internal predecessors, (7870), 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-09-01 02:18:09,772 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 787.0) internal successors, (7870), 10 states have internal predecessors, (7870), 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-09-01 02:18:09,772 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 264 flow. Second operand 9 states and 2823 transitions. [2023-09-01 02:18:09,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 722 flow [2023-09-01 02:18:09,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 697 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-09-01 02:18:09,776 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 384 flow [2023-09-01 02:18:09,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=384, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2023-09-01 02:18:09,777 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-09-01 02:18:09,777 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 384 flow [2023-09-01 02:18:09,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.4) internal successors, (3044), 10 states have internal predecessors, (3044), 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-09-01 02:18:09,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:18:09,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:18:09,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (14)] Forceful destruction successful, exit code 0 [2023-09-01 02:18:09,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:18:09,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:18:09,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:18:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1244448862, now seen corresponding path program 1 times [2023-09-01 02:18:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:18:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099925802] [2023-09-01 02:18:09,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 02:18:09,990 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-09-01 02:18:09,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:18:09,991 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:18:09,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-09-01 02:18:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 02:18:10,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2023-09-01 02:18:10,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:18:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:18:10,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:18:11,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 02:18:11,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 716 treesize of output 366 [2023-09-01 02:18:11,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 362 [2023-09-01 02:18:11,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 358 [2023-09-01 02:18:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:18:12,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:18:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099925802] [2023-09-01 02:18:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099925802] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:18:12,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:18:12,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-09-01 02:18:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102052383] [2023-09-01 02:18:12,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 02:18:12,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-09-01 02:18:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:18:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-09-01 02:18:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-09-01 02:18:12,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 787 [2023-09-01 02:18:12,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 384 flow. Second operand has 10 states, 10 states have (on average 308.6) internal successors, (3086), 10 states have internal predecessors, (3086), 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-09-01 02:18:12,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:18:12,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 787 [2023-09-01 02:18:12,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:18:13,998 INFO L130 PetriNetUnfolder]: 3538/5930 cut-off events. [2023-09-01 02:18:13,999 INFO L131 PetriNetUnfolder]: For 9726/9726 co-relation queries the response was YES. [2023-09-01 02:18:14,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21377 conditions, 5930 events. 3538/5930 cut-off events. For 9726/9726 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 37379 event pairs, 1332 based on Foata normal form. 88/5146 useless extension candidates. Maximal degree in co-relation 21341. Up to 3489 conditions per place. [2023-09-01 02:18:14,033 INFO L137 encePairwiseOnDemand]: 780/787 looper letters, 116 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2023-09-01 02:18:14,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 129 transitions, 1147 flow [2023-09-01 02:18:14,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 02:18:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 02:18:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3142 transitions. [2023-09-01 02:18:14,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39923761118170265 [2023-09-01 02:18:14,041 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3142 transitions. [2023-09-01 02:18:14,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3142 transitions. [2023-09-01 02:18:14,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:18:14,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3142 transitions. [2023-09-01 02:18:14,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 314.2) internal successors, (3142), 10 states have internal predecessors, (3142), 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-09-01 02:18:14,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 787.0) internal successors, (8657), 11 states have internal predecessors, (8657), 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-09-01 02:18:14,055 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 787.0) internal successors, (8657), 11 states have internal predecessors, (8657), 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-09-01 02:18:14,055 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 384 flow. Second operand 10 states and 3142 transitions. [2023-09-01 02:18:14,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 129 transitions, 1147 flow [2023-09-01 02:18:14,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 1084 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-09-01 02:18:14,071 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 448 flow [2023-09-01 02:18:14,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=448, PETRI_PLACES=81, PETRI_TRANSITIONS=53} [2023-09-01 02:18:14,071 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-09-01 02:18:14,071 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 448 flow [2023-09-01 02:18:14,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 308.6) internal successors, (3086), 10 states have internal predecessors, (3086), 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-09-01 02:18:14,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:18:14,072 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 02:18:14,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-09-01 02:18:14,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:18:14,283 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:18:14,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:18:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -877018718, now seen corresponding path program 2 times [2023-09-01 02:18:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:18:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992806370] [2023-09-01 02:18:14,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 02:18:14,284 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-09-01 02:18:14,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:18:14,285 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:18:14,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (16)] Waiting until timeout for monitored process [2023-09-01 02:18:14,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 02:18:14,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:18:14,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjunts are in the unsatisfiable core [2023-09-01 02:18:14,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:18:14,443 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:18:14,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:18:14,882 INFO L350 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 0 case distinctions, treesize of input 137 treesize of output 57 [2023-09-01 02:18:14,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-09-01 02:18:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:18:14,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:18:15,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 02:18:15,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 716 treesize of output 366 [2023-09-01 02:18:15,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 362 [2023-09-01 02:18:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:18:16,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:18:16,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992806370] [2023-09-01 02:18:16,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992806370] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:18:16,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:18:16,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-09-01 02:18:16,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296586512] [2023-09-01 02:18:16,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 02:18:16,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-09-01 02:18:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:18:16,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-09-01 02:18:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-09-01 02:18:21,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 787 [2023-09-01 02:18:21,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 53 transitions, 448 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 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-09-01 02:18:21,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:18:21,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 787 [2023-09-01 02:18:21,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:18:25,581 INFO L130 PetriNetUnfolder]: 4446/7414 cut-off events. [2023-09-01 02:18:25,581 INFO L131 PetriNetUnfolder]: For 11682/11682 co-relation queries the response was YES. [2023-09-01 02:18:25,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29012 conditions, 7414 events. 4446/7414 cut-off events. For 11682/11682 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 47290 event pairs, 1650 based on Foata normal form. 0/6378 useless extension candidates. Maximal degree in co-relation 28972. Up to 2288 conditions per place. [2023-09-01 02:18:25,630 INFO L137 encePairwiseOnDemand]: 781/787 looper letters, 285 selfloop transitions, 24 changer transitions 0/309 dead transitions. [2023-09-01 02:18:25,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 309 transitions, 2561 flow [2023-09-01 02:18:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-01 02:18:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-09-01 02:18:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4936 transitions. [2023-09-01 02:18:25,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391994917407878 [2023-09-01 02:18:25,643 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4936 transitions. [2023-09-01 02:18:25,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4936 transitions. [2023-09-01 02:18:25,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:18:25,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4936 transitions. [2023-09-01 02:18:25,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 308.5) internal successors, (4936), 16 states have internal predecessors, (4936), 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-09-01 02:18:25,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 787.0) internal successors, (13379), 17 states have internal predecessors, (13379), 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-09-01 02:18:25,666 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 787.0) internal successors, (13379), 17 states have internal predecessors, (13379), 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-09-01 02:18:25,666 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 448 flow. Second operand 16 states and 4936 transitions. [2023-09-01 02:18:25,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 309 transitions, 2561 flow [2023-09-01 02:18:25,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 309 transitions, 2539 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-09-01 02:18:25,695 INFO L231 Difference]: Finished difference. Result has 92 places, 68 transitions, 622 flow [2023-09-01 02:18:25,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=622, PETRI_PLACES=92, PETRI_TRANSITIONS=68} [2023-09-01 02:18:25,696 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-09-01 02:18:25,696 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 68 transitions, 622 flow [2023-09-01 02:18:25,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 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-09-01 02:18:25,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:18:25,697 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 02:18:25,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (16)] Forceful destruction successful, exit code 0 [2023-09-01 02:18:25,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:18:25,908 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:18:25,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:18:25,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1417764173, now seen corresponding path program 3 times [2023-09-01 02:18:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:18:25,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198406403] [2023-09-01 02:18:25,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:18:25,909 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-09-01 02:18:25,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:18:25,910 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:18:25,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-09-01 02:18:26,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 02:18:26,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:18:26,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2023-09-01 02:18:26,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:18:26,118 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:18:26,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:18:26,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 714 treesize of output 320 [2023-09-01 02:18:26,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 02:18:26,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 338 [2023-09-01 02:18:27,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-09-01 02:18:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:18:27,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:18:28,840 INFO L321 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2023-09-01 02:18:28,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1160 treesize of output 565 [2023-09-01 02:18:28,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 565 treesize of output 557 [2023-09-01 02:19:00,191 WARN L222 SmtUtils]: Spent 12.59s on a formula simplification. DAG size of input: 230 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 02:19:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:19:01,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:19:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198406403] [2023-09-01 02:19:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198406403] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:19:01,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:19:01,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-09-01 02:19:01,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364114743] [2023-09-01 02:19:01,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 02:19:01,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 02:19:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:19:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 02:19:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-09-01 02:19:08,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:19:21,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 787 [2023-09-01 02:19:21,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 68 transitions, 622 flow. Second operand has 14 states, 14 states have (on average 283.42857142857144) internal successors, (3968), 14 states have internal predecessors, (3968), 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-09-01 02:19:21,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:19:21,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 787 [2023-09-01 02:19:21,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:19:32,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 02:19:37,998 INFO L130 PetriNetUnfolder]: 3852/6480 cut-off events. [2023-09-01 02:19:37,998 INFO L131 PetriNetUnfolder]: For 14068/14068 co-relation queries the response was YES. [2023-09-01 02:19:38,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26627 conditions, 6480 events. 3852/6480 cut-off events. For 14068/14068 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 41339 event pairs, 957 based on Foata normal form. 132/5734 useless extension candidates. Maximal degree in co-relation 26588. Up to 2599 conditions per place. [2023-09-01 02:19:38,036 INFO L137 encePairwiseOnDemand]: 779/787 looper letters, 242 selfloop transitions, 18 changer transitions 0/260 dead transitions. [2023-09-01 02:19:38,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 260 transitions, 2277 flow [2023-09-01 02:19:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-09-01 02:19:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-09-01 02:19:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4646 transitions. [2023-09-01 02:19:38,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3689644218551461 [2023-09-01 02:19:38,047 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4646 transitions. [2023-09-01 02:19:38,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4646 transitions. [2023-09-01 02:19:38,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:19:38,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4646 transitions. [2023-09-01 02:19:38,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 290.375) internal successors, (4646), 16 states have internal predecessors, (4646), 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-09-01 02:19:38,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 787.0) internal successors, (13379), 17 states have internal predecessors, (13379), 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-09-01 02:19:38,071 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 787.0) internal successors, (13379), 17 states have internal predecessors, (13379), 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-09-01 02:19:38,071 INFO L175 Difference]: Start difference. First operand has 92 places, 68 transitions, 622 flow. Second operand 16 states and 4646 transitions. [2023-09-01 02:19:38,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 260 transitions, 2277 flow [2023-09-01 02:19:38,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 260 transitions, 2199 flow, removed 27 selfloop flow, removed 9 redundant places. [2023-09-01 02:19:38,121 INFO L231 Difference]: Finished difference. Result has 102 places, 66 transitions, 580 flow [2023-09-01 02:19:38,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=580, PETRI_PLACES=102, PETRI_TRANSITIONS=66} [2023-09-01 02:19:38,123 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 58 predicate places. [2023-09-01 02:19:38,123 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 66 transitions, 580 flow [2023-09-01 02:19:38,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 283.42857142857144) internal successors, (3968), 14 states have internal predecessors, (3968), 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-09-01 02:19:38,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:19:38,124 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 02:19:38,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-09-01 02:19:38,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:19:38,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:19:38,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:19:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash -504714061, now seen corresponding path program 4 times [2023-09-01 02:19:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:19:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819228825] [2023-09-01 02:19:38,337 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-01 02:19:38,337 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-09-01 02:19:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:19:38,338 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:19:38,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-09-01 02:19:38,470 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-01 02:19:38,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:19:38,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 23 conjunts are in the unsatisfiable core [2023-09-01 02:19:38,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:19:38,613 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:19:38,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:19:39,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 574 treesize of output 302 [2023-09-01 02:19:39,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-09-01 02:19:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:19:40,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:19:43,245 INFO L321 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2023-09-01 02:19:43,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1196 treesize of output 601 [2023-09-01 02:19:43,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 601 treesize of output 593 [2023-09-01 02:20:31,031 WARN L222 SmtUtils]: Spent 16.27s on a formula simplification. DAG size of input: 221 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 02:20:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:20:33,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:20:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819228825] [2023-09-01 02:20:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819228825] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:20:33,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:20:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-09-01 02:20:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055593371] [2023-09-01 02:20:33,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 02:20:33,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 02:20:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:20:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 02:20:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-09-01 02:21:03,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 787 [2023-09-01 02:21:03,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 66 transitions, 580 flow. Second operand has 16 states, 16 states have (on average 281.375) internal successors, (4502), 16 states have internal predecessors, (4502), 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-09-01 02:21:03,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:21:03,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 787 [2023-09-01 02:21:03,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:21:47,948 INFO L130 PetriNetUnfolder]: 5340/8772 cut-off events. [2023-09-01 02:21:47,949 INFO L131 PetriNetUnfolder]: For 17379/17379 co-relation queries the response was YES. [2023-09-01 02:21:47,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37276 conditions, 8772 events. 5340/8772 cut-off events. For 17379/17379 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 56956 event pairs, 578 based on Foata normal form. 308/8340 useless extension candidates. Maximal degree in co-relation 37236. Up to 1892 conditions per place. [2023-09-01 02:21:47,999 INFO L137 encePairwiseOnDemand]: 779/787 looper letters, 535 selfloop transitions, 54 changer transitions 0/589 dead transitions. [2023-09-01 02:21:48,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 589 transitions, 4933 flow [2023-09-01 02:21:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-09-01 02:21:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-09-01 02:21:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 9282 transitions. [2023-09-01 02:21:48,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3685673443456163 [2023-09-01 02:21:48,017 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 9282 transitions. [2023-09-01 02:21:48,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 9282 transitions. [2023-09-01 02:21:48,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:21:48,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 9282 transitions. [2023-09-01 02:21:48,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 290.0625) internal successors, (9282), 32 states have internal predecessors, (9282), 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-09-01 02:21:48,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 787.0) internal successors, (25971), 33 states have internal predecessors, (25971), 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-09-01 02:21:48,058 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 787.0) internal successors, (25971), 33 states have internal predecessors, (25971), 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-09-01 02:21:48,058 INFO L175 Difference]: Start difference. First operand has 102 places, 66 transitions, 580 flow. Second operand 32 states and 9282 transitions. [2023-09-01 02:21:48,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 589 transitions, 4933 flow [2023-09-01 02:21:48,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 589 transitions, 4911 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-09-01 02:21:48,093 INFO L231 Difference]: Finished difference. Result has 132 places, 98 transitions, 971 flow [2023-09-01 02:21:48,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=971, PETRI_PLACES=132, PETRI_TRANSITIONS=98} [2023-09-01 02:21:48,094 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places. [2023-09-01 02:21:48,094 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 98 transitions, 971 flow [2023-09-01 02:21:48,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 281.375) internal successors, (4502), 16 states have internal predecessors, (4502), 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-09-01 02:21:48,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:21:48,096 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2023-09-01 02:21:48,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-09-01 02:21:48,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:21:48,306 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:21:48,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:21:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash 614923105, now seen corresponding path program 3 times [2023-09-01 02:21:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:21:48,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424374030] [2023-09-01 02:21:48,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 02:21:48,307 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-09-01 02:21:48,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:21:48,308 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:21:48,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (19)] Waiting until timeout for monitored process [2023-09-01 02:21:48,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-09-01 02:21:48,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:21:48,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2023-09-01 02:21:48,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:21:48,666 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:21:48,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:21:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:21:50,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:21:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 02:21:55,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-09-01 02:21:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424374030] [2023-09-01 02:21:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424374030] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 02:21:55,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-09-01 02:21:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-09-01 02:21:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676239679] [2023-09-01 02:21:55,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-09-01 02:21:55,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-09-01 02:21:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-09-01 02:21:55,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-09-01 02:21:55,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-09-01 02:22:45,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 787 [2023-09-01 02:22:45,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 98 transitions, 971 flow. Second operand has 24 states, 24 states have (on average 317.0) internal successors, (7608), 24 states have internal predecessors, (7608), 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-09-01 02:22:45,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 02:22:45,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 787 [2023-09-01 02:22:45,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 02:23:25,570 INFO L130 PetriNetUnfolder]: 10296/17016 cut-off events. [2023-09-01 02:23:25,571 INFO L131 PetriNetUnfolder]: For 53505/53505 co-relation queries the response was YES. [2023-09-01 02:23:25,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80915 conditions, 17016 events. 10296/17016 cut-off events. For 53505/53505 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 112771 event pairs, 6810 based on Foata normal form. 12/15568 useless extension candidates. Maximal degree in co-relation 80869. Up to 3845 conditions per place. [2023-09-01 02:23:25,671 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 716 selfloop transitions, 24 changer transitions 0/740 dead transitions. [2023-09-01 02:23:25,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 740 transitions, 6844 flow [2023-09-01 02:23:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-09-01 02:23:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-09-01 02:23:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 8009 transitions. [2023-09-01 02:23:25,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4240258365099534 [2023-09-01 02:23:25,682 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 8009 transitions. [2023-09-01 02:23:25,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 8009 transitions. [2023-09-01 02:23:25,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 02:23:25,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 8009 transitions. [2023-09-01 02:23:25,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 333.7083333333333) internal successors, (8009), 24 states have internal predecessors, (8009), 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-09-01 02:23:25,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 787.0) internal successors, (19675), 25 states have internal predecessors, (19675), 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-09-01 02:23:25,706 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 787.0) internal successors, (19675), 25 states have internal predecessors, (19675), 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-09-01 02:23:25,706 INFO L175 Difference]: Start difference. First operand has 132 places, 98 transitions, 971 flow. Second operand 24 states and 8009 transitions. [2023-09-01 02:23:25,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 740 transitions, 6844 flow [2023-09-01 02:23:25,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 740 transitions, 6626 flow, removed 32 selfloop flow, removed 14 redundant places. [2023-09-01 02:23:25,981 INFO L231 Difference]: Finished difference. Result has 154 places, 111 transitions, 1036 flow [2023-09-01 02:23:25,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=787, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1036, PETRI_PLACES=154, PETRI_TRANSITIONS=111} [2023-09-01 02:23:25,981 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2023-09-01 02:23:25,981 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 111 transitions, 1036 flow [2023-09-01 02:23:25,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 317.0) internal successors, (7608), 24 states have internal predecessors, (7608), 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-09-01 02:23:25,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 02:23:25,982 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2023-09-01 02:23:25,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (19)] Ended with exit code 0 [2023-09-01 02:23:26,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:23:26,183 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-09-01 02:23:26,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 02:23:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1533745602, now seen corresponding path program 5 times [2023-09-01 02:23:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-09-01 02:23:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918410734] [2023-09-01 02:23:26,184 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-09-01 02:23:26,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-09-01 02:23:26,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-09-01 02:23:26,185 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-01 02:23:26,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (20)] Waiting until timeout for monitored process [2023-09-01 02:23:26,396 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-09-01 02:23:26,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 02:23:26,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2023-09-01 02:23:26,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 02:23:26,622 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-09-01 02:23:26,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-09-01 02:23:29,720 INFO L321 Elim1Store]: treesize reduction 332, result has 0.3 percent of original size [2023-09-01 02:23:29,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 28 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 38 case distinctions, treesize of input 1085 treesize of output 497 [2023-09-01 02:23:31,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-09-01 02:23:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 02:23:31,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 02:23:47,901 INFO L321 Elim1Store]: treesize reduction 440, result has 0.2 percent of original size [2023-09-01 02:23:47,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 2700 treesize of output 1113 [2023-09-01 02:23:47,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1113 treesize of output 1101 [2023-09-01 02:24:55,607 WARN L222 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 18 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-09-01 02:25:36,767 WARN L222 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 18 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-09-01 02:26:38,869 WARN L222 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 18 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-09-01 02:27:57,923 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse423 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse420 (bvadd c_~A~0.offset .cse423 (_ bv12 32))) (.cse422 (select |c_#length| c_~A~0.base)) (.cse419 (bvadd (_ bv8 32) c_~A~0.offset .cse423)) (.cse424 (bvadd (_ bv4 32) c_~A~0.offset .cse423))) (let ((.cse0 (not (bvule (bvadd c_~A~0.offset .cse423) .cse424))) (.cse3 (not (bvule .cse424 .cse419))) (.cse2 ((_ sign_extend 32) c_~bag2~0)) (.cse1 ((_ sign_extend 32) c_~sum2~0)) (.cse5 (not (bvslt (bvadd (_ bv3 32) c_~j~0) c_~N~0))) (.cse6 (not (bvule .cse420 .cse422))) (.cse7 (not (bvslt (bvadd (_ bv2 32) c_~j~0) c_~N~0))) (.cse8 (let ((.cse421 (bvadd (_ bv16 32) c_~A~0.offset .cse423))) (and (bvule .cse420 .cse421) (bvule .cse421 .cse422)))) (.cse20 (not (bvule .cse419 .cse420))) (.cse4 (not (bvslt (bvadd c_~j~0 (_ bv1 32)) c_~N~0))) (.cse127 (not (bvslt c_~j~0 c_~N~0)))) (and (or .cse0 (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse2)))) (let ((.cse14 (bvadd c_~bag2~0 c_~sum2~0))) (let ((.cse61 ((_ sign_extend 32) .cse14))) (and (or .cse3 .cse4 (and (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse13 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse9 (bvadd (_ bv2147483647 32) (bvneg .cse13)))) (or (not (bvsle c_~bag2~0 .cse9)) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse12 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse11 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse10 ((_ sign_extend 32) .cse12))) (or (not (bvsge .cse10 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse11))))) (not (bvsle .cse12 (bvadd (_ bv2147483647 32) (bvneg .cse11)))) (not (bvsle .cse12 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse13 c_~bag2~0 c_~sum2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg .cse10)))))))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse13)) (_ bv18446744071562067968 64)))) (not (bvsle .cse14 .cse9)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse16 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse15 (bvadd (_ bv2147483647 32) (bvneg .cse16)))) (or (not (bvsle c_~bag2~0 .cse15)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse16)) (_ bv18446744071562067968 64)))) (not (bvsle .cse14 .cse15)) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse18 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse17 ((_ sign_extend 32) .cse19))) (or (not (bvsge .cse17 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse18))))) (not (bvsle .cse18 (_ bv0 32))) (not (bvsle .cse19 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse16 c_~bag2~0 c_~sum2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg .cse17))))))))))))) .cse20) (or (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse25 (bvadd (_ bv2147483647 32) (bvneg .cse21)))) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse23 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse24 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse22 (bvadd .cse23 .cse24))) (or (bvsle (bvadd .cse21 c_~bag2~0) .cse22) (not (bvsle .cse23 (bvadd (_ bv2147483647 32) (bvneg .cse24)))) (not (bvsle .cse23 (_ bv0 32))) (bvsle (bvadd .cse21 .cse23) .cse22))))) (not (bvsle c_~bag2~0 .cse25)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse21)) (_ bv18446744071562067968 64)))) (not (bvsle .cse14 .cse25)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse27 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse26 (bvadd (_ bv2147483647 32) (bvneg .cse27)))) (or (not (bvsle c_~bag2~0 .cse26)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse27)) (_ bv18446744071562067968 64)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse29 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse28 (bvadd .cse30 .cse29))) (or (bvsle (bvadd .cse27 c_~bag2~0) .cse28) (not (bvsle .cse29 (_ bv0 32))) (not (bvsle .cse30 (_ bv0 32))) (bvsle (bvadd .cse27 .cse30) .cse28))))) (not (bvsle .cse14 .cse26))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse33 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse31 (bvadd (_ bv2147483647 32) (bvneg .cse33)))) (or (not (bvsle c_~bag2~0 .cse31)) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse32 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse32 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse32 (_ bv0 32))) (not (bvsle .cse33 (bvadd (_ bv2147483647 32) (bvneg .cse32))))))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse33)) (_ bv18446744071562067968 64)))) (not (bvsle .cse14 .cse31)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse35 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse34 (bvadd (_ bv2147483647 32) (bvneg .cse35)))) (or (not (bvsle c_~bag2~0 .cse34)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse35)) (_ bv18446744071562067968 64)))) (not (bvsle .cse14 .cse34)) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse36 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse36 (_ bv0 32))) (not (bvsle .cse35 (bvadd (_ bv2147483647 32) (bvneg .cse36))))))))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse37 (bvadd (_ bv2147483647 32) (bvneg .cse38)))) (or (not (bvsle c_~bag2~0 .cse37)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse38)) (_ bv18446744071562067968 64)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse39 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))))) (or (not (bvsle .cse38 .cse39)) (not (bvsle (bvadd .cse38 c_~bag2~0 c_~sum2~0) .cse39))))) (not (bvsle .cse14 .cse37)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse43 (bvadd (_ bv2147483647 32) (bvneg .cse41)))) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse40 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse42 (bvadd (_ bv2147483647 32) (bvneg .cse40)))) (or (not (bvsle .cse40 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse41 .cse42)) (not (bvsle (bvadd .cse41 c_~bag2~0 c_~sum2~0) .cse42)))))) (not (bvsle c_~bag2~0 .cse43)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse41)) (_ bv18446744071562067968 64)))) (not (bvsle .cse14 .cse43))))))) .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse44 (bvadd (_ bv2147483647 32) (bvneg .cse45)))) (or (not (bvsle c_~bag2~0 .cse44)) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse48 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse47 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse46 (bvadd .cse48 .cse47))) (or (bvsle (bvadd .cse45 c_~bag2~0) .cse46) (not (bvsle .cse47 (_ bv0 32))) (not (bvsle .cse45 (bvadd (_ bv2147483647 32) (bvneg .cse48)))) (bvsle (bvadd .cse45 .cse48) .cse46))))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse45)) (_ bv18446744071562067968 64)))) (not (bvsle .cse14 .cse44)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse50 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse49 (bvadd (_ bv2147483647 32) (bvneg .cse50)))) (or (not (bvsle c_~bag2~0 .cse49)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse50)) (_ bv18446744071562067968 64)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse53 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse51 (bvadd .cse52 .cse53))) (or (bvsle (bvadd .cse50 c_~bag2~0) .cse51) (not (bvsle .cse52 (bvadd (_ bv2147483647 32) (bvneg .cse53)))) (not (bvsle .cse50 (bvadd (_ bv2147483647 32) (bvneg .cse52)))) (bvsle (bvadd .cse50 .cse52) .cse51))))) (not (bvsle .cse14 .cse49))))))) .cse20))) (or .cse3 (and (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse54 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse54)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse54)) (_ bv18446744071562067968 64)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse56 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse55 (bvadd .cse54 .cse56))) (or (bvsle (bvadd .cse54 c_~bag2~0) .cse55) (not (bvsle .cse55 (_ bv0 32))) (not (bvsle .cse55 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse54 (bvadd (_ bv2147483647 32) (bvneg .cse56))))))))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse57)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse57)) (_ bv18446744071562067968 64)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse59 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse58 (bvadd .cse57 .cse59))) (or (not (bvsle .cse14 (bvadd (bvneg .cse58) (_ bv2147483647 32)))) (bvsle (bvadd .cse57 c_~bag2~0) .cse58) (not (bvsle .cse58 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse57 (bvadd (_ bv2147483647 32) (bvneg .cse59)))))))))))) .cse20) (or .cse5 .cse6 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse60 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse60)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse63 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse62 (bvadd .cse60 .cse63))) (or (not (bvsge .cse61 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse62))))) (not (bvsle .cse14 (bvadd (bvneg .cse62) (_ bv2147483647 32)))) (bvsle (bvadd .cse60 c_~bag2~0) .cse62) (not (bvsle .cse63 (_ bv0 32))) (not (bvsle .cse62 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))))))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse60)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse64)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse64)) (_ bv18446744071562067968 64)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse67 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse66 (bvadd .cse64 .cse67))) (let ((.cse65 ((_ sign_extend 32) .cse66)) (.cse68 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse61 (bvadd (_ bv18446744071562067968 64) (bvneg .cse65)))) (bvsle (bvadd .cse64 c_~bag2~0) .cse66) (not (bvsle .cse66 (_ bv0 32))) (not (bvsle .cse67 (_ bv0 32))) (not (bvsge .cse65 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse68))))) (not (bvsle .cse66 (bvadd (_ bv2147483647 32) (bvneg .cse68))))))))))))) .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse69 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse69)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse72 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse70 (bvadd .cse69 c_~bag2~0)) (.cse71 (bvadd .cse69 .cse72)) (.cse73 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (bvsle .cse70 .cse71) (not (bvsle .cse72 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse71) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse73))))) (bvsle .cse70 (bvadd .cse69 .cse72 .cse73)) (not (bvsle .cse71 (bvadd (_ bv2147483647 32) (bvneg .cse73)))))))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse69)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse75 (bvadd .cse74 .cse77)) (.cse76 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (bvsle (bvadd .cse74 c_~bag2~0) .cse75) (not (bvsle .cse76 (_ bv0 32))) (not (bvsle .cse77 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse75) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse76))))))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse74)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse74)) (_ bv18446744071562067968 64)))))))) .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse78 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse78)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse81 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse79 (bvadd .cse78 c_~bag2~0)) (.cse80 (bvadd .cse78 .cse81)) (.cse82 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (bvsle .cse79 .cse80) (bvsle .cse79 (bvadd .cse78 .cse81 .cse82)) (not (bvsle .cse80 (bvadd (_ bv2147483647 32) (bvneg .cse82)))) (not (bvsle .cse78 (bvadd (_ bv2147483647 32) (bvneg .cse81)))))))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse78)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse84 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse83)))) (bvsle (bvadd .cse83 c_~bag2~0) (bvadd .cse83 .cse84)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse83)) (_ bv18446744071562067968 64)))) (not (bvsle .cse83 (bvadd (_ bv2147483647 32) (bvneg .cse84)))))))) .cse20)) .cse4) (or .cse3 .cse4 (and (or .cse5 .cse6 .cse7 .cse8 .cse20) (or (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse85 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse88 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse87 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse86 ((_ sign_extend 32) .cse88))) (or (not (bvsge .cse86 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse87))))) (not (bvsle .cse88 (bvadd (_ bv2147483647 32) (bvneg .cse87)))) (not (bvsle .cse88 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse85 c_~bag2~0 c_~sum2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg .cse86)))))))) (not (bvsge .cse85 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse89 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse89 (_ bv0 32))) (not (bvsge .cse89 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse92 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse91 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse90 ((_ sign_extend 32) .cse92))) (or (not (bvsge .cse90 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse91))))) (not (bvsle .cse91 (_ bv0 32))) (not (bvsle .cse92 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse89 c_~bag2~0 c_~sum2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg .cse90)))))))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse96 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse95 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse93 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse94 (bvadd .cse96 .cse95))) (or (bvsle (bvadd .cse93 c_~bag2~0) .cse94) (not (bvsle .cse93 (_ bv0 32))) (not (bvsle .cse95 (_ bv0 32))) (not (bvsle .cse93 (bvadd (_ bv2147483647 32) (bvneg .cse96)))) (not (bvsge .cse93 (_ bv0 32))) (bvsle (bvadd .cse93 .cse96) .cse94))))) .cse20) (or .cse5 .cse6 .cse7 (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse97 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse98 (bvadd .cse99 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)))) (or (bvsle (bvadd .cse97 c_~bag2~0) .cse98) (not (bvsle .cse97 (_ bv0 32))) (not (bvsle .cse99 (_ bv0 32))) (not (bvsge .cse97 (_ bv0 32))) (bvsle (bvadd .cse97 .cse99) .cse98))))) .cse8 .cse20))) (or .cse3 .cse4 (and (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse101 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse100 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse100 (_ bv0 32))) (bvsle (bvadd .cse100 c_~bag2~0) (bvadd .cse100 .cse101)) (not (bvsle .cse100 (bvadd (_ bv2147483647 32) (bvneg .cse101)))) (not (bvsge .cse100 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse102 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse104 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse103 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (bvsle (bvadd .cse102 c_~bag2~0) (bvadd .cse102 .cse103 .cse104)) (not (bvsle (bvadd .cse102 .cse103) (bvadd (_ bv2147483647 32) (bvneg .cse104)))) (not (bvsle .cse102 (bvadd (_ bv2147483647 32) (bvneg .cse103))))))) (not (bvsle .cse102 (_ bv0 32))) (not (bvsge .cse102 (_ bv0 32))))))) .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse105 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse105 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse107 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse106 (bvadd .cse105 .cse107))) (or (bvsle (bvadd .cse105 c_~bag2~0) .cse106) (not (bvsle .cse106 (_ bv0 32))) (not (bvsle .cse106 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse105 (bvadd (_ bv2147483647 32) (bvneg .cse107)))))))) (not (bvsge .cse105 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse108 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse108 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse110 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse109 (bvadd .cse108 .cse110))) (or (not (bvsle .cse14 (bvadd (bvneg .cse109) (_ bv2147483647 32)))) (bvsle (bvadd .cse108 c_~bag2~0) .cse109) (not (bvsle .cse109 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse108 (bvadd (_ bv2147483647 32) (bvneg .cse110)))))))) (not (bvsge .cse108 (_ bv0 32))))))) .cse20) (or (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse111 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse111 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse113 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse112 (bvadd .cse111 .cse113))) (or (not (bvsge .cse61 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse112))))) (not (bvsle .cse14 (bvadd (bvneg .cse112) (_ bv2147483647 32)))) (bvsle (bvadd .cse111 c_~bag2~0) .cse112) (not (bvsle .cse113 (_ bv0 32))) (not (bvsle .cse112 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))))))) (not (bvsge .cse111 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse114 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse114 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse117 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse116 (bvadd .cse114 .cse117))) (let ((.cse115 ((_ sign_extend 32) .cse116)) (.cse118 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse61 (bvadd (_ bv18446744071562067968 64) (bvneg .cse115)))) (bvsle (bvadd .cse114 c_~bag2~0) .cse116) (not (bvsle .cse117 (_ bv0 32))) (not (bvsge .cse115 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse118))))) (not (bvsle .cse116 (bvadd (_ bv2147483647 32) (bvneg .cse118))))))))) (not (bvsge .cse114 (_ bv0 32))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse119 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse119 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse120 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse121 (bvadd .cse119 .cse120)) (.cse122 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse120 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse121) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse122))))) (bvsle (bvadd .cse119 c_~bag2~0) (bvadd .cse119 .cse120 .cse122)) (not (bvsle .cse121 (bvadd (_ bv2147483647 32) (bvneg .cse122)))))))) (not (bvsge .cse119 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse123 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse126 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse124 (bvadd .cse123 .cse126)) (.cse125 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (bvsle (bvadd .cse123 c_~bag2~0) .cse124) (not (bvsle .cse125 (_ bv0 32))) (not (bvsle .cse126 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse124) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse125))))))))) (not (bvsle .cse123 (_ bv0 32))) (not (bvsge .cse123 (_ bv0 32))))))) .cse20)))))) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32)))) .cse127) (or .cse0 (and (or .cse3 .cse4 (and (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse131 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse130 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse128 (bvadd .cse130 c_~bag2~0))) (let ((.cse129 ((_ sign_extend 32) .cse128))) (or (not (bvsle .cse128 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse129)))) (not (bvsle .cse130 (_ bv0 32))) (bvsle (bvadd .cse130 .cse131 c_~bag2~0) .cse128) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse130)) (_ bv18446744071562067968 64)))) (not (bvsge .cse129 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse131))))) (not (bvsle (bvadd .cse130 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse131))))))))) (not (bvsle .cse131 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse134 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse132 (bvadd .cse134 c_~bag2~0))) (let ((.cse133 ((_ sign_extend 32) .cse132)) (.cse135 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse132 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse133)))) (not (bvsle .cse134 (_ bv0 32))) (bvsle (bvadd .cse134 .cse135 c_~bag2~0) .cse132) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse134)) (_ bv18446744071562067968 64)))) (not (bvsge .cse133 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse135))))) (not (bvsle (bvadd .cse134 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse135))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse137 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse136 (bvadd .cse137 c_~bag2~0)) (.cse138 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse136))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse136) (_ bv2147483647 32)))) (not (bvsle .cse137 (_ bv0 32))) (bvsle (bvadd .cse137 .cse138 c_~bag2~0) .cse136) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse137)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse137 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse138)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse141 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse139 (bvadd .cse140 c_~bag2~0))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse139))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse139) (_ bv2147483647 32)))) (not (bvsle .cse140 (_ bv0 32))) (bvsle (bvadd .cse140 .cse141 c_~bag2~0) .cse139) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse140)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse140 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse141)))))))) (not (bvsle .cse141 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))))))) .cse20) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse142 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse142 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse144 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse143 (bvadd .cse144 c_~bag2~0))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse143))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse143) (_ bv2147483647 32)))) (not (bvsle .cse144 (_ bv0 32))) (bvsle (bvadd .cse144 .cse142 c_~bag2~0) .cse143) (not (bvsge .cse144 (_ bv0 32))) (not (bvsle (bvadd .cse144 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse142))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse146 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse145 (bvadd .cse146 c_~bag2~0)) (.cse147 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse145))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse145) (_ bv2147483647 32)))) (not (bvsle .cse146 (_ bv0 32))) (bvsle (bvadd .cse146 .cse147 c_~bag2~0) .cse145) (not (bvsge .cse146 (_ bv0 32))) (not (bvsle (bvadd .cse146 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse147)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse148 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse148 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse151 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse149 (bvadd .cse151 c_~bag2~0))) (let ((.cse150 ((_ sign_extend 32) .cse149))) (or (not (bvsle .cse149 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse150)))) (not (bvsle .cse151 (_ bv0 32))) (bvsle (bvadd .cse151 .cse148 c_~bag2~0) .cse149) (not (bvsge .cse151 (_ bv0 32))) (not (bvsge .cse150 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse148))))) (not (bvsle (bvadd .cse151 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse148)))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse154 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse152 (bvadd .cse154 c_~bag2~0))) (let ((.cse153 ((_ sign_extend 32) .cse152)) (.cse155 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse152 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse153)))) (not (bvsle .cse154 (_ bv0 32))) (bvsle (bvadd .cse154 .cse155 c_~bag2~0) .cse152) (not (bvsge .cse154 (_ bv0 32))) (not (bvsge .cse153 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse155))))) (not (bvsle (bvadd .cse154 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse155)))))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 (and (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse156 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse159 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse157 (bvadd .cse159 c_~bag2~0)) (.cse161 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse160 (bvadd .cse159 .cse161 c_~bag2~0)) (.cse158 ((_ sign_extend 32) .cse157))) (or (not (bvsle .cse157 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse158)))) (not (bvsle .cse159 (_ bv0 32))) (bvsle .cse160 .cse157) (bvsle .cse160 (bvadd .cse161 .cse156)) (not (bvsge .cse159 (_ bv0 32))) (not (bvsge .cse158 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse161))))))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse165 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse164 (bvadd .cse163 .cse165 c_~bag2~0)) (.cse166 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse162 (bvadd .cse163 c_~bag2~0))) (or (not (bvsle c_~sum2~0 (bvadd (bvneg .cse162) (_ bv2147483647 32)))) (not (bvsle .cse163 (_ bv0 32))) (bvsle .cse164 .cse162) (bvsle .cse164 (bvadd .cse165 .cse166)) (not (bvsle .cse165 (bvadd (_ bv2147483647 32) (bvneg .cse166)))) (not (bvsge .cse163 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse162) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse165))))))))) (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse171 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse170 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse168 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse167 (bvadd .cse168 c_~bag2~0)) (.cse169 (bvadd .cse168 .cse170 c_~bag2~0))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse167))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse167) (_ bv2147483647 32)))) (not (bvsle .cse168 (_ bv0 32))) (bvsle .cse169 .cse167) (bvsle .cse169 (bvadd .cse170 .cse171)) (not (bvsge .cse168 (_ bv0 32))))))) (not (bvsle .cse171 (_ bv0 32))))))) .cse8 .cse20) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse174 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse172 (bvadd .cse174 c_~bag2~0))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse173 ((_ sign_extend 32) .cse172)) (.cse175 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse172 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse173)))) (not (bvsle .cse174 (_ bv0 32))) (bvsle (bvadd .cse174 .cse175 c_~bag2~0) (bvadd .cse175 .cse176)) (not (bvsle .cse175 (bvadd (_ bv2147483647 32) (bvneg .cse176)))) (not (bvsge .cse173 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse175)))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse180 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse178 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse177 (bvadd .cse178 c_~bag2~0)) (.cse179 (bvadd .cse178 .cse180 c_~bag2~0)) (.cse181 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse177))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse177) (_ bv2147483647 32)))) (not (bvsle .cse178 (_ bv0 32))) (bvsle .cse179 .cse177) (bvsle .cse179 (bvadd .cse180 .cse181)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse178)) (_ bv18446744071562067968 64)))) (not (bvsle .cse180 (bvadd (_ bv2147483647 32) (bvneg .cse181)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse185 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse183 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse182 (bvadd .cse183 c_~bag2~0)) (.cse184 (bvadd .cse183 .cse185 c_~bag2~0)) (.cse186 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse182))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse182) (_ bv2147483647 32)))) (not (bvsle .cse183 (_ bv0 32))) (bvsle .cse184 .cse182) (bvsle .cse184 (bvadd .cse185 .cse186)) (not (bvsle .cse186 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse183)) (_ bv18446744071562067968 64)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse189 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse187 (bvadd .cse189 c_~bag2~0)) (.cse191 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse190 (bvadd .cse189 .cse191 c_~bag2~0)) (.cse192 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse188 ((_ sign_extend 32) .cse187))) (or (not (bvsle .cse187 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse188)))) (not (bvsle .cse189 (_ bv0 32))) (bvsle .cse190 .cse187) (bvsle .cse190 (bvadd .cse191 .cse192)) (not (bvsle .cse192 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse189)) (_ bv18446744071562067968 64)))) (not (bvsge .cse188 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse191))))))))))) .cse5 .cse6 .cse7 .cse8 .cse20))) (or .cse3 .cse4 (and (or .cse5 .cse6 .cse7 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse194 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse195 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse193 (bvadd .cse194 .cse195 c_~bag2~0))) (let ((.cse198 (bvadd .cse194 c_~bag2~0)) (.cse197 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse196 ((_ sign_extend 32) .cse193))) (or (not (bvsle .cse193 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse194)))) (not (bvsle .cse195 (_ bv0 32))) (not (bvsge .cse196 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse197))))) (not (bvsge .cse194 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse198) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse195))))) (= (_ bv2147483647 32) .cse198) (not (bvsle .cse193 (bvadd (_ bv2147483647 32) (bvneg .cse197)))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse196))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse200 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse199 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse201 (bvadd .cse199 c_~bag2~0)) (.cse202 (bvadd .cse199 .cse200 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse199)))) (not (bvsle .cse200 (_ bv0 32))) (not (bvsge .cse199 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse201) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse200))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse202)))) (= (_ bv2147483647 32) .cse201) (not (bvsle .cse202 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse202)))))))))) .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 .cse20 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse203 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse204 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse205 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse206 (bvadd .cse203 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse203)))) (not (bvsle .cse204 (_ bv0 32))) (not (bvsle .cse205 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse203 .cse205 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse204))))) (not (bvsge .cse203 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse206) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse205))))) (= (_ bv2147483647 32) .cse206))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse208 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse207 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse211 (bvadd .cse207 c_~bag2~0)) (.cse209 (bvadd .cse207 .cse208 c_~bag2~0)) (.cse210 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse207)))) (not (bvsle .cse208 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse209) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse210))))) (not (bvsge .cse207 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse211) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse208))))) (= (_ bv2147483647 32) (bvadd .cse207 .cse208 c_~bag2~0 .cse210)) (= (_ bv2147483647 32) .cse211) (not (bvsle .cse209 (bvadd (_ bv2147483647 32) (bvneg .cse210)))))))))) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse212 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse213 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse214 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse215 (bvadd .cse212 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse212)))) (not (bvsle .cse213 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse212)) (_ bv18446744071562067968 64)))) (not (bvsle .cse214 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse212 .cse214 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse213))))) (not (bvsge ((_ sign_extend 32) .cse215) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse214))))) (= (_ bv2147483647 32) .cse215))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse217 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse216 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse220 (bvadd .cse216 c_~bag2~0)) (.cse218 (bvadd .cse216 .cse217 c_~bag2~0)) (.cse219 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse216)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse216)) (_ bv18446744071562067968 64)))) (not (bvsle .cse217 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse218) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse219))))) (not (bvsge ((_ sign_extend 32) .cse220) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse217))))) (= (_ bv2147483647 32) (bvadd .cse216 .cse217 c_~bag2~0 .cse219)) (= (_ bv2147483647 32) .cse220) (not (bvsle .cse218 (bvadd (_ bv2147483647 32) (bvneg .cse219))))))))) .cse20) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse222 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse226 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse221 (bvadd .cse222 .cse226 c_~bag2~0))) (let ((.cse225 (bvadd .cse222 c_~bag2~0)) (.cse224 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse223 ((_ sign_extend 32) .cse221))) (or (not (bvsle .cse221 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse222)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse222)) (_ bv18446744071562067968 64)))) (not (bvsge .cse223 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse224))))) (not (bvsle .cse225 (bvadd (_ bv2147483647 32) (bvneg .cse226)))) (not (bvsge ((_ sign_extend 32) .cse225) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse226))))) (not (bvsle .cse221 (bvadd (_ bv2147483647 32) (bvneg .cse224)))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse223))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse230 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse227 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse229 (bvadd .cse227 c_~bag2~0)) (.cse228 (bvadd .cse227 .cse230 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse227)))) (= (_ bv2147483647 32) .cse228) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse227)) (_ bv18446744071562067968 64)))) (not (bvsle .cse229 (bvadd (_ bv2147483647 32) (bvneg .cse230)))) (not (bvsge ((_ sign_extend 32) .cse229) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse230))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse228)))) (not (bvsle .cse228 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse228)))))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse234 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse231 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse233 (bvadd .cse231 c_~bag2~0)) (.cse232 (bvadd .cse231 .cse234 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse231)))) (= (_ bv2147483647 32) .cse232) (not (bvsle .cse233 (bvadd (_ bv2147483647 32) (bvneg .cse234)))) (not (bvsge .cse231 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse233) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse234))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse232)))) (not (bvsle .cse232 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse232))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse236 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse240 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse235 (bvadd .cse236 .cse240 c_~bag2~0))) (let ((.cse239 (bvadd .cse236 c_~bag2~0)) (.cse238 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse237 ((_ sign_extend 32) .cse235))) (or (not (bvsle .cse235 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse236)))) (not (bvsge .cse237 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse238))))) (not (bvsle .cse239 (bvadd (_ bv2147483647 32) (bvneg .cse240)))) (not (bvsge .cse236 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse239) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse240))))) (not (bvsle .cse235 (bvadd (_ bv2147483647 32) (bvneg .cse238)))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse237)))))))))) .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse245 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse241 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse244 (bvadd .cse241 c_~bag2~0)) (.cse242 (bvadd .cse241 .cse245 c_~bag2~0)) (.cse243 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse241)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse241)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse242) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse243))))) (not (bvsle .cse244 (bvadd (_ bv2147483647 32) (bvneg .cse245)))) (not (bvsge ((_ sign_extend 32) .cse244) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse245))))) (= (_ bv2147483647 32) (bvadd .cse241 .cse245 c_~bag2~0 .cse243)) (not (bvsle .cse242 (bvadd (_ bv2147483647 32) (bvneg .cse243)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse246 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse250 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse247 (bvadd .cse246 .cse250 c_~bag2~0)) (.cse248 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse249 (bvadd .cse246 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse246)))) (= (_ bv2147483647 32) .cse247) (not (bvsle .cse248 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse246)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse247) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse248))))) (not (bvsle .cse249 (bvadd (_ bv2147483647 32) (bvneg .cse250)))) (not (bvsge ((_ sign_extend 32) .cse249) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse250)))))))))) .cse20) (or .cse5 .cse6 .cse7 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse252 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse251 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse253 (bvadd .cse251 c_~bag2~0)) (.cse254 (bvadd .cse251 .cse252 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse251)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse251)) (_ bv18446744071562067968 64)))) (not (bvsle .cse252 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse253) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse252))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse254)))) (= (_ bv2147483647 32) .cse253) (not (bvsle .cse254 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse254))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse256 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse257 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse255 (bvadd .cse256 .cse257 c_~bag2~0))) (let ((.cse260 (bvadd .cse256 c_~bag2~0)) (.cse259 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse258 ((_ sign_extend 32) .cse255))) (or (not (bvsle .cse255 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse256)))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse256)) (_ bv18446744071562067968 64)))) (not (bvsle .cse257 (_ bv0 32))) (not (bvsge .cse258 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse259))))) (not (bvsge ((_ sign_extend 32) .cse260) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse257))))) (= (_ bv2147483647 32) .cse260) (not (bvsle .cse255 (bvadd (_ bv2147483647 32) (bvneg .cse259)))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse258)))))))))) .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse265 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse262 (bvadd .cse261 .cse265 c_~bag2~0)) (.cse263 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse264 (bvadd .cse261 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse261)))) (= (_ bv2147483647 32) .cse262) (not (bvsle .cse263 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse262) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse263))))) (not (bvsle .cse264 (bvadd (_ bv2147483647 32) (bvneg .cse265)))) (not (bvsge .cse261 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse264) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse265))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse270 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse266 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse269 (bvadd .cse266 c_~bag2~0)) (.cse267 (bvadd .cse266 .cse270 c_~bag2~0)) (.cse268 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse266)))) (not (bvsge ((_ sign_extend 32) .cse267) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse268))))) (not (bvsle .cse269 (bvadd (_ bv2147483647 32) (bvneg .cse270)))) (not (bvsge .cse266 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse269) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse270))))) (= (_ bv2147483647 32) (bvadd .cse266 .cse270 c_~bag2~0 .cse268)) (not (bvsle .cse267 (bvadd (_ bv2147483647 32) (bvneg .cse268))))))))) .cse20))) (or .cse3 (and (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse273 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse271 (bvadd .cse273 c_~bag2~0)) (.cse275 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse274 (bvadd .cse273 .cse275 c_~bag2~0)) (.cse276 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse272 ((_ sign_extend 32) .cse271))) (or (not (bvsle .cse271 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse272)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse273)))) (bvsle .cse274 .cse271) (bvsle .cse274 (bvadd .cse275 .cse276)) (not (bvsle .cse276 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse273)) (_ bv18446744071562067968 64)))) (not (bvsge .cse272 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse275)))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse280 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse278 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse277 (bvadd .cse278 c_~bag2~0)) (.cse279 (bvadd .cse278 .cse280 c_~bag2~0)) (.cse281 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse277))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse277) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse278)))) (bvsle .cse279 .cse277) (bvsle .cse279 (bvadd .cse280 .cse281)) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse278)) (_ bv18446744071562067968 64)))) (not (bvsle .cse280 (bvadd (_ bv2147483647 32) (bvneg .cse281)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse285 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse283 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse282 (bvadd .cse283 c_~bag2~0)) (.cse284 (bvadd .cse283 .cse285 c_~bag2~0)) (.cse286 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse282))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse282) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse283)))) (bvsle .cse284 .cse282) (bvsle .cse284 (bvadd .cse285 .cse286)) (not (bvsle .cse286 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse283)) (_ bv18446744071562067968 64)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse289 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse287 (bvadd .cse289 c_~bag2~0))) (let ((.cse291 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse288 ((_ sign_extend 32) .cse287)) (.cse290 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse287 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse288)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse289)))) (bvsle (bvadd .cse289 .cse290 c_~bag2~0) (bvadd .cse290 .cse291)) (not (bvsle .cse290 (bvadd (_ bv2147483647 32) (bvneg .cse291)))) (not (bvsge .cse288 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse290))))))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse292 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse292 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse294 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse293 (bvadd .cse294 c_~bag2~0))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse293))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse293) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse294)))) (bvsle (bvadd .cse294 .cse292 c_~bag2~0) .cse293) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse294)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse294 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse292))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse295 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse295 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse298 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse296 (bvadd .cse298 c_~bag2~0))) (let ((.cse297 ((_ sign_extend 32) .cse296))) (or (not (bvsle .cse296 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse297)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse298)))) (bvsle (bvadd .cse298 .cse295 c_~bag2~0) .cse296) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse298)) (_ bv18446744071562067968 64)))) (not (bvsge .cse297 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse295))))) (not (bvsle (bvadd .cse298 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse295)))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse300 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse299 (bvadd .cse300 c_~bag2~0)) (.cse301 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse299))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse299) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse300)))) (bvsle (bvadd .cse300 .cse301 c_~bag2~0) .cse299) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse300)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse300 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse301)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse304 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse302 (bvadd .cse304 c_~bag2~0))) (let ((.cse303 ((_ sign_extend 32) .cse302)) (.cse305 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse302 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse303)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse304)))) (bvsle (bvadd .cse304 .cse305 c_~bag2~0) .cse302) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse304)) (_ bv18446744071562067968 64)))) (not (bvsge .cse303 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse305))))) (not (bvsle (bvadd .cse304 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse305)))))))))) .cse20) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse306 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse306 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse309 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse307 (bvadd .cse309 c_~bag2~0))) (let ((.cse308 ((_ sign_extend 32) .cse307))) (or (not (bvsle .cse307 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse308)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse309)))) (bvsle (bvadd .cse309 .cse306 c_~bag2~0) .cse307) (not (bvsge .cse309 (_ bv0 32))) (not (bvsge .cse308 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse306))))) (not (bvsle (bvadd .cse309 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse306)))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse310 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse310 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse312 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse311 (bvadd .cse312 c_~bag2~0))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse311))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse311) (_ bv2147483647 32)))) (bvsle (bvadd .cse312 .cse310 c_~bag2~0) .cse311) (not (bvsge .cse312 (_ bv0 32))) (not (bvsle (bvadd .cse312 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse310))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse314 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse313 (bvadd .cse314 c_~bag2~0)) (.cse315 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse313))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse313) (_ bv2147483647 32)))) (bvsle (bvadd .cse314 .cse315 c_~bag2~0) .cse313) (not (bvsge .cse314 (_ bv0 32))) (not (bvsle (bvadd .cse314 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse315)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse318 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse316 (bvadd .cse318 c_~bag2~0))) (let ((.cse317 ((_ sign_extend 32) .cse316)) (.cse319 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse316 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse317)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse318)))) (bvsle (bvadd .cse318 .cse319 c_~bag2~0) .cse316) (not (bvsge .cse318 (_ bv0 32))) (not (bvsge .cse317 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse319))))) (not (bvsle (bvadd .cse318 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse319)))))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or (and (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse320 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse320 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse323 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse321 (bvadd .cse323 c_~bag2~0)) (.cse325 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse324 (bvadd .cse323 .cse325 c_~bag2~0)) (.cse322 ((_ sign_extend 32) .cse321))) (or (not (bvsle .cse321 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse322)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse323)))) (bvsle .cse324 .cse321) (bvsle .cse324 (bvadd .cse325 .cse320)) (not (bvsge .cse323 (_ bv0 32))) (not (bvsge .cse322 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse325))))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse329 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse330 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse328 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse326 (bvadd .cse328 c_~bag2~0))) (let ((.cse327 ((_ sign_extend 32) .cse326))) (or (not (bvsle .cse326 (_ bv0 32))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse327)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse328)))) (bvsle (bvadd .cse328 .cse329 c_~bag2~0) (bvadd .cse329 .cse330)) (not (bvsge .cse327 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse329)))))))))) (not (bvsle .cse329 (bvadd (_ bv2147483647 32) (bvneg .cse330))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse332 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse331 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse331 (bvadd (_ bv2147483647 32) (bvneg .cse332)))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse335 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse333 (bvadd .cse335 c_~bag2~0)) (.cse334 (bvadd .cse335 .cse331 c_~bag2~0))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse333))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse333) (_ bv2147483647 32)))) (bvsle .cse334 .cse333) (bvsle .cse334 (bvadd .cse331 .cse332)) (not (bvsge .cse335 (_ bv0 32)))))))))) (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse336 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse336 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse339 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse340 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse337 (bvadd .cse340 c_~bag2~0)) (.cse338 (bvadd .cse340 .cse339 c_~bag2~0))) (or (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse337))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse337) (_ bv2147483647 32)))) (bvsle .cse338 .cse337) (bvsle .cse338 (bvadd .cse339 .cse336)) (not (bvsge .cse340 (_ bv0 32))))))))))) .cse5 .cse6 .cse7 .cse8 .cse20)) .cse4) (or .cse3 (and (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse342 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse346 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse341 (bvadd .cse342 .cse346 c_~bag2~0))) (let ((.cse345 (bvadd .cse342 c_~bag2~0)) (.cse344 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse343 ((_ sign_extend 32) .cse341))) (or (not (bvsle .cse341 (_ bv0 32))) (not (bvsle .cse342 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse342)) (_ bv18446744071562067968 64)))) (not (bvsge .cse343 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse344))))) (not (bvsle .cse345 (bvadd (_ bv2147483647 32) (bvneg .cse346)))) (not (bvsge ((_ sign_extend 32) .cse345) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse346))))) (not (bvsle .cse341 (bvadd (_ bv2147483647 32) (bvneg .cse344)))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse343))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse350 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse347 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse349 (bvadd .cse347 c_~bag2~0)) (.cse348 (bvadd .cse347 .cse350 c_~bag2~0))) (or (not (bvsle .cse347 (_ bv0 32))) (= (_ bv2147483647 32) .cse348) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse347)) (_ bv18446744071562067968 64)))) (not (bvsle .cse349 (bvadd (_ bv2147483647 32) (bvneg .cse350)))) (not (bvsge ((_ sign_extend 32) .cse349) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse350))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse348)))) (not (bvsle .cse348 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse348)))))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse352 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse353 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse351 (bvadd .cse352 .cse353 c_~bag2~0))) (let ((.cse356 (bvadd .cse352 c_~bag2~0)) (.cse355 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse354 ((_ sign_extend 32) .cse351))) (or (not (bvsle .cse351 (_ bv0 32))) (not (bvsle .cse352 (_ bv0 32))) (not (bvsle .cse353 (_ bv0 32))) (not (bvsge .cse354 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse355))))) (not (bvsge .cse352 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse356) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse353))))) (= (_ bv2147483647 32) .cse356) (not (bvsle .cse351 (bvadd (_ bv2147483647 32) (bvneg .cse355)))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse354))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse358 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse357 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse359 (bvadd .cse357 c_~bag2~0)) (.cse360 (bvadd .cse357 .cse358 c_~bag2~0))) (or (not (bvsle .cse357 (_ bv0 32))) (not (bvsle .cse358 (_ bv0 32))) (not (bvsge .cse357 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse359) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse358))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse360)))) (= (_ bv2147483647 32) .cse359) (not (bvsle .cse360 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse360)))))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse361 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse362 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse363 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse364 (bvadd .cse361 c_~bag2~0))) (or (not (bvsle .cse361 (_ bv0 32))) (not (bvsle .cse362 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse361)) (_ bv18446744071562067968 64)))) (not (bvsle .cse363 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse361 .cse363 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse362))))) (not (bvsge ((_ sign_extend 32) .cse364) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse363))))) (= (_ bv2147483647 32) .cse364))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse366 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse365 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse369 (bvadd .cse365 c_~bag2~0)) (.cse367 (bvadd .cse365 .cse366 c_~bag2~0)) (.cse368 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse365 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse365)) (_ bv18446744071562067968 64)))) (not (bvsle .cse366 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse367) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse368))))) (not (bvsge ((_ sign_extend 32) .cse369) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse366))))) (= (_ bv2147483647 32) (bvadd .cse365 .cse366 c_~bag2~0 .cse368)) (= (_ bv2147483647 32) .cse369) (not (bvsle .cse367 (bvadd (_ bv2147483647 32) (bvneg .cse368))))))))) .cse8 .cse20) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse371 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse370 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse372 (bvadd .cse370 c_~bag2~0)) (.cse373 (bvadd .cse370 .cse371 c_~bag2~0))) (or (not (bvsle .cse370 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse370)) (_ bv18446744071562067968 64)))) (not (bvsle .cse371 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse372) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse371))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse373)))) (= (_ bv2147483647 32) .cse372) (not (bvsle .cse373 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse373))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse375 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse376 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse374 (bvadd .cse375 .cse376 c_~bag2~0))) (let ((.cse379 (bvadd .cse375 c_~bag2~0)) (.cse378 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse377 ((_ sign_extend 32) .cse374))) (or (not (bvsle .cse374 (_ bv0 32))) (not (bvsle .cse375 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse375)) (_ bv18446744071562067968 64)))) (not (bvsle .cse376 (_ bv0 32))) (not (bvsge .cse377 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse378))))) (not (bvsge ((_ sign_extend 32) .cse379) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse376))))) (= (_ bv2147483647 32) .cse379) (not (bvsle .cse374 (bvadd (_ bv2147483647 32) (bvneg .cse378)))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse377)))))))))) .cse5 .cse6 .cse7 .cse8 .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse380 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse384 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse381 (bvadd .cse380 .cse384 c_~bag2~0)) (.cse382 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse383 (bvadd .cse380 c_~bag2~0))) (or (not (bvsle .cse380 (_ bv0 32))) (= (_ bv2147483647 32) .cse381) (not (bvsle .cse382 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse381) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse382))))) (not (bvsle .cse383 (bvadd (_ bv2147483647 32) (bvneg .cse384)))) (not (bvsge .cse380 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse383) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse384))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse389 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse385 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse388 (bvadd .cse385 c_~bag2~0)) (.cse386 (bvadd .cse385 .cse389 c_~bag2~0)) (.cse387 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse385 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse386) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse387))))) (not (bvsle .cse388 (bvadd (_ bv2147483647 32) (bvneg .cse389)))) (not (bvsge .cse385 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse388) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse389))))) (= (_ bv2147483647 32) (bvadd .cse385 .cse389 c_~bag2~0 .cse387)) (not (bvsle .cse386 (bvadd (_ bv2147483647 32) (bvneg .cse387))))))))) .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse394 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse390 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse393 (bvadd .cse390 c_~bag2~0)) (.cse391 (bvadd .cse390 .cse394 c_~bag2~0)) (.cse392 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse390 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse390)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse391) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse392))))) (not (bvsle .cse393 (bvadd (_ bv2147483647 32) (bvneg .cse394)))) (not (bvsge ((_ sign_extend 32) .cse393) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse394))))) (= (_ bv2147483647 32) (bvadd .cse390 .cse394 c_~bag2~0 .cse392)) (not (bvsle .cse391 (bvadd (_ bv2147483647 32) (bvneg .cse392)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse395 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse399 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse396 (bvadd .cse395 .cse399 c_~bag2~0)) (.cse397 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse398 (bvadd .cse395 c_~bag2~0))) (or (not (bvsle .cse395 (_ bv0 32))) (= (_ bv2147483647 32) .cse396) (not (bvsle .cse397 (_ bv0 32))) (not (bvsge .cse2 (bvadd (bvneg ((_ sign_extend 32) .cse395)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse396) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse397))))) (not (bvsle .cse398 (bvadd (_ bv2147483647 32) (bvneg .cse399)))) (not (bvsge ((_ sign_extend 32) .cse398) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse399)))))))))) .cse20) (or .cse5 .cse6 .cse7 .cse8 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse401 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse405 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse400 (bvadd .cse401 .cse405 c_~bag2~0))) (let ((.cse404 (bvadd .cse401 c_~bag2~0)) (.cse403 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse402 ((_ sign_extend 32) .cse400))) (or (not (bvsle .cse400 (_ bv0 32))) (not (bvsle .cse401 (_ bv0 32))) (not (bvsge .cse402 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse403))))) (not (bvsle .cse404 (bvadd (_ bv2147483647 32) (bvneg .cse405)))) (not (bvsge .cse401 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse404) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse405))))) (not (bvsle .cse400 (bvadd (_ bv2147483647 32) (bvneg .cse403)))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg .cse402))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse409 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse406 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse408 (bvadd .cse406 c_~bag2~0)) (.cse407 (bvadd .cse406 .cse409 c_~bag2~0))) (or (not (bvsle .cse406 (_ bv0 32))) (= (_ bv2147483647 32) .cse407) (not (bvsle .cse408 (bvadd (_ bv2147483647 32) (bvneg .cse409)))) (not (bvsge .cse406 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse408) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse409))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse407)))) (not (bvsle .cse407 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse1 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse407)))))))))) .cse20) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse410 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse411 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse412 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse413 (bvadd .cse410 c_~bag2~0))) (or (not (bvsle .cse410 (_ bv0 32))) (not (bvsle .cse411 (_ bv0 32))) (not (bvsle .cse412 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse410 .cse412 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse411))))) (not (bvsge .cse410 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse413) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse412))))) (= (_ bv2147483647 32) .cse413))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse415 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse414 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse418 (bvadd .cse414 c_~bag2~0)) (.cse416 (bvadd .cse414 .cse415 c_~bag2~0)) (.cse417 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse414 (_ bv0 32))) (not (bvsle .cse415 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse416) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse417))))) (not (bvsge .cse414 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse418) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse415))))) (= (_ bv2147483647 32) (bvadd .cse414 .cse415 c_~bag2~0 .cse417)) (= (_ bv2147483647 32) .cse418) (not (bvsle .cse416 (bvadd (_ bv2147483647 32) (bvneg .cse417))))))))) .cse5 .cse6 .cse7 .cse8 .cse20)) .cse4)) .cse127))))) is different from true [2023-09-01 02:29:54,149 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse273 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse270 (bvadd c_~A~0.offset .cse273 (_ bv12 32))) (.cse272 (select |c_#length| c_~A~0.base)) (.cse274 (bvadd (_ bv4 32) c_~A~0.offset .cse273)) (.cse269 (bvadd (_ bv8 32) c_~A~0.offset .cse273))) (let ((.cse1 (not (bvule .cse274 .cse269))) (.cse0 (not (bvule (bvadd c_~A~0.offset .cse273) .cse274))) (.cse2 (not (bvslt (bvadd c_~j~0 (_ bv1 32)) c_~N~0))) (.cse3 (not (bvslt (bvadd (_ bv3 32) c_~j~0) c_~N~0))) (.cse4 (not (bvule .cse270 .cse272))) (.cse5 (not (bvslt (bvadd (_ bv2 32) c_~j~0) c_~N~0))) (.cse20 (let ((.cse271 (bvadd (_ bv16 32) c_~A~0.offset .cse273))) (and (bvule .cse270 .cse271) (bvule .cse271 .cse272)))) (.cse7 ((_ sign_extend 32) c_~sum2~0)) (.cse10 ((_ sign_extend 32) c_~bag2~0)) (.cse268 (not (bvslt c_~j~0 c_~N~0))) (.cse21 (not (bvule .cse269 .cse270)))) (and (or .cse0 (and (or .cse1 .cse2 (and (or .cse3 .cse4 .cse5 (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse8 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse6 (bvadd .cse8 c_~bag2~0)) (.cse9 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse6 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse6))))) (not (bvsle .cse8 (_ bv0 32))) (bvsle (bvadd .cse8 .cse9 c_~bag2~0) .cse6) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse8)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse8 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse9)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse13 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse12 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse11 (bvadd .cse12 c_~bag2~0))) (or (not (bvsle .cse11 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse11))))) (not (bvsle .cse12 (_ bv0 32))) (bvsle (bvadd .cse12 .cse13 c_~bag2~0) .cse11) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse12)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse12 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse13)))))))) (not (bvsle .cse13 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse14 (bvadd .cse15 c_~bag2~0)) (.cse16 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse14))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse14) (_ bv2147483647 32)))) (not (bvsle .cse15 (_ bv0 32))) (bvsle (bvadd .cse15 .cse16 c_~bag2~0) .cse14) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse15)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse15 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse16)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse18 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse17 (bvadd .cse18 c_~bag2~0))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse17))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse17) (_ bv2147483647 32)))) (not (bvsle .cse18 (_ bv0 32))) (bvsle (bvadd .cse18 .cse19 c_~bag2~0) .cse17) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse18)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse18 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse19)))))))) (not (bvsle .cse19 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))))))) .cse20 .cse21) (or .cse3 .cse4 .cse5 .cse20 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse25 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse23 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse22 (bvadd .cse23 c_~bag2~0)) (.cse24 (bvadd .cse23 .cse25 c_~bag2~0)) (.cse26 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse22))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse22) (_ bv2147483647 32)))) (not (bvsle .cse23 (_ bv0 32))) (bvsle .cse24 .cse22) (bvsle .cse24 (bvadd .cse25 .cse26)) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse23)) (_ bv18446744071562067968 64)))) (not (bvsle .cse25 (bvadd (_ bv2147483647 32) (bvneg .cse26)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse27 (bvadd .cse28 c_~bag2~0)) (.cse29 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse27 (_ bv0 32))) (not (bvsle .cse28 (_ bv0 32))) (bvsle (bvadd .cse28 .cse29 c_~bag2~0) (bvadd .cse29 .cse30)) (not (bvsle .cse29 (bvadd (_ bv2147483647 32) (bvneg .cse30)))) (not (bvsge ((_ sign_extend 32) .cse27) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse29))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse34 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse32 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse31 (bvadd .cse32 c_~bag2~0)) (.cse33 (bvadd .cse32 .cse34 c_~bag2~0)) (.cse35 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse31))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse31) (_ bv2147483647 32)))) (not (bvsle .cse32 (_ bv0 32))) (bvsle .cse33 .cse31) (bvsle .cse33 (bvadd .cse34 .cse35)) (not (bvsle .cse35 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse32)) (_ bv18446744071562067968 64)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse36 (bvadd .cse38 c_~bag2~0)) (.cse40 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse39 (bvadd .cse38 .cse40 c_~bag2~0)) (.cse41 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse37 ((_ sign_extend 32) .cse36))) (or (not (bvsle .cse36 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse37)))) (not (bvsle .cse38 (_ bv0 32))) (bvsle .cse39 .cse36) (bvsle .cse39 (bvadd .cse40 .cse41)) (not (bvsle .cse41 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse38)) (_ bv18446744071562067968 64)))) (not (bvsge .cse37 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse40))))))))))) .cse21))) (or .cse1 .cse2 (and (or .cse3 .cse4 .cse5 .cse20 .cse21 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse42 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse43 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse44 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse45 (bvadd .cse42 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse42)))) (not (bvsle .cse43 (_ bv0 32))) (not (bvsle .cse44 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse42 .cse44 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse43))))) (not (bvsge .cse42 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse45) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse44))))) (= (_ bv2147483647 32) .cse45))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse47 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse46 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse50 (bvadd .cse46 c_~bag2~0)) (.cse48 (bvadd .cse46 .cse47 c_~bag2~0)) (.cse49 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse46)))) (not (bvsle .cse47 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse48) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse49))))) (not (bvsge .cse46 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse50) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse47))))) (= (_ bv2147483647 32) (bvadd .cse46 .cse47 c_~bag2~0 .cse49)) (= (_ bv2147483647 32) .cse50) (not (bvsle .cse48 (bvadd (_ bv2147483647 32) (bvneg .cse49)))))))))) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse53 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse51 (bvadd .cse52 .cse53 c_~bag2~0))) (let ((.cse56 (bvadd .cse52 c_~bag2~0)) (.cse55 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse54 ((_ sign_extend 32) .cse51))) (or (not (bvsle .cse51 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse52)))) (not (bvsle .cse53 (_ bv0 32))) (not (bvsge .cse54 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse55))))) (not (bvsge .cse52 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse56) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse53))))) (= (_ bv2147483647 32) .cse56) (not (bvsle .cse51 (bvadd (_ bv2147483647 32) (bvneg .cse55)))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse54))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse58 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse59 (bvadd .cse58 c_~bag2~0)) (.cse60 (bvadd .cse58 .cse57 c_~bag2~0))) (or (not (bvsle .cse57 (_ bv0 32))) (not (bvsge .cse58 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse59) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse57))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse60)))) (= (_ bv2147483647 32) .cse59) (not (bvsle .cse60 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse60)))))))))) .cse3 .cse4 .cse5 .cse20 .cse21) (or .cse3 .cse4 .cse5 .cse20 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse61 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse63 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse64 (bvadd .cse61 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse61)))) (not (bvsle .cse62 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse61)) (_ bv18446744071562067968 64)))) (not (bvsle .cse63 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse61 .cse63 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse62))))) (not (bvsge ((_ sign_extend 32) .cse64) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse63))))) (= (_ bv2147483647 32) .cse64))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse66 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse65 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse69 (bvadd .cse65 c_~bag2~0)) (.cse67 (bvadd .cse65 .cse66 c_~bag2~0)) (.cse68 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse65)))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse65)) (_ bv18446744071562067968 64)))) (not (bvsle .cse66 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse67) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse68))))) (not (bvsge ((_ sign_extend 32) .cse69) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse66))))) (= (_ bv2147483647 32) (bvadd .cse65 .cse66 c_~bag2~0 .cse68)) (= (_ bv2147483647 32) .cse69) (not (bvsle .cse67 (bvadd (_ bv2147483647 32) (bvneg .cse68))))))))) .cse21) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse71 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse75 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse70 (bvadd .cse71 .cse75 c_~bag2~0))) (let ((.cse74 (bvadd .cse71 c_~bag2~0)) (.cse73 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse72 ((_ sign_extend 32) .cse70))) (or (not (bvsle .cse70 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse71)))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse71)) (_ bv18446744071562067968 64)))) (not (bvsge .cse72 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse73))))) (not (bvsle .cse74 (bvadd (_ bv2147483647 32) (bvneg .cse75)))) (not (bvsge ((_ sign_extend 32) .cse74) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse75))))) (not (bvsle .cse70 (bvadd (_ bv2147483647 32) (bvneg .cse73)))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse72))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse76 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse78 (bvadd .cse76 c_~bag2~0)) (.cse77 (bvadd .cse76 .cse79 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse76)))) (= (_ bv2147483647 32) .cse77) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse76)) (_ bv18446744071562067968 64)))) (not (bvsle .cse78 (bvadd (_ bv2147483647 32) (bvneg .cse79)))) (not (bvsge ((_ sign_extend 32) .cse78) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse79))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse77)))) (not (bvsle .cse77 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse77)))))))))) .cse3 .cse4 .cse5 .cse20 .cse21) (or .cse3 .cse4 .cse5 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse80 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse82 (bvadd .cse80 c_~bag2~0)) (.cse81 (bvadd .cse80 .cse83 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse80)))) (= (_ bv2147483647 32) .cse81) (not (bvsle .cse82 (bvadd (_ bv2147483647 32) (bvneg .cse83)))) (not (bvsge .cse80 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse82) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse83))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse81)))) (not (bvsle .cse81 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse81))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse89 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse84 (bvadd .cse85 .cse89 c_~bag2~0))) (let ((.cse88 (bvadd .cse85 c_~bag2~0)) (.cse87 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse86 ((_ sign_extend 32) .cse84))) (or (not (bvsle .cse84 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse85)))) (not (bvsge .cse86 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse87))))) (not (bvsle .cse88 (bvadd (_ bv2147483647 32) (bvneg .cse89)))) (not (bvsge .cse85 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse88) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse89))))) (not (bvsle .cse84 (bvadd (_ bv2147483647 32) (bvneg .cse87)))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse86)))))))))) .cse20 .cse21) (or .cse3 .cse4 .cse5 .cse20 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse94 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse90 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse93 (bvadd .cse90 c_~bag2~0)) (.cse91 (bvadd .cse90 .cse94 c_~bag2~0)) (.cse92 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse90)))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse90)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse91) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse92))))) (not (bvsle .cse93 (bvadd (_ bv2147483647 32) (bvneg .cse94)))) (not (bvsge ((_ sign_extend 32) .cse93) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse94))))) (= (_ bv2147483647 32) (bvadd .cse90 .cse94 c_~bag2~0 .cse92)) (not (bvsle .cse91 (bvadd (_ bv2147483647 32) (bvneg .cse92)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse95 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse99 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse96 (bvadd .cse95 .cse99 c_~bag2~0)) (.cse97 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse98 (bvadd .cse95 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse95)))) (= (_ bv2147483647 32) .cse96) (not (bvsle .cse97 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse95)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse96) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse97))))) (not (bvsle .cse98 (bvadd (_ bv2147483647 32) (bvneg .cse99)))) (not (bvsge ((_ sign_extend 32) .cse98) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse99)))))))))) .cse21) (or .cse3 .cse4 .cse5 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse101 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse100 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse102 (bvadd .cse100 c_~bag2~0)) (.cse103 (bvadd .cse100 .cse101 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse100)))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse100)) (_ bv18446744071562067968 64)))) (not (bvsle .cse101 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse102) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse101))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse103)))) (= (_ bv2147483647 32) .cse102) (not (bvsle .cse103 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse103))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse105 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse106 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse104 (bvadd .cse105 .cse106 c_~bag2~0))) (let ((.cse109 (bvadd .cse105 c_~bag2~0)) (.cse108 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse107 ((_ sign_extend 32) .cse104))) (or (not (bvsle .cse104 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse105)))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse105)) (_ bv18446744071562067968 64)))) (not (bvsle .cse106 (_ bv0 32))) (not (bvsge .cse107 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse108))))) (not (bvsge ((_ sign_extend 32) .cse109) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse106))))) (= (_ bv2147483647 32) .cse109) (not (bvsle .cse104 (bvadd (_ bv2147483647 32) (bvneg .cse108)))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse107)))))))))) .cse20 .cse21) (or .cse3 .cse4 .cse5 .cse20 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse110 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse114 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse111 (bvadd .cse110 .cse114 c_~bag2~0)) (.cse112 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse113 (bvadd .cse110 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse110)))) (= (_ bv2147483647 32) .cse111) (not (bvsle .cse112 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse111) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse112))))) (not (bvsle .cse113 (bvadd (_ bv2147483647 32) (bvneg .cse114)))) (not (bvsge .cse110 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse113) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse114))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse119 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse115 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse118 (bvadd .cse115 c_~bag2~0)) (.cse116 (bvadd .cse115 .cse119 c_~bag2~0)) (.cse117 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse115)))) (not (bvsge ((_ sign_extend 32) .cse116) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse117))))) (not (bvsle .cse118 (bvadd (_ bv2147483647 32) (bvneg .cse119)))) (not (bvsge .cse115 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse118) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse119))))) (= (_ bv2147483647 32) (bvadd .cse115 .cse119 c_~bag2~0 .cse117)) (not (bvsle .cse116 (bvadd (_ bv2147483647 32) (bvneg .cse117))))))))) .cse21))) (or .cse1 (and (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse122 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse120 (bvadd .cse122 c_~bag2~0)) (.cse124 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse123 (bvadd .cse122 .cse124 c_~bag2~0)) (.cse125 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse121 ((_ sign_extend 32) .cse120))) (or (not (bvsle .cse120 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse121)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse122)))) (bvsle .cse123 .cse120) (bvsle .cse123 (bvadd .cse124 .cse125)) (not (bvsle .cse125 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse122)) (_ bv18446744071562067968 64)))) (not (bvsge .cse121 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse124)))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse129 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse127 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse126 (bvadd .cse127 c_~bag2~0)) (.cse128 (bvadd .cse127 .cse129 c_~bag2~0)) (.cse130 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse126))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse126) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse127)))) (bvsle .cse128 .cse126) (bvsle .cse128 (bvadd .cse129 .cse130)) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse127)) (_ bv18446744071562067968 64)))) (not (bvsle .cse129 (bvadd (_ bv2147483647 32) (bvneg .cse130)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse134 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse132 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse131 (bvadd .cse132 c_~bag2~0)) (.cse133 (bvadd .cse132 .cse134 c_~bag2~0)) (.cse135 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse131))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse131) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse132)))) (bvsle .cse133 .cse131) (bvsle .cse133 (bvadd .cse134 .cse135)) (not (bvsle .cse135 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse132)) (_ bv18446744071562067968 64)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse138 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse136 (bvadd .cse138 c_~bag2~0))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse137 ((_ sign_extend 32) .cse136)) (.cse139 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse136 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse137)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse138)))) (bvsle (bvadd .cse138 .cse139 c_~bag2~0) (bvadd .cse139 .cse140)) (not (bvsle .cse139 (bvadd (_ bv2147483647 32) (bvneg .cse140)))) (not (bvsge .cse137 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse139))))))))))) .cse3 .cse4 .cse5 .cse20 .cse21) (or .cse3 .cse4 .cse5 .cse20 (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse141 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse141 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse143 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse142 (bvadd .cse143 c_~bag2~0))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse142))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse142) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse143)))) (bvsle (bvadd .cse143 .cse141 c_~bag2~0) .cse142) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse143)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse143 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse141))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse144 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse144 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse145 (bvadd .cse147 c_~bag2~0))) (let ((.cse146 ((_ sign_extend 32) .cse145))) (or (not (bvsle .cse145 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse146)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse147)))) (bvsle (bvadd .cse147 .cse144 c_~bag2~0) .cse145) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse147)) (_ bv18446744071562067968 64)))) (not (bvsge .cse146 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse144))))) (not (bvsle (bvadd .cse147 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse144)))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse149 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse148 (bvadd .cse149 c_~bag2~0)) (.cse150 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse148))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse148) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse149)))) (bvsle (bvadd .cse149 .cse150 c_~bag2~0) .cse148) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse149)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse149 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse150)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse153 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse151 (bvadd .cse153 c_~bag2~0))) (let ((.cse152 ((_ sign_extend 32) .cse151)) (.cse154 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse151 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse152)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse153)))) (bvsle (bvadd .cse153 .cse154 c_~bag2~0) .cse151) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse153)) (_ bv18446744071562067968 64)))) (not (bvsge .cse152 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse154))))) (not (bvsle (bvadd .cse153 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse154)))))))))) .cse21) (or (and (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse155 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse155 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse156 (bvadd .cse158 c_~bag2~0))) (let ((.cse157 ((_ sign_extend 32) .cse156))) (or (not (bvsle .cse156 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse157)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse158)))) (bvsle (bvadd .cse158 .cse155 c_~bag2~0) .cse156) (not (bvsge .cse158 (_ bv0 32))) (not (bvsge .cse157 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse155))))) (not (bvsle (bvadd .cse158 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse155)))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse159 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse159 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse161 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse160 (bvadd .cse161 c_~bag2~0))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse160))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse160) (_ bv2147483647 32)))) (bvsle (bvadd .cse161 .cse159 c_~bag2~0) .cse160) (not (bvsge .cse161 (_ bv0 32))) (not (bvsle (bvadd .cse161 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse159))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse162 (bvadd .cse163 c_~bag2~0)) (.cse164 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse162))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse162) (_ bv2147483647 32)))) (bvsle (bvadd .cse163 .cse164 c_~bag2~0) .cse162) (not (bvsge .cse163 (_ bv0 32))) (not (bvsle (bvadd .cse163 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse164)))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse167 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse165 (bvadd .cse167 c_~bag2~0))) (let ((.cse166 ((_ sign_extend 32) .cse165)) (.cse168 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse165 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse166)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse167)))) (bvsle (bvadd .cse167 .cse168 c_~bag2~0) .cse165) (not (bvsge .cse167 (_ bv0 32))) (not (bvsge .cse166 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse168))))) (not (bvsle (bvadd .cse167 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse168)))))))))) .cse3 .cse4 .cse5 .cse20 .cse21) (or (and (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse169 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse169 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse172 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse170 (bvadd .cse172 c_~bag2~0)) (.cse174 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse173 (bvadd .cse172 .cse174 c_~bag2~0)) (.cse171 ((_ sign_extend 32) .cse170))) (or (not (bvsle .cse170 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse171)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse172)))) (bvsle .cse173 .cse170) (bvsle .cse173 (bvadd .cse174 .cse169)) (not (bvsge .cse172 (_ bv0 32))) (not (bvsge .cse171 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse174))))))))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse178 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse179 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse175 (bvadd .cse177 c_~bag2~0))) (let ((.cse176 ((_ sign_extend 32) .cse175))) (or (not (bvsle .cse175 (_ bv0 32))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse176)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse177)))) (bvsle (bvadd .cse177 .cse178 c_~bag2~0) (bvadd .cse178 .cse179)) (not (bvsge .cse176 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse178)))))))))) (not (bvsle .cse178 (bvadd (_ bv2147483647 32) (bvneg .cse179))))))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse181 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse180 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse180 (bvadd (_ bv2147483647 32) (bvneg .cse181)))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse184 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse182 (bvadd .cse184 c_~bag2~0)) (.cse183 (bvadd .cse184 .cse180 c_~bag2~0))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse182))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse182) (_ bv2147483647 32)))) (bvsle .cse183 .cse182) (bvsle .cse183 (bvadd .cse180 .cse181)) (not (bvsge .cse184 (_ bv0 32)))))))))) (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse185 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse185 (_ bv0 32))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse189 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse186 (bvadd .cse189 c_~bag2~0)) (.cse187 (bvadd .cse189 .cse188 c_~bag2~0))) (or (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse186))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse186) (_ bv2147483647 32)))) (bvsle .cse187 .cse186) (bvsle .cse187 (bvadd .cse188 .cse185)) (not (bvsge .cse189 (_ bv0 32))))))))))) .cse3 .cse4 .cse5 .cse20 .cse21)) .cse2) (or .cse1 (and (or .cse3 .cse4 .cse5 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse192 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse190 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse191 (bvadd .cse190 c_~bag2~0)) (.cse193 (bvadd .cse190 .cse192 c_~bag2~0))) (or (not (bvsle .cse190 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse190)) (_ bv18446744071562067968 64)))) (not (bvsle .cse191 (bvadd (_ bv2147483647 32) (bvneg .cse192)))) (not (bvsge ((_ sign_extend 32) .cse191) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse192))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse193)))) (not (bvsle .cse193 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse193))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse195 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse199 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse194 (bvadd .cse195 .cse199 c_~bag2~0))) (let ((.cse198 (bvadd .cse195 c_~bag2~0)) (.cse197 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse196 ((_ sign_extend 32) .cse194))) (or (not (bvsle .cse194 (_ bv0 32))) (not (bvsle .cse195 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse195)) (_ bv18446744071562067968 64)))) (not (bvsge .cse196 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse197))))) (not (bvsle .cse198 (bvadd (_ bv2147483647 32) (bvneg .cse199)))) (not (bvsge ((_ sign_extend 32) .cse198) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse199))))) (not (bvsle .cse194 (bvadd (_ bv2147483647 32) (bvneg .cse197)))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse196)))))))))) .cse20 .cse21) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse201 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse202 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse200 (bvadd .cse201 .cse202 c_~bag2~0))) (let ((.cse205 (bvadd .cse201 c_~bag2~0)) (.cse204 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse203 ((_ sign_extend 32) .cse200))) (or (not (bvsle .cse200 (_ bv0 32))) (not (bvsle .cse201 (_ bv0 32))) (not (bvsle .cse202 (_ bv0 32))) (not (bvsge .cse203 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse204))))) (not (bvsge .cse201 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse205) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse202))))) (= (_ bv2147483647 32) .cse205) (not (bvsle .cse200 (bvadd (_ bv2147483647 32) (bvneg .cse204)))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse203))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse206 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse208 (bvadd .cse206 c_~bag2~0)) (.cse209 (bvadd .cse206 .cse207 c_~bag2~0))) (or (not (bvsle .cse206 (_ bv0 32))) (not (bvsle .cse207 (_ bv0 32))) (not (bvsge .cse206 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse208) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse207))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse209)))) (= (_ bv2147483647 32) .cse208) (not (bvsle .cse209 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse209)))))))))) .cse3 .cse4 .cse5 .cse20 .cse21) (or .cse3 .cse4 .cse5 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse210 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse211 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse212 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse213 (bvadd .cse210 c_~bag2~0))) (or (not (bvsle .cse210 (_ bv0 32))) (not (bvsle .cse211 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse210)) (_ bv18446744071562067968 64)))) (not (bvsle .cse212 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse210 .cse212 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse211))))) (not (bvsge ((_ sign_extend 32) .cse213) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse212))))) (= (_ bv2147483647 32) .cse213))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse215 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse214 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse218 (bvadd .cse214 c_~bag2~0)) (.cse216 (bvadd .cse214 .cse215 c_~bag2~0)) (.cse217 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse214 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse214)) (_ bv18446744071562067968 64)))) (not (bvsle .cse215 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse216) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse217))))) (not (bvsge ((_ sign_extend 32) .cse218) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse215))))) (= (_ bv2147483647 32) (bvadd .cse214 .cse215 c_~bag2~0 .cse217)) (= (_ bv2147483647 32) .cse218) (not (bvsle .cse216 (bvadd (_ bv2147483647 32) (bvneg .cse217))))))))) .cse20 .cse21) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse220 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse219 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse221 (bvadd .cse219 c_~bag2~0)) (.cse222 (bvadd .cse219 .cse220 c_~bag2~0))) (or (not (bvsle .cse219 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse219)) (_ bv18446744071562067968 64)))) (not (bvsle .cse220 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse221) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse220))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse222)))) (= (_ bv2147483647 32) .cse221) (not (bvsle .cse222 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse222))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse224 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse225 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse223 (bvadd .cse224 .cse225 c_~bag2~0))) (let ((.cse228 (bvadd .cse224 c_~bag2~0)) (.cse227 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse226 ((_ sign_extend 32) .cse223))) (or (not (bvsle .cse223 (_ bv0 32))) (not (bvsle .cse224 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse224)) (_ bv18446744071562067968 64)))) (not (bvsle .cse225 (_ bv0 32))) (not (bvsge .cse226 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse227))))) (not (bvsge ((_ sign_extend 32) .cse228) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse225))))) (= (_ bv2147483647 32) .cse228) (not (bvsle .cse223 (bvadd (_ bv2147483647 32) (bvneg .cse227)))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse226)))))))))) .cse3 .cse4 .cse5 .cse20 .cse21) (or .cse3 .cse4 .cse5 .cse20 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse233 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse230 (bvadd .cse229 .cse233 c_~bag2~0)) (.cse231 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse232 (bvadd .cse229 c_~bag2~0))) (or (not (bvsle .cse229 (_ bv0 32))) (= (_ bv2147483647 32) .cse230) (not (bvsle .cse231 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse230) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse231))))) (not (bvsle .cse232 (bvadd (_ bv2147483647 32) (bvneg .cse233)))) (not (bvsge .cse229 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse232) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse233))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse238 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse234 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse237 (bvadd .cse234 c_~bag2~0)) (.cse235 (bvadd .cse234 .cse238 c_~bag2~0)) (.cse236 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse234 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse235) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse236))))) (not (bvsle .cse237 (bvadd (_ bv2147483647 32) (bvneg .cse238)))) (not (bvsge .cse234 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse237) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse238))))) (= (_ bv2147483647 32) (bvadd .cse234 .cse238 c_~bag2~0 .cse236)) (not (bvsle .cse235 (bvadd (_ bv2147483647 32) (bvneg .cse236))))))))) .cse21) (or .cse3 .cse4 .cse5 .cse20 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse243 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse239 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse242 (bvadd .cse239 c_~bag2~0)) (.cse240 (bvadd .cse239 .cse243 c_~bag2~0)) (.cse241 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse239 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse239)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse240) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse241))))) (not (bvsle .cse242 (bvadd (_ bv2147483647 32) (bvneg .cse243)))) (not (bvsge ((_ sign_extend 32) .cse242) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse243))))) (= (_ bv2147483647 32) (bvadd .cse239 .cse243 c_~bag2~0 .cse241)) (not (bvsle .cse240 (bvadd (_ bv2147483647 32) (bvneg .cse241)))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse248 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse245 (bvadd .cse244 .cse248 c_~bag2~0)) (.cse246 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse247 (bvadd .cse244 c_~bag2~0))) (or (not (bvsle .cse244 (_ bv0 32))) (= (_ bv2147483647 32) .cse245) (not (bvsle .cse246 (_ bv0 32))) (not (bvsge .cse10 (bvadd (bvneg ((_ sign_extend 32) .cse244)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse245) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse246))))) (not (bvsle .cse247 (bvadd (_ bv2147483647 32) (bvneg .cse248)))) (not (bvsge ((_ sign_extend 32) .cse247) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse248)))))))))) .cse21) (or (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse249 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse250 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse251 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse252 (bvadd .cse249 c_~bag2~0))) (or (not (bvsle .cse249 (_ bv0 32))) (not (bvsle .cse250 (_ bv0 32))) (not (bvsle .cse251 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse249 .cse251 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse250))))) (not (bvsge .cse249 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse252) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse251))))) (= (_ bv2147483647 32) .cse252))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse254 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse253 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse257 (bvadd .cse253 c_~bag2~0)) (.cse255 (bvadd .cse253 .cse254 c_~bag2~0)) (.cse256 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse253 (_ bv0 32))) (not (bvsle .cse254 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse255) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse256))))) (not (bvsge .cse253 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse257) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse254))))) (= (_ bv2147483647 32) (bvadd .cse253 .cse254 c_~bag2~0 .cse256)) (= (_ bv2147483647 32) .cse257) (not (bvsle .cse255 (bvadd (_ bv2147483647 32) (bvneg .cse256))))))))) .cse3 .cse4 .cse5 .cse20 .cse21) (or .cse3 .cse4 .cse5 .cse20 (and (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse260 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse258 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse259 (bvadd .cse258 c_~bag2~0)) (.cse261 (bvadd .cse258 .cse260 c_~bag2~0))) (or (not (bvsle .cse258 (_ bv0 32))) (not (bvsle .cse259 (bvadd (_ bv2147483647 32) (bvneg .cse260)))) (not (bvsge .cse258 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse259) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse260))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse261)))) (not (bvsle .cse261 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse261))))))))) (forall ((v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8)) (v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse263 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse267 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse262 (bvadd .cse263 .cse267 c_~bag2~0))) (let ((.cse266 (bvadd .cse263 c_~bag2~0)) (.cse265 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse264 ((_ sign_extend 32) .cse262))) (or (not (bvsle .cse262 (_ bv0 32))) (not (bvsle .cse263 (_ bv0 32))) (not (bvsge .cse264 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse265))))) (not (bvsle .cse266 (bvadd (_ bv2147483647 32) (bvneg .cse267)))) (not (bvsge .cse263 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse266) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse267))))) (not (bvsle .cse262 (bvadd (_ bv2147483647 32) (bvneg .cse265)))) (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse264)))))))))) .cse21)) .cse2)) .cse268) (or .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse20 (not (bvsge .cse7 (bvadd (_ bv18446744071562067968 64) (bvneg .cse10)))) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32)))) .cse268 .cse21))))) is different from true Killed by 15