./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 AFTER --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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 23:26:02,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 23:26:02,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 23:26:02,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 23:26:02,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 23:26:02,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 23:26:02,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 23:26:02,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 23:26:02,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 23:26:02,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 23:26:02,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 23:26:02,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 23:26:02,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 23:26:02,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 23:26:02,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 23:26:02,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 23:26:02,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 23:26:02,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 23:26:02,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 23:26:02,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 23:26:02,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 23:26:02,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 23:26:02,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 23:26:02,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 23:26:02,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 23:26:02,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 23:26:02,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 23:26:02,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 23:26:02,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 23:26:02,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 23:26:02,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 23:26:02,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 23:26:02,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 23:26:02,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 23:26:02,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 23:26:02,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 23:26:02,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 23:26:02,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 23:26:02,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 23:26:02,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 23:26:02,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 23:26:02,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 23:26:02,734 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 23:26:02,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 23:26:02,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 23:26:02,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 23:26:02,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 23:26:02,736 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 23:26:02,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 23:26:02,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 23:26:02,737 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 23:26:02,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 23:26:02,737 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 23:26:02,738 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 23:26:02,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 23:26:02,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 23:26:02,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 23:26:02,739 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 23:26:02,739 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 23:26:02,739 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 23:26:02,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 23:26:02,740 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 23:26:02,740 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 23:26:02,740 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 23:26:02,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 23:26:02,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 23:26:02,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 23:26:02,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 23:26:02,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 23:26:02,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 23:26:02,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 23:26:02,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 23:26:02,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 23:26:02,742 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 23:26:02,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 23:26:02,743 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 23:26:02,743 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 -> AFTER [2023-08-29 23:26:03,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 23:26:03,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 23:26:03,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 23:26:03,088 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 23:26:03,089 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 23:26:03,090 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-08-29 23:26:04,187 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 23:26:04,411 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 23:26:04,412 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-08-29 23:26:04,418 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f801aa8e1/d00287ae04684b7da83c95bbac7ec848/FLAGaf6d311f2 [2023-08-29 23:26:04,437 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f801aa8e1/d00287ae04684b7da83c95bbac7ec848 [2023-08-29 23:26:04,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 23:26:04,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 23:26:04,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 23:26:04,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 23:26:04,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 23:26:04,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:26:04" (1/1) ... [2023-08-29 23:26:04,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae05aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:04, skipping insertion in model container [2023-08-29 23:26:04,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:26:04" (1/1) ... [2023-08-29 23:26:04,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 23:26:04,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 23:26:04,667 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-08-29 23:26:04,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 23:26:04,698 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-08-29 23:26:04,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5eca8f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:04, skipping insertion in model container [2023-08-29 23:26:04,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 23:26:04,701 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-08-29 23:26:04,703 INFO L158 Benchmark]: Toolchain (without parser) took 260.87ms. Allocated memory is still 88.1MB. Free memory was 65.6MB in the beginning and 55.7MB in the end (delta: 9.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-29 23:26:04,703 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 60.8MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 23:26:04,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.78ms. Allocated memory is still 88.1MB. Free memory was 65.4MB in the beginning and 55.8MB in the end (delta: 9.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-29 23:26:04,705 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 60.8MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.78ms. Allocated memory is still 88.1MB. Free memory was 65.4MB in the beginning and 55.8MB in the end (delta: 9.6MB). Peak memory consumption was 6.3MB. 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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 23:26:06,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 23:26:06,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 23:26:06,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 23:26:06,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 23:26:06,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 23:26:06,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 23:26:06,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 23:26:06,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 23:26:06,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 23:26:06,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 23:26:06,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 23:26:06,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 23:26:06,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 23:26:06,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 23:26:06,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 23:26:06,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 23:26:06,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 23:26:06,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 23:26:06,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 23:26:06,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 23:26:06,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 23:26:06,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 23:26:06,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 23:26:06,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 23:26:06,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 23:26:06,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 23:26:06,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 23:26:06,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 23:26:06,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 23:26:06,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 23:26:06,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 23:26:06,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 23:26:06,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 23:26:06,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 23:26:06,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 23:26:06,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 23:26:06,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 23:26:06,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 23:26:06,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 23:26:06,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 23:26:06,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 23:26:06,551 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 23:26:06,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 23:26:06,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 23:26:06,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 23:26:06,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 23:26:06,554 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 23:26:06,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 23:26:06,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 23:26:06,555 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 23:26:06,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 23:26:06,556 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 23:26:06,556 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 23:26:06,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 23:26:06,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 23:26:06,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 23:26:06,557 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 23:26:06,557 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 23:26:06,557 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 23:26:06,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 23:26:06,557 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 23:26:06,558 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 23:26:06,558 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 23:26:06,558 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 23:26:06,558 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 23:26:06,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 23:26:06,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 23:26:06,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 23:26:06,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 23:26:06,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 23:26:06,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 23:26:06,559 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 23:26:06,560 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 23:26:06,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 23:26:06,560 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 23:26:06,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 23:26:06,561 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 23:26:06,561 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 23:26:06,561 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 -> AFTER [2023-08-29 23:26:06,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 23:26:06,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 23:26:06,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 23:26:06,891 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 23:26:06,891 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 23:26:06,892 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-08-29 23:26:08,088 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 23:26:08,283 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 23:26:08,284 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-08-29 23:26:08,290 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187ab98df/f5c6b40b0c574de4a70642158debbc5c/FLAG12b07130f [2023-08-29 23:26:08,310 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187ab98df/f5c6b40b0c574de4a70642158debbc5c [2023-08-29 23:26:08,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 23:26:08,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 23:26:08,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 23:26:08,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 23:26:08,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 23:26:08,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180e5334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08, skipping insertion in model container [2023-08-29 23:26:08,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 23:26:08,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 23:26:08,536 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-08-29 23:26:08,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 23:26:08,571 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-08-29 23:26:08,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 23:26:08,602 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-08-29 23:26:08,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 23:26:08,622 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 23:26:08,655 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-08-29 23:26:08,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 23:26:08,679 INFO L208 MainTranslator]: Completed translation [2023-08-29 23:26:08,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08 WrapperNode [2023-08-29 23:26:08,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 23:26:08,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 23:26:08,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 23:26:08,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 23:26:08,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,754 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 269 [2023-08-29 23:26:08,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 23:26:08,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 23:26:08,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 23:26:08,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 23:26:08,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,809 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 23:26:08,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 23:26:08,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 23:26:08,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 23:26:08,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (1/1) ... [2023-08-29 23:26:08,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 23:26:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 23:26:08,850 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-08-29 23:26:08,874 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-08-29 23:26:08,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 23:26:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 23:26:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 23:26:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 23:26:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 23:26:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 23:26:08,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 23:26:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-29 23:26:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 23:26:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 23:26:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 23:26:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 23:26:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 23:26:08,892 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 23:26:09,053 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 23:26:09,055 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 23:26:09,598 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 23:26:09,608 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 23:26:09,608 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-29 23:26:09,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:26:09 BoogieIcfgContainer [2023-08-29 23:26:09,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 23:26:09,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 23:26:09,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 23:26:09,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 23:26:09,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 11:26:08" (1/3) ... [2023-08-29 23:26:09,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb19e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 11:26:09, skipping insertion in model container [2023-08-29 23:26:09,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:26:08" (2/3) ... [2023-08-29 23:26:09,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb19e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 11:26:09, skipping insertion in model container [2023-08-29 23:26:09,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:26:09" (3/3) ... [2023-08-29 23:26:09,618 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2023-08-29 23:26:09,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 23:26:09,633 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-08-29 23:26:09,633 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 23:26:09,744 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-29 23:26:09,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 333 places, 354 transitions, 724 flow [2023-08-29 23:26:09,910 INFO L130 PetriNetUnfolder]: 28/352 cut-off events. [2023-08-29 23:26:09,911 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 23:26:09,921 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-08-29 23:26:09,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 333 places, 354 transitions, 724 flow [2023-08-29 23:26:09,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 348 transitions, 708 flow [2023-08-29 23:26:09,944 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 23:26:09,958 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 327 places, 348 transitions, 708 flow [2023-08-29 23:26:09,964 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 327 places, 348 transitions, 708 flow [2023-08-29 23:26:09,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 348 transitions, 708 flow [2023-08-29 23:26:10,012 INFO L130 PetriNetUnfolder]: 28/348 cut-off events. [2023-08-29 23:26:10,013 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 23:26:10,016 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-08-29 23:26:10,028 INFO L119 LiptonReduction]: Number of co-enabled transitions 28296 [2023-08-29 23:26:37,650 INFO L134 LiptonReduction]: Checked pairs total: 26570 [2023-08-29 23:26:37,651 INFO L136 LiptonReduction]: Total number of compositions: 433 [2023-08-29 23:26:37,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 23:26:37,670 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;@1d48c245, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 23:26:37,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-08-29 23:26:37,682 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-29 23:26:37,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 23:26:37,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:37,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 23:26:37,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:37,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash 47968, now seen corresponding path program 1 times [2023-08-29 23:26:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927397736] [2023-08-29 23:26:37,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:37,700 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-08-29 23:26:37,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:37,707 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-08-29 23:26:37,756 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-08-29 23:26:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:37,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 23:26:37,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:37,915 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2023-08-29 23:26:37,916 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-08-29 23:26:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:37,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:37,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:37,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927397736] [2023-08-29 23:26:37,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927397736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:37,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:37,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:26:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366967517] [2023-08-29 23:26:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:37,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:26:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:37,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:26:37,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:26:38,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 787 [2023-08-29 23:26:38,153 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-08-29 23:26:38,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:38,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 787 [2023-08-29 23:26:38,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:38,403 INFO L130 PetriNetUnfolder]: 230/373 cut-off events. [2023-08-29 23:26:38,403 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 23:26:38,404 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-08-29 23:26:38,407 INFO L137 encePairwiseOnDemand]: 776/787 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-29 23:26:38,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 136 flow [2023-08-29 23:26:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:26:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:26:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2023-08-29 23:26:38,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4239728928420161 [2023-08-29 23:26:38,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1001 transitions. [2023-08-29 23:26:38,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1001 transitions. [2023-08-29 23:26:38,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:38,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1001 transitions. [2023-08-29 23:26:38,435 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-08-29 23:26:38,442 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-08-29 23:26:38,444 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-08-29 23:26:38,446 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 94 flow. Second operand 3 states and 1001 transitions. [2023-08-29 23:26:38,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 136 flow [2023-08-29 23:26:38,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 23:26:38,451 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 68 flow [2023-08-29 23:26:38,453 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-08-29 23:26:38,456 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -12 predicate places. [2023-08-29 23:26:38,457 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 68 flow [2023-08-29 23:26:38,458 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-08-29 23:26:38,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:38,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 23:26:38,471 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-08-29 23:26:38,667 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-08-29 23:26:38,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:38,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash 48127, now seen corresponding path program 1 times [2023-08-29 23:26:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522937213] [2023-08-29 23:26:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:38,669 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-08-29 23:26:38,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:38,670 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-08-29 23:26:38,674 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-08-29 23:26:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:38,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 23:26:38,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:38,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 23:26:38,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 23:26:38,851 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-29 23:26:38,851 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-08-29 23:26:38,872 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-08-29 23:26:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:38,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:38,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522937213] [2023-08-29 23:26:38,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522937213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:38,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:38,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:26:38,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877617255] [2023-08-29 23:26:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:38,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:26:38,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:38,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:26:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:26:39,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 787 [2023-08-29 23:26:39,177 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-08-29 23:26:39,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:39,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 787 [2023-08-29 23:26:39,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:39,411 INFO L130 PetriNetUnfolder]: 178/296 cut-off events. [2023-08-29 23:26:39,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 23:26:39,412 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-08-29 23:26:39,414 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-29 23:26:39,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 122 flow [2023-08-29 23:26:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:26:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:26:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 991 transitions. [2023-08-29 23:26:39,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197373994070309 [2023-08-29 23:26:39,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 991 transitions. [2023-08-29 23:26:39,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 991 transitions. [2023-08-29 23:26:39,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:39,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 991 transitions. [2023-08-29 23:26:39,422 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-08-29 23:26:39,427 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-08-29 23:26:39,428 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-08-29 23:26:39,429 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 68 flow. Second operand 3 states and 991 transitions. [2023-08-29 23:26:39,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 122 flow [2023-08-29 23:26:39,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:26:39,430 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 65 flow [2023-08-29 23:26:39,431 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-08-29 23:26:39,432 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -13 predicate places. [2023-08-29 23:26:39,433 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 65 flow [2023-08-29 23:26:39,433 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-08-29 23:26:39,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:39,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 23:26:39,448 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-08-29 23:26:39,643 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-08-29 23:26:39,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:39,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash 48125, now seen corresponding path program 1 times [2023-08-29 23:26:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:39,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149901393] [2023-08-29 23:26:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:39,645 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-08-29 23:26:39,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:39,649 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-08-29 23:26:39,661 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-08-29 23:26:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:39,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 23:26:39,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:39,776 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2023-08-29 23:26:39,777 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-08-29 23:26:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:39,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:39,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:39,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149901393] [2023-08-29 23:26:39,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149901393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:39,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:39,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:26:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936956342] [2023-08-29 23:26:39,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:39,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:26:39,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:26:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:26:39,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 787 [2023-08-29 23:26:39,950 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-08-29 23:26:39,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:39,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 787 [2023-08-29 23:26:39,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:40,111 INFO L130 PetriNetUnfolder]: 126/219 cut-off events. [2023-08-29 23:26:40,111 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 23:26:40,112 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-08-29 23:26:40,113 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-29 23:26:40,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 115 flow [2023-08-29 23:26:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:26:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:26:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 980 transitions. [2023-08-29 23:26:40,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41507835662854725 [2023-08-29 23:26:40,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 980 transitions. [2023-08-29 23:26:40,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 980 transitions. [2023-08-29 23:26:40,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:40,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 980 transitions. [2023-08-29 23:26:40,119 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-08-29 23:26:40,123 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-08-29 23:26:40,124 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-08-29 23:26:40,125 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 65 flow. Second operand 3 states and 980 transitions. [2023-08-29 23:26:40,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 115 flow [2023-08-29 23:26:40,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:26:40,126 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 62 flow [2023-08-29 23:26:40,126 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-08-29 23:26:40,127 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -14 predicate places. [2023-08-29 23:26:40,127 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 62 flow [2023-08-29 23:26:40,128 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-08-29 23:26:40,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:40,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 23:26:40,143 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-08-29 23:26:40,337 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-08-29 23:26:40,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:40,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 47969, now seen corresponding path program 1 times [2023-08-29 23:26:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:40,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495188396] [2023-08-29 23:26:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:40,338 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-08-29 23:26:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:40,341 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-08-29 23:26:40,342 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-08-29 23:26:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:40,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 23:26:40,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:40,483 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:26:40,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-08-29 23:26:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:40,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:40,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495188396] [2023-08-29 23:26:40,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495188396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:40,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:40,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:26:40,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663184507] [2023-08-29 23:26:40,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:40,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:26:40,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:40,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:26:40,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:26:40,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 787 [2023-08-29 23:26:40,694 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-08-29 23:26:40,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:40,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 787 [2023-08-29 23:26:40,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:41,047 INFO L130 PetriNetUnfolder]: 251/436 cut-off events. [2023-08-29 23:26:41,047 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 23:26:41,048 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-08-29 23:26:41,049 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 50 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-29 23:26:41,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 52 transitions, 220 flow [2023-08-29 23:26:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:26:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:26:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2023-08-29 23:26:41,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290554849639983 [2023-08-29 23:26:41,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1013 transitions. [2023-08-29 23:26:41,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1013 transitions. [2023-08-29 23:26:41,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:41,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1013 transitions. [2023-08-29 23:26:41,056 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-08-29 23:26:41,059 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-08-29 23:26:41,061 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-08-29 23:26:41,061 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 62 flow. Second operand 3 states and 1013 transitions. [2023-08-29 23:26:41,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 52 transitions, 220 flow [2023-08-29 23:26:41,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 52 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:26:41,063 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 73 flow [2023-08-29 23:26:41,063 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-08-29 23:26:41,064 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -12 predicate places. [2023-08-29 23:26:41,064 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 73 flow [2023-08-29 23:26:41,064 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-08-29 23:26:41,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:41,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 23:26:41,079 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-08-29 23:26:41,273 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-08-29 23:26:41,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:41,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1492321, now seen corresponding path program 1 times [2023-08-29 23:26:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822977561] [2023-08-29 23:26:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:41,275 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-08-29 23:26:41,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:41,278 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-08-29 23:26:41,305 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-08-29 23:26:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:41,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 23:26:41,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:41,416 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:26:41,416 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-08-29 23:26:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:41,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:26:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:41,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822977561] [2023-08-29 23:26:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822977561] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 23:26:41,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 23:26:41,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2023-08-29 23:26:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630888600] [2023-08-29 23:26:41,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 23:26:41,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 23:26:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:41,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 23:26:41,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 23:26:42,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 787 [2023-08-29 23:26:42,599 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-08-29 23:26:42,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:42,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 787 [2023-08-29 23:26:42,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:43,125 INFO L130 PetriNetUnfolder]: 378/657 cut-off events. [2023-08-29 23:26:43,125 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 23:26:43,126 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-08-29 23:26:43,128 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 74 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2023-08-29 23:26:43,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 81 transitions, 355 flow [2023-08-29 23:26:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 23:26:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 23:26:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1974 transitions. [2023-08-29 23:26:43,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41804320203303685 [2023-08-29 23:26:43,141 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1974 transitions. [2023-08-29 23:26:43,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1974 transitions. [2023-08-29 23:26:43,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:43,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1974 transitions. [2023-08-29 23:26:43,146 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-08-29 23:26:43,153 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-08-29 23:26:43,156 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-08-29 23:26:43,156 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 73 flow. Second operand 6 states and 1974 transitions. [2023-08-29 23:26:43,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 81 transitions, 355 flow [2023-08-29 23:26:43,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 81 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:26:43,158 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 125 flow [2023-08-29 23:26:43,158 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-08-29 23:26:43,159 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-08-29 23:26:43,159 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 125 flow [2023-08-29 23:26:43,160 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-08-29 23:26:43,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:43,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 23:26:43,169 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-08-29 23:26:43,369 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-08-29 23:26:43,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:43,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash 46282859, now seen corresponding path program 1 times [2023-08-29 23:26:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237496650] [2023-08-29 23:26:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:43,371 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-08-29 23:26:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:43,372 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-08-29 23:26:43,374 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-08-29 23:26:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:43,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 23:26:43,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:43,474 INFO L321 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2023-08-29 23:26:43,474 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-08-29 23:26:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:43,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:43,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237496650] [2023-08-29 23:26:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237496650] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:43,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:43,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:26:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907143724] [2023-08-29 23:26:43,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:43,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:26:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:43,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:26:43,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:26:43,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 787 [2023-08-29 23:26:43,588 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-08-29 23:26:43,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:43,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 787 [2023-08-29 23:26:43,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:43,812 INFO L130 PetriNetUnfolder]: 345/594 cut-off events. [2023-08-29 23:26:43,813 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-29 23:26:43,813 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-08-29 23:26:43,816 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-29 23:26:43,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 183 flow [2023-08-29 23:26:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:26:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:26:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2023-08-29 23:26:43,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142312579415502 [2023-08-29 23:26:43,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 978 transitions. [2023-08-29 23:26:43,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 978 transitions. [2023-08-29 23:26:43,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:43,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 978 transitions. [2023-08-29 23:26:43,822 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-08-29 23:26:43,825 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-08-29 23:26:43,826 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-08-29 23:26:43,826 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 125 flow. Second operand 3 states and 978 transitions. [2023-08-29 23:26:43,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 183 flow [2023-08-29 23:26:43,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 173 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-29 23:26:43,828 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 113 flow [2023-08-29 23:26:43,828 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-08-29 23:26:43,829 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2023-08-29 23:26:43,829 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 113 flow [2023-08-29 23:26:43,829 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-08-29 23:26:43,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:43,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 23:26:43,840 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-08-29 23:26:44,038 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-08-29 23:26:44,038 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:44,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:44,039 INFO L85 PathProgramCache]: Analyzing trace with hash 46282857, now seen corresponding path program 1 times [2023-08-29 23:26:44,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792018393] [2023-08-29 23:26:44,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:44,039 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-08-29 23:26:44,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:44,041 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-08-29 23:26:44,079 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-08-29 23:26:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:44,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 23:26:44,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:44,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 23:26:44,154 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-08-29 23:26:44,155 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-08-29 23:26:44,166 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-08-29 23:26:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:44,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:44,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:44,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792018393] [2023-08-29 23:26:44,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792018393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:44,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:26:44,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815847571] [2023-08-29 23:26:44,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:26:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:44,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:26:44,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:26:44,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 787 [2023-08-29 23:26:44,316 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-08-29 23:26:44,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:44,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 787 [2023-08-29 23:26:44,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:44,507 INFO L130 PetriNetUnfolder]: 312/531 cut-off events. [2023-08-29 23:26:44,507 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 23:26:44,508 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-08-29 23:26:44,510 INFO L137 encePairwiseOnDemand]: 784/787 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-29 23:26:44,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 167 flow [2023-08-29 23:26:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:26:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:26:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2023-08-29 23:26:44,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171961033460398 [2023-08-29 23:26:44,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 985 transitions. [2023-08-29 23:26:44,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 985 transitions. [2023-08-29 23:26:44,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:44,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 985 transitions. [2023-08-29 23:26:44,516 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-08-29 23:26:44,519 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-08-29 23:26:44,520 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-08-29 23:26:44,520 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 113 flow. Second operand 3 states and 985 transitions. [2023-08-29 23:26:44,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 167 flow [2023-08-29 23:26:44,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:26:44,524 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 110 flow [2023-08-29 23:26:44,525 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-08-29 23:26:44,525 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2023-08-29 23:26:44,525 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 110 flow [2023-08-29 23:26:44,526 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-08-29 23:26:44,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:44,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 23:26:44,539 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 (8)] Ended with exit code 0 [2023-08-29 23:26:44,734 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-08-29 23:26:44,735 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:44,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash 46282755, now seen corresponding path program 1 times [2023-08-29 23:26:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:44,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485146188] [2023-08-29 23:26:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:44,735 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-08-29 23:26:44,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:44,737 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-08-29 23:26:44,738 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-08-29 23:26:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:44,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 23:26:44,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:44,822 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2023-08-29 23:26:44,823 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-08-29 23:26:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:44,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:44,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485146188] [2023-08-29 23:26:44,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485146188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:44,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 23:26:44,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566639661] [2023-08-29 23:26:44,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:44,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 23:26:44,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:44,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 23:26:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 23:26:45,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 787 [2023-08-29 23:26:45,028 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-08-29 23:26:45,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:45,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 787 [2023-08-29 23:26:45,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:45,202 INFO L130 PetriNetUnfolder]: 213/366 cut-off events. [2023-08-29 23:26:45,202 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-29 23:26:45,202 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-08-29 23:26:45,204 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 23 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2023-08-29 23:26:45,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 160 flow [2023-08-29 23:26:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 23:26:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 23:26:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1247 transitions. [2023-08-29 23:26:45,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39612452350698857 [2023-08-29 23:26:45,208 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1247 transitions. [2023-08-29 23:26:45,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1247 transitions. [2023-08-29 23:26:45,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:45,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1247 transitions. [2023-08-29 23:26:45,211 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-08-29 23:26:45,214 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-08-29 23:26:45,216 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-08-29 23:26:45,216 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 110 flow. Second operand 4 states and 1247 transitions. [2023-08-29 23:26:45,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 160 flow [2023-08-29 23:26:45,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:26:45,217 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 113 flow [2023-08-29 23:26:45,217 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-08-29 23:26:45,218 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2023-08-29 23:26:45,218 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 113 flow [2023-08-29 23:26:45,219 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-08-29 23:26:45,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:45,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 23:26:45,237 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-08-29 23:26:45,427 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-08-29 23:26:45,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:45,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash 46282756, now seen corresponding path program 1 times [2023-08-29 23:26:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:45,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130106207] [2023-08-29 23:26:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:45,428 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-08-29 23:26:45,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:45,429 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-08-29 23:26:45,432 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-08-29 23:26:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:45,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 23:26:45,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:45,554 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:26:45,554 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-08-29 23:26:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:45,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:45,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:45,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130106207] [2023-08-29 23:26:45,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130106207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:45,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:45,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 23:26:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233337059] [2023-08-29 23:26:45,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:45,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 23:26:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:45,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 23:26:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 23:26:45,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 787 [2023-08-29 23:26:45,898 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-08-29 23:26:45,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:45,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 787 [2023-08-29 23:26:45,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:46,215 INFO L130 PetriNetUnfolder]: 387/660 cut-off events. [2023-08-29 23:26:46,215 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 23:26:46,216 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-08-29 23:26:46,218 INFO L137 encePairwiseOnDemand]: 782/787 looper letters, 36 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2023-08-29 23:26:46,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 230 flow [2023-08-29 23:26:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 23:26:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 23:26:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1297 transitions. [2023-08-29 23:26:46,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41200762388818296 [2023-08-29 23:26:46,222 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1297 transitions. [2023-08-29 23:26:46,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1297 transitions. [2023-08-29 23:26:46,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:46,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1297 transitions. [2023-08-29 23:26:46,225 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-08-29 23:26:46,228 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-08-29 23:26:46,229 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-08-29 23:26:46,229 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 113 flow. Second operand 4 states and 1297 transitions. [2023-08-29 23:26:46,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 230 flow [2023-08-29 23:26:46,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 23:26:46,231 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 135 flow [2023-08-29 23:26:46,231 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-08-29 23:26:46,232 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-08-29 23:26:46,232 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 135 flow [2023-08-29 23:26:46,233 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-08-29 23:26:46,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:46,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 23:26:46,247 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-08-29 23:26:46,441 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-08-29 23:26:46,442 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:46,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1528187091, now seen corresponding path program 1 times [2023-08-29 23:26:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859508137] [2023-08-29 23:26:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:46,442 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-08-29 23:26:46,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:46,443 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-08-29 23:26:46,447 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-08-29 23:26:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:46,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 23:26:46,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:46,554 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:26:46,554 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-08-29 23:26:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:46,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:46,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:46,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859508137] [2023-08-29 23:26:46,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859508137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:46,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:46,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 23:26:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843663465] [2023-08-29 23:26:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:46,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 23:26:46,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:46,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 23:26:46,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 23:26:46,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 787 [2023-08-29 23:26:46,914 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-08-29 23:26:46,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:46,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 787 [2023-08-29 23:26:46,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:47,230 INFO L130 PetriNetUnfolder]: 597/1014 cut-off events. [2023-08-29 23:26:47,231 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2023-08-29 23:26:47,232 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-08-29 23:26:47,235 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-08-29 23:26:47,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 267 flow [2023-08-29 23:26:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 23:26:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 23:26:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1295 transitions. [2023-08-29 23:26:47,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113722998729352 [2023-08-29 23:26:47,240 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1295 transitions. [2023-08-29 23:26:47,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1295 transitions. [2023-08-29 23:26:47,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:47,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1295 transitions. [2023-08-29 23:26:47,243 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-08-29 23:26:47,247 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-08-29 23:26:47,248 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-08-29 23:26:47,248 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 135 flow. Second operand 4 states and 1295 transitions. [2023-08-29 23:26:47,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 267 flow [2023-08-29 23:26:47,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 23:26:47,250 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 148 flow [2023-08-29 23:26:47,250 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-08-29 23:26:47,251 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-08-29 23:26:47,251 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 148 flow [2023-08-29 23:26:47,252 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-08-29 23:26:47,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:47,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-29 23:26:47,267 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-08-29 23:26:47,460 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-08-29 23:26:47,461 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:47,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:47,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1528328236, now seen corresponding path program 1 times [2023-08-29 23:26:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040884610] [2023-08-29 23:26:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:47,461 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-08-29 23:26:47,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:47,462 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-08-29 23:26:47,463 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-08-29 23:26:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:47,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 23:26:47,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:47,606 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:26:47,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-08-29 23:26:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:47,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 23:26:47,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:47,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040884610] [2023-08-29 23:26:47,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040884610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:26:47,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:26:47,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 23:26:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812924247] [2023-08-29 23:26:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:26:47,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 23:26:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 23:26:47,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 23:26:47,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 787 [2023-08-29 23:26:48,000 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-08-29 23:26:48,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:48,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 787 [2023-08-29 23:26:48,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:48,343 INFO L130 PetriNetUnfolder]: 408/707 cut-off events. [2023-08-29 23:26:48,343 INFO L131 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2023-08-29 23:26:48,344 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-08-29 23:26:48,346 INFO L137 encePairwiseOnDemand]: 781/787 looper letters, 38 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-29 23:26:48,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 266 flow [2023-08-29 23:26:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 23:26:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 23:26:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1272 transitions. [2023-08-29 23:26:48,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4040660736975858 [2023-08-29 23:26:48,350 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1272 transitions. [2023-08-29 23:26:48,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1272 transitions. [2023-08-29 23:26:48,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:48,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1272 transitions. [2023-08-29 23:26:48,353 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-08-29 23:26:48,356 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-08-29 23:26:48,357 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-08-29 23:26:48,357 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 148 flow. Second operand 4 states and 1272 transitions. [2023-08-29 23:26:48,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 266 flow [2023-08-29 23:26:48,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 23:26:48,359 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 171 flow [2023-08-29 23:26:48,359 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-08-29 23:26:48,360 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2023-08-29 23:26:48,360 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 171 flow [2023-08-29 23:26:48,360 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-08-29 23:26:48,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:48,360 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-08-29 23:26:48,372 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-08-29 23:26:48,569 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-08-29 23:26:48,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:48,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1513306977, now seen corresponding path program 2 times [2023-08-29 23:26:48,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916371508] [2023-08-29 23:26:48,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 23:26:48,570 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-08-29 23:26:48,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:48,571 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-08-29 23:26:48,573 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-08-29 23:26:48,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 23:26:48,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 23:26:48,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-29 23:26:48,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:48,702 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:26:48,702 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-08-29 23:26:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:48,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:26:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:26:49,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:49,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916371508] [2023-08-29 23:26:49,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916371508] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 23:26:49,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 23:26:49,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-08-29 23:26:49,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689218634] [2023-08-29 23:26:49,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 23:26:49,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 23:26:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:49,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 23:26:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-08-29 23:26:52,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 787 [2023-08-29 23:26:52,681 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-08-29 23:26:52,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:52,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 787 [2023-08-29 23:26:52,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:26:56,164 INFO L130 PetriNetUnfolder]: 1793/3057 cut-off events. [2023-08-29 23:26:56,164 INFO L131 PetriNetUnfolder]: For 1287/1287 co-relation queries the response was YES. [2023-08-29 23:26:56,168 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-08-29 23:26:56,180 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 202 selfloop transitions, 12 changer transitions 0/214 dead transitions. [2023-08-29 23:26:56,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 214 transitions, 1266 flow [2023-08-29 23:26:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 23:26:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 23:26:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3985 transitions. [2023-08-29 23:26:56,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42196103346039815 [2023-08-29 23:26:56,192 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3985 transitions. [2023-08-29 23:26:56,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3985 transitions. [2023-08-29 23:26:56,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:26:56,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3985 transitions. [2023-08-29 23:26:56,202 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-08-29 23:26:56,212 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-08-29 23:26:56,213 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-08-29 23:26:56,213 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 171 flow. Second operand 12 states and 3985 transitions. [2023-08-29 23:26:56,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 214 transitions, 1266 flow [2023-08-29 23:26:56,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 214 transitions, 1256 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 23:26:56,218 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 264 flow [2023-08-29 23:26:56,218 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-08-29 23:26:56,220 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-08-29 23:26:56,220 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 264 flow [2023-08-29 23:26:56,221 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-08-29 23:26:56,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:26:56,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:26:56,231 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-08-29 23:26:56,430 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-08-29 23:26:56,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:26:56,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:26:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -317097428, now seen corresponding path program 1 times [2023-08-29 23:26:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:26:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606690702] [2023-08-29 23:26:56,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:26:56,432 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-08-29 23:26:56,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:26:56,433 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-08-29 23:26:56,434 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-08-29 23:26:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:26:56,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-29 23:26:56,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:26:56,590 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:26:56,591 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-08-29 23:26:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 23:26:56,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:26:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 23:26:57,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:26:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606690702] [2023-08-29 23:26:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606690702] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 23:26:57,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 23:26:57,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-29 23:26:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018301631] [2023-08-29 23:26:57,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 23:26:57,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 23:26:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:26:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 23:26:57,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-29 23:26:58,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 787 [2023-08-29 23:26:58,766 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-08-29 23:26:58,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:26:58,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 787 [2023-08-29 23:26:58,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:27:01,971 INFO L130 PetriNetUnfolder]: 3728/6216 cut-off events. [2023-08-29 23:27:01,972 INFO L131 PetriNetUnfolder]: For 1486/1486 co-relation queries the response was YES. [2023-08-29 23:27:01,984 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-08-29 23:27:02,003 INFO L137 encePairwiseOnDemand]: 778/787 looper letters, 91 selfloop transitions, 21 changer transitions 0/112 dead transitions. [2023-08-29 23:27:02,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 722 flow [2023-08-29 23:27:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:27:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:27:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2823 transitions. [2023-08-29 23:27:02,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39855993223210506 [2023-08-29 23:27:02,012 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2823 transitions. [2023-08-29 23:27:02,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2823 transitions. [2023-08-29 23:27:02,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:27:02,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2823 transitions. [2023-08-29 23:27:02,018 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-08-29 23:27:02,025 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-08-29 23:27:02,025 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-08-29 23:27:02,026 INFO L175 Difference]: Start difference. First operand has 61 places, 38 transitions, 264 flow. Second operand 9 states and 2823 transitions. [2023-08-29 23:27:02,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 722 flow [2023-08-29 23:27:02,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 697 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-29 23:27:02,029 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 384 flow [2023-08-29 23:27:02,030 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-08-29 23:27:02,030 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2023-08-29 23:27:02,030 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 384 flow [2023-08-29 23:27:02,031 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-08-29 23:27:02,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:27:02,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:27:02,044 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-08-29 23:27:02,240 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-08-29 23:27:02,240 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:27:02,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:27:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1244448862, now seen corresponding path program 1 times [2023-08-29 23:27:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:27:02,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781330374] [2023-08-29 23:27:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:27:02,242 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-08-29 23:27:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:27:02,243 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-08-29 23:27:02,245 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-08-29 23:27:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:27:02,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 23:27:02,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:27:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:27:02,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:27:03,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 23:27:03,141 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-08-29 23:27:03,155 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-08-29 23:27:03,168 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-08-29 23:27:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:27:04,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:27:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781330374] [2023-08-29 23:27:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781330374] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 23:27:04,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 23:27:04,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-29 23:27:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199946441] [2023-08-29 23:27:04,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 23:27:04,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 23:27:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:27:04,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 23:27:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-29 23:27:04,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 787 [2023-08-29 23:27:04,631 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-08-29 23:27:04,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:27:04,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 787 [2023-08-29 23:27:04,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:27:06,082 INFO L130 PetriNetUnfolder]: 3538/5930 cut-off events. [2023-08-29 23:27:06,082 INFO L131 PetriNetUnfolder]: For 9726/9726 co-relation queries the response was YES. [2023-08-29 23:27:06,101 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-08-29 23:27:06,126 INFO L137 encePairwiseOnDemand]: 780/787 looper letters, 116 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2023-08-29 23:27:06,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 129 transitions, 1147 flow [2023-08-29 23:27:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 23:27:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 23:27:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3142 transitions. [2023-08-29 23:27:06,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39923761118170265 [2023-08-29 23:27:06,135 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3142 transitions. [2023-08-29 23:27:06,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3142 transitions. [2023-08-29 23:27:06,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:27:06,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3142 transitions. [2023-08-29 23:27:06,141 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-08-29 23:27:06,148 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-08-29 23:27:06,149 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-08-29 23:27:06,150 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 384 flow. Second operand 10 states and 3142 transitions. [2023-08-29 23:27:06,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 129 transitions, 1147 flow [2023-08-29 23:27:06,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 1084 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-29 23:27:06,164 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 448 flow [2023-08-29 23:27:06,165 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-08-29 23:27:06,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-08-29 23:27:06,165 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 448 flow [2023-08-29 23:27:06,166 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-08-29 23:27:06,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:27:06,166 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:27:06,179 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-08-29 23:27:06,376 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-08-29 23:27:06,377 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:27:06,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:27:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -877018718, now seen corresponding path program 2 times [2023-08-29 23:27:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:27:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307948785] [2023-08-29 23:27:06,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 23:27:06,378 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-08-29 23:27:06,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:27:06,379 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-08-29 23:27:06,382 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-08-29 23:27:06,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-29 23:27:06,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 23:27:06,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-29 23:27:06,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:27:06,536 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:27:06,537 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-08-29 23:27:06,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-08-29 23:27:06,892 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-08-29 23:27:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:27:06,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:27:07,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 23:27:07,266 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-08-29 23:27:07,279 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-08-29 23:27:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:27:08,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:27:08,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307948785] [2023-08-29 23:27:08,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307948785] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 23:27:08,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 23:27:08,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-08-29 23:27:08,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178802783] [2023-08-29 23:27:08,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 23:27:08,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 23:27:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:27:08,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 23:27:08,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-08-29 23:27:12,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 787 [2023-08-29 23:27:12,490 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-08-29 23:27:12,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:27:12,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 787 [2023-08-29 23:27:12,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:27:16,618 INFO L130 PetriNetUnfolder]: 4446/7414 cut-off events. [2023-08-29 23:27:16,618 INFO L131 PetriNetUnfolder]: For 11682/11682 co-relation queries the response was YES. [2023-08-29 23:27:16,638 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-08-29 23:27:16,665 INFO L137 encePairwiseOnDemand]: 781/787 looper letters, 285 selfloop transitions, 24 changer transitions 0/309 dead transitions. [2023-08-29 23:27:16,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 309 transitions, 2561 flow [2023-08-29 23:27:16,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-29 23:27:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-29 23:27:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4936 transitions. [2023-08-29 23:27:16,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391994917407878 [2023-08-29 23:27:16,677 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4936 transitions. [2023-08-29 23:27:16,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4936 transitions. [2023-08-29 23:27:16,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:27:16,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4936 transitions. [2023-08-29 23:27:16,687 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-08-29 23:27:16,697 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-08-29 23:27:16,698 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-08-29 23:27:16,698 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 448 flow. Second operand 16 states and 4936 transitions. [2023-08-29 23:27:16,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 309 transitions, 2561 flow [2023-08-29 23:27:16,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 309 transitions, 2539 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-29 23:27:16,727 INFO L231 Difference]: Finished difference. Result has 92 places, 68 transitions, 622 flow [2023-08-29 23:27:16,727 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-08-29 23:27:16,728 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-08-29 23:27:16,728 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 68 transitions, 622 flow [2023-08-29 23:27:16,729 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-08-29 23:27:16,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:27:16,729 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 23:27:16,743 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-08-29 23:27:16,944 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-08-29 23:27:16,944 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:27:16,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:27:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1417764173, now seen corresponding path program 3 times [2023-08-29 23:27:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:27:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418171802] [2023-08-29 23:27:16,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 23:27:16,945 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-08-29 23:27:16,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:27:16,946 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-08-29 23:27:16,949 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-08-29 23:27:17,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-29 23:27:17,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 23:27:17,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-29 23:27:17,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:27:17,138 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:27:17,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2023-08-29 23:27:17,925 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-08-29 23:27:17,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 23:27:17,954 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-08-29 23:27:18,019 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-08-29 23:27:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:27:18,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:27:19,582 INFO L321 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2023-08-29 23:27:19,583 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-08-29 23:27:19,593 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-08-29 23:27:45,121 WARN L222 SmtUtils]: Spent 7.86s 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-08-29 23:27:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:27:45,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:27:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418171802] [2023-08-29 23:27:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418171802] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 23:27:45,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 23:27:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-08-29 23:27:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31167233] [2023-08-29 23:27:45,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 23:27:45,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-29 23:27:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:27:45,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-29 23:27:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-08-29 23:27:59,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 787 [2023-08-29 23:27:59,952 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-08-29 23:27:59,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:27:59,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 787 [2023-08-29 23:27:59,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:28:08,070 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-08-29 23:28:12,948 INFO L130 PetriNetUnfolder]: 3852/6480 cut-off events. [2023-08-29 23:28:12,948 INFO L131 PetriNetUnfolder]: For 14068/14068 co-relation queries the response was YES. [2023-08-29 23:28:12,966 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-08-29 23:28:12,992 INFO L137 encePairwiseOnDemand]: 779/787 looper letters, 242 selfloop transitions, 18 changer transitions 0/260 dead transitions. [2023-08-29 23:28:12,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 260 transitions, 2277 flow [2023-08-29 23:28:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-29 23:28:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-29 23:28:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4646 transitions. [2023-08-29 23:28:13,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3689644218551461 [2023-08-29 23:28:13,001 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4646 transitions. [2023-08-29 23:28:13,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4646 transitions. [2023-08-29 23:28:13,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:28:13,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4646 transitions. [2023-08-29 23:28:13,010 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-08-29 23:28:13,019 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-08-29 23:28:13,020 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-08-29 23:28:13,021 INFO L175 Difference]: Start difference. First operand has 92 places, 68 transitions, 622 flow. Second operand 16 states and 4646 transitions. [2023-08-29 23:28:13,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 260 transitions, 2277 flow [2023-08-29 23:28:13,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 260 transitions, 2199 flow, removed 27 selfloop flow, removed 9 redundant places. [2023-08-29 23:28:13,074 INFO L231 Difference]: Finished difference. Result has 102 places, 66 transitions, 580 flow [2023-08-29 23:28:13,074 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-08-29 23:28:13,075 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 58 predicate places. [2023-08-29 23:28:13,075 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 66 transitions, 580 flow [2023-08-29 23:28:13,076 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-08-29 23:28:13,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:28:13,076 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-08-29 23:28:13,091 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-08-29 23:28:13,286 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-08-29 23:28:13,287 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:28:13,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:28:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -504714061, now seen corresponding path program 4 times [2023-08-29 23:28:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:28:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925980384] [2023-08-29 23:28:13,288 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 23:28:13,288 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-08-29 23:28:13,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:28:13,289 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-08-29 23:28:13,291 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-08-29 23:28:13,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 23:28:13,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 23:28:13,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-29 23:28:13,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:28:13,533 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:28:13,534 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-08-29 23:28:14,551 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-08-29 23:28:14,625 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-08-29 23:28:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:28:14,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:28:17,563 INFO L321 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2023-08-29 23:28:17,564 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-08-29 23:28:17,583 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-08-29 23:28:59,090 WARN L222 SmtUtils]: Spent 15.81s 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-08-29 23:29:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:29:01,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:29:01,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925980384] [2023-08-29 23:29:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925980384] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 23:29:01,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 23:29:01,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-08-29 23:29:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337733560] [2023-08-29 23:29:01,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 23:29:01,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-29 23:29:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:29:01,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-29 23:29:01,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-08-29 23:29:29,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 787 [2023-08-29 23:29:29,840 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-08-29 23:29:29,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:29:29,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 787 [2023-08-29 23:29:29,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:30:11,346 INFO L130 PetriNetUnfolder]: 5340/8772 cut-off events. [2023-08-29 23:30:11,346 INFO L131 PetriNetUnfolder]: For 17379/17379 co-relation queries the response was YES. [2023-08-29 23:30:11,366 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-08-29 23:30:11,393 INFO L137 encePairwiseOnDemand]: 779/787 looper letters, 535 selfloop transitions, 54 changer transitions 0/589 dead transitions. [2023-08-29 23:30:11,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 589 transitions, 4933 flow [2023-08-29 23:30:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-29 23:30:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-29 23:30:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 9282 transitions. [2023-08-29 23:30:11,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3685673443456163 [2023-08-29 23:30:11,410 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 9282 transitions. [2023-08-29 23:30:11,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 9282 transitions. [2023-08-29 23:30:11,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:30:11,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 9282 transitions. [2023-08-29 23:30:11,424 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-08-29 23:30:11,442 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-08-29 23:30:11,444 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-08-29 23:30:11,444 INFO L175 Difference]: Start difference. First operand has 102 places, 66 transitions, 580 flow. Second operand 32 states and 9282 transitions. [2023-08-29 23:30:11,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 589 transitions, 4933 flow [2023-08-29 23:30:11,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 589 transitions, 4911 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-29 23:30:11,479 INFO L231 Difference]: Finished difference. Result has 132 places, 98 transitions, 971 flow [2023-08-29 23:30:11,479 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-08-29 23:30:11,480 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places. [2023-08-29 23:30:11,480 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 98 transitions, 971 flow [2023-08-29 23:30:11,480 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-08-29 23:30:11,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:30:11,481 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2023-08-29 23:30:11,494 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-08-29 23:30:11,691 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-08-29 23:30:11,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:30:11,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:30:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 614923105, now seen corresponding path program 3 times [2023-08-29 23:30:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:30:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701827421] [2023-08-29 23:30:11,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 23:30:11,693 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-08-29 23:30:11,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:30:11,693 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-08-29 23:30:11,695 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-08-29 23:30:11,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-08-29 23:30:11,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 23:30:11,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-29 23:30:11,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:30:12,023 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:30:12,023 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-08-29 23:30:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:30:13,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:30:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 23:30:18,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 23:30:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701827421] [2023-08-29 23:30:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701827421] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-29 23:30:18,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-29 23:30:18,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-08-29 23:30:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091771825] [2023-08-29 23:30:18,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-29 23:30:18,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-29 23:30:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 23:30:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-29 23:30:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-08-29 23:31:06,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 787 [2023-08-29 23:31:06,167 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-08-29 23:31:06,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:31:06,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 787 [2023-08-29 23:31:06,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:31:45,241 INFO L130 PetriNetUnfolder]: 10296/17016 cut-off events. [2023-08-29 23:31:45,241 INFO L131 PetriNetUnfolder]: For 53505/53505 co-relation queries the response was YES. [2023-08-29 23:31:45,293 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-08-29 23:31:45,343 INFO L137 encePairwiseOnDemand]: 783/787 looper letters, 716 selfloop transitions, 24 changer transitions 0/740 dead transitions. [2023-08-29 23:31:45,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 740 transitions, 6844 flow [2023-08-29 23:31:45,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-29 23:31:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-29 23:31:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 8009 transitions. [2023-08-29 23:31:45,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4240258365099534 [2023-08-29 23:31:45,353 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 8009 transitions. [2023-08-29 23:31:45,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 8009 transitions. [2023-08-29 23:31:45,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:31:45,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 8009 transitions. [2023-08-29 23:31:45,363 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-08-29 23:31:45,374 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-08-29 23:31:45,375 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-08-29 23:31:45,375 INFO L175 Difference]: Start difference. First operand has 132 places, 98 transitions, 971 flow. Second operand 24 states and 8009 transitions. [2023-08-29 23:31:45,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 740 transitions, 6844 flow [2023-08-29 23:31:45,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 740 transitions, 6626 flow, removed 32 selfloop flow, removed 14 redundant places. [2023-08-29 23:31:45,732 INFO L231 Difference]: Finished difference. Result has 154 places, 111 transitions, 1036 flow [2023-08-29 23:31:45,732 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-08-29 23:31:45,733 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places. [2023-08-29 23:31:45,733 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 111 transitions, 1036 flow [2023-08-29 23:31:45,734 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-08-29 23:31:45,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:31:45,734 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2023-08-29 23:31:45,741 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 (19)] Forceful destruction successful, exit code 0 [2023-08-29 23:31:45,934 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-08-29 23:31:45,934 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-08-29 23:31:45,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:31:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1533745602, now seen corresponding path program 5 times [2023-08-29 23:31:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 23:31:45,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887542915] [2023-08-29 23:31:45,935 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 23:31:45,935 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-08-29 23:31:45,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 23:31:45,936 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-08-29 23:31:45,937 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-08-29 23:31:46,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-29 23:31:46,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 23:31:46,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-29 23:31:46,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 23:31:46,332 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-08-29 23:31:46,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-08-29 23:31:49,030 INFO L321 Elim1Store]: treesize reduction 332, result has 0.3 percent of original size [2023-08-29 23:31:49,030 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-08-29 23:31:50,665 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-08-29 23:31:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-29 23:31:50,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-29 23:32:06,482 INFO L321 Elim1Store]: treesize reduction 440, result has 0.2 percent of original size [2023-08-29 23:32:06,483 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-08-29 23:32:06,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1113 treesize of output 1101 [2023-08-29 23:33:10,122 WARN L222 SmtUtils]: Spent 5.55s 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-08-29 23:33:50,855 WARN L222 SmtUtils]: Spent 5.98s 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-08-29 23:34:51,321 WARN L222 SmtUtils]: Spent 5.73s 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-08-29 23:35:58,119 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse416 (bvmul (_ bv4 32) c_~j~0))) (let ((.cse419 (bvadd c_~A~0.offset .cse416 (_ bv12 32))) (.cse421 (select |c_#length| c_~A~0.base)) (.cse417 (bvadd (_ bv4 32) c_~A~0.offset .cse416)) (.cse418 (bvadd (_ bv8 32) c_~A~0.offset .cse416))) (let ((.cse1 (not (bvule .cse417 .cse418))) (.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 .cse419 .cse421))) (.cse5 (not (bvslt (bvadd (_ bv2 32) c_~j~0) c_~N~0))) (.cse6 (let ((.cse420 (bvadd (_ bv16 32) c_~A~0.offset .cse416))) (and (bvule .cse419 .cse420) (bvule .cse420 .cse421)))) (.cse23 (not (bvule .cse418 .cse419))) (.cse0 (not (bvule (bvadd c_~A~0.offset .cse416) .cse417))) (.cse8 ((_ sign_extend 32) c_~sum2~0)) (.cse12 ((_ sign_extend 32) c_~bag2~0)) (.cse301 (not (bvslt c_~j~0 c_~N~0)))) (and (or .cse0 (and (or .cse1 .cse2 (and (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse11 (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 ((.cse10 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse7 (bvadd .cse10 c_~bag2~0))) (let ((.cse9 ((_ sign_extend 32) .cse7))) (or (not (bvsle .cse7 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse9)))) (not (bvsle .cse10 (_ bv0 32))) (bvsle (bvadd .cse10 .cse11 c_~bag2~0) .cse7) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse10)) (_ bv18446744071562067968 64)))) (not (bvsge .cse9 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse11))))) (not (bvsle (bvadd .cse10 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse11))))))))) (not (bvsle .cse11 (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 ((.cse13 (bvadd .cse15 c_~bag2~0))) (let ((.cse14 ((_ sign_extend 32) .cse13)) (.cse16 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse13 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse14)))) (not (bvsle .cse15 (_ bv0 32))) (bvsle (bvadd .cse15 .cse16 c_~bag2~0) .cse13) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse15)) (_ bv18446744071562067968 64)))) (not (bvsge .cse14 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse16))))) (not (bvsle (bvadd .cse15 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse16))))))))) (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 ((.cse18 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse17 (bvadd .cse18 c_~bag2~0)) (.cse19 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse8 (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 .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse18)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse18 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse19)))))))) (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 ((.cse22 (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 ((.cse21 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse20 (bvadd .cse21 c_~bag2~0))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse20))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse20) (_ bv2147483647 32)))) (not (bvsle .cse21 (_ bv0 32))) (bvsle (bvadd .cse21 .cse22 c_~bag2~0) .cse20) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse21)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse21 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse22)))))))) (not (bvsle .cse22 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))))))) .cse23) (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 ((.cse24 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse24 (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 ((.cse26 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse25 (bvadd .cse26 c_~bag2~0))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse25))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse25) (_ bv2147483647 32)))) (not (bvsle .cse26 (_ bv0 32))) (bvsle (bvadd .cse26 .cse24 c_~bag2~0) .cse25) (not (bvsge .cse26 (_ bv0 32))) (not (bvsle (bvadd .cse26 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse24))))))))))) (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 ((.cse28 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse27 (bvadd .cse28 c_~bag2~0)) (.cse29 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse27))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse27) (_ bv2147483647 32)))) (not (bvsle .cse28 (_ bv0 32))) (bvsle (bvadd .cse28 .cse29 c_~bag2~0) .cse27) (not (bvsge .cse28 (_ bv0 32))) (not (bvsle (bvadd .cse28 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse29)))))))) (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))) (or (not (bvsle .cse30 (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 ((.cse33 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse31 (bvadd .cse33 c_~bag2~0))) (let ((.cse32 ((_ sign_extend 32) .cse31))) (or (not (bvsle .cse31 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse32)))) (not (bvsle .cse33 (_ bv0 32))) (bvsle (bvadd .cse33 .cse30 c_~bag2~0) .cse31) (not (bvsge .cse33 (_ bv0 32))) (not (bvsge .cse32 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse30))))) (not (bvsle (bvadd .cse33 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse30)))))))))))) (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 ((.cse36 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse34 (bvadd .cse36 c_~bag2~0))) (let ((.cse35 ((_ sign_extend 32) .cse34)) (.cse37 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse34 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse35)))) (not (bvsle .cse36 (_ bv0 32))) (bvsle (bvadd .cse36 .cse37 c_~bag2~0) .cse34) (not (bvsge .cse36 (_ bv0 32))) (not (bvsge .cse35 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse37))))) (not (bvsle (bvadd .cse36 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse37)))))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (or .cse3 .cse4 .cse5 (and (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse38 (_ 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 ((.cse41 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse39 (bvadd .cse41 c_~bag2~0)) (.cse43 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse42 (bvadd .cse41 .cse43 c_~bag2~0)) (.cse40 ((_ sign_extend 32) .cse39))) (or (not (bvsle .cse39 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse40)))) (not (bvsle .cse41 (_ bv0 32))) (bvsle .cse42 .cse39) (bvsle .cse42 (bvadd .cse43 .cse38)) (not (bvsge .cse41 (_ bv0 32))) (not (bvsge .cse40 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse43))))))))))))) (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 ((.cse45 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse47 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse46 (bvadd .cse45 .cse47 c_~bag2~0)) (.cse48 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse44 (bvadd .cse45 c_~bag2~0))) (or (not (bvsle c_~sum2~0 (bvadd (bvneg .cse44) (_ bv2147483647 32)))) (not (bvsle .cse45 (_ bv0 32))) (bvsle .cse46 .cse44) (bvsle .cse46 (bvadd .cse47 .cse48)) (not (bvsle .cse47 (bvadd (_ bv2147483647 32) (bvneg .cse48)))) (not (bvsge .cse45 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse44) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse47))))))))) (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse53 (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 ((.cse52 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse50 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse49 (bvadd .cse50 c_~bag2~0)) (.cse51 (bvadd .cse50 .cse52 c_~bag2~0))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse49))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse49) (_ bv2147483647 32)))) (not (bvsle .cse50 (_ bv0 32))) (bvsle .cse51 .cse49) (bvsle .cse51 (bvadd .cse52 .cse53)) (not (bvsge .cse50 (_ bv0 32))))))) (not (bvsle .cse53 (_ bv0 32))))))) .cse6 .cse23) (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 ((.cse56 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse54 (bvadd .cse56 c_~bag2~0))) (let ((.cse58 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse55 ((_ sign_extend 32) .cse54)) (.cse57 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse54 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse55)))) (not (bvsle .cse56 (_ bv0 32))) (bvsle (bvadd .cse56 .cse57 c_~bag2~0) (bvadd .cse57 .cse58)) (not (bvsle .cse57 (bvadd (_ bv2147483647 32) (bvneg .cse58)))) (not (bvsge .cse55 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse57)))))))))) (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 ((.cse62 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse60 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse59 (bvadd .cse60 c_~bag2~0)) (.cse61 (bvadd .cse60 .cse62 c_~bag2~0)) (.cse63 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse59))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse59) (_ bv2147483647 32)))) (not (bvsle .cse60 (_ bv0 32))) (bvsle .cse61 .cse59) (bvsle .cse61 (bvadd .cse62 .cse63)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse60)) (_ bv18446744071562067968 64)))) (not (bvsle .cse62 (bvadd (_ bv2147483647 32) (bvneg .cse63)))))))) (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 ((.cse67 (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 ((.cse64 (bvadd .cse65 c_~bag2~0)) (.cse66 (bvadd .cse65 .cse67 c_~bag2~0)) (.cse68 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse64))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse64) (_ bv2147483647 32)))) (not (bvsle .cse65 (_ bv0 32))) (bvsle .cse66 .cse64) (bvsle .cse66 (bvadd .cse67 .cse68)) (not (bvsle .cse68 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse65)) (_ 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 ((.cse71 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse69 (bvadd .cse71 c_~bag2~0)) (.cse73 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse72 (bvadd .cse71 .cse73 c_~bag2~0)) (.cse74 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse70 ((_ sign_extend 32) .cse69))) (or (not (bvsle .cse69 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse70)))) (not (bvsle .cse71 (_ bv0 32))) (bvsle .cse72 .cse69) (bvsle .cse72 (bvadd .cse73 .cse74)) (not (bvsle .cse74 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse71)) (_ bv18446744071562067968 64)))) (not (bvsge .cse70 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse73))))))))))) .cse3 .cse4 .cse5 .cse6 .cse23))) (or .cse1 .cse2 (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 ((.cse76 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse77 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse75 (bvadd .cse76 .cse77 c_~bag2~0))) (let ((.cse80 (bvadd .cse76 c_~bag2~0)) (.cse79 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse78 ((_ sign_extend 32) .cse75))) (or (not (bvsle .cse75 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse76)))) (not (bvsle .cse77 (_ bv0 32))) (not (bvsge .cse78 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse79))))) (not (bvsge .cse76 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse80) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse77))))) (= (_ bv2147483647 32) .cse80) (not (bvsle .cse75 (bvadd (_ bv2147483647 32) (bvneg .cse79)))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse78))))))))) (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 ((.cse82 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse81 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse83 (bvadd .cse81 c_~bag2~0)) (.cse84 (bvadd .cse81 .cse82 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse81)))) (not (bvsle .cse82 (_ bv0 32))) (not (bvsge .cse81 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse83) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse82))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse84)))) (= (_ bv2147483647 32) .cse83) (not (bvsle .cse84 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse84)))))))))) .cse6 .cse23) (or .cse3 .cse4 .cse5 .cse6 .cse23 (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 ((.cse85 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse86 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse87 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse88 (bvadd .cse85 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse85)))) (not (bvsle .cse86 (_ bv0 32))) (not (bvsle .cse87 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse85 .cse87 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse86))))) (not (bvsge .cse85 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse88) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse87))))) (= (_ bv2147483647 32) .cse88))))) (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 ((.cse90 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse89 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse93 (bvadd .cse89 c_~bag2~0)) (.cse91 (bvadd .cse89 .cse90 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 .cse89)))) (not (bvsle .cse90 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse91) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse92))))) (not (bvsge .cse89 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse93) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse90))))) (= (_ bv2147483647 32) (bvadd .cse89 .cse90 c_~bag2~0 .cse92)) (= (_ bv2147483647 32) .cse93) (not (bvsle .cse91 (bvadd (_ bv2147483647 32) (bvneg .cse92)))))))))) (or .cse3 .cse4 .cse5 .cse6 (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_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse95 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse96 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse97 (bvadd .cse94 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse94)))) (not (bvsle .cse95 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse94)) (_ bv18446744071562067968 64)))) (not (bvsle .cse96 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse94 .cse96 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse95))))) (not (bvsge ((_ sign_extend 32) .cse97) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse96))))) (= (_ bv2147483647 32) .cse97))))) (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 ((.cse99 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse98 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse102 (bvadd .cse98 c_~bag2~0)) (.cse100 (bvadd .cse98 .cse99 c_~bag2~0)) (.cse101 (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 .cse98)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse98)) (_ bv18446744071562067968 64)))) (not (bvsle .cse99 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse100) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse101))))) (not (bvsge ((_ sign_extend 32) .cse102) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse99))))) (= (_ bv2147483647 32) (bvadd .cse98 .cse99 c_~bag2~0 .cse101)) (= (_ bv2147483647 32) .cse102) (not (bvsle .cse100 (bvadd (_ bv2147483647 32) (bvneg .cse101))))))))) .cse23) (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 ((.cse104 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse108 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse103 (bvadd .cse104 .cse108 c_~bag2~0))) (let ((.cse107 (bvadd .cse104 c_~bag2~0)) (.cse106 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse105 ((_ sign_extend 32) .cse103))) (or (not (bvsle .cse103 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse104)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse104)) (_ bv18446744071562067968 64)))) (not (bvsge .cse105 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse106))))) (not (bvsle .cse107 (bvadd (_ bv2147483647 32) (bvneg .cse108)))) (not (bvsge ((_ sign_extend 32) .cse107) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse108))))) (not (bvsle .cse103 (bvadd (_ bv2147483647 32) (bvneg .cse106)))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse105))))))))) (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 ((.cse112 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse109 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse111 (bvadd .cse109 c_~bag2~0)) (.cse110 (bvadd .cse109 .cse112 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse109)))) (= (_ bv2147483647 32) .cse110) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse109)) (_ bv18446744071562067968 64)))) (not (bvsle .cse111 (bvadd (_ bv2147483647 32) (bvneg .cse112)))) (not (bvsge ((_ sign_extend 32) .cse111) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse112))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse110)))) (not (bvsle .cse110 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse110)))))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (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 ((.cse116 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse113 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse115 (bvadd .cse113 c_~bag2~0)) (.cse114 (bvadd .cse113 .cse116 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse113)))) (= (_ bv2147483647 32) .cse114) (not (bvsle .cse115 (bvadd (_ bv2147483647 32) (bvneg .cse116)))) (not (bvsge .cse113 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse115) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse116))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse114)))) (not (bvsle .cse114 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse8 (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 ((.cse118 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse122 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse117 (bvadd .cse118 .cse122 c_~bag2~0))) (let ((.cse121 (bvadd .cse118 c_~bag2~0)) (.cse120 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse119 ((_ sign_extend 32) .cse117))) (or (not (bvsle .cse117 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse118)))) (not (bvsge .cse119 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse120))))) (not (bvsle .cse121 (bvadd (_ bv2147483647 32) (bvneg .cse122)))) (not (bvsge .cse118 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse121) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse122))))) (not (bvsle .cse117 (bvadd (_ bv2147483647 32) (bvneg .cse120)))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse119)))))))))) .cse6 .cse23) (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse127 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse123 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse126 (bvadd .cse123 c_~bag2~0)) (.cse124 (bvadd .cse123 .cse127 c_~bag2~0)) (.cse125 (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 .cse123)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse123)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse124) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse125))))) (not (bvsle .cse126 (bvadd (_ bv2147483647 32) (bvneg .cse127)))) (not (bvsge ((_ sign_extend 32) .cse126) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse127))))) (= (_ bv2147483647 32) (bvadd .cse123 .cse127 c_~bag2~0 .cse125)) (not (bvsle .cse124 (bvadd (_ bv2147483647 32) (bvneg .cse125)))))))) (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 ((.cse128 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse132 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse129 (bvadd .cse128 .cse132 c_~bag2~0)) (.cse130 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse131 (bvadd .cse128 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse128)))) (= (_ bv2147483647 32) .cse129) (not (bvsle .cse130 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse128)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse129) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse130))))) (not (bvsle .cse131 (bvadd (_ bv2147483647 32) (bvneg .cse132)))) (not (bvsge ((_ sign_extend 32) .cse131) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse132)))))))))) .cse23) (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 ((.cse134 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse133 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse135 (bvadd .cse133 c_~bag2~0)) (.cse136 (bvadd .cse133 .cse134 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse133)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse133)) (_ bv18446744071562067968 64)))) (not (bvsle .cse134 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse135) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse134))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse136)))) (= (_ bv2147483647 32) .cse135) (not (bvsle .cse136 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse136))))))))) (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)) (.cse139 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse137 (bvadd .cse138 .cse139 c_~bag2~0))) (let ((.cse142 (bvadd .cse138 c_~bag2~0)) (.cse141 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse140 ((_ sign_extend 32) .cse137))) (or (not (bvsle .cse137 (_ bv0 32))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse138)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse138)) (_ bv18446744071562067968 64)))) (not (bvsle .cse139 (_ bv0 32))) (not (bvsge .cse140 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse141))))) (not (bvsge ((_ sign_extend 32) .cse142) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse139))))) (= (_ bv2147483647 32) .cse142) (not (bvsle .cse137 (bvadd (_ bv2147483647 32) (bvneg .cse141)))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse140)))))))))) .cse6 .cse23) (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse143 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse147 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse144 (bvadd .cse143 .cse147 c_~bag2~0)) (.cse145 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse146 (bvadd .cse143 c_~bag2~0))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse143)))) (= (_ bv2147483647 32) .cse144) (not (bvsle .cse145 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse144) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse145))))) (not (bvsle .cse146 (bvadd (_ bv2147483647 32) (bvneg .cse147)))) (not (bvsge .cse143 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse146) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse147))))))))) (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 ((.cse152 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse148 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse151 (bvadd .cse148 c_~bag2~0)) (.cse149 (bvadd .cse148 .cse152 c_~bag2~0)) (.cse150 (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 .cse148)))) (not (bvsge ((_ sign_extend 32) .cse149) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse150))))) (not (bvsle .cse151 (bvadd (_ bv2147483647 32) (bvneg .cse152)))) (not (bvsge .cse148 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse151) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse152))))) (= (_ bv2147483647 32) (bvadd .cse148 .cse152 c_~bag2~0 .cse150)) (not (bvsle .cse149 (bvadd (_ bv2147483647 32) (bvneg .cse150))))))))) .cse23))) (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 ((.cse155 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse153 (bvadd .cse155 c_~bag2~0)) (.cse157 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse156 (bvadd .cse155 .cse157 c_~bag2~0)) (.cse158 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse154 ((_ sign_extend 32) .cse153))) (or (not (bvsle .cse153 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse154)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse155)))) (bvsle .cse156 .cse153) (bvsle .cse156 (bvadd .cse157 .cse158)) (not (bvsle .cse158 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse155)) (_ bv18446744071562067968 64)))) (not (bvsge .cse154 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse157)))))))))) (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 ((.cse162 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse160 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse159 (bvadd .cse160 c_~bag2~0)) (.cse161 (bvadd .cse160 .cse162 c_~bag2~0)) (.cse163 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse159))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse159) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse160)))) (bvsle .cse161 .cse159) (bvsle .cse161 (bvadd .cse162 .cse163)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse160)) (_ bv18446744071562067968 64)))) (not (bvsle .cse162 (bvadd (_ bv2147483647 32) (bvneg .cse163)))))))) (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 ((.cse167 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse165 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse164 (bvadd .cse165 c_~bag2~0)) (.cse166 (bvadd .cse165 .cse167 c_~bag2~0)) (.cse168 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse164))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse164) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse165)))) (bvsle .cse166 .cse164) (bvsle .cse166 (bvadd .cse167 .cse168)) (not (bvsle .cse168 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse165)) (_ 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 ((.cse171 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse169 (bvadd .cse171 c_~bag2~0))) (let ((.cse173 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse170 ((_ sign_extend 32) .cse169)) (.cse172 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse169 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse170)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse171)))) (bvsle (bvadd .cse171 .cse172 c_~bag2~0) (bvadd .cse172 .cse173)) (not (bvsle .cse172 (bvadd (_ bv2147483647 32) (bvneg .cse173)))) (not (bvsge .cse170 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse172))))))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse174 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse174 (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 ((.cse176 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse175 (bvadd .cse176 c_~bag2~0))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse175))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse175) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse176)))) (bvsle (bvadd .cse176 .cse174 c_~bag2~0) .cse175) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse176)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse176 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .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 ((.cse177 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse177 (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 ((.cse180 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse178 (bvadd .cse180 c_~bag2~0))) (let ((.cse179 ((_ sign_extend 32) .cse178))) (or (not (bvsle .cse178 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse179)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse180)))) (bvsle (bvadd .cse180 .cse177 c_~bag2~0) .cse178) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse180)) (_ bv18446744071562067968 64)))) (not (bvsge .cse179 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse177))))) (not (bvsle (bvadd .cse180 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse177)))))))))))) (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 ((.cse182 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse181 (bvadd .cse182 c_~bag2~0)) (.cse183 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse181))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse181) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse182)))) (bvsle (bvadd .cse182 .cse183 c_~bag2~0) .cse181) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse182)) (_ bv18446744071562067968 64)))) (not (bvsle (bvadd .cse182 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse183)))))))) (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 ((.cse186 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse184 (bvadd .cse186 c_~bag2~0))) (let ((.cse185 ((_ sign_extend 32) .cse184)) (.cse187 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse184 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse185)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse186)))) (bvsle (bvadd .cse186 .cse187 c_~bag2~0) .cse184) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse186)) (_ bv18446744071562067968 64)))) (not (bvsge .cse185 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse187))))) (not (bvsle (bvadd .cse186 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse187)))))))))) .cse23) (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 ((.cse188 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse188 (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 ((.cse191 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse189 (bvadd .cse191 c_~bag2~0))) (let ((.cse190 ((_ sign_extend 32) .cse189))) (or (not (bvsle .cse189 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse190)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse191)))) (bvsle (bvadd .cse191 .cse188 c_~bag2~0) .cse189) (not (bvsge .cse191 (_ bv0 32))) (not (bvsge .cse190 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse188))))) (not (bvsle (bvadd .cse191 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse188)))))))))))) (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 ((.cse192 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse192 (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 ((.cse194 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse193 (bvadd .cse194 c_~bag2~0))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse193))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse193) (_ bv2147483647 32)))) (bvsle (bvadd .cse194 .cse192 c_~bag2~0) .cse193) (not (bvsge .cse194 (_ bv0 32))) (not (bvsle (bvadd .cse194 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse192))))))))))) (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 ((.cse196 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse195 (bvadd .cse196 c_~bag2~0)) (.cse197 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse195))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse195) (_ bv2147483647 32)))) (bvsle (bvadd .cse196 .cse197 c_~bag2~0) .cse195) (not (bvsge .cse196 (_ bv0 32))) (not (bvsle (bvadd .cse196 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse197)))))))) (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 ((.cse200 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse198 (bvadd .cse200 c_~bag2~0))) (let ((.cse199 ((_ sign_extend 32) .cse198)) (.cse201 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse198 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse199)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse200)))) (bvsle (bvadd .cse200 .cse201 c_~bag2~0) .cse198) (not (bvsge .cse200 (_ bv0 32))) (not (bvsge .cse199 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse201))))) (not (bvsle (bvadd .cse200 c_~bag2~0 c_~sum2~0) (bvadd (_ bv2147483647 32) (bvneg .cse201)))))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (or (and (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse202 (_ 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 ((.cse205 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse203 (bvadd .cse205 c_~bag2~0)) (.cse207 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse206 (bvadd .cse205 .cse207 c_~bag2~0)) (.cse204 ((_ sign_extend 32) .cse203))) (or (not (bvsle .cse203 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse204)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse205)))) (bvsle .cse206 .cse203) (bvsle .cse206 (bvadd .cse207 .cse202)) (not (bvsge .cse205 (_ bv0 32))) (not (bvsge .cse204 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse207))))))))))))) (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 ((.cse211 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse212 (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 ((.cse210 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse208 (bvadd .cse210 c_~bag2~0))) (let ((.cse209 ((_ sign_extend 32) .cse208))) (or (not (bvsle .cse208 (_ bv0 32))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse209)))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse210)))) (bvsle (bvadd .cse210 .cse211 c_~bag2~0) (bvadd .cse211 .cse212)) (not (bvsge .cse209 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse211)))))))))) (not (bvsle .cse211 (bvadd (_ bv2147483647 32) (bvneg .cse212))))))) (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 ((.cse214 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse213 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse213 (bvadd (_ bv2147483647 32) (bvneg .cse214)))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse217 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse215 (bvadd .cse217 c_~bag2~0)) (.cse216 (bvadd .cse217 .cse213 c_~bag2~0))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse215))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse215) (_ bv2147483647 32)))) (bvsle .cse216 .cse215) (bvsle .cse216 (bvadd .cse213 .cse214)) (not (bvsge .cse217 (_ bv0 32)))))))))) (forall ((v_arrayElimCell_80 (_ BitVec 8)) (v_arrayElimCell_72 (_ BitVec 8)) (v_arrayElimCell_71 (_ BitVec 8)) (v_arrayElimCell_74 (_ BitVec 8))) (let ((.cse218 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse218 (_ 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 ((.cse221 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse222 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse219 (bvadd .cse222 c_~bag2~0)) (.cse220 (bvadd .cse222 .cse221 c_~bag2~0))) (or (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse219))))) (not (bvsle c_~sum2~0 (bvadd (bvneg .cse219) (_ bv2147483647 32)))) (bvsle .cse220 .cse219) (bvsle .cse220 (bvadd .cse221 .cse218)) (not (bvsge .cse222 (_ bv0 32))))))))))) .cse3 .cse4 .cse5 .cse6 .cse23)) .cse2) (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 ((.cse224 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse228 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse223 (bvadd .cse224 .cse228 c_~bag2~0))) (let ((.cse227 (bvadd .cse224 c_~bag2~0)) (.cse226 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse225 ((_ sign_extend 32) .cse223))) (or (not (bvsle .cse223 (_ bv0 32))) (not (bvsle .cse224 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse224)) (_ bv18446744071562067968 64)))) (not (bvsge .cse225 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse226))))) (not (bvsle .cse227 (bvadd (_ bv2147483647 32) (bvneg .cse228)))) (not (bvsge ((_ sign_extend 32) .cse227) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse228))))) (not (bvsle .cse223 (bvadd (_ bv2147483647 32) (bvneg .cse226)))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse225))))))))) (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 ((.cse232 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse229 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse231 (bvadd .cse229 c_~bag2~0)) (.cse230 (bvadd .cse229 .cse232 c_~bag2~0))) (or (not (bvsle .cse229 (_ bv0 32))) (= (_ bv2147483647 32) .cse230) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse229)) (_ bv18446744071562067968 64)))) (not (bvsle .cse231 (bvadd (_ bv2147483647 32) (bvneg .cse232)))) (not (bvsge ((_ sign_extend 32) .cse231) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse232))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse230)))) (not (bvsle .cse230 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse230)))))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (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 ((.cse234 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse235 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse233 (bvadd .cse234 .cse235 c_~bag2~0))) (let ((.cse238 (bvadd .cse234 c_~bag2~0)) (.cse237 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse236 ((_ sign_extend 32) .cse233))) (or (not (bvsle .cse233 (_ bv0 32))) (not (bvsle .cse234 (_ bv0 32))) (not (bvsle .cse235 (_ bv0 32))) (not (bvsge .cse236 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse237))))) (not (bvsge .cse234 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse238) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse235))))) (= (_ bv2147483647 32) .cse238) (not (bvsle .cse233 (bvadd (_ bv2147483647 32) (bvneg .cse237)))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse236))))))))) (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 ((.cse240 (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 ((.cse241 (bvadd .cse239 c_~bag2~0)) (.cse242 (bvadd .cse239 .cse240 c_~bag2~0))) (or (not (bvsle .cse239 (_ bv0 32))) (not (bvsle .cse240 (_ bv0 32))) (not (bvsge .cse239 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse241) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse240))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse242)))) (= (_ bv2147483647 32) .cse241) (not (bvsle .cse242 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse242)))))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (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 ((.cse243 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse245 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse246 (bvadd .cse243 c_~bag2~0))) (or (not (bvsle .cse243 (_ bv0 32))) (not (bvsle .cse244 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse243)) (_ bv18446744071562067968 64)))) (not (bvsle .cse245 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse243 .cse245 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse244))))) (not (bvsge ((_ sign_extend 32) .cse246) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse245))))) (= (_ bv2147483647 32) .cse246))))) (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 ((.cse248 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse247 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse251 (bvadd .cse247 c_~bag2~0)) (.cse249 (bvadd .cse247 .cse248 c_~bag2~0)) (.cse250 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse247 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse247)) (_ bv18446744071562067968 64)))) (not (bvsle .cse248 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse249) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse250))))) (not (bvsge ((_ sign_extend 32) .cse251) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse248))))) (= (_ bv2147483647 32) (bvadd .cse247 .cse248 c_~bag2~0 .cse250)) (= (_ bv2147483647 32) .cse251) (not (bvsle .cse249 (bvadd (_ bv2147483647 32) (bvneg .cse250))))))))) .cse6 .cse23) (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 ((.cse253 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse252 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse254 (bvadd .cse252 c_~bag2~0)) (.cse255 (bvadd .cse252 .cse253 c_~bag2~0))) (or (not (bvsle .cse252 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse252)) (_ bv18446744071562067968 64)))) (not (bvsle .cse253 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse254) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse253))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse255)))) (= (_ bv2147483647 32) .cse254) (not (bvsle .cse255 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse255))))))))) (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 ((.cse257 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse258 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse256 (bvadd .cse257 .cse258 c_~bag2~0))) (let ((.cse261 (bvadd .cse257 c_~bag2~0)) (.cse260 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse259 ((_ sign_extend 32) .cse256))) (or (not (bvsle .cse256 (_ bv0 32))) (not (bvsle .cse257 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse257)) (_ bv18446744071562067968 64)))) (not (bvsle .cse258 (_ bv0 32))) (not (bvsge .cse259 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse260))))) (not (bvsge ((_ sign_extend 32) .cse261) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse258))))) (= (_ bv2147483647 32) .cse261) (not (bvsle .cse256 (bvadd (_ bv2147483647 32) (bvneg .cse260)))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse259)))))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse262 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse266 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse263 (bvadd .cse262 .cse266 c_~bag2~0)) (.cse264 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse265 (bvadd .cse262 c_~bag2~0))) (or (not (bvsle .cse262 (_ bv0 32))) (= (_ bv2147483647 32) .cse263) (not (bvsle .cse264 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse263) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse264))))) (not (bvsle .cse265 (bvadd (_ bv2147483647 32) (bvneg .cse266)))) (not (bvsge .cse262 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse265) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse266))))))))) (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 ((.cse271 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse267 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse270 (bvadd .cse267 c_~bag2~0)) (.cse268 (bvadd .cse267 .cse271 c_~bag2~0)) (.cse269 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse267 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse268) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse269))))) (not (bvsle .cse270 (bvadd (_ bv2147483647 32) (bvneg .cse271)))) (not (bvsge .cse267 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse270) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse271))))) (= (_ bv2147483647 32) (bvadd .cse267 .cse271 c_~bag2~0 .cse269)) (not (bvsle .cse268 (bvadd (_ bv2147483647 32) (bvneg .cse269))))))))) .cse23) (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse276 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse272 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse275 (bvadd .cse272 c_~bag2~0)) (.cse273 (bvadd .cse272 .cse276 c_~bag2~0)) (.cse274 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse272 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse272)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse273) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse274))))) (not (bvsle .cse275 (bvadd (_ bv2147483647 32) (bvneg .cse276)))) (not (bvsge ((_ sign_extend 32) .cse275) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse276))))) (= (_ bv2147483647 32) (bvadd .cse272 .cse276 c_~bag2~0 .cse274)) (not (bvsle .cse273 (bvadd (_ bv2147483647 32) (bvneg .cse274)))))))) (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 ((.cse277 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse281 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse278 (bvadd .cse277 .cse281 c_~bag2~0)) (.cse279 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse280 (bvadd .cse277 c_~bag2~0))) (or (not (bvsle .cse277 (_ bv0 32))) (= (_ bv2147483647 32) .cse278) (not (bvsle .cse279 (_ bv0 32))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse277)) (_ bv18446744071562067968 64)))) (not (bvsge ((_ sign_extend 32) .cse278) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse279))))) (not (bvsle .cse280 (bvadd (_ bv2147483647 32) (bvneg .cse281)))) (not (bvsge ((_ sign_extend 32) .cse280) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse281)))))))))) .cse23) (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse283 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse287 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse282 (bvadd .cse283 .cse287 c_~bag2~0))) (let ((.cse286 (bvadd .cse283 c_~bag2~0)) (.cse285 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse284 ((_ sign_extend 32) .cse282))) (or (not (bvsle .cse282 (_ bv0 32))) (not (bvsle .cse283 (_ bv0 32))) (not (bvsge .cse284 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse285))))) (not (bvsle .cse286 (bvadd (_ bv2147483647 32) (bvneg .cse287)))) (not (bvsge .cse283 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse286) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse287))))) (not (bvsle .cse282 (bvadd (_ bv2147483647 32) (bvneg .cse285)))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse284))))))))) (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 ((.cse291 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse288 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse290 (bvadd .cse288 c_~bag2~0)) (.cse289 (bvadd .cse288 .cse291 c_~bag2~0))) (or (not (bvsle .cse288 (_ bv0 32))) (= (_ bv2147483647 32) .cse289) (not (bvsle .cse290 (bvadd (_ bv2147483647 32) (bvneg .cse291)))) (not (bvsge .cse288 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse290) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse291))))) (not (bvsle c_~sum2~0 (bvadd (_ bv2147483647 32) (bvneg .cse289)))) (not (bvsle .cse289 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse289)))))))))) .cse23) (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 ((.cse292 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse293 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse294 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse295 (bvadd .cse292 c_~bag2~0))) (or (not (bvsle .cse292 (_ bv0 32))) (not (bvsle .cse293 (_ bv0 32))) (not (bvsle .cse294 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse292 .cse294 c_~bag2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse293))))) (not (bvsge .cse292 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse295) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse294))))) (= (_ bv2147483647 32) .cse295))))) (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 ((.cse297 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse296 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse300 (bvadd .cse296 c_~bag2~0)) (.cse298 (bvadd .cse296 .cse297 c_~bag2~0)) (.cse299 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse296 (_ bv0 32))) (not (bvsle .cse297 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse298) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse299))))) (not (bvsge .cse296 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse300) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse297))))) (= (_ bv2147483647 32) (bvadd .cse296 .cse297 c_~bag2~0 .cse299)) (= (_ bv2147483647 32) .cse300) (not (bvsle .cse298 (bvadd (_ bv2147483647 32) (bvneg .cse299))))))))) .cse3 .cse4 .cse5 .cse6 .cse23)) .cse2)) .cse301) (or (let ((.cse306 (bvadd c_~bag2~0 c_~sum2~0))) (let ((.cse323 ((_ sign_extend 32) .cse306))) (and (or .cse1 .cse2 (and (or .cse3 .cse4 .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 ((.cse302 (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 .cse302)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse302)) (_ 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 ((.cse304 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse303 (bvadd .cse302 .cse304))) (or (bvsle (bvadd .cse302 c_~bag2~0) .cse303) (not (bvsle .cse303 (_ bv0 32))) (not (bvsle .cse303 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse302 (bvadd (_ bv2147483647 32) (bvneg .cse304))))))))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse305 (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 .cse305)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse305)) (_ 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 ((.cse308 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse307 (bvadd .cse305 .cse308))) (or (not (bvsle .cse306 (bvadd (bvneg .cse307) (_ bv2147483647 32)))) (bvsle (bvadd .cse305 c_~bag2~0) .cse307) (not (bvsle .cse307 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse305 (bvadd (_ bv2147483647 32) (bvneg .cse308)))))))))))) .cse23) (or .cse3 .cse4 .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 ((.cse309 (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 ((.cse311 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse310 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (bvsle (bvadd .cse309 c_~bag2~0) (bvadd .cse309 .cse310 .cse311)) (not (bvsle (bvadd .cse309 .cse310) (bvadd (_ bv2147483647 32) (bvneg .cse311)))) (not (bvsle .cse309 (bvadd (_ bv2147483647 32) (bvneg .cse310))))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse309)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse309)) (_ 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 ((.cse312 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse313 (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 .cse312)))) (bvsle (bvadd .cse312 c_~bag2~0) (bvadd .cse312 .cse313)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse312)) (_ bv18446744071562067968 64)))) (not (bvsle .cse312 (bvadd (_ bv2147483647 32) (bvneg .cse313)))))))) .cse23) (or .cse3 .cse4 .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 ((.cse314 (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 ((.cse317 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse315 (bvadd .cse314 .cse317)) (.cse316 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (bvsle (bvadd .cse314 c_~bag2~0) .cse315) (not (bvsle .cse316 (_ bv0 32))) (not (bvsle .cse317 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse315) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse316))))))))) (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse314)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse314)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_75 (_ 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))) (or (not (bvsle c_~bag2~0 (bvadd (_ bv2147483647 32) (bvneg .cse318)))) (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 ((.cse319 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse320 (bvadd .cse318 .cse319)) (.cse321 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse319 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse320) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse321))))) (bvsle (bvadd .cse318 c_~bag2~0) (bvadd .cse318 .cse319 .cse321)) (not (bvsle .cse320 (bvadd (_ bv2147483647 32) (bvneg .cse321)))))))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse318)) (_ bv18446744071562067968 64)))))))) .cse23) (or .cse3 .cse4 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse322 (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 .cse322)))) (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 ((.cse325 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse324 (bvadd .cse322 .cse325))) (or (not (bvsge .cse323 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse324))))) (not (bvsle .cse306 (bvadd (bvneg .cse324) (_ bv2147483647 32)))) (bvsle (bvadd .cse322 c_~bag2~0) .cse324) (not (bvsle .cse325 (_ bv0 32))) (not (bvsle .cse324 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))))))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse322)) (_ bv18446744071562067968 64))))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse326 (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 .cse326)))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse326)) (_ 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 ((.cse329 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse328 (bvadd .cse326 .cse329))) (let ((.cse327 ((_ sign_extend 32) .cse328)) (.cse330 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse323 (bvadd (_ bv18446744071562067968 64) (bvneg .cse327)))) (bvsle (bvadd .cse326 c_~bag2~0) .cse328) (not (bvsle .cse328 (_ bv0 32))) (not (bvsle .cse329 (_ bv0 32))) (not (bvsge .cse327 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse330))))) (not (bvsle .cse328 (bvadd (_ bv2147483647 32) (bvneg .cse330))))))))))))) .cse5 .cse6 .cse23))) (or .cse1 .cse2 (and (or .cse3 .cse4 .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 ((.cse335 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse331 (bvadd (_ bv2147483647 32) (bvneg .cse335)))) (or (not (bvsle c_~bag2~0 .cse331)) (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 ((.cse334 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse333 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse332 ((_ sign_extend 32) .cse334))) (or (not (bvsge .cse332 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse333))))) (not (bvsle .cse334 (bvadd (_ bv2147483647 32) (bvneg .cse333)))) (not (bvsle .cse334 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse335 c_~bag2~0 c_~sum2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg .cse332)))))))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse335)) (_ bv18446744071562067968 64)))) (not (bvsle .cse306 .cse331)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse337 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse336 (bvadd (_ bv2147483647 32) (bvneg .cse337)))) (or (not (bvsle c_~bag2~0 .cse336)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse337)) (_ bv18446744071562067968 64)))) (not (bvsle .cse306 .cse336)) (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 ((.cse340 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse339 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse338 ((_ sign_extend 32) .cse340))) (or (not (bvsge .cse338 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse339))))) (not (bvsle .cse339 (_ bv0 32))) (not (bvsle .cse340 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse337 c_~bag2~0 c_~sum2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg .cse338))))))))))))) .cse23) (or (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse341 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse345 (bvadd (_ bv2147483647 32) (bvneg .cse341)))) (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 ((.cse343 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse344 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse342 (bvadd .cse343 .cse344))) (or (bvsle (bvadd .cse341 c_~bag2~0) .cse342) (not (bvsle .cse343 (bvadd (_ bv2147483647 32) (bvneg .cse344)))) (not (bvsle .cse343 (_ bv0 32))) (bvsle (bvadd .cse341 .cse343) .cse342))))) (not (bvsle c_~bag2~0 .cse345)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse341)) (_ bv18446744071562067968 64)))) (not (bvsle .cse306 .cse345)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse347 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse346 (bvadd (_ bv2147483647 32) (bvneg .cse347)))) (or (not (bvsle c_~bag2~0 .cse346)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse347)) (_ 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 ((.cse350 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse349 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse348 (bvadd .cse350 .cse349))) (or (bvsle (bvadd .cse347 c_~bag2~0) .cse348) (not (bvsle .cse349 (_ bv0 32))) (not (bvsle .cse350 (_ bv0 32))) (bvsle (bvadd .cse347 .cse350) .cse348))))) (not (bvsle .cse306 .cse346))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (or .cse3 .cse4 .cse5 (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse353 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse351 (bvadd (_ bv2147483647 32) (bvneg .cse353)))) (or (not (bvsle c_~bag2~0 .cse351)) (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 ((.cse352 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse352 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse352 (_ bv0 32))) (not (bvsle .cse353 (bvadd (_ bv2147483647 32) (bvneg .cse352))))))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse353)) (_ bv18446744071562067968 64)))) (not (bvsle .cse306 .cse351)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse355 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse354 (bvadd (_ bv2147483647 32) (bvneg .cse355)))) (or (not (bvsle c_~bag2~0 .cse354)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse355)) (_ bv18446744071562067968 64)))) (not (bvsle .cse306 .cse354)) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse356 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (not (bvsle .cse356 (_ bv0 32))) (not (bvsle .cse355 (bvadd (_ bv2147483647 32) (bvneg .cse356))))))))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse358 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse357 (bvadd (_ bv2147483647 32) (bvneg .cse358)))) (or (not (bvsle c_~bag2~0 .cse357)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse358)) (_ bv18446744071562067968 64)))) (forall ((v_arrayElimCell_76 (_ BitVec 8)) (v_arrayElimCell_78 (_ BitVec 8)) (v_arrayElimCell_77 (_ BitVec 8)) (v_arrayElimCell_79 (_ BitVec 8))) (let ((.cse359 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))))) (or (not (bvsle .cse358 .cse359)) (not (bvsle (bvadd .cse358 c_~bag2~0 c_~sum2~0) .cse359))))) (not (bvsle .cse306 .cse357)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse361 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse363 (bvadd (_ bv2147483647 32) (bvneg .cse361)))) (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 ((.cse360 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse362 (bvadd (_ bv2147483647 32) (bvneg .cse360)))) (or (not (bvsle .cse360 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse361 .cse362)) (not (bvsle (bvadd .cse361 c_~bag2~0 c_~sum2~0) .cse362)))))) (not (bvsle c_~bag2~0 .cse363)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse361)) (_ bv18446744071562067968 64)))) (not (bvsle .cse306 .cse363))))))) .cse6 .cse23) (or .cse3 .cse4 .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 ((.cse365 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse364 (bvadd (_ bv2147483647 32) (bvneg .cse365)))) (or (not (bvsle c_~bag2~0 .cse364)) (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 ((.cse368 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse367 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse366 (bvadd .cse368 .cse367))) (or (bvsle (bvadd .cse365 c_~bag2~0) .cse366) (not (bvsle .cse367 (_ bv0 32))) (not (bvsle .cse365 (bvadd (_ bv2147483647 32) (bvneg .cse368)))) (bvsle (bvadd .cse365 .cse368) .cse366))))) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse365)) (_ bv18446744071562067968 64)))) (not (bvsle .cse306 .cse364)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse370 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (let ((.cse369 (bvadd (_ bv2147483647 32) (bvneg .cse370)))) (or (not (bvsle c_~bag2~0 .cse369)) (not (bvsge .cse12 (bvadd (bvneg ((_ sign_extend 32) .cse370)) (_ 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 ((.cse372 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse373 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse371 (bvadd .cse372 .cse373))) (or (bvsle (bvadd .cse370 c_~bag2~0) .cse371) (not (bvsle .cse372 (bvadd (_ bv2147483647 32) (bvneg .cse373)))) (not (bvsle .cse370 (bvadd (_ bv2147483647 32) (bvneg .cse372)))) (bvsle (bvadd .cse370 .cse372) .cse371))))) (not (bvsle .cse306 .cse369))))))) .cse23))) (or .cse1 .cse2 (and (or .cse3 .cse4 .cse5 .cse6 .cse23) (or (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse374 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse374 (_ 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 ((.cse377 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse376 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse375 ((_ sign_extend 32) .cse377))) (or (not (bvsge .cse375 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse376))))) (not (bvsle .cse377 (bvadd (_ bv2147483647 32) (bvneg .cse376)))) (not (bvsle .cse377 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse374 c_~bag2~0 c_~sum2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg .cse375)))))))) (not (bvsge .cse374 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse378 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse378 (_ bv0 32))) (not (bvsge .cse378 (_ 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 ((.cse381 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse380 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse379 ((_ sign_extend 32) .cse381))) (or (not (bvsge .cse379 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse380))))) (not (bvsle .cse380 (_ bv0 32))) (not (bvsle .cse381 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) (bvadd .cse378 c_~bag2~0 c_~sum2~0)) (bvadd (_ bv18446744071562067968 64) (bvneg .cse379)))))))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse385 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse384 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (let ((.cse382 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse383 (bvadd .cse385 .cse384))) (or (bvsle (bvadd .cse382 c_~bag2~0) .cse383) (not (bvsle .cse382 (_ bv0 32))) (not (bvsle .cse384 (_ bv0 32))) (not (bvsle .cse382 (bvadd (_ bv2147483647 32) (bvneg .cse385)))) (not (bvsge .cse382 (_ bv0 32))) (bvsle (bvadd .cse382 .cse385) .cse383))))) .cse23) (or .cse3 .cse4 .cse5 (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 ((.cse388 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse386 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82)) (.cse387 (bvadd .cse388 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)))) (or (bvsle (bvadd .cse386 c_~bag2~0) .cse387) (not (bvsle .cse386 (_ bv0 32))) (not (bvsle .cse388 (_ bv0 32))) (not (bvsge .cse386 (_ bv0 32))) (bvsle (bvadd .cse386 .cse388) .cse387))))) .cse6 .cse23))) (or .cse1 .cse2 (and (or .cse3 .cse4 .cse5 .cse6 (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 ((.cse390 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77)) (.cse389 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse389 (_ bv0 32))) (bvsle (bvadd .cse389 c_~bag2~0) (bvadd .cse389 .cse390)) (not (bvsle .cse389 (bvadd (_ bv2147483647 32) (bvneg .cse390)))) (not (bvsge .cse389 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse391 (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 ((.cse393 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72)) (.cse392 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (or (bvsle (bvadd .cse391 c_~bag2~0) (bvadd .cse391 .cse392 .cse393)) (not (bvsle (bvadd .cse391 .cse392) (bvadd (_ bv2147483647 32) (bvneg .cse393)))) (not (bvsle .cse391 (bvadd (_ bv2147483647 32) (bvneg .cse392))))))) (not (bvsle .cse391 (_ bv0 32))) (not (bvsge .cse391 (_ bv0 32))))))) .cse23) (or .cse3 .cse4 .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 ((.cse394 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse394 (_ 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 ((.cse396 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse395 (bvadd .cse394 .cse396))) (or (bvsle (bvadd .cse394 c_~bag2~0) .cse395) (not (bvsle .cse395 (_ bv0 32))) (not (bvsle .cse395 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse394 (bvadd (_ bv2147483647 32) (bvneg .cse396)))))))) (not (bvsge .cse394 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse397 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse397 (_ 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 ((.cse399 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse398 (bvadd .cse397 .cse399))) (or (not (bvsle .cse306 (bvadd (bvneg .cse398) (_ bv2147483647 32)))) (bvsle (bvadd .cse397 c_~bag2~0) .cse398) (not (bvsle .cse398 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))) (not (bvsle .cse397 (bvadd (_ bv2147483647 32) (bvneg .cse399)))))))) (not (bvsge .cse397 (_ bv0 32))))))) .cse23) (or (and (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse400 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse400 (_ 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 ((.cse402 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse401 (bvadd .cse400 .cse402))) (or (not (bvsge .cse323 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse401))))) (not (bvsle .cse306 (bvadd (bvneg .cse401) (_ bv2147483647 32)))) (bvsle (bvadd .cse400 c_~bag2~0) .cse401) (not (bvsle .cse402 (_ bv0 32))) (not (bvsle .cse401 (bvadd (_ bv2147483647 32) (bvneg (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))))))))) (not (bvsge .cse400 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse403 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse403 (_ 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 ((.cse406 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse405 (bvadd .cse403 .cse406))) (let ((.cse404 ((_ sign_extend 32) .cse405)) (.cse407 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsge .cse323 (bvadd (_ bv18446744071562067968 64) (bvneg .cse404)))) (bvsle (bvadd .cse403 c_~bag2~0) .cse405) (not (bvsle .cse406 (_ bv0 32))) (not (bvsge .cse404 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse407))))) (not (bvsle .cse405 (bvadd (_ bv2147483647 32) (bvneg .cse407))))))))) (not (bvsge .cse403 (_ bv0 32))))))) .cse3 .cse4 .cse5 .cse6 .cse23) (or .cse3 .cse4 .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 ((.cse408 (concat (concat (concat v_arrayElimCell_73 v_arrayElimCell_75) v_arrayElimCell_81) v_arrayElimCell_82))) (or (not (bvsle .cse408 (_ 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 ((.cse409 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse410 (bvadd .cse408 .cse409)) (.cse411 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (not (bvsle .cse409 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse410) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse411))))) (bvsle (bvadd .cse408 c_~bag2~0) (bvadd .cse408 .cse409 .cse411)) (not (bvsle .cse410 (bvadd (_ bv2147483647 32) (bvneg .cse411)))))))) (not (bvsge .cse408 (_ bv0 32)))))) (forall ((v_arrayElimCell_75 (_ BitVec 8)) (v_arrayElimCell_81 (_ BitVec 8)) (v_arrayElimCell_82 (_ BitVec 8)) (v_arrayElimCell_73 (_ BitVec 8))) (let ((.cse412 (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 ((.cse415 (concat (concat (concat v_arrayElimCell_78 v_arrayElimCell_79) v_arrayElimCell_76) v_arrayElimCell_77))) (let ((.cse413 (bvadd .cse412 .cse415)) (.cse414 (concat (concat (concat v_arrayElimCell_80 v_arrayElimCell_74) v_arrayElimCell_71) v_arrayElimCell_72))) (or (bvsle (bvadd .cse412 c_~bag2~0) .cse413) (not (bvsle .cse414 (_ bv0 32))) (not (bvsle .cse415 (_ bv0 32))) (not (bvsge ((_ sign_extend 32) .cse413) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse414))))))))) (not (bvsle .cse412 (_ bv0 32))) (not (bvsge .cse412 (_ bv0 32))))))) .cse23)))))) .cse0 (not (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse12)))) (and (not (bvsle c_~sum2~0 (bvadd (bvneg c_~bag2~0) (_ bv2147483647 32)))) (not (bvsle c_~bag2~0 (_ bv0 32)))) .cse301))))) is different from true [2023-08-29 23:37:54,882 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