./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS --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 99c42ba3d1f6c70520bbcf0a3136609166f98fb21063bda215f7779ff0bb27ca --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:20:46,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:20:46,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:20:46,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:20:46,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:20:46,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:20:46,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:20:46,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:20:46,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:20:46,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:20:46,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:20:46,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:20:46,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:20:46,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:20:46,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:20:46,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:20:46,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:20:46,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:20:46,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:20:46,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:20:46,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:20:46,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:20:46,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:20:46,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:20:46,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:20:46,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:20:46,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:20:46,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:20:46,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:20:46,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:20:46,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:20:46,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:20:46,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:20:46,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:20:46,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:20:46,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:20:46,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:20:46,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:20:46,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:20:46,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:20:46,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:20:46,450 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 02:20:46,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:20:46,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:20:46,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:20:46,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:20:46,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:20:46,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:20:46,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:20:46,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:20:46,504 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:20:46,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:20:46,504 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:20:46,504 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:20:46,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:20:46,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:20:46,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:20:46,505 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:20:46,505 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:20:46,506 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:20:46,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:20:46,509 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:20:46,510 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:20:46,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:20:46,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:20:46,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:20:46,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:20:46,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:20:46,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:20:46,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:20:46,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:20:46,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:20:46,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:20:46,513 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:20:46,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:20:46,514 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS 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 -> 99c42ba3d1f6c70520bbcf0a3136609166f98fb21063bda215f7779ff0bb27ca [2022-11-23 02:20:46,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:20:46,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:20:46,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:20:46,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:20:46,844 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:20:46,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2022-11-23 02:20:50,020 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:20:50,234 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:20:50,234 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2022-11-23 02:20:50,242 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/data/fd07e9813/9cc6351f3835401889abe33258e62825/FLAGd41c268b5 [2022-11-23 02:20:50,259 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/data/fd07e9813/9cc6351f3835401889abe33258e62825 [2022-11-23 02:20:50,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:20:50,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:20:50,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:20:50,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:20:50,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:20:50,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:20:50" (1/1) ... [2022-11-23 02:20:50,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30aa75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:50, skipping insertion in model container [2022-11-23 02:20:50,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:20:50" (1/1) ... [2022-11-23 02:20:50,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:20:50,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:20:50,528 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c[2474,2487] [2022-11-23 02:20:50,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:20:50,547 ERROR L326 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) [2022-11-23 02:20:50,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@429db45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:50, skipping insertion in model container [2022-11-23 02:20:50,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:20:50,548 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-23 02:20:50,550 INFO L158 Benchmark]: Toolchain (without parser) took 286.64ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 70.6MB in the beginning and 139.2MB in the end (delta: -68.6MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-11-23 02:20:50,551 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory was 103.1MB in the beginning and 103.0MB in the end (delta: 88.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:20:50,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.02ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 70.4MB in the beginning and 139.2MB in the end (delta: -68.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-11-23 02:20:50,553 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.30ms. Allocated memory is still 134.2MB. Free memory was 103.1MB in the beginning and 103.0MB in the end (delta: 88.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.02ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 70.4MB in the beginning and 139.2MB in the end (delta: -68.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 100]: 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS --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 99c42ba3d1f6c70520bbcf0a3136609166f98fb21063bda215f7779ff0bb27ca --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:20:52,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:20:52,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:20:52,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:20:52,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:20:52,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:20:52,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:20:52,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:20:52,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:20:52,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:20:52,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:20:52,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:20:52,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:20:52,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:20:52,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:20:52,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:20:52,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:20:52,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:20:52,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:20:52,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:20:52,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:20:52,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:20:52,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:20:52,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:20:52,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:20:52,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:20:52,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:20:52,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:20:52,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:20:52,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:20:52,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:20:52,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:20:52,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:20:53,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:20:53,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:20:53,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:20:53,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:20:53,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:20:53,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:20:53,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:20:53,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:20:53,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 02:20:53,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:20:53,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:20:53,061 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:20:53,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:20:53,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:20:53,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:20:53,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:20:53,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:20:53,063 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:20:53,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:20:53,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:20:53,065 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:20:53,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:20:53,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:20:53,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:20:53,066 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:20:53,066 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:20:53,066 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:20:53,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:20:53,067 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:20:53,067 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 02:20:53,067 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 02:20:53,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:20:53,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:20:53,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:20:53,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:20:53,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:20:53,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:20:53,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:20:53,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:20:53,069 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 02:20:53,069 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 02:20:53,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:20:53,070 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:20:53,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:20:53,070 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 02:20:53,071 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS 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 -> 99c42ba3d1f6c70520bbcf0a3136609166f98fb21063bda215f7779ff0bb27ca [2022-11-23 02:20:53,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:20:53,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:20:53,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:20:53,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:20:53,481 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:20:53,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2022-11-23 02:20:56,455 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:20:56,754 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:20:56,754 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2022-11-23 02:20:56,761 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/data/2c49fa2a9/e99116b47c2c490e92ace381a5ddb75d/FLAG3085485de [2022-11-23 02:20:56,776 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/data/2c49fa2a9/e99116b47c2c490e92ace381a5ddb75d [2022-11-23 02:20:56,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:20:56,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:20:56,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:20:56,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:20:56,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:20:56,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:20:56" (1/1) ... [2022-11-23 02:20:56,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7613fa92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:56, skipping insertion in model container [2022-11-23 02:20:56,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:20:56" (1/1) ... [2022-11-23 02:20:56,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:20:56,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:20:57,050 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c[2474,2487] [2022-11-23 02:20:57,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:20:57,073 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 02:20:57,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:20:57,090 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c[2474,2487] [2022-11-23 02:20:57,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:20:57,098 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:20:57,120 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c[2474,2487] [2022-11-23 02:20:57,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:20:57,138 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:20:57,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57 WrapperNode [2022-11-23 02:20:57,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:20:57,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:20:57,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:20:57,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:20:57,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,180 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 139 [2022-11-23 02:20:57,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:20:57,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:20:57,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:20:57,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:20:57,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,210 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:20:57,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:20:57,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:20:57,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:20:57,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (1/1) ... [2022-11-23 02:20:57,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:20:57,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:20:57,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:20:57,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:20:57,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:20:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 02:20:57,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:20:57,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 02:20:57,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 02:20:57,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 02:20:57,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 02:20:57,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 02:20:57,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 02:20:57,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:20:57,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:20:57,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:20:57,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 02:20:57,337 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:20:57,485 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:20:57,487 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:20:58,057 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:20:58,066 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:20:58,066 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-23 02:20:58,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:20:58 BoogieIcfgContainer [2022-11-23 02:20:58,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:20:58,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:20:58,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:20:58,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:20:58,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:20:56" (1/3) ... [2022-11-23 02:20:58,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86e6e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:20:58, skipping insertion in model container [2022-11-23 02:20:58,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:20:57" (2/3) ... [2022-11-23 02:20:58,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86e6e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:20:58, skipping insertion in model container [2022-11-23 02:20:58,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:20:58" (3/3) ... [2022-11-23 02:20:58,094 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2022-11-23 02:20:58,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:20:58,122 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-11-23 02:20:58,122 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:20:58,261 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 02:20:58,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 199 transitions, 414 flow [2022-11-23 02:20:58,377 INFO L130 PetriNetUnfolder]: 15/197 cut-off events. [2022-11-23 02:20:58,377 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 02:20:58,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 197 events. 15/197 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 319 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-11-23 02:20:58,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 199 transitions, 414 flow [2022-11-23 02:20:58,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 192 transitions, 396 flow [2022-11-23 02:20:58,396 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:20:58,412 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 192 transitions, 396 flow [2022-11-23 02:20:58,415 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 192 transitions, 396 flow [2022-11-23 02:20:58,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 192 transitions, 396 flow [2022-11-23 02:20:58,461 INFO L130 PetriNetUnfolder]: 15/192 cut-off events. [2022-11-23 02:20:58,462 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 02:20:58,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 192 events. 15/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 319 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-11-23 02:20:58,471 INFO L119 LiptonReduction]: Number of co-enabled transitions 4156 [2022-11-23 02:21:25,314 INFO L134 LiptonReduction]: Checked pairs total: 4168 [2022-11-23 02:21:25,314 INFO L136 LiptonReduction]: Total number of compositions: 222 [2022-11-23 02:21:25,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:21:25,338 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;@56f8a7d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:21:25,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-23 02:21:25,342 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2022-11-23 02:21:25,342 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:21:25,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:25,343 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-11-23 02:21:25,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:25,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash 25300, now seen corresponding path program 1 times [2022-11-23 02:21:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:25,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751245089] [2022-11-23 02:21:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:25,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:25,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:25,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:25,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 02:21:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:25,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:21:25,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:25,678 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-11-23 02:21:25,679 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 [2022-11-23 02:21:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:25,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:21:25,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:25,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751245089] [2022-11-23 02:21:25,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751245089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:21:25,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:21:25,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:21:25,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315626249] [2022-11-23 02:21:25,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:21:25,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:21:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:25,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:21:25,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:21:25,930 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 421 [2022-11-23 02:21:25,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:25,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:25,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 421 [2022-11-23 02:21:25,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:26,383 INFO L130 PetriNetUnfolder]: 540/759 cut-off events. [2022-11-23 02:21:26,384 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-23 02:21:26,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 759 events. 540/759 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 3205 event pairs, 254 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 1329. Up to 754 conditions per place. [2022-11-23 02:21:26,394 INFO L137 encePairwiseOnDemand]: 417/421 looper letters, 30 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2022-11-23 02:21:26,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 140 flow [2022-11-23 02:21:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:21:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:21:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2022-11-23 02:21:26,422 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.447347585114806 [2022-11-23 02:21:26,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2022-11-23 02:21:26,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2022-11-23 02:21:26,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:26,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2022-11-23 02:21:26,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:26,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:26,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:26,452 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 84 flow. Second operand 3 states and 565 transitions. [2022-11-23 02:21:26,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 140 flow [2022-11-23 02:21:26,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 02:21:26,464 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 72 flow [2022-11-23 02:21:26,468 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2022-11-23 02:21:26,475 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2022-11-23 02:21:26,475 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 72 flow [2022-11-23 02:21:26,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:26,476 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:26,477 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-11-23 02:21:26,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:21:26,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:26,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 25402, now seen corresponding path program 1 times [2022-11-23 02:21:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:26,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877404468] [2022-11-23 02:21:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:26,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:26,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:26,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:26,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 02:21:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:26,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 02:21:26,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:26,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:21:26,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:26,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877404468] [2022-11-23 02:21:26,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877404468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:21:26,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:21:26,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:21:26,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746802549] [2022-11-23 02:21:26,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:21:26,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:21:26,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:26,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:21:26,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:21:26,912 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 421 [2022-11-23 02:21:26,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:26,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:26,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 421 [2022-11-23 02:21:26,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:27,350 INFO L130 PetriNetUnfolder]: 540/761 cut-off events. [2022-11-23 02:21:27,350 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-23 02:21:27,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 761 events. 540/761 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 3210 event pairs, 254 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 1521. Up to 755 conditions per place. [2022-11-23 02:21:27,355 INFO L137 encePairwiseOnDemand]: 416/421 looper letters, 31 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-11-23 02:21:27,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 142 flow [2022-11-23 02:21:27,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:21:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:21:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2022-11-23 02:21:27,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45368171021377673 [2022-11-23 02:21:27,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2022-11-23 02:21:27,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2022-11-23 02:21:27,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:27,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2022-11-23 02:21:27,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:27,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:27,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:27,365 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 72 flow. Second operand 3 states and 573 transitions. [2022-11-23 02:21:27,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 142 flow [2022-11-23 02:21:27,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:21:27,367 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 87 flow [2022-11-23 02:21:27,368 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2022-11-23 02:21:27,368 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-11-23 02:21:27,369 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 87 flow [2022-11-23 02:21:27,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:27,370 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:27,370 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-11-23 02:21:27,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:21:27,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:27,582 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:27,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 25301, now seen corresponding path program 1 times [2022-11-23 02:21:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:27,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548684933] [2022-11-23 02:21:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:27,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:27,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:27,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:27,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 02:21:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:27,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 02:21:27,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:27,779 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-11-23 02:21:27,780 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 [2022-11-23 02:21:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:27,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:21:27,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:27,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548684933] [2022-11-23 02:21:27,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548684933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:21:27,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:21:27,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:21:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891901961] [2022-11-23 02:21:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:21:27,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:21:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:21:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:21:28,108 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 421 [2022-11-23 02:21:28,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:28,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:28,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 421 [2022-11-23 02:21:28,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:28,522 INFO L130 PetriNetUnfolder]: 540/760 cut-off events. [2022-11-23 02:21:28,522 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-23 02:21:28,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 760 events. 540/760 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 3276 event pairs, 254 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 1525. Up to 755 conditions per place. [2022-11-23 02:21:28,527 INFO L137 encePairwiseOnDemand]: 418/421 looper letters, 30 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-11-23 02:21:28,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 151 flow [2022-11-23 02:21:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:21:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:21:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2022-11-23 02:21:28,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4489311163895487 [2022-11-23 02:21:28,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2022-11-23 02:21:28,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2022-11-23 02:21:28,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:28,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2022-11-23 02:21:28,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:28,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:28,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:28,536 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 87 flow. Second operand 3 states and 567 transitions. [2022-11-23 02:21:28,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 151 flow [2022-11-23 02:21:28,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 147 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-23 02:21:28,538 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 91 flow [2022-11-23 02:21:28,539 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2022-11-23 02:21:28,539 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2022-11-23 02:21:28,540 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 91 flow [2022-11-23 02:21:28,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:28,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:28,541 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:21:28,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 02:21:28,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:28,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:28,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:28,753 INFO L85 PathProgramCache]: Analyzing trace with hash 787537, now seen corresponding path program 1 times [2022-11-23 02:21:28,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:28,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876219170] [2022-11-23 02:21:28,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:28,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:28,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:28,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:28,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 02:21:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:28,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 02:21:28,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:28,888 INFO L321 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2022-11-23 02:21:28,889 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 29 [2022-11-23 02:21:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:21:28,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:21:28,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:28,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876219170] [2022-11-23 02:21:28,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876219170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:21:28,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:21:28,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:21:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378560380] [2022-11-23 02:21:28,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:21:28,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:21:28,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:28,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:21:28,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:21:29,166 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 421 [2022-11-23 02:21:29,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:29,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:29,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 421 [2022-11-23 02:21:29,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:29,483 INFO L130 PetriNetUnfolder]: 410/589 cut-off events. [2022-11-23 02:21:29,484 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-23 02:21:29,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 589 events. 410/589 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 2458 event pairs, 191 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 1183. Up to 584 conditions per place. [2022-11-23 02:21:29,487 INFO L137 encePairwiseOnDemand]: 418/421 looper letters, 29 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2022-11-23 02:21:29,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 145 flow [2022-11-23 02:21:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:21:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:21:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2022-11-23 02:21:29,490 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.444972288202692 [2022-11-23 02:21:29,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2022-11-23 02:21:29,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2022-11-23 02:21:29,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:29,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2022-11-23 02:21:29,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:29,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:29,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:29,497 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 91 flow. Second operand 3 states and 562 transitions. [2022-11-23 02:21:29,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 145 flow [2022-11-23 02:21:29,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:21:29,499 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 83 flow [2022-11-23 02:21:29,499 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2022-11-23 02:21:29,500 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-11-23 02:21:29,500 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 83 flow [2022-11-23 02:21:29,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:29,501 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:29,501 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:21:29,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:21:29,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:29,713 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash 787436, now seen corresponding path program 1 times [2022-11-23 02:21:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:29,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314631974] [2022-11-23 02:21:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:29,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:29,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:29,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:29,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 02:21:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:29,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 02:21:29,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:29,888 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-11-23 02:21:29,888 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 [2022-11-23 02:21:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:29,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:21:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:30,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:30,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314631974] [2022-11-23 02:21:30,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314631974] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:21:30,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:21:30,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2022-11-23 02:21:30,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867009923] [2022-11-23 02:21:30,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:21:30,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:21:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:30,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:21:30,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:21:31,589 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 421 [2022-11-23 02:21:31,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 83 flow. Second operand has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:31,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:31,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 421 [2022-11-23 02:21:31,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:32,515 INFO L130 PetriNetUnfolder]: 811/1169 cut-off events. [2022-11-23 02:21:32,516 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 02:21:32,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 1169 events. 811/1169 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 5561 event pairs, 380 based on Foata normal form. 3/319 useless extension candidates. Maximal degree in co-relation 2351. Up to 581 conditions per place. [2022-11-23 02:21:32,523 INFO L137 encePairwiseOnDemand]: 416/421 looper letters, 54 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2022-11-23 02:21:32,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 297 flow [2022-11-23 02:21:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:21:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:21:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1098 transitions. [2022-11-23 02:21:32,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4346793349168646 [2022-11-23 02:21:32,528 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1098 transitions. [2022-11-23 02:21:32,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1098 transitions. [2022-11-23 02:21:32,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:32,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1098 transitions. [2022-11-23 02:21:32,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:32,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 421.0) internal successors, (2947), 7 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:32,538 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 421.0) internal successors, (2947), 7 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:32,538 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 83 flow. Second operand 6 states and 1098 transitions. [2022-11-23 02:21:32,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 297 flow [2022-11-23 02:21:32,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:21:32,541 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 160 flow [2022-11-23 02:21:32,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-11-23 02:21:32,542 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2022-11-23 02:21:32,542 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 160 flow [2022-11-23 02:21:32,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:32,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:32,543 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:21:32,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:21:32,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:32,755 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 787535, now seen corresponding path program 1 times [2022-11-23 02:21:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859426923] [2022-11-23 02:21:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:32,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:32,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:32,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:32,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-23 02:21:32,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:32,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:21:32,919 INFO L321 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2022-11-23 02:21:32,919 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 2 case distinctions, treesize of input 14 treesize of output 26 [2022-11-23 02:21:32,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 02:21:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:33,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:21:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:33,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:33,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859426923] [2022-11-23 02:21:33,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859426923] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:21:33,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:21:33,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2022-11-23 02:21:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516555100] [2022-11-23 02:21:33,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:21:33,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:21:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:21:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:21:34,068 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 421 [2022-11-23 02:21:34,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:34,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:34,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 421 [2022-11-23 02:21:34,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:35,095 INFO L130 PetriNetUnfolder]: 679/996 cut-off events. [2022-11-23 02:21:35,096 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-23 02:21:35,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 996 events. 679/996 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 4695 event pairs, 317 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 2023. Up to 569 conditions per place. [2022-11-23 02:21:35,101 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 50 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2022-11-23 02:21:35,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 320 flow [2022-11-23 02:21:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:21:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:21:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1239 transitions. [2022-11-23 02:21:35,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42042755344418054 [2022-11-23 02:21:35,106 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1239 transitions. [2022-11-23 02:21:35,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1239 transitions. [2022-11-23 02:21:35,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:35,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1239 transitions. [2022-11-23 02:21:35,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:35,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 421.0) internal successors, (3368), 8 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:35,116 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 421.0) internal successors, (3368), 8 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:35,116 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 160 flow. Second operand 7 states and 1239 transitions. [2022-11-23 02:21:35,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 320 flow [2022-11-23 02:21:35,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 306 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-23 02:21:35,119 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 152 flow [2022-11-23 02:21:35,120 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-11-23 02:21:35,120 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2022-11-23 02:21:35,121 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 152 flow [2022-11-23 02:21:35,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:35,121 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:35,122 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:21:35,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:35,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:35,333 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 756839569, now seen corresponding path program 1 times [2022-11-23 02:21:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:35,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501834496] [2022-11-23 02:21:35,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:35,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:35,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:35,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 02:21:35,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:35,538 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-11-23 02:21:35,538 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 [2022-11-23 02:21:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:35,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:21:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:36,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:36,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501834496] [2022-11-23 02:21:36,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501834496] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:21:36,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:21:36,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2022-11-23 02:21:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535401751] [2022-11-23 02:21:36,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:21:36,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:21:36,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:36,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:21:36,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:21:38,334 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 [0] [2022-11-23 02:21:39,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 421 [2022-11-23 02:21:39,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 152 flow. Second operand has 8 states, 8 states have (on average 169.25) internal successors, (1354), 8 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:39,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:39,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 421 [2022-11-23 02:21:39,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:40,183 INFO L130 PetriNetUnfolder]: 637/928 cut-off events. [2022-11-23 02:21:40,183 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-11-23 02:21:40,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 928 events. 637/928 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 4289 event pairs, 297 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 1925. Up to 540 conditions per place. [2022-11-23 02:21:40,189 INFO L137 encePairwiseOnDemand]: 417/421 looper letters, 52 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-11-23 02:21:40,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 312 flow [2022-11-23 02:21:40,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:21:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:21:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 895 transitions. [2022-11-23 02:21:40,193 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4251781472684085 [2022-11-23 02:21:40,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 895 transitions. [2022-11-23 02:21:40,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 895 transitions. [2022-11-23 02:21:40,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:40,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 895 transitions. [2022-11-23 02:21:40,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:40,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:40,200 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:40,201 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 152 flow. Second operand 5 states and 895 transitions. [2022-11-23 02:21:40,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 312 flow [2022-11-23 02:21:40,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 282 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-11-23 02:21:40,209 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 124 flow [2022-11-23 02:21:40,209 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-11-23 02:21:40,210 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2022-11-23 02:21:40,210 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 124 flow [2022-11-23 02:21:40,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 169.25) internal successors, (1354), 8 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:40,211 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:40,211 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:21:40,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 02:21:40,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:40,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash 756839568, now seen corresponding path program 1 times [2022-11-23 02:21:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:40,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749296995] [2022-11-23 02:21:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:40,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:40,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:40,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:40,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 02:21:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:40,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 02:21:40,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:40,587 INFO L321 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2022-11-23 02:21:40,587 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 [2022-11-23 02:21:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:21:40,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:21:40,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:40,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749296995] [2022-11-23 02:21:40,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749296995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:21:40,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:21:40,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:21:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509516550] [2022-11-23 02:21:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:21:40,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:21:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:40,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:21:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:21:40,739 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 421 [2022-11-23 02:21:40,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:40,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:40,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 421 [2022-11-23 02:21:40,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:41,064 INFO L130 PetriNetUnfolder]: 607/872 cut-off events. [2022-11-23 02:21:41,064 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-11-23 02:21:41,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 872 events. 607/872 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 3976 event pairs, 279 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 1803. Up to 862 conditions per place. [2022-11-23 02:21:41,070 INFO L137 encePairwiseOnDemand]: 418/421 looper letters, 30 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2022-11-23 02:21:41,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 182 flow [2022-11-23 02:21:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:21:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:21:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2022-11-23 02:21:41,073 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4346793349168646 [2022-11-23 02:21:41,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2022-11-23 02:21:41,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2022-11-23 02:21:41,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:41,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2022-11-23 02:21:41,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:41,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:41,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:41,078 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 124 flow. Second operand 3 states and 549 transitions. [2022-11-23 02:21:41,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 182 flow [2022-11-23 02:21:41,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 177 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 02:21:41,080 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 117 flow [2022-11-23 02:21:41,080 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-11-23 02:21:41,081 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2022-11-23 02:21:41,081 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 117 flow [2022-11-23 02:21:41,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:41,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:41,082 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 02:21:41,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-23 02:21:41,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:41,293 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1987183402, now seen corresponding path program 1 times [2022-11-23 02:21:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:41,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938239174] [2022-11-23 02:21:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:41,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:41,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:41,296 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:41,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:41,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:21:41,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:41,440 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-11-23 02:21:41,441 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 [2022-11-23 02:21:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:21:41,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:21:41,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:41,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938239174] [2022-11-23 02:21:41,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938239174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:21:41,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:21:41,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:21:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362194699] [2022-11-23 02:21:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:21:41,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:21:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:21:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:21:41,771 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 421 [2022-11-23 02:21:41,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:41,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:41,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 421 [2022-11-23 02:21:41,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:42,034 INFO L130 PetriNetUnfolder]: 356/529 cut-off events. [2022-11-23 02:21:42,035 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-11-23 02:21:42,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 529 events. 356/529 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2213 event pairs, 159 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 1101. Up to 514 conditions per place. [2022-11-23 02:21:42,041 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 23 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2022-11-23 02:21:42,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 167 flow [2022-11-23 02:21:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:21:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:21:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 693 transitions. [2022-11-23 02:21:42,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41152019002375295 [2022-11-23 02:21:42,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 693 transitions. [2022-11-23 02:21:42,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 693 transitions. [2022-11-23 02:21:42,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:42,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 693 transitions. [2022-11-23 02:21:42,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:42,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:42,052 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:42,053 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 117 flow. Second operand 4 states and 693 transitions. [2022-11-23 02:21:42,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 167 flow [2022-11-23 02:21:42,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:21:42,054 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 120 flow [2022-11-23 02:21:42,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-11-23 02:21:42,055 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2022-11-23 02:21:42,055 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 120 flow [2022-11-23 02:21:42,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:42,056 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:42,056 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2022-11-23 02:21:42,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:42,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:42,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1986752661, now seen corresponding path program 2 times [2022-11-23 02:21:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:42,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797178511] [2022-11-23 02:21:42,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:21:42,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:42,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:42,269 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:42,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:42,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:21:42,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:21:42,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 02:21:42,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:42,476 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-11-23 02:21:42,476 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 [2022-11-23 02:21:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:42,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:21:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:43,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797178511] [2022-11-23 02:21:43,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797178511] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:21:43,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:21:43,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2022-11-23 02:21:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739554158] [2022-11-23 02:21:43,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:21:43,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 02:21:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 02:21:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-23 02:21:48,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 421 [2022-11-23 02:21:48,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 120 flow. Second operand has 12 states, 12 states have (on average 174.0) internal successors, (2088), 12 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:48,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:48,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 421 [2022-11-23 02:21:48,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:53,520 INFO L130 PetriNetUnfolder]: 1775/2624 cut-off events. [2022-11-23 02:21:53,520 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-11-23 02:21:53,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5492 conditions, 2624 events. 1775/2624 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 13743 event pairs, 822 based on Foata normal form. 6/1142 useless extension candidates. Maximal degree in co-relation 5476. Up to 331 conditions per place. [2022-11-23 02:21:53,540 INFO L137 encePairwiseOnDemand]: 416/421 looper letters, 169 selfloop transitions, 13 changer transitions 0/184 dead transitions. [2022-11-23 02:21:53,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 184 transitions, 930 flow [2022-11-23 02:21:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:21:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-23 02:21:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2264 transitions. [2022-11-23 02:21:53,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44813935075217737 [2022-11-23 02:21:53,548 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2264 transitions. [2022-11-23 02:21:53,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2264 transitions. [2022-11-23 02:21:53,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:53,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2264 transitions. [2022-11-23 02:21:53,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 188.66666666666666) internal successors, (2264), 12 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:53,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 421.0) internal successors, (5473), 13 states have internal predecessors, (5473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:53,593 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 421.0) internal successors, (5473), 13 states have internal predecessors, (5473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:53,593 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 120 flow. Second operand 12 states and 2264 transitions. [2022-11-23 02:21:53,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 184 transitions, 930 flow [2022-11-23 02:21:53,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 184 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:21:53,599 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 214 flow [2022-11-23 02:21:53,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=214, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2022-11-23 02:21:53,602 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2022-11-23 02:21:53,602 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 214 flow [2022-11-23 02:21:53,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 174.0) internal successors, (2088), 12 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:53,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:53,603 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2022-11-23 02:21:53,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:53,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:53,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1986752760, now seen corresponding path program 2 times [2022-11-23 02:21:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:53,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048350840] [2022-11-23 02:21:53,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:21:53,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:53,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:53,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:53,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 02:21:53,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:21:53,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:21:53,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 02:21:53,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:53,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:21:53,965 INFO L321 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2022-11-23 02:21:53,966 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 2 case distinctions, treesize of input 14 treesize of output 26 [2022-11-23 02:21:53,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-23 02:21:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 02:21:54,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:21:54,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:54,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048350840] [2022-11-23 02:21:54,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048350840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:21:54,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:21:54,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:21:54,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726558559] [2022-11-23 02:21:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:21:54,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:21:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:21:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:21:54,330 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 421 [2022-11-23 02:21:54,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:54,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:54,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 421 [2022-11-23 02:21:54,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:54,831 INFO L130 PetriNetUnfolder]: 1262/1913 cut-off events. [2022-11-23 02:21:54,832 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-11-23 02:21:54,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 1913 events. 1262/1913 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9742 event pairs, 558 based on Foata normal form. 168/992 useless extension candidates. Maximal degree in co-relation 3912. Up to 1877 conditions per place. [2022-11-23 02:21:54,844 INFO L137 encePairwiseOnDemand]: 418/421 looper letters, 32 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2022-11-23 02:21:54,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 35 transitions, 256 flow [2022-11-23 02:21:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:21:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:21:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2022-11-23 02:21:54,847 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43784639746634996 [2022-11-23 02:21:54,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2022-11-23 02:21:54,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2022-11-23 02:21:54,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:54,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2022-11-23 02:21:54,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:54,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:54,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 421.0) internal successors, (1684), 4 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:54,853 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 214 flow. Second operand 3 states and 553 transitions. [2022-11-23 02:21:54,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 35 transitions, 256 flow [2022-11-23 02:21:54,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 35 transitions, 241 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-23 02:21:54,855 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 177 flow [2022-11-23 02:21:54,856 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2022-11-23 02:21:54,856 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2022-11-23 02:21:54,856 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 177 flow [2022-11-23 02:21:54,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:54,857 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:54,857 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 02:21:54,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 02:21:55,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:55,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1987183403, now seen corresponding path program 1 times [2022-11-23 02:21:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:55,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556007369] [2022-11-23 02:21:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:55,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:55,070 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:55,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:55,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 02:21:55,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:55,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:21:55,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-11-23 02:21:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:21:55,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:21:55,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556007369] [2022-11-23 02:21:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556007369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:21:55,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:21:55,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2022-11-23 02:21:55,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377927566] [2022-11-23 02:21:55,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:21:55,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:21:55,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:21:55,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:21:55,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:21:57,258 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 421 [2022-11-23 02:21:57,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 177 flow. Second operand has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:57,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:21:57,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 421 [2022-11-23 02:21:57,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:21:58,526 INFO L130 PetriNetUnfolder]: 1523/2435 cut-off events. [2022-11-23 02:21:58,527 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-23 02:21:58,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4984 conditions, 2435 events. 1523/2435 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14312 event pairs, 288 based on Foata normal form. 0/1129 useless extension candidates. Maximal degree in co-relation 4961. Up to 1558 conditions per place. [2022-11-23 02:21:58,550 INFO L137 encePairwiseOnDemand]: 416/421 looper letters, 53 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2022-11-23 02:21:58,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 377 flow [2022-11-23 02:21:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:21:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:21:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1237 transitions. [2022-11-23 02:21:58,556 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4197488971835765 [2022-11-23 02:21:58,556 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1237 transitions. [2022-11-23 02:21:58,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1237 transitions. [2022-11-23 02:21:58,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:21:58,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1237 transitions. [2022-11-23 02:21:58,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 176.71428571428572) internal successors, (1237), 7 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:58,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 421.0) internal successors, (3368), 8 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:58,577 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 421.0) internal successors, (3368), 8 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:58,577 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 177 flow. Second operand 7 states and 1237 transitions. [2022-11-23 02:21:58,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 377 flow [2022-11-23 02:21:58,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:21:58,584 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 222 flow [2022-11-23 02:21:58,584 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2022-11-23 02:21:58,585 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2022-11-23 02:21:58,585 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 222 flow [2022-11-23 02:21:58,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:58,587 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:21:58,587 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:21:58,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:58,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:58,799 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:21:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:21:58,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1473144126, now seen corresponding path program 1 times [2022-11-23 02:21:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:21:58,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61171151] [2022-11-23 02:21:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:21:58,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:21:58,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:21:58,802 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:21:58,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:21:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:21:58,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-23 02:21:58,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:21:59,021 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-11-23 02:21:59,021 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 [2022-11-23 02:21:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:21:59,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:22:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:22:00,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:22:00,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61171151] [2022-11-23 02:22:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61171151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:22:00,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:22:00,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2022-11-23 02:22:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359661546] [2022-11-23 02:22:00,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:22:00,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:22:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:22:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:22:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 02:22:08,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 421 [2022-11-23 02:22:08,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 169.5) internal successors, (1356), 8 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:08,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:22:08,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 421 [2022-11-23 02:22:08,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:22:12,255 INFO L130 PetriNetUnfolder]: 1111/1873 cut-off events. [2022-11-23 02:22:12,255 INFO L131 PetriNetUnfolder]: For 543/543 co-relation queries the response was YES. [2022-11-23 02:22:12,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4308 conditions, 1873 events. 1111/1873 cut-off events. For 543/543 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 10939 event pairs, 625 based on Foata normal form. 21/1254 useless extension candidates. Maximal degree in co-relation 4282. Up to 1507 conditions per place. [2022-11-23 02:22:12,271 INFO L137 encePairwiseOnDemand]: 413/421 looper letters, 50 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2022-11-23 02:22:12,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 409 flow [2022-11-23 02:22:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:22:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:22:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1571 transitions. [2022-11-23 02:22:12,279 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4146212721034574 [2022-11-23 02:22:12,279 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1571 transitions. [2022-11-23 02:22:12,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1571 transitions. [2022-11-23 02:22:12,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:22:12,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1571 transitions. [2022-11-23 02:22:12,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 174.55555555555554) internal successors, (1571), 9 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:12,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 421.0) internal successors, (4210), 10 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:12,291 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 421.0) internal successors, (4210), 10 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:12,291 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 222 flow. Second operand 9 states and 1571 transitions. [2022-11-23 02:22:12,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 409 flow [2022-11-23 02:22:12,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 395 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-23 02:22:12,299 INFO L231 Difference]: Finished difference. Result has 67 places, 38 transitions, 249 flow [2022-11-23 02:22:12,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=249, PETRI_PLACES=67, PETRI_TRANSITIONS=38} [2022-11-23 02:22:12,301 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2022-11-23 02:22:12,301 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 38 transitions, 249 flow [2022-11-23 02:22:12,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 169.5) internal successors, (1356), 8 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:12,302 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:22:12,302 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-23 02:22:12,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:22:12,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:22:12,514 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:22:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:22:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2115676825, now seen corresponding path program 2 times [2022-11-23 02:22:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:22:12,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703234119] [2022-11-23 02:22:12,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:22:12,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:22:12,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:22:12,516 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:22:12,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-23 02:22:12,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:22:12,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:22:12,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 02:22:12,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:22:12,682 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-11-23 02:22:12,682 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 [2022-11-23 02:22:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 02:22:12,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:22:12,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:22:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703234119] [2022-11-23 02:22:12,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703234119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:22:12,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:22:12,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:22:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494487063] [2022-11-23 02:22:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:22:12,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:22:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:22:12,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:22:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:22:13,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 421 [2022-11-23 02:22:13,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 38 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:13,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:22:13,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 421 [2022-11-23 02:22:13,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:22:13,581 INFO L130 PetriNetUnfolder]: 533/995 cut-off events. [2022-11-23 02:22:13,582 INFO L131 PetriNetUnfolder]: For 940/940 co-relation queries the response was YES. [2022-11-23 02:22:13,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 995 events. 533/995 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5558 event pairs, 279 based on Foata normal form. 162/941 useless extension candidates. Maximal degree in co-relation 2273. Up to 946 conditions per place. [2022-11-23 02:22:13,590 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 26 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2022-11-23 02:22:13,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 34 transitions, 285 flow [2022-11-23 02:22:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:22:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:22:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 716 transitions. [2022-11-23 02:22:13,593 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4251781472684085 [2022-11-23 02:22:13,593 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 716 transitions. [2022-11-23 02:22:13,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 716 transitions. [2022-11-23 02:22:13,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:22:13,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 716 transitions. [2022-11-23 02:22:13,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:13,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:13,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 421.0) internal successors, (2105), 5 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:13,600 INFO L175 Difference]: Start difference. First operand has 67 places, 38 transitions, 249 flow. Second operand 4 states and 716 transitions. [2022-11-23 02:22:13,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 34 transitions, 285 flow [2022-11-23 02:22:13,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 34 transitions, 240 flow, removed 5 selfloop flow, removed 12 redundant places. [2022-11-23 02:22:13,603 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 188 flow [2022-11-23 02:22:13,603 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2022-11-23 02:22:13,604 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2022-11-23 02:22:13,604 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 188 flow [2022-11-23 02:22:13,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:13,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:22:13,605 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2022-11-23 02:22:13,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:22:13,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:22:13,818 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:22:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:22:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1590894283, now seen corresponding path program 3 times [2022-11-23 02:22:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:22:13,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724851899] [2022-11-23 02:22:13,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:22:13,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:22:13,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:22:13,821 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:22:13,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:22:14,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-23 02:22:14,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:22:14,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-23 02:22:14,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:22:14,183 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-11-23 02:22:14,184 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 [2022-11-23 02:22:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:22:14,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:22:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:22:18,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:22:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724851899] [2022-11-23 02:22:18,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724851899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:22:18,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:22:18,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2022-11-23 02:22:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586327721] [2022-11-23 02:22:18,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:22:18,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 02:22:18,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:22:18,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 02:22:18,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2022-11-23 02:22:41,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 421 [2022-11-23 02:22:41,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 34 transitions, 188 flow. Second operand has 24 states, 24 states have (on average 173.0) internal successors, (4152), 24 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:22:41,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:22:41,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 421 [2022-11-23 02:22:41,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:23:05,385 INFO L130 PetriNetUnfolder]: 1201/2275 cut-off events. [2022-11-23 02:23:05,385 INFO L131 PetriNetUnfolder]: For 747/747 co-relation queries the response was YES. [2022-11-23 02:23:05,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 2275 events. 1201/2275 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 13325 event pairs, 631 based on Foata normal form. 12/1863 useless extension candidates. Maximal degree in co-relation 5004. Up to 504 conditions per place. [2022-11-23 02:23:05,396 INFO L137 encePairwiseOnDemand]: 417/421 looper letters, 295 selfloop transitions, 25 changer transitions 0/322 dead transitions. [2022-11-23 02:23:05,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 322 transitions, 1780 flow [2022-11-23 02:23:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 02:23:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-11-23 02:23:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4611 transitions. [2022-11-23 02:23:05,408 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4380997624703088 [2022-11-23 02:23:05,408 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4611 transitions. [2022-11-23 02:23:05,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4611 transitions. [2022-11-23 02:23:05,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:23:05,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4611 transitions. [2022-11-23 02:23:05,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 184.44) internal successors, (4611), 25 states have internal predecessors, (4611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:05,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 421.0) internal successors, (10946), 26 states have internal predecessors, (10946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:05,436 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 421.0) internal successors, (10946), 26 states have internal predecessors, (10946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:05,436 INFO L175 Difference]: Start difference. First operand has 54 places, 34 transitions, 188 flow. Second operand 25 states and 4611 transitions. [2022-11-23 02:23:05,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 322 transitions, 1780 flow [2022-11-23 02:23:05,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 322 transitions, 1756 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:23:05,443 INFO L231 Difference]: Finished difference. Result has 77 places, 47 transitions, 300 flow [2022-11-23 02:23:05,443 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=300, PETRI_PLACES=77, PETRI_TRANSITIONS=47} [2022-11-23 02:23:05,444 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2022-11-23 02:23:05,444 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 47 transitions, 300 flow [2022-11-23 02:23:05,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 173.0) internal successors, (4152), 24 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:05,446 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:23:05,446 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:23:05,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:23:05,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:23:05,660 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:23:05,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:23:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1516381480, now seen corresponding path program 1 times [2022-11-23 02:23:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:23:05,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074911621] [2022-11-23 02:23:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:23:05,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:23:05,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:23:05,663 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:23:05,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:23:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:23:05,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 02:23:05,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:23:05,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:23:05,984 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 114 treesize of output 92 [2022-11-23 02:23:05,990 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 92 treesize of output 90 [2022-11-23 02:23:05,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 88 [2022-11-23 02:23:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:23:06,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:23:06,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:23:06,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074911621] [2022-11-23 02:23:06,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074911621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:23:06,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:23:06,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:23:06,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338171544] [2022-11-23 02:23:06,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:23:06,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:23:06,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:23:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:23:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:23:06,275 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 421 [2022-11-23 02:23:06,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 47 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:06,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:23:06,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 421 [2022-11-23 02:23:06,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:23:07,000 INFO L130 PetriNetUnfolder]: 1703/3050 cut-off events. [2022-11-23 02:23:07,000 INFO L131 PetriNetUnfolder]: For 412/412 co-relation queries the response was YES. [2022-11-23 02:23:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6762 conditions, 3050 events. 1703/3050 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 17467 event pairs, 210 based on Foata normal form. 21/2483 useless extension candidates. Maximal degree in co-relation 6739. Up to 2395 conditions per place. [2022-11-23 02:23:07,010 INFO L137 encePairwiseOnDemand]: 414/421 looper letters, 56 selfloop transitions, 10 changer transitions 2/69 dead transitions. [2022-11-23 02:23:07,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 69 transitions, 489 flow [2022-11-23 02:23:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:23:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:23:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 899 transitions. [2022-11-23 02:23:07,014 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4270783847980998 [2022-11-23 02:23:07,014 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 899 transitions. [2022-11-23 02:23:07,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 899 transitions. [2022-11-23 02:23:07,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:23:07,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 899 transitions. [2022-11-23 02:23:07,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:07,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:07,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:07,021 INFO L175 Difference]: Start difference. First operand has 77 places, 47 transitions, 300 flow. Second operand 5 states and 899 transitions. [2022-11-23 02:23:07,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 69 transitions, 489 flow [2022-11-23 02:23:07,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 69 transitions, 443 flow, removed 7 selfloop flow, removed 15 redundant places. [2022-11-23 02:23:07,024 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 322 flow [2022-11-23 02:23:07,025 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2022-11-23 02:23:07,025 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2022-11-23 02:23:07,025 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 322 flow [2022-11-23 02:23:07,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:07,026 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:23:07,026 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:23:07,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:23:07,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:23:07,238 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:23:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:23:07,239 INFO L85 PathProgramCache]: Analyzing trace with hash 391464586, now seen corresponding path program 2 times [2022-11-23 02:23:07,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:23:07,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540210350] [2022-11-23 02:23:07,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:23:07,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:23:07,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:23:07,240 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:23:07,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-23 02:23:07,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:23:07,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:23:07,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 02:23:07,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:23:07,485 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 31 treesize of output 9 [2022-11-23 02:23:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:23:11,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:23:11,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:23:11,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540210350] [2022-11-23 02:23:11,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540210350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:23:11,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:23:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:23:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491294581] [2022-11-23 02:23:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:23:11,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:23:11,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:23:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:23:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:23:11,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 421 [2022-11-23 02:23:11,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:11,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:23:11,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 421 [2022-11-23 02:23:11,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:23:12,630 INFO L130 PetriNetUnfolder]: 1603/2927 cut-off events. [2022-11-23 02:23:12,630 INFO L131 PetriNetUnfolder]: For 898/938 co-relation queries the response was YES. [2022-11-23 02:23:12,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8780 conditions, 2927 events. 1603/2927 cut-off events. For 898/938 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 16503 event pairs, 160 based on Foata normal form. 60/2507 useless extension candidates. Maximal degree in co-relation 8758. Up to 2281 conditions per place. [2022-11-23 02:23:12,645 INFO L137 encePairwiseOnDemand]: 414/421 looper letters, 55 selfloop transitions, 11 changer transitions 2/69 dead transitions. [2022-11-23 02:23:12,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 498 flow [2022-11-23 02:23:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:23:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:23:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 902 transitions. [2022-11-23 02:23:12,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4285035629453682 [2022-11-23 02:23:12,649 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 902 transitions. [2022-11-23 02:23:12,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 902 transitions. [2022-11-23 02:23:12,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:23:12,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 902 transitions. [2022-11-23 02:23:12,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:12,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:12,658 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 421.0) internal successors, (2526), 6 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:12,658 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 322 flow. Second operand 5 states and 902 transitions. [2022-11-23 02:23:12,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 498 flow [2022-11-23 02:23:12,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 486 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-23 02:23:12,666 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 361 flow [2022-11-23 02:23:12,667 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2022-11-23 02:23:12,667 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2022-11-23 02:23:12,668 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 361 flow [2022-11-23 02:23:12,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:12,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:23:12,668 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:23:12,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:23:12,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:23:12,881 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:23:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:23:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -286252078, now seen corresponding path program 3 times [2022-11-23 02:23:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:23:12,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500745690] [2022-11-23 02:23:12,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:23:12,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:23:12,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:23:12,883 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:23:12,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:23:12,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 02:23:12,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:23:12,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 02:23:12,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:23:13,086 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 31 treesize of output 9 [2022-11-23 02:23:19,190 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:23:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:23:21,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:23:21,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:23:21,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500745690] [2022-11-23 02:23:21,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500745690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:23:21,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:23:21,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:23:21,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447929103] [2022-11-23 02:23:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:23:21,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:23:21,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:23:21,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:23:21,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:23:23,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:23:25,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:23:26,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 421 [2022-11-23 02:23:26,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:26,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:23:26,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 421 [2022-11-23 02:23:26,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:23:27,560 INFO L130 PetriNetUnfolder]: 1643/3047 cut-off events. [2022-11-23 02:23:27,560 INFO L131 PetriNetUnfolder]: For 2671/2731 co-relation queries the response was YES. [2022-11-23 02:23:27,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10101 conditions, 3047 events. 1643/3047 cut-off events. For 2671/2731 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 17755 event pairs, 160 based on Foata normal form. 80/2687 useless extension candidates. Maximal degree in co-relation 10077. Up to 2281 conditions per place. [2022-11-23 02:23:27,577 INFO L137 encePairwiseOnDemand]: 414/421 looper letters, 56 selfloop transitions, 14 changer transitions 2/73 dead transitions. [2022-11-23 02:23:27,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 557 flow [2022-11-23 02:23:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:23:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:23:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions. [2022-11-23 02:23:27,581 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42636579572446553 [2022-11-23 02:23:27,581 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions. [2022-11-23 02:23:27,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions. [2022-11-23 02:23:27,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:23:27,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions. [2022-11-23 02:23:27,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:27,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 421.0) internal successors, (2947), 7 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:27,588 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 421.0) internal successors, (2947), 7 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:27,588 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 361 flow. Second operand 6 states and 1077 transitions. [2022-11-23 02:23:27,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 557 flow [2022-11-23 02:23:27,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 522 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-23 02:23:27,603 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 398 flow [2022-11-23 02:23:27,603 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2022-11-23 02:23:27,604 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2022-11-23 02:23:27,604 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 398 flow [2022-11-23 02:23:27,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:23:27,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:23:27,605 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:23:27,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:23:27,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:23:27,811 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:23:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:23:27,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1355689727, now seen corresponding path program 1 times [2022-11-23 02:23:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:23:27,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201114352] [2022-11-23 02:23:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:23:27,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:23:27,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:23:27,813 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:23:27,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:23:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:23:27,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 02:23:27,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:23:28,331 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 63 treesize of output 19 [2022-11-23 02:23:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:23:28,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:23:30,502 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 176 treesize of output 174 [2022-11-23 02:23:30,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 174 treesize of output 172 [2022-11-23 02:23:31,385 INFO L321 Elim1Store]: treesize reduction 210, result has 3.2 percent of original size [2022-11-23 02:23:31,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 85 treesize of output 23 [2022-11-23 02:23:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:23:31,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:23:31,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201114352] [2022-11-23 02:23:31,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201114352] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:23:31,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:23:31,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2022-11-23 02:23:31,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834809067] [2022-11-23 02:23:31,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:23:31,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 02:23:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:23:31,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 02:23:31,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-11-23 02:23:33,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:23:35,989 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 [0] [2022-11-23 02:23:38,056 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 [0] [2022-11-23 02:23:40,161 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 [0] [2022-11-23 02:23:42,213 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 [0] [2022-11-23 02:23:44,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:23:46,474 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 [0] [2022-11-23 02:23:48,525 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 [0] [2022-11-23 02:23:50,586 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 [0] [2022-11-23 02:23:52,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:23:54,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:23:56,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:23:58,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:01,006 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 [0] [2022-11-23 02:24:03,055 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 [0] [2022-11-23 02:24:05,111 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 [0] [2022-11-23 02:24:07,168 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 [0] [2022-11-23 02:24:09,219 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 [0] [2022-11-23 02:24:11,283 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 [0] [2022-11-23 02:24:13,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:15,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:17,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:19,529 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 [0] [2022-11-23 02:24:21,583 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 [0] [2022-11-23 02:24:23,661 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 [0] [2022-11-23 02:24:25,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:25,732 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 421 [2022-11-23 02:24:25,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 398 flow. Second operand has 14 states, 14 states have (on average 135.28571428571428) internal successors, (1894), 14 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:24:25,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:24:25,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 421 [2022-11-23 02:24:25,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:24:27,996 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 [] [2022-11-23 02:24:31,074 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] [2022-11-23 02:24:33,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:24:36,806 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 [] [2022-11-23 02:24:38,811 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 [] [2022-11-23 02:24:41,110 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 [] [2022-11-23 02:24:43,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:24:45,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:47,241 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 [0] [2022-11-23 02:24:49,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:51,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:53,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:24:55,069 INFO L130 PetriNetUnfolder]: 4163/7787 cut-off events. [2022-11-23 02:24:55,069 INFO L131 PetriNetUnfolder]: For 7911/7911 co-relation queries the response was YES. [2022-11-23 02:24:55,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24583 conditions, 7787 events. 4163/7787 cut-off events. For 7911/7911 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 53820 event pairs, 160 based on Foata normal form. 40/7067 useless extension candidates. Maximal degree in co-relation 24557. Up to 2201 conditions per place. [2022-11-23 02:24:55,118 INFO L137 encePairwiseOnDemand]: 411/421 looper letters, 93 selfloop transitions, 57 changer transitions 19/169 dead transitions. [2022-11-23 02:24:55,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 169 transitions, 1123 flow [2022-11-23 02:24:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 02:24:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-23 02:24:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2662 transitions. [2022-11-23 02:24:55,126 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.33279159894986876 [2022-11-23 02:24:55,127 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2662 transitions. [2022-11-23 02:24:55,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2662 transitions. [2022-11-23 02:24:55,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:24:55,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2662 transitions. [2022-11-23 02:24:55,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 140.10526315789474) internal successors, (2662), 19 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:24:55,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 421.0) internal successors, (8420), 20 states have internal predecessors, (8420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:24:55,146 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 421.0) internal successors, (8420), 20 states have internal predecessors, (8420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:24:55,146 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 398 flow. Second operand 19 states and 2662 transitions. [2022-11-23 02:24:55,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 169 transitions, 1123 flow [2022-11-23 02:24:55,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 169 transitions, 1044 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-11-23 02:24:55,244 INFO L231 Difference]: Finished difference. Result has 102 places, 101 transitions, 729 flow [2022-11-23 02:24:55,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=729, PETRI_PLACES=102, PETRI_TRANSITIONS=101} [2022-11-23 02:24:55,245 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2022-11-23 02:24:55,245 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 101 transitions, 729 flow [2022-11-23 02:24:55,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 135.28571428571428) internal successors, (1894), 14 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:24:55,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:24:55,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:24:55,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-23 02:24:55,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:24:55,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:24:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:24:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1921904673, now seen corresponding path program 2 times [2022-11-23 02:24:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:24:55,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699915437] [2022-11-23 02:24:55,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:24:55,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 [2022-11-23 02:24:55,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:24:55,463 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:24:55,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-23 02:24:55,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:24:55,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:24:55,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 02:24:55,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:24:56,075 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 63 treesize of output 19 [2022-11-23 02:24:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:24:56,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:24:58,242 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 176 treesize of output 174 [2022-11-23 02:24:58,253 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 174 treesize of output 172 [2022-11-23 02:24:59,572 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-11-23 02:24:59,572 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 169 treesize of output 113 [2022-11-23 02:25:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:25:02,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:25:02,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699915437] [2022-11-23 02:25:02,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699915437] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:25:02,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:25:02,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2022-11-23 02:25:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931719438] [2022-11-23 02:25:02,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:25:02,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 02:25:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:25:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 02:25:02,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=128, Unknown=1, NotChecked=0, Total=182 [2022-11-23 02:25:05,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:07,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:09,300 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 [0] [2022-11-23 02:25:11,390 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 [0] [2022-11-23 02:25:13,450 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 [0] [2022-11-23 02:25:15,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:17,866 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 [0] [2022-11-23 02:25:19,925 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 [0] [2022-11-23 02:25:22,007 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 [0] [2022-11-23 02:25:24,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:26,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:28,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:30,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:32,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:34,520 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 [0] [2022-11-23 02:25:36,591 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 [0] [2022-11-23 02:25:38,669 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 [0] [2022-11-23 02:25:40,762 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 [0] [2022-11-23 02:25:42,830 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 [0] [2022-11-23 02:25:44,912 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 [0] [2022-11-23 02:25:47,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:49,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:51,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:53,250 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 [0] [2022-11-23 02:25:55,302 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 [0] [2022-11-23 02:25:57,380 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 [0] [2022-11-23 02:25:59,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:25:59,465 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 421 [2022-11-23 02:25:59,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 101 transitions, 729 flow. Second operand has 14 states, 14 states have (on average 135.28571428571428) internal successors, (1894), 14 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:25:59,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:25:59,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 421 [2022-11-23 02:25:59,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:26:02,580 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 [] [2022-11-23 02:26:05,903 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 [0] [2022-11-23 02:26:07,908 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 [] [2022-11-23 02:26:09,915 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 [] [2022-11-23 02:26:11,919 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] [2022-11-23 02:26:16,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:26:18,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:26:20,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:26:24,925 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 [] [2022-11-23 02:26:26,934 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 [] [2022-11-23 02:26:28,938 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] [2022-11-23 02:26:35,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:26:37,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:26:39,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:26:41,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:26:43,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:26:45,787 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 [0] [2022-11-23 02:26:47,814 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 [0] [2022-11-23 02:26:49,974 INFO L130 PetriNetUnfolder]: 5923/11527 cut-off events. [2022-11-23 02:26:49,974 INFO L131 PetriNetUnfolder]: For 33111/33111 co-relation queries the response was YES. [2022-11-23 02:26:50,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48993 conditions, 11527 events. 5923/11527 cut-off events. For 33111/33111 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 88046 event pairs, 600 based on Foata normal form. 120/11647 useless extension candidates. Maximal degree in co-relation 48957. Up to 6741 conditions per place. [2022-11-23 02:26:50,082 INFO L137 encePairwiseOnDemand]: 411/421 looper letters, 123 selfloop transitions, 60 changer transitions 21/204 dead transitions. [2022-11-23 02:26:50,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 204 transitions, 1745 flow [2022-11-23 02:26:50,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 02:26:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-23 02:26:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2371 transitions. [2022-11-23 02:26:50,088 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3312840575660193 [2022-11-23 02:26:50,088 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2371 transitions. [2022-11-23 02:26:50,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2371 transitions. [2022-11-23 02:26:50,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:26:50,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2371 transitions. [2022-11-23 02:26:50,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 139.47058823529412) internal successors, (2371), 17 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:50,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 421.0) internal successors, (7578), 18 states have internal predecessors, (7578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:50,143 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 421.0) internal successors, (7578), 18 states have internal predecessors, (7578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:50,143 INFO L175 Difference]: Start difference. First operand has 102 places, 101 transitions, 729 flow. Second operand 17 states and 2371 transitions. [2022-11-23 02:26:50,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 204 transitions, 1745 flow [2022-11-23 02:26:50,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 204 transitions, 1572 flow, removed 75 selfloop flow, removed 3 redundant places. [2022-11-23 02:26:50,975 INFO L231 Difference]: Finished difference. Result has 123 places, 145 transitions, 1210 flow [2022-11-23 02:26:50,976 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1210, PETRI_PLACES=123, PETRI_TRANSITIONS=145} [2022-11-23 02:26:50,976 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2022-11-23 02:26:50,976 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 145 transitions, 1210 flow [2022-11-23 02:26:50,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 135.28571428571428) internal successors, (1894), 14 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:50,977 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:26:50,977 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:26:50,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-23 02:26:51,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:26:51,190 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:26:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:26:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1705555709, now seen corresponding path program 1 times [2022-11-23 02:26:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:26:51,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677587196] [2022-11-23 02:26:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:26:51,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:26:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:26:51,192 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:26:51,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-23 02:26:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:26:51,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:26:51,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:26:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:26:51,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:26:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:26:51,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:26:51,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677587196] [2022-11-23 02:26:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677587196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:26:51,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:26:51,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-23 02:26:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631716019] [2022-11-23 02:26:51,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:26:51,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:26:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:26:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:26:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:26:51,843 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 421 [2022-11-23 02:26:51,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 145 transitions, 1210 flow. Second operand has 9 states, 9 states have (on average 171.44444444444446) internal successors, (1543), 9 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:51,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:26:51,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 421 [2022-11-23 02:26:51,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:26:54,969 INFO L130 PetriNetUnfolder]: 5803/11187 cut-off events. [2022-11-23 02:26:54,969 INFO L131 PetriNetUnfolder]: For 53811/53811 co-relation queries the response was YES. [2022-11-23 02:26:55,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52243 conditions, 11187 events. 5803/11187 cut-off events. For 53811/53811 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 83673 event pairs, 1320 based on Foata normal form. 240/11387 useless extension candidates. Maximal degree in co-relation 52197. Up to 7128 conditions per place. [2022-11-23 02:26:55,071 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 139 selfloop transitions, 44 changer transitions 0/183 dead transitions. [2022-11-23 02:26:55,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 183 transitions, 1781 flow [2022-11-23 02:26:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:26:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:26:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1581 transitions. [2022-11-23 02:26:55,074 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4172604908946952 [2022-11-23 02:26:55,074 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1581 transitions. [2022-11-23 02:26:55,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1581 transitions. [2022-11-23 02:26:55,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:26:55,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1581 transitions. [2022-11-23 02:26:55,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 175.66666666666666) internal successors, (1581), 9 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:55,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 421.0) internal successors, (4210), 10 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:55,081 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 421.0) internal successors, (4210), 10 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:55,081 INFO L175 Difference]: Start difference. First operand has 123 places, 145 transitions, 1210 flow. Second operand 9 states and 1581 transitions. [2022-11-23 02:26:55,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 183 transitions, 1781 flow [2022-11-23 02:26:56,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 183 transitions, 1671 flow, removed 55 selfloop flow, removed 2 redundant places. [2022-11-23 02:26:56,073 INFO L231 Difference]: Finished difference. Result has 132 places, 153 transitions, 1365 flow [2022-11-23 02:26:56,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1365, PETRI_PLACES=132, PETRI_TRANSITIONS=153} [2022-11-23 02:26:56,074 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2022-11-23 02:26:56,074 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 153 transitions, 1365 flow [2022-11-23 02:26:56,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 171.44444444444446) internal successors, (1543), 9 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:56,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:26:56,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:26:56,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-23 02:26:56,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:26:56,287 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:26:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:26:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash 795198845, now seen corresponding path program 2 times [2022-11-23 02:26:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:26:56,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816215178] [2022-11-23 02:26:56,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:26:56,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 [2022-11-23 02:26:56,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:26:56,289 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:26:56,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-23 02:26:56,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:26:56,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:26:56,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:26:56,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:26:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:26:56,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:26:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:26:56,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:26:56,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816215178] [2022-11-23 02:26:56,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816215178] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:26:56,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:26:56,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-23 02:26:56,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171696299] [2022-11-23 02:26:56,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:26:56,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:26:56,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:26:56,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:26:56,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:26:57,082 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 421 [2022-11-23 02:26:57,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 153 transitions, 1365 flow. Second operand has 9 states, 9 states have (on average 171.44444444444446) internal successors, (1543), 9 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:26:57,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:26:57,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 421 [2022-11-23 02:26:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:27:01,185 INFO L130 PetriNetUnfolder]: 6243/12107 cut-off events. [2022-11-23 02:27:01,185 INFO L131 PetriNetUnfolder]: For 71791/71791 co-relation queries the response was YES. [2022-11-23 02:27:01,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60108 conditions, 12107 events. 6243/12107 cut-off events. For 71791/71791 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 92801 event pairs, 1500 based on Foata normal form. 240/12307 useless extension candidates. Maximal degree in co-relation 60057. Up to 7168 conditions per place. [2022-11-23 02:27:01,322 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 146 selfloop transitions, 50 changer transitions 0/196 dead transitions. [2022-11-23 02:27:01,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 196 transitions, 2028 flow [2022-11-23 02:27:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 02:27:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-23 02:27:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1760 transitions. [2022-11-23 02:27:01,326 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4180522565320665 [2022-11-23 02:27:01,326 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1760 transitions. [2022-11-23 02:27:01,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1760 transitions. [2022-11-23 02:27:01,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:27:01,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1760 transitions. [2022-11-23 02:27:01,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 176.0) internal successors, (1760), 10 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:01,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 421.0) internal successors, (4631), 11 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:01,333 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 421.0) internal successors, (4631), 11 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:01,333 INFO L175 Difference]: Start difference. First operand has 132 places, 153 transitions, 1365 flow. Second operand 10 states and 1760 transitions. [2022-11-23 02:27:01,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 196 transitions, 2028 flow [2022-11-23 02:27:03,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 196 transitions, 1917 flow, removed 36 selfloop flow, removed 2 redundant places. [2022-11-23 02:27:03,024 INFO L231 Difference]: Finished difference. Result has 145 places, 165 transitions, 1602 flow [2022-11-23 02:27:03,024 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1602, PETRI_PLACES=145, PETRI_TRANSITIONS=165} [2022-11-23 02:27:03,025 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 105 predicate places. [2022-11-23 02:27:03,025 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 165 transitions, 1602 flow [2022-11-23 02:27:03,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 171.44444444444446) internal successors, (1543), 9 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:27:03,026 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:27:03,026 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:27:03,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-11-23 02:27:03,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:27:03,228 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:27:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:27:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1181424395, now seen corresponding path program 3 times [2022-11-23 02:27:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:27:03,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526119694] [2022-11-23 02:27:03,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:27:03,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:27:03,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:27:03,230 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:27:03,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-23 02:27:03,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 02:27:03,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:27:03,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 02:27:03,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:27:03,497 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 [2022-11-23 02:27:03,532 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 [2022-11-23 02:27:03,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:27:03,616 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 6 case distinctions, treesize of input 63 treesize of output 19 [2022-11-23 02:27:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:27:03,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:27:06,208 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-11-23 02:27:06,209 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 221 treesize of output 199 [2022-11-23 02:27:06,223 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 141 treesize of output 139 [2022-11-23 02:27:06,237 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 139 treesize of output 137 [2022-11-23 02:27:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:27:09,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:27:09,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526119694] [2022-11-23 02:27:09,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526119694] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:27:09,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:27:09,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2022-11-23 02:27:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435327334] [2022-11-23 02:27:09,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:27:09,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:27:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:27:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:27:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=59, Unknown=1, NotChecked=0, Total=90 [2022-11-23 02:27:11,354 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 [0] [2022-11-23 02:27:13,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:15,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:17,453 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 [0] [2022-11-23 02:27:19,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:21,512 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 [0] [2022-11-23 02:27:23,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:25,558 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 [0] [2022-11-23 02:27:27,583 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 [0] [2022-11-23 02:27:29,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:31,648 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 [0] [2022-11-23 02:27:33,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:35,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:37,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:39,759 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 [0] [2022-11-23 02:27:41,781 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 [0] [2022-11-23 02:27:43,817 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 [0] [2022-11-23 02:27:45,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:47,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:49,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:51,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:53,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:27:56,025 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 [0] [2022-11-23 02:27:58,048 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 [0] [2022-11-23 02:28:00,077 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 [0] [2022-11-23 02:28:02,113 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 [0] [2022-11-23 02:28:04,135 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 [0] [2022-11-23 02:28:06,169 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 [0] [2022-11-23 02:28:08,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:28:10,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:28:12,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:28:14,297 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 [0] [2022-11-23 02:28:16,319 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 [0] [2022-11-23 02:28:18,350 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 [0] [2022-11-23 02:28:20,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:28:20,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 421 [2022-11-23 02:28:20,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 165 transitions, 1602 flow. Second operand has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:20,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:28:20,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 421 [2022-11-23 02:28:20,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:28:22,785 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 [] [2022-11-23 02:28:25,420 INFO L130 PetriNetUnfolder]: 6183/12167 cut-off events. [2022-11-23 02:28:25,421 INFO L131 PetriNetUnfolder]: For 70030/70130 co-relation queries the response was YES. [2022-11-23 02:28:25,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61334 conditions, 12167 events. 6183/12167 cut-off events. For 70030/70130 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 94848 event pairs, 620 based on Foata normal form. 120/12247 useless extension candidates. Maximal degree in co-relation 61277. Up to 10041 conditions per place. [2022-11-23 02:28:25,525 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 138 selfloop transitions, 32 changer transitions 4/179 dead transitions. [2022-11-23 02:28:25,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 179 transitions, 2006 flow [2022-11-23 02:28:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:28:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:28:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2022-11-23 02:28:25,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.33927157561361837 [2022-11-23 02:28:25,527 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 857 transitions. [2022-11-23 02:28:25,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions. [2022-11-23 02:28:25,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:28:25,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions. [2022-11-23 02:28:25,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:25,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 421.0) internal successors, (2947), 7 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:25,530 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 421.0) internal successors, (2947), 7 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:25,531 INFO L175 Difference]: Start difference. First operand has 145 places, 165 transitions, 1602 flow. Second operand 6 states and 857 transitions. [2022-11-23 02:28:25,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 179 transitions, 2006 flow [2022-11-23 02:28:26,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 179 transitions, 1921 flow, removed 40 selfloop flow, removed 1 redundant places. [2022-11-23 02:28:26,710 INFO L231 Difference]: Finished difference. Result has 150 places, 166 transitions, 1599 flow [2022-11-23 02:28:26,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1599, PETRI_PLACES=150, PETRI_TRANSITIONS=166} [2022-11-23 02:28:26,711 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 110 predicate places. [2022-11-23 02:28:26,711 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 166 transitions, 1599 flow [2022-11-23 02:28:26,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:26,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:28:26,712 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:28:26,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-11-23 02:28:26,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:28:26,918 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:28:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:28:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash -885241845, now seen corresponding path program 3 times [2022-11-23 02:28:26,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:28:26,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762508872] [2022-11-23 02:28:26,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:28:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:28:26,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:28:26,920 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:28:26,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-23 02:28:27,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 02:28:27,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:28:27,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:28:27,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:28:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:28:27,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:28:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:28:27,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:28:27,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762508872] [2022-11-23 02:28:27,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762508872] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:28:27,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:28:27,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-23 02:28:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492627586] [2022-11-23 02:28:27,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:28:27,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:28:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:28:27,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:28:27,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:28:28,246 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 421 [2022-11-23 02:28:28,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 166 transitions, 1599 flow. Second operand has 9 states, 9 states have (on average 171.33333333333334) internal successors, (1542), 9 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:28,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:28:28,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 421 [2022-11-23 02:28:28,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:28:32,688 INFO L130 PetriNetUnfolder]: 6863/13307 cut-off events. [2022-11-23 02:28:32,689 INFO L131 PetriNetUnfolder]: For 79871/79871 co-relation queries the response was YES. [2022-11-23 02:28:32,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67456 conditions, 13307 events. 6863/13307 cut-off events. For 79871/79871 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 103904 event pairs, 1420 based on Foata normal form. 240/13507 useless extension candidates. Maximal degree in co-relation 67397. Up to 7468 conditions per place. [2022-11-23 02:28:32,837 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 147 selfloop transitions, 68 changer transitions 0/215 dead transitions. [2022-11-23 02:28:32,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 215 transitions, 2372 flow [2022-11-23 02:28:32,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 02:28:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-23 02:28:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1938 transitions. [2022-11-23 02:28:32,840 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4184841286979054 [2022-11-23 02:28:32,841 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1938 transitions. [2022-11-23 02:28:32,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1938 transitions. [2022-11-23 02:28:32,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:28:32,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1938 transitions. [2022-11-23 02:28:32,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 176.1818181818182) internal successors, (1938), 11 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:32,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 421.0) internal successors, (5052), 12 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:32,846 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 421.0) internal successors, (5052), 12 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:32,846 INFO L175 Difference]: Start difference. First operand has 150 places, 166 transitions, 1599 flow. Second operand 11 states and 1938 transitions. [2022-11-23 02:28:32,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 215 transitions, 2372 flow [2022-11-23 02:28:33,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 215 transitions, 2309 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-23 02:28:33,860 INFO L231 Difference]: Finished difference. Result has 161 places, 182 transitions, 1959 flow [2022-11-23 02:28:33,861 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1959, PETRI_PLACES=161, PETRI_TRANSITIONS=182} [2022-11-23 02:28:33,861 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 121 predicate places. [2022-11-23 02:28:33,862 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 182 transitions, 1959 flow [2022-11-23 02:28:33,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 171.33333333333334) internal successors, (1542), 9 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:33,862 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:28:33,862 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:28:33,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-11-23 02:28:34,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:28:34,064 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:28:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:28:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1620230041, now seen corresponding path program 4 times [2022-11-23 02:28:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:28:34,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290319713] [2022-11-23 02:28:34,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 02:28:34,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:28:34,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:28:34,066 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:28:34,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-23 02:28:34,204 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 02:28:34,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:28:34,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:28:34,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:28:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:28:34,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:28:34,347 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 60 treesize of output 58 [2022-11-23 02:28:34,352 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 58 treesize of output 56 [2022-11-23 02:28:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:28:34,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:28:34,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290319713] [2022-11-23 02:28:34,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290319713] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:28:34,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:28:34,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-23 02:28:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337791454] [2022-11-23 02:28:34,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:28:34,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 02:28:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:28:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 02:28:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:28:35,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 421 [2022-11-23 02:28:35,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 182 transitions, 1959 flow. Second operand has 9 states, 9 states have (on average 172.22222222222223) internal successors, (1550), 9 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:35,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:28:35,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 421 [2022-11-23 02:28:35,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:28:40,208 INFO L130 PetriNetUnfolder]: 6843/13327 cut-off events. [2022-11-23 02:28:40,208 INFO L131 PetriNetUnfolder]: For 91311/91311 co-relation queries the response was YES. [2022-11-23 02:28:40,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71660 conditions, 13327 events. 6843/13327 cut-off events. For 91311/91311 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 104456 event pairs, 1420 based on Foata normal form. 80/13367 useless extension candidates. Maximal degree in co-relation 71597. Up to 7508 conditions per place. [2022-11-23 02:28:40,350 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 143 selfloop transitions, 66 changer transitions 0/209 dead transitions. [2022-11-23 02:28:40,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 209 transitions, 2507 flow [2022-11-23 02:28:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:28:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:28:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1598 transitions. [2022-11-23 02:28:40,354 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4217471628397994 [2022-11-23 02:28:40,354 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1598 transitions. [2022-11-23 02:28:40,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1598 transitions. [2022-11-23 02:28:40,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:28:40,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1598 transitions. [2022-11-23 02:28:40,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:40,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 421.0) internal successors, (4210), 10 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:40,361 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 421.0) internal successors, (4210), 10 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:40,361 INFO L175 Difference]: Start difference. First operand has 161 places, 182 transitions, 1959 flow. Second operand 9 states and 1598 transitions. [2022-11-23 02:28:40,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 209 transitions, 2507 flow [2022-11-23 02:28:42,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 209 transitions, 2334 flow, removed 59 selfloop flow, removed 4 redundant places. [2022-11-23 02:28:42,325 INFO L231 Difference]: Finished difference. Result has 167 places, 184 transitions, 1969 flow [2022-11-23 02:28:42,326 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1969, PETRI_PLACES=167, PETRI_TRANSITIONS=184} [2022-11-23 02:28:42,326 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 127 predicate places. [2022-11-23 02:28:42,326 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 184 transitions, 1969 flow [2022-11-23 02:28:42,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 172.22222222222223) internal successors, (1550), 9 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:28:42,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:28:42,327 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:28:42,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-23 02:28:42,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:28:42,527 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:28:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:28:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1989159369, now seen corresponding path program 4 times [2022-11-23 02:28:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:28:42,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465580591] [2022-11-23 02:28:42,528 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 02:28:42,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:28:42,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:28:42,530 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:28:42,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-23 02:28:42,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 02:28:42,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:28:42,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 02:28:42,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:28:42,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:28:42,850 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 148 treesize of output 104 [2022-11-23 02:28:42,856 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 94 treesize of output 92 [2022-11-23 02:28:42,862 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 92 treesize of output 90 [2022-11-23 02:28:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:28:42,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:28:45,049 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 176 treesize of output 174 [2022-11-23 02:28:45,056 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 174 treesize of output 172 [2022-11-23 02:28:45,830 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-11-23 02:28:45,831 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 169 treesize of output 113 [2022-11-23 02:28:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:28:48,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:28:48,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465580591] [2022-11-23 02:28:48,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465580591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:28:48,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:28:48,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2022-11-23 02:28:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789330320] [2022-11-23 02:28:48,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:28:48,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:28:48,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:28:48,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:28:48,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=59, Unknown=1, NotChecked=0, Total=90 [2022-11-23 02:28:50,349 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 [0] [2022-11-23 02:28:52,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:28:54,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:28:56,407 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 [0] [2022-11-23 02:28:58,421 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 [0] [2022-11-23 02:29:00,447 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 [0] [2022-11-23 02:29:02,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:04,477 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 [0] [2022-11-23 02:29:06,490 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 [0] [2022-11-23 02:29:08,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:10,541 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 [0] [2022-11-23 02:29:12,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:14,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:16,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:18,633 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 [0] [2022-11-23 02:29:20,647 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 [0] [2022-11-23 02:29:22,673 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 [0] [2022-11-23 02:29:24,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:26,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:28,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:30,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:32,794 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 [0] [2022-11-23 02:29:34,811 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 [0] [2022-11-23 02:29:36,841 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 [0] [2022-11-23 02:29:38,863 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 [0] [2022-11-23 02:29:40,880 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 [0] [2022-11-23 02:29:42,905 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 [0] [2022-11-23 02:29:44,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:46,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:48,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:50,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:53,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:29:55,032 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 [0] [2022-11-23 02:29:57,048 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 [0] [2022-11-23 02:29:59,082 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 [0] [2022-11-23 02:30:01,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:30:03,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:30:03,124 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 421 [2022-11-23 02:30:03,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 184 transitions, 1969 flow. Second operand has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:30:03,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:30:03,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 421 [2022-11-23 02:30:03,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:30:05,665 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 [] [2022-11-23 02:30:07,668 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 [] [2022-11-23 02:30:10,604 INFO L130 PetriNetUnfolder]: 6743/13187 cut-off events. [2022-11-23 02:30:10,604 INFO L131 PetriNetUnfolder]: For 87810/87910 co-relation queries the response was YES. [2022-11-23 02:30:10,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69702 conditions, 13187 events. 6743/13187 cut-off events. For 87810/87910 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 103587 event pairs, 660 based on Foata normal form. 120/13267 useless extension candidates. Maximal degree in co-relation 69637. Up to 11141 conditions per place. [2022-11-23 02:30:10,746 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 156 selfloop transitions, 33 changer transitions 4/198 dead transitions. [2022-11-23 02:30:10,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 198 transitions, 2402 flow [2022-11-23 02:30:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:30:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 02:30:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2022-11-23 02:30:10,749 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3400633412509897 [2022-11-23 02:30:10,749 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 859 transitions. [2022-11-23 02:30:10,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 859 transitions. [2022-11-23 02:30:10,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:30:10,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 859 transitions. [2022-11-23 02:30:10,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.16666666666666) internal successors, (859), 6 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:30:10,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 421.0) internal successors, (2947), 7 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:30:10,754 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 421.0) internal successors, (2947), 7 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:30:10,754 INFO L175 Difference]: Start difference. First operand has 167 places, 184 transitions, 1969 flow. Second operand 6 states and 859 transitions. [2022-11-23 02:30:10,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 198 transitions, 2402 flow [2022-11-23 02:30:12,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 198 transitions, 2311 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-23 02:30:12,079 INFO L231 Difference]: Finished difference. Result has 170 places, 185 transitions, 1968 flow [2022-11-23 02:30:12,079 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1968, PETRI_PLACES=170, PETRI_TRANSITIONS=185} [2022-11-23 02:30:12,079 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 130 predicate places. [2022-11-23 02:30:12,080 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 185 transitions, 1968 flow [2022-11-23 02:30:12,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:30:12,080 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:30:12,080 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:30:12,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-23 02:30:12,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:30:12,281 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:30:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:30:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2011273081, now seen corresponding path program 5 times [2022-11-23 02:30:12,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:30:12,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628315928] [2022-11-23 02:30:12,282 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 02:30:12,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:30:12,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:30:12,283 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:30:12,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-23 02:30:12,435 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:30:12,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:30:12,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-23 02:30:12,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:30:12,552 INFO L321 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-11-23 02:30:12,552 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 [2022-11-23 02:30:13,523 INFO L321 Elim1Store]: treesize reduction 456, result has 5.2 percent of original size [2022-11-23 02:30:13,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 20 new quantified variables, introduced 60 case distinctions, treesize of input 1681 treesize of output 303 [2022-11-23 02:30:13,545 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 168 treesize of output 164 [2022-11-23 02:30:13,555 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 160 treesize of output 158 [2022-11-23 02:30:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:30:13,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:30:13,734 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 176 treesize of output 174 [2022-11-23 02:30:16,574 INFO L321 Elim1Store]: treesize reduction 498, result has 21.3 percent of original size [2022-11-23 02:30:16,574 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 20 new quantified variables, introduced 66 case distinctions, treesize of input 2274 treesize of output 372 [2022-11-23 02:31:12,765 WARN L859 $PredicateComparison]: unable to prove that (or (not (bvsge c_~x2~0 (_ bv0 32))) (let ((.cse2 (select |c_#length| c_~f~0.base)) (.cse5 (bvmul c_~x2~0 (_ bv4 32)))) (let ((.cse16 (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse332 (bvmul (_ bv4 32) .cse331))) (or (not (bvslt .cse331 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse332) .cse2)) (= .cse5 .cse332) (not (bvsge .cse331 (_ bv0 32))))))))) (and (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse1 (bvmul (_ bv4 32) .cse0))) (or (not (bvslt .cse0 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse1) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse6 (bvmul (_ bv4 32) .cse4))) (let ((.cse3 (bvadd c_~f~0.offset (_ bv4 32) .cse6))) (or (not (bvule .cse3 .cse2)) (not (bvslt .cse4 c_~size~0)) (not (bvsge .cse4 (_ bv0 32))) (= .cse5 .cse6) (not (bvule (bvadd c_~f~0.offset .cse6) .cse3)) (= .cse6 .cse1)))))) (= .cse5 .cse1) (not (bvsge .cse0 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse9 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse7 (concat .cse9 v_arrayElimCell_104))) (let ((.cse10 (bvmul (_ bv4 32) .cse7))) (or (not (bvslt .cse7 c_~size~0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse8 (concat .cse9 v_arrayElimCell_96))) (or (= c_~x1~0 .cse8) (= .cse5 (bvmul (_ bv4 32) .cse8))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse10) .cse2)) (= .cse5 .cse10) (not (bvsge .cse7 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse11 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse12 (bvmul (_ bv4 32) .cse11))) (or (not (bvslt .cse11 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse12) .cse2)) (= .cse5 .cse12) (not (bvsge .cse11 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse14 (bvmul (_ bv4 32) .cse15))) (let ((.cse13 (bvadd c_~f~0.offset (_ bv4 32) .cse14))) (or (not (bvule .cse13 .cse2)) (= .cse5 .cse14) (not (bvslt .cse15 c_~size~0)) (= .cse12 .cse14) (not (bvule (bvadd c_~f~0.offset .cse14) .cse13))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))))))) (or .cse16 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96)))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse17 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse18 (bvmul (_ bv4 32) .cse17))) (or (not (bvslt .cse17 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse18) .cse2)) (= .cse5 .cse18) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (not (bvsge .cse17 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse23 (bvmul (_ bv4 32) .cse19))) (or (not (bvslt .cse19 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse20 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse21 (bvmul .cse20 (_ bv4 32)))) (let ((.cse22 (bvadd c_~f~0.offset (_ bv4 32) .cse21))) (or (not (bvslt .cse20 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse21) .cse22)) (not (bvule .cse22 .cse2)) (= .cse21 .cse23)))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse23) .cse2)) (= .cse5 .cse23) (not (bvsge .cse19 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse24 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse25 (bvmul (_ bv4 32) .cse24))) (or (not (bvslt .cse24 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse25) .cse2)) (= .cse5 .cse25) (not (bvsge .cse24 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse26 (bvmul (_ bv4 32) .cse28))) (let ((.cse27 (bvadd c_~f~0.offset (_ bv4 32) .cse26))) (or (not (bvule (bvadd c_~f~0.offset .cse26) .cse27)) (= .cse26 .cse25) (not (bvslt .cse28 c_~size~0)) (not (bvule .cse27 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse29 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (or (not (bvslt .cse29 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) (bvmul (_ bv4 32) .cse29)) .cse2)) (= .cse29 c_~x1~0) (not (bvsge .cse29 (_ bv0 32)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse31 (bvmul (_ bv4 32) .cse30))) (or (not (bvslt .cse30 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse31) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse32 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse34 (bvmul (_ bv4 32) .cse32))) (let ((.cse33 (bvadd c_~f~0.offset (_ bv4 32) .cse34))) (or (not (bvslt .cse32 c_~size~0)) (not (bvule .cse33 .cse2)) (not (bvsge .cse32 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse34) .cse33)) (= .cse34 .cse31)))))) (= .cse5 .cse31) (not (bvsge .cse30 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse35 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse36 (bvmul (_ bv4 32) .cse35))) (or (not (bvslt .cse35 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse36) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse37 (bvmul (_ bv4 32) .cse38))) (let ((.cse39 (bvadd c_~f~0.offset (_ bv4 32) .cse37))) (or (= .cse5 .cse37) (not (bvsge .cse38 (_ bv0 32))) (not (bvule .cse39 .cse2)) (not (bvslt .cse38 c_~size~0)) (= .cse37 .cse36) (not (bvule (bvadd c_~f~0.offset .cse37) .cse39))))))))) (= .cse5 .cse36) (not (bvsge .cse35 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse45 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse40 (concat (concat .cse45 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse41 (bvmul (_ bv4 32) .cse40))) (or (not (bvslt .cse40 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse41) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse44 (concat (concat .cse45 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse42 (bvmul (_ bv4 32) .cse44))) (let ((.cse43 (bvadd c_~f~0.offset (_ bv4 32) .cse42))) (or (= .cse41 .cse42) (not (bvule (bvadd c_~f~0.offset .cse42) .cse43)) (not (bvule .cse43 .cse2)) (not (bvslt .cse44 c_~size~0)) (= .cse5 .cse42)))))) (= .cse5 .cse41) (not (bvsge .cse40 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse46 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse47 (bvmul (_ bv4 32) .cse46))) (or (not (bvslt .cse46 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse47) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse51 (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse48 (concat .cse51 v_arrayElimCell_96))) (let ((.cse50 (bvmul (_ bv4 32) .cse48))) (let ((.cse49 (bvadd c_~f~0.offset (_ bv4 32) .cse50))) (or (not (bvslt .cse48 c_~size~0)) (not (bvule .cse49 .cse2)) (not (bvsge .cse48 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse50) .cse49)) (= .cse50 .cse47) (= .cse5 .cse50)))))) (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse51 v_arrayElimCell_103)))))) (= .cse5 .cse47) (not (bvsge .cse46 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse53 (bvmul (_ bv4 32) .cse52))) (or (not (bvslt .cse52 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse53) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse54 (bvmul (_ bv4 32) .cse55))) (let ((.cse56 (bvadd c_~f~0.offset (_ bv4 32) .cse54))) (or (= .cse5 .cse54) (not (bvsge .cse55 (_ bv0 32))) (not (bvule .cse56 .cse2)) (not (bvslt .cse55 c_~size~0)) (= .cse54 .cse53) (not (bvule (bvadd c_~f~0.offset .cse54) .cse56))))))) (= .cse5 .cse53) (not (bvsge .cse52 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse58 (bvmul (_ bv4 32) .cse57))) (or (not (bvslt .cse57 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse58) .cse2)) (= .cse5 .cse58) (not (bvsge .cse57 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse62 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse61 (concat (concat .cse62 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse60 (bvmul (_ bv4 32) .cse61))) (let ((.cse59 (bvadd c_~f~0.offset (_ bv4 32) .cse60))) (or (not (bvule .cse59 .cse2)) (= .cse5 .cse60) (not (bvslt .cse61 c_~size~0)) (= .cse58 .cse60) (not (bvule (bvadd c_~f~0.offset .cse60) .cse59))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse62 v_arrayElimCell_99) v_arrayElimCell_103)))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse68 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse63 (concat .cse68 v_arrayElimCell_104))) (let ((.cse64 (bvmul (_ bv4 32) .cse63))) (or (not (bvslt .cse63 c_~size~0)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse64) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse67 (concat .cse68 v_arrayElimCell_96))) (let ((.cse65 (bvmul (_ bv4 32) .cse67))) (let ((.cse66 (bvadd c_~f~0.offset (_ bv4 32) .cse65))) (or (= .cse65 .cse64) (not (bvule .cse66 .cse2)) (not (bvslt .cse67 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse65) .cse66)) (= .cse5 .cse65)))))) (= .cse5 .cse64) (not (bvsge .cse63 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse69 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse70 (bvmul (_ bv4 32) .cse69))) (or (not (bvslt .cse69 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse70) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse74 (concat v_arrayElimCell_100 v_arrayElimCell_101))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse71 (concat (concat .cse74 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse73 (bvmul (_ bv4 32) .cse71))) (let ((.cse72 (bvadd c_~f~0.offset (_ bv4 32) .cse73))) (or (not (bvslt .cse71 c_~size~0)) (not (bvule .cse72 .cse2)) (not (bvsge .cse71 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse73) .cse72)) (= .cse73 .cse70) (= .cse5 .cse73)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse74 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse5 .cse70) (not (bvsge .cse69 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse75 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse79 (bvmul (_ bv4 32) .cse75))) (or (not (bvslt .cse75 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse78 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse76 (bvmul (_ bv4 32) .cse78))) (let ((.cse77 (bvadd c_~f~0.offset (_ bv4 32) .cse76))) (or (not (bvule (bvadd c_~f~0.offset .cse76) .cse77)) (not (bvule .cse77 .cse2)) (not (bvslt .cse78 c_~size~0)) (= .cse79 .cse76) (not (bvsge .cse78 (_ bv0 32))) (= .cse5 .cse76)))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse79) .cse2)) (= .cse5 .cse79) (not (bvsge .cse75 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse80 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse83 (bvmul (_ bv4 32) .cse80))) (or (not (bvslt .cse80 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse84 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse81 (bvmul (_ bv4 32) .cse84))) (let ((.cse82 (bvadd c_~f~0.offset (_ bv4 32) .cse81))) (or (not (bvule (bvadd c_~f~0.offset .cse81) .cse82)) (= .cse5 .cse81) (= .cse81 .cse83) (not (bvslt .cse84 c_~size~0)) (not (bvule .cse82 .cse2))))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse83) .cse2)) (= .cse5 .cse83) (not (bvsge .cse80 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse86 (bvmul (_ bv4 32) .cse85))) (or (not (bvslt .cse85 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse86) .cse2)) (= .cse5 .cse86) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse90 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse88 (concat (concat .cse90 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse89 (bvmul (_ bv4 32) .cse88))) (let ((.cse87 (bvadd c_~f~0.offset (_ bv4 32) .cse89))) (or (not (bvule .cse87 .cse2)) (not (bvslt .cse88 c_~size~0)) (not (bvsge .cse88 (_ bv0 32))) (= .cse5 .cse89) (not (bvule (bvadd c_~f~0.offset .cse89) .cse87)) (= .cse89 .cse86)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse90 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (not (bvsge .cse85 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse96 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse91 (concat .cse96 v_arrayElimCell_104))) (let ((.cse92 (bvmul (_ bv4 32) .cse91))) (or (not (bvslt .cse91 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse92) .cse2)) (= .cse5 .cse92) (not (bvsge .cse91 (_ bv0 32))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse95 (concat .cse96 v_arrayElimCell_96))) (let ((.cse93 (bvmul (_ bv4 32) .cse95))) (let ((.cse94 (bvadd c_~f~0.offset (_ bv4 32) .cse93))) (or (= .cse93 .cse92) (not (bvule .cse94 .cse2)) (not (bvslt .cse95 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse93) .cse94)))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse97 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse98 (bvmul (_ bv4 32) .cse97))) (or (not (bvslt .cse97 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse98) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse101 (bvmul (_ bv4 32) .cse99))) (let ((.cse100 (bvadd c_~f~0.offset (_ bv4 32) .cse101))) (or (not (bvslt .cse99 c_~size~0)) (not (bvule .cse100 .cse2)) (not (bvsge .cse99 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse101) .cse100)) (= .cse101 .cse98) (= .cse5 .cse101)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))))) (= .cse5 .cse98) (not (bvsge .cse97 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse102 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse103 (bvmul (_ bv4 32) .cse102))) (or (not (bvslt .cse102 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse103) .cse2)) (= .cse5 .cse103) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse104 (bvmul (_ bv4 32) .cse106))) (let ((.cse105 (bvadd c_~f~0.offset (_ bv4 32) .cse104))) (or (not (bvule (bvadd c_~f~0.offset .cse104) .cse105)) (not (bvslt .cse106 c_~size~0)) (not (bvule .cse105 .cse2)) (= .cse103 .cse104)))))) (not (bvsge .cse102 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse109 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse107 (concat .cse109 v_arrayElimCell_104))) (let ((.cse108 (bvmul (_ bv4 32) .cse107))) (or (not (bvslt .cse107 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse108) .cse2)) (= .cse5 .cse108) (not (bvsge .cse107 (_ bv0 32))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat .cse109 v_arrayElimCell_96)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse110 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse111 (bvmul (_ bv4 32) .cse110))) (or (not (bvslt .cse110 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse111) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse113 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse114 (bvmul (_ bv4 32) .cse113))) (let ((.cse112 (bvadd c_~f~0.offset (_ bv4 32) .cse114))) (or (not (bvule .cse112 .cse2)) (not (bvslt .cse113 c_~size~0)) (not (bvsge .cse113 (_ bv0 32))) (= .cse5 .cse114) (not (bvule (bvadd c_~f~0.offset .cse114) .cse112)) (= .cse114 .cse111)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse5 .cse111) (not (bvsge .cse110 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse115 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse119 (bvmul (_ bv4 32) .cse115))) (or (not (bvslt .cse115 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse117 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse116 (bvmul (_ bv4 32) .cse117))) (let ((.cse118 (bvadd c_~f~0.offset (_ bv4 32) .cse116))) (or (= .cse5 .cse116) (not (bvsge .cse117 (_ bv0 32))) (not (bvule .cse118 .cse2)) (not (bvslt .cse117 c_~size~0)) (= .cse116 .cse119) (not (bvule (bvadd c_~f~0.offset .cse116) .cse118))))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse119) .cse2)) (= .cse5 .cse119) (not (bvsge .cse115 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse123 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse120 (concat (concat .cse123 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse121 (bvmul (_ bv4 32) .cse120))) (or (not (bvslt .cse120 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse121) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse122 (concat (concat .cse123 v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse122) (= .cse5 (bvmul (_ bv4 32) .cse122))))) (= .cse5 .cse121) (not (bvsge .cse120 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse124 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse125 (bvmul (_ bv4 32) .cse124))) (or (not (bvslt .cse124 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse125) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse126 (bvmul (_ bv4 32) .cse128))) (let ((.cse127 (bvadd c_~f~0.offset (_ bv4 32) .cse126))) (or (not (bvule (bvadd c_~f~0.offset .cse126) .cse127)) (= .cse5 .cse126) (= .cse126 .cse125) (not (bvslt .cse128 c_~size~0)) (not (bvule .cse127 .cse2))))))))) (= .cse5 .cse125) (not (bvsge .cse124 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse129 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse130 (bvmul (_ bv4 32) .cse129))) (or (not (bvslt .cse129 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse130) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse132 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse131 (bvmul (_ bv4 32) .cse132))) (let ((.cse133 (bvadd .cse131 c_~f~0.offset (_ bv4 32)))) (or (= .cse131 .cse130) (not (bvsge .cse132 (_ bv0 32))) (not (bvslt .cse132 c_~size~0)) (not (bvule (bvadd .cse131 c_~f~0.offset) .cse133)) (not (bvule .cse133 .cse2))))))) (= .cse5 .cse130) (not (bvsge .cse129 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse139 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse134 (concat .cse139 v_arrayElimCell_104))) (let ((.cse135 (bvmul (_ bv4 32) .cse134))) (or (not (bvslt .cse134 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse135) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse138 (concat .cse139 v_arrayElimCell_96))) (let ((.cse136 (bvmul (_ bv4 32) .cse138))) (let ((.cse137 (bvadd c_~f~0.offset (_ bv4 32) .cse136))) (or (= .cse136 .cse135) (not (bvule .cse137 .cse2)) (not (bvslt .cse138 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse136) .cse137)) (= .cse5 .cse136)))))) (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse139 v_arrayElimCell_103))) (= .cse5 .cse135) (not (bvsge .cse134 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse141 (bvmul (_ bv4 32) .cse140))) (or (not (bvslt .cse140 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse141) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse144 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse142 (bvmul (_ bv4 32) .cse144))) (let ((.cse143 (bvadd c_~f~0.offset (_ bv4 32) .cse142))) (or (not (bvule (bvadd c_~f~0.offset .cse142) .cse143)) (not (bvule .cse143 .cse2)) (not (bvslt .cse144 c_~size~0)) (= .cse141 .cse142) (not (bvsge .cse144 (_ bv0 32))) (= .cse5 .cse142)))))))) (= .cse5 .cse141) (not (bvsge .cse140 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse146 (bvmul (_ bv4 32) .cse145))) (or (not (bvslt .cse145 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse146) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse5 (bvmul (_ bv4 32) .cse147)) (= c_~x1~0 .cse147)))) (= .cse5 .cse146) (not (bvsge .cse145 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse152 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse151 (bvmul (_ bv4 32) .cse152))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse150 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse149 (bvmul (_ bv4 32) .cse150))) (let ((.cse148 (bvadd c_~f~0.offset (_ bv4 32) .cse149))) (or (not (bvule .cse148 .cse2)) (= .cse5 .cse149) (not (bvslt .cse150 c_~size~0)) (= .cse151 .cse149) (not (bvule (bvadd c_~f~0.offset .cse149) .cse148))))))) (not (bvslt .cse152 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse151) .cse2)) (= .cse5 .cse151) (not (bvsge .cse152 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse155 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse153 (concat (concat .cse155 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse154 (bvmul (_ bv4 32) .cse153))) (or (not (bvslt .cse153 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse154) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse155 v_arrayElimCell_107) v_arrayElimCell_104))) (= .cse5 .cse154) (not (bvsge .cse153 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse158 (bvmul (_ bv4 32) .cse156))) (or (not (bvslt .cse156 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse157 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse157 c_~x1~0) (= .cse5 (bvmul (_ bv4 32) .cse157))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse158) .cse2)) (= .cse5 .cse158) (not (bvsge .cse156 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse164 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse159 (concat .cse164 v_arrayElimCell_104))) (let ((.cse160 (bvmul (_ bv4 32) .cse159))) (or (not (bvslt .cse159 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse160) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse163 (concat .cse164 v_arrayElimCell_96))) (let ((.cse161 (bvmul (_ bv4 32) .cse163))) (let ((.cse162 (bvadd c_~f~0.offset (_ bv4 32) .cse161))) (or (= .cse161 .cse160) (not (bvule .cse162 .cse2)) (not (bvslt .cse163 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse161) .cse162)) (= .cse5 .cse161)))))) (forall ((v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_103) c_~x1~0)) (= .cse5 .cse160) (not (bvsge .cse159 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse167 (bvmul (_ bv4 32) .cse165))) (or (not (bvslt .cse165 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse166 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse5 (bvmul (_ bv4 32) .cse166)) (= c_~x1~0 .cse166)))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse167) .cse2)) (= .cse5 .cse167) (not (bvsge .cse165 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse168 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse169 (bvmul (_ bv4 32) .cse168))) (or (not (bvslt .cse168 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse169) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse170 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse172 (bvmul (_ bv4 32) .cse170))) (let ((.cse171 (bvadd c_~f~0.offset (_ bv4 32) .cse172))) (or (not (bvslt .cse170 c_~size~0)) (not (bvule .cse171 .cse2)) (not (bvsge .cse170 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse172) .cse171)) (= .cse172 .cse169) (= .cse5 .cse172)))))) (= .cse5 .cse169) (not (bvsge .cse168 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse178 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse173 (concat .cse178 v_arrayElimCell_104))) (let ((.cse174 (bvmul (_ bv4 32) .cse173))) (or (not (bvslt .cse173 c_~size~0)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse174) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse177 (concat .cse178 v_arrayElimCell_96))) (let ((.cse175 (bvmul (_ bv4 32) .cse177))) (let ((.cse176 (bvadd c_~f~0.offset (_ bv4 32) .cse175))) (or (= .cse175 .cse174) (not (bvule .cse176 .cse2)) (not (bvslt .cse177 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse175) .cse176)) (= .cse5 .cse175)))))) (= .cse5 .cse174) (not (bvsge .cse173 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse179 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse183 (bvmul (_ bv4 32) .cse179))) (or (not (bvslt .cse179 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse181 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse182 (bvmul (_ bv4 32) .cse181))) (let ((.cse180 (bvadd c_~f~0.offset (_ bv4 32) .cse182))) (or (not (bvule .cse180 .cse2)) (not (bvslt .cse181 c_~size~0)) (not (bvsge .cse181 (_ bv0 32))) (= .cse5 .cse182) (not (bvule (bvadd c_~f~0.offset .cse182) .cse180)) (= .cse182 .cse183)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse183) .cse2)) (= .cse5 .cse183) (not (bvsge .cse179 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse184 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse185 (bvmul (_ bv4 32) .cse184))) (or (not (bvslt .cse184 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse185) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse5 .cse185) (not (bvsge .cse184 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse186 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse187 (bvmul (_ bv4 32) .cse186))) (or (not (bvslt .cse186 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse187) .cse2)) (= .cse5 .cse187) (not (bvsge .cse186 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse190 (bvmul (_ bv4 32) .cse188))) (let ((.cse189 (bvadd c_~f~0.offset (_ bv4 32) .cse190))) (or (not (bvsge .cse188 (_ bv0 32))) (not (bvule .cse189 .cse2)) (= .cse190 .cse187) (not (bvule (bvadd c_~f~0.offset .cse190) .cse189)) (not (bvslt .cse188 c_~size~0))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse196 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse191 (concat (concat .cse196 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse192 (bvmul (_ bv4 32) .cse191))) (or (not (bvslt .cse191 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse192) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse195 (concat (concat .cse196 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse193 (bvmul (_ bv4 32) .cse195))) (let ((.cse194 (bvadd c_~f~0.offset (_ bv4 32) .cse193))) (or (= .cse192 .cse193) (not (bvule (bvadd c_~f~0.offset .cse193) .cse194)) (not (bvule .cse194 .cse2)) (not (bvslt .cse195 c_~size~0)) (= .cse5 .cse193)))))))) (= .cse5 .cse192) (not (bvsge .cse191 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse197 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse199 (bvmul (_ bv4 32) .cse197))) (or (not (bvslt .cse197 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse198 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse198 c_~x1~0) (= .cse5 (bvmul (_ bv4 32) .cse198))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse199) .cse2)) (= .cse5 .cse199) (not (bvsge .cse197 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse205 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse200 (concat .cse205 v_arrayElimCell_104))) (let ((.cse201 (bvmul (_ bv4 32) .cse200))) (or (not (bvslt .cse200 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse201) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse204 (concat .cse205 v_arrayElimCell_96))) (let ((.cse202 (bvmul (_ bv4 32) .cse204))) (let ((.cse203 (bvadd c_~f~0.offset (_ bv4 32) .cse202))) (or (= .cse202 .cse201) (not (bvule .cse203 .cse2)) (not (bvslt .cse204 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse202) .cse203)) (= .cse5 .cse202)))))) (= .cse5 .cse201) (not (bvsge .cse200 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse206 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse210 (bvmul (_ bv4 32) .cse206))) (or (not (bvslt .cse206 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse207 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse207 v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse211 (concat (concat .cse207 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse208 (bvmul (_ bv4 32) .cse211))) (let ((.cse209 (bvadd c_~f~0.offset (_ bv4 32) .cse208))) (or (not (bvule (bvadd c_~f~0.offset .cse208) .cse209)) (= .cse5 .cse208) (= .cse208 .cse210) (not (bvslt .cse211 c_~size~0)) (not (bvule .cse209 .cse2)))))))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse210) .cse2)) (= .cse5 .cse210) (not (bvsge .cse206 (_ bv0 32))))))) (or (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse217 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse216 (concat .cse217 v_arrayElimCell_96))) (let ((.cse212 (concat .cse217 v_arrayElimCell_104)) (.cse213 (bvmul (_ bv4 32) .cse216))) (let ((.cse215 (bvadd c_~f~0.offset (_ bv4 32) .cse213)) (.cse214 (bvmul (_ bv4 32) .cse212))) (or (not (bvslt .cse212 c_~size~0)) (= .cse213 .cse214) (not (bvule .cse215 .cse2)) (not (bvslt .cse216 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse213) .cse215)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse214) .cse2)) (= .cse5 .cse214) (= .cse5 .cse213) (not (bvsge .cse212 (_ bv0 32))))))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse219 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse218 (concat (concat .cse219 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse220 (bvmul (_ bv4 32) .cse218))) (or (not (bvslt .cse218 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse219 v_arrayElimCell_107) v_arrayElimCell_96))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse220) .cse2)) (= .cse5 .cse220) (not (bvsge .cse218 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse221 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse222 (bvmul (_ bv4 32) .cse221))) (or (not (bvslt .cse221 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse222) .cse2)) (= .cse5 .cse222) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse225 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse223 (bvmul (_ bv4 32) .cse225))) (let ((.cse224 (bvadd c_~f~0.offset (_ bv4 32) .cse223))) (or (not (bvule (bvadd c_~f~0.offset .cse223) .cse224)) (not (bvule .cse224 .cse2)) (not (bvslt .cse225 c_~size~0)) (= .cse222 .cse223) (not (bvsge .cse225 (_ bv0 32)))))))) (not (bvsge .cse221 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse230 (bvmul (_ bv4 32) .cse226))) (or (not (bvslt .cse226 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse231 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse229 (concat (concat .cse231 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse227 (bvmul (_ bv4 32) .cse229))) (let ((.cse228 (bvadd c_~f~0.offset (_ bv4 32) .cse227))) (or (not (bvule (bvadd c_~f~0.offset .cse227) .cse228)) (not (bvule .cse228 .cse2)) (not (bvslt .cse229 c_~size~0)) (= .cse230 .cse227) (not (bvsge .cse229 (_ bv0 32))) (= .cse5 .cse227)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse231 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse230) .cse2)) (= .cse5 .cse230) (not (bvsge .cse226 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse232 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse233 (bvmul (_ bv4 32) .cse232))) (or (not (bvslt .cse232 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse233) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse5 .cse233) (not (bvsge .cse232 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse235 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse240 (concat .cse235 v_arrayElimCell_105))) (let ((.cse234 (concat .cse240 v_arrayElimCell_104))) (let ((.cse236 (bvmul (_ bv4 32) .cse234))) (or (not (bvslt .cse234 c_~size~0)) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse235 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse236) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse239 (concat .cse240 v_arrayElimCell_96))) (let ((.cse237 (bvmul (_ bv4 32) .cse239))) (let ((.cse238 (bvadd c_~f~0.offset (_ bv4 32) .cse237))) (or (= .cse237 .cse236) (not (bvule .cse238 .cse2)) (not (bvslt .cse239 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse237) .cse238)) (= .cse5 .cse237)))))) (= .cse5 .cse236) (not (bvsge .cse234 (_ bv0 32))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse241 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse242 (bvmul (_ bv4 32) .cse241))) (or (not (bvslt .cse241 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse242) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse243 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse244 (bvmul (_ bv4 32) .cse243))) (let ((.cse245 (bvadd c_~f~0.offset (_ bv4 32) .cse244))) (or (not (bvsge .cse243 (_ bv0 32))) (not (bvslt .cse243 c_~size~0)) (= .cse242 .cse244) (not (bvule .cse245 .cse2)) (not (bvule (bvadd c_~f~0.offset .cse244) .cse245))))))) (= .cse5 .cse242) (not (bvsge .cse241 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse246 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse247 (bvmul (_ bv4 32) .cse246))) (or (not (bvslt .cse246 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse247) .cse2)) (= .cse5 .cse247) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse250 (bvmul (_ bv4 32) .cse248))) (let ((.cse249 (bvadd c_~f~0.offset (_ bv4 32) .cse250))) (or (not (bvslt .cse248 c_~size~0)) (not (bvule .cse249 .cse2)) (not (bvsge .cse248 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse250) .cse249)) (= .cse250 .cse247) (= .cse5 .cse250)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvsge .cse246 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse251 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse252 (bvmul (_ bv4 32) .cse251))) (or (not (bvslt .cse251 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse252) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse5 .cse252) (not (bvsge .cse251 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse253 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse254 (bvmul (_ bv4 32) .cse253))) (or (not (bvslt .cse253 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse254) .cse2)) (= .cse5 .cse254) (not (bvsge .cse253 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse260 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse255 (concat (concat .cse260 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse256 (bvmul (_ bv4 32) .cse255))) (or (not (bvslt .cse255 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse259 (concat (concat .cse260 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse257 (bvmul (_ bv4 32) .cse259))) (let ((.cse258 (bvadd c_~f~0.offset (_ bv4 32) .cse257))) (or (= .cse256 .cse257) (not (bvule (bvadd c_~f~0.offset .cse257) .cse258)) (not (bvule .cse258 .cse2)) (not (bvslt .cse259 c_~size~0))))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse256) .cse2)) (= .cse5 .cse256) (not (bvsge .cse255 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse262 (bvmul (_ bv4 32) .cse261))) (or (not (bvslt .cse261 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse262) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (= .cse5 .cse262) (not (bvsge .cse261 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse263 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse264 (bvmul (_ bv4 32) .cse263))) (or (not (bvslt .cse263 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse264) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse266 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse267 (bvmul (_ bv4 32) .cse266))) (let ((.cse265 (bvadd c_~f~0.offset (_ bv4 32) .cse267))) (or (not (bvule .cse265 .cse2)) (not (bvslt .cse266 c_~size~0)) (not (bvsge .cse266 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse267) .cse265)) (= .cse267 .cse264)))))) (= .cse5 .cse264) (not (bvsge .cse263 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse273 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse268 (concat .cse273 v_arrayElimCell_104))) (let ((.cse269 (bvmul (_ bv4 32) .cse268))) (or (not (bvslt .cse268 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse269) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse272 (concat .cse273 v_arrayElimCell_96))) (let ((.cse270 (bvmul (_ bv4 32) .cse272))) (let ((.cse271 (bvadd c_~f~0.offset (_ bv4 32) .cse270))) (or (= .cse270 .cse269) (not (bvule .cse271 .cse2)) (not (bvslt .cse272 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse270) .cse271)) (= .cse5 .cse270)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse5 .cse269) (not (bvsge .cse268 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse274 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse275 (bvmul (_ bv4 32) .cse274))) (or (not (bvslt .cse274 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse275) .cse2)) (= .cse5 .cse275) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse278 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse276 (bvmul (_ bv4 32) .cse278))) (let ((.cse277 (bvadd c_~f~0.offset (_ bv4 32) .cse276))) (or (not (bvule (bvadd c_~f~0.offset .cse276) .cse277)) (not (bvslt .cse278 c_~size~0)) (not (bvsge .cse278 (_ bv0 32))) (= .cse276 .cse275) (not (bvule .cse277 .cse2))))))) (not (bvsge .cse274 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse279 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse280 (bvmul (_ bv4 32) .cse279))) (or (not (bvslt .cse279 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse280) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse282 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse281 (bvmul (_ bv4 32) .cse282))) (let ((.cse283 (bvadd c_~f~0.offset (_ bv4 32) .cse281))) (or (= .cse5 .cse281) (not (bvsge .cse282 (_ bv0 32))) (not (bvule .cse283 .cse2)) (not (bvslt .cse282 c_~size~0)) (= .cse281 .cse280) (not (bvule (bvadd c_~f~0.offset .cse281) .cse283))))))))) (= .cse5 .cse280) (not (bvsge .cse279 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse284 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse285 (bvmul (_ bv4 32) .cse284))) (or (not (bvslt .cse284 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse285) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse5 .cse285) (not (bvsge .cse284 (_ bv0 32))))))) (or .cse16 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse286 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse286) (= .cse5 (bvmul (_ bv4 32) .cse286)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse287 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse288 (bvmul (_ bv4 32) .cse287))) (or (not (bvslt .cse287 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse288) .cse2)) (= .cse5 .cse288) (not (bvsge .cse287 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse294 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse289 (concat (concat .cse294 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse290 (bvmul (_ bv4 32) .cse289))) (or (not (bvslt .cse289 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse290) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse293 (concat (concat .cse294 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse291 (bvmul (_ bv4 32) .cse293))) (let ((.cse292 (bvadd c_~f~0.offset (_ bv4 32) .cse291))) (or (= .cse290 .cse291) (not (bvule (bvadd c_~f~0.offset .cse291) .cse292)) (not (bvule .cse292 .cse2)) (not (bvslt .cse293 c_~size~0)) (= .cse5 .cse291)))))))) (= .cse5 .cse290) (not (bvsge .cse289 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse300 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse295 (concat (concat .cse300 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse296 (bvmul (_ bv4 32) .cse295))) (or (not (bvslt .cse295 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse296) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse297 (concat (concat .cse300 v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse298 (bvmul (_ bv4 32) .cse297))) (let ((.cse299 (bvadd c_~f~0.offset (_ bv4 32) .cse298))) (or (not (bvslt .cse297 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse298) .cse299)) (= .cse298 .cse296) (not (bvule .cse299 .cse2))))))) (= .cse5 .cse296) (not (bvsge .cse295 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse301 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse302 (bvmul (_ bv4 32) .cse301))) (or (not (bvslt .cse301 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse302) .cse2)) (= .cse5 .cse302) (not (bvsge .cse301 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse303 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse304 (bvmul (_ bv4 32) .cse303))) (or (not (bvslt .cse303 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse304) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse307 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse305 (bvmul (_ bv4 32) .cse307))) (let ((.cse306 (bvadd c_~f~0.offset (_ bv4 32) .cse305))) (or (not (bvule (bvadd c_~f~0.offset .cse305) .cse306)) (not (bvule .cse306 .cse2)) (not (bvslt .cse307 c_~size~0)) (= .cse304 .cse305) (not (bvsge .cse307 (_ bv0 32))) (= .cse5 .cse305)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse5 .cse304) (not (bvsge .cse303 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse308 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse309 (bvmul (_ bv4 32) .cse308))) (or (not (bvslt .cse308 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse309) .cse2)) (= .cse5 .cse309) (not (bvsge .cse308 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse315 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse310 (concat .cse315 v_arrayElimCell_104))) (let ((.cse311 (bvmul (_ bv4 32) .cse310))) (or (not (bvslt .cse310 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse311) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse314 (concat .cse315 v_arrayElimCell_96))) (let ((.cse312 (bvmul (_ bv4 32) .cse314))) (let ((.cse313 (bvadd c_~f~0.offset (_ bv4 32) .cse312))) (or (= .cse312 .cse311) (not (bvule .cse313 .cse2)) (not (bvslt .cse314 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse312) .cse313)) (= .cse5 .cse312)))))) (= .cse5 .cse311) (not (bvsge .cse310 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse316 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse317 (bvmul (_ bv4 32) .cse316))) (or (not (bvslt .cse316 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse317) .cse2)) (= .cse5 .cse317) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (not (bvsge .cse316 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse318 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse319 (bvmul (_ bv4 32) .cse318))) (or (not (bvslt .cse318 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse319) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse320 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse322 (bvmul (_ bv4 32) .cse320))) (let ((.cse321 (bvadd c_~f~0.offset (_ bv4 32) .cse322))) (or (not (bvsge .cse320 (_ bv0 32))) (not (bvule .cse321 .cse2)) (not (bvslt .cse320 c_~size~0)) (= .cse322 .cse319) (not (bvule (bvadd c_~f~0.offset .cse322) .cse321))))))) (= .cse5 .cse319) (not (bvsge .cse318 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse323 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse324 (bvmul (_ bv4 32) .cse323))) (or (not (bvslt .cse323 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse324) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse325 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= c_~x1~0 .cse325) (= .cse5 (bvmul (_ bv4 32) .cse325))))) (= .cse5 .cse324) (not (bvsge .cse323 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse326 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse327 (bvmul (_ bv4 32) .cse326))) (or (not (bvslt .cse326 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse327) .cse2)) (= .cse5 .cse327) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse329 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse330 (bvmul (_ bv4 32) .cse329))) (let ((.cse328 (bvadd c_~f~0.offset (_ bv4 32) .cse330))) (or (not (bvule .cse328 .cse2)) (not (bvslt .cse329 c_~size~0)) (= .cse327 .cse330) (not (bvule (bvadd c_~f~0.offset .cse330) .cse328))))))) (not (bvsge .cse326 (_ bv0 32)))))))))) (not (bvslt c_~x2~0 c_~size~0))) is different from true [2022-11-23 02:32:17,823 WARN L859 $PredicateComparison]: unable to prove that (or (not (bvsge c_~x2~0 (_ bv0 32))) (bvslt |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt c_~x2~0 c_~size~0)) (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (bvmul c_~x2~0 (_ bv4 32)))) (let ((.cse105 (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse332 (bvmul (_ bv4 32) .cse331))) (or (not (bvslt .cse331 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse332) .cse2)) (= .cse3 .cse332) (not (bvsge .cse331 (_ bv0 32))))))))) (and (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse1 (bvmul (_ bv4 32) .cse0))) (or (not (bvslt .cse0 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse1) .cse2)) (= .cse3 .cse1) (not (bvsge .cse0 (_ bv0 32))) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse5 (bvmul (_ bv4 32) .cse4))) (let ((.cse6 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse5))) (or (not (bvsge .cse4 (_ bv0 32))) (not (bvslt .cse4 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse5) .cse6)) (= .cse1 .cse5) (not (bvule .cse6 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse7 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse8 (bvmul (_ bv4 32) .cse7))) (or (not (bvslt .cse7 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse8) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse3 .cse8) (not (bvsge .cse7 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse13 (bvmul (_ bv4 32) .cse9))) (or (not (bvslt .cse9 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse12 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse11 (bvmul (_ bv4 32) .cse12))) (let ((.cse10 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse11))) (or (not (bvule .cse10 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse11) .cse10)) (not (bvslt .cse12 c_~size~0)) (not (bvsge .cse12 (_ bv0 32))) (= .cse11 .cse13)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse13) .cse2)) (= .cse3 .cse13) (not (bvsge .cse9 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse14 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse18 (bvmul (_ bv4 32) .cse14))) (or (not (bvslt .cse14 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse16 (bvmul .cse15 (_ bv4 32)))) (let ((.cse17 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse16))) (or (not (bvslt .cse15 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse16) .cse17)) (= .cse16 .cse18) (not (bvule .cse17 .cse2))))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse18) .cse2)) (= .cse3 .cse18) (not (bvsge .cse14 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse20 (bvmul (_ bv4 32) .cse19))) (or (not (bvslt .cse19 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse20) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse3 (bvmul (_ bv4 32) .cse21)) (= c_~x1~0 .cse21)))) (= .cse3 .cse20) (not (bvsge .cse19 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse27 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse22 (concat (concat .cse27 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse23 (bvmul (_ bv4 32) .cse22))) (or (not (bvslt .cse22 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse26 (concat (concat .cse27 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse24 (bvmul (_ bv4 32) .cse26))) (let ((.cse25 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse24))) (or (= .cse23 .cse24) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse24) .cse25)) (not (bvslt .cse26 c_~size~0)) (not (bvule .cse25 .cse2)) (= .cse3 .cse24)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse23) .cse2)) (= .cse3 .cse23) (not (bvsge .cse22 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse29 (bvmul (_ bv4 32) .cse28))) (or (not (bvslt .cse28 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse29) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse29) (not (bvsge .cse28 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse31 (bvmul (_ bv4 32) .cse30))) (or (not (bvslt .cse30 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse31) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse32 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse34 (bvmul (_ bv4 32) .cse32))) (let ((.cse33 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse34))) (or (not (bvsge .cse32 (_ bv0 32))) (not (bvule .cse33 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse34) .cse33)) (not (bvslt .cse32 c_~size~0)) (= .cse34 .cse31)))))) (= .cse3 .cse31) (not (bvsge .cse30 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse35 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse36 (bvmul (_ bv4 32) .cse35))) (or (not (bvslt .cse35 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse36) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse37 (bvmul (_ bv4 32) .cse38))) (let ((.cse39 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse37))) (or (= .cse3 .cse37) (not (bvsge .cse38 (_ bv0 32))) (not (bvule .cse39 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse37) .cse39)) (not (bvslt .cse38 c_~size~0)) (= .cse37 .cse36)))))))) (= .cse3 .cse36) (not (bvsge .cse35 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse40 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse43 (bvmul (_ bv4 32) .cse40))) (or (not (bvslt .cse40 c_~size~0)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse42 (bvmul (_ bv4 32) .cse41))) (let ((.cse44 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse42))) (or (not (bvslt .cse41 c_~size~0)) (not (bvsge .cse41 (_ bv0 32))) (= .cse42 .cse43) (not (bvule .cse44 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse42) .cse44))))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse43) .cse2)) (= .cse3 .cse43) (not (bvsge .cse40 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse46 (bvmul (_ bv4 32) .cse45))) (or (not (bvslt .cse45 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse46) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse3 .cse46) (not (bvsge .cse45 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse47 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse48 (bvmul (_ bv4 32) .cse47))) (or (not (bvslt .cse47 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse48) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse50 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse51 (bvmul (_ bv4 32) .cse50))) (let ((.cse49 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse51))) (or (not (bvule .cse49 .cse2)) (not (bvsge .cse50 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse51) .cse49)) (= .cse51 .cse48) (not (bvslt .cse50 c_~size~0))))))) (= .cse3 .cse48) (not (bvsge .cse47 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse53 (bvmul (_ bv4 32) .cse52))) (or (not (bvslt .cse52 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse53) .cse2)) (= .cse3 .cse53) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse54 (bvmul (_ bv4 32) .cse55))) (let ((.cse56 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse54))) (or (= .cse3 .cse54) (= .cse54 .cse53) (not (bvslt .cse55 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse54) .cse56)) (not (bvule .cse56 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvsge .cse52 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse58 (bvmul (_ bv4 32) .cse57))) (or (not (bvslt .cse57 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse58) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse60 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse59 (bvmul (_ bv4 32) .cse60))) (let ((.cse61 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse59))) (or (= .cse3 .cse59) (not (bvsge .cse60 (_ bv0 32))) (not (bvule .cse61 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse59) .cse61)) (not (bvslt .cse60 c_~size~0)) (= .cse59 .cse58)))))) (= .cse3 .cse58) (not (bvsge .cse57 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse63 (bvmul (_ bv4 32) .cse62))) (or (not (bvslt .cse62 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse63) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse3 (bvmul (_ bv4 32) .cse64)) (= c_~x1~0 .cse64)))) (= .cse3 .cse63) (not (bvsge .cse62 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse66 (bvmul (_ bv4 32) .cse65))) (or (not (bvslt .cse65 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse66) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse3 .cse66) (not (bvsge .cse65 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse72 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse67 (concat .cse72 v_arrayElimCell_104))) (let ((.cse68 (bvmul (_ bv4 32) .cse67))) (or (not (bvslt .cse67 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse68) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse71 (concat .cse72 v_arrayElimCell_96))) (let ((.cse69 (bvmul (_ bv4 32) .cse71))) (let ((.cse70 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse69))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse69) .cse70)) (= .cse69 .cse68) (not (bvslt .cse71 c_~size~0)) (not (bvule .cse70 .cse2)) (= .cse3 .cse69)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse68) (not (bvsge .cse67 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse78 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse73 (concat .cse78 v_arrayElimCell_104))) (let ((.cse74 (bvmul (_ bv4 32) .cse73))) (or (not (bvslt .cse73 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse74) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse77 (concat .cse78 v_arrayElimCell_96))) (let ((.cse75 (bvmul (_ bv4 32) .cse77))) (let ((.cse76 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse75))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse75) .cse76)) (= .cse75 .cse74) (not (bvslt .cse77 c_~size~0)) (not (bvule .cse76 .cse2)) (= .cse3 .cse75)))))) (= .cse3 .cse74) (not (bvsge .cse73 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse80 (bvmul (_ bv4 32) .cse79))) (or (not (bvslt .cse79 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse80) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse82 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse83 (bvmul (_ bv4 32) .cse82))) (let ((.cse81 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse83))) (or (not (bvule .cse81 .cse2)) (not (bvslt .cse82 c_~size~0)) (not (bvsge .cse82 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse83) .cse81)) (= .cse3 .cse83) (= .cse83 .cse80)))))) (= .cse3 .cse80) (not (bvsge .cse79 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse89 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse84 (concat .cse89 v_arrayElimCell_104))) (let ((.cse85 (bvmul (_ bv4 32) .cse84))) (or (not (bvslt .cse84 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse85) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse88 (concat .cse89 v_arrayElimCell_96))) (let ((.cse86 (bvmul (_ bv4 32) .cse88))) (let ((.cse87 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse86))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse86) .cse87)) (= .cse86 .cse85) (not (bvslt .cse88 c_~size~0)) (not (bvule .cse87 .cse2))))))) (= .cse3 .cse85) (not (bvsge .cse84 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse95 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse90 (concat .cse95 v_arrayElimCell_104))) (let ((.cse91 (bvmul (_ bv4 32) .cse90))) (or (not (bvslt .cse90 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse91) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse94 (concat .cse95 v_arrayElimCell_96))) (let ((.cse92 (bvmul (_ bv4 32) .cse94))) (let ((.cse93 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse92))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse92) .cse93)) (= .cse92 .cse91) (not (bvslt .cse94 c_~size~0)) (not (bvule .cse93 .cse2)) (= .cse3 .cse92)))))) (= .cse3 .cse91) (not (bvsge .cse90 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse101 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse96 (concat (concat .cse101 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse97 (bvmul (_ bv4 32) .cse96))) (or (not (bvslt .cse96 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse97) .cse2)) (= .cse3 .cse97) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse100 (concat (concat .cse101 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse98 (bvmul (_ bv4 32) .cse100))) (let ((.cse99 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse98))) (or (= .cse97 .cse98) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse98) .cse99)) (not (bvslt .cse100 c_~size~0)) (not (bvule .cse99 .cse2)) (= .cse3 .cse98)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvsge .cse96 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse102 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse104 (bvmul (_ bv4 32) .cse102))) (or (not (bvslt .cse102 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse103 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse103 c_~x1~0) (= .cse3 (bvmul (_ bv4 32) .cse103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse104) .cse2)) (= .cse3 .cse104) (not (bvsge .cse102 (_ bv0 32))))))) (or .cse105 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96)))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse107 (bvmul (_ bv4 32) .cse106))) (or (not (bvslt .cse106 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse107) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse111 (concat v_arrayElimCell_100 v_arrayElimCell_101))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse108 (concat (concat .cse111 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse109 (bvmul (_ bv4 32) .cse108))) (let ((.cse110 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse109))) (or (not (bvslt .cse108 c_~size~0)) (not (bvsge .cse108 (_ bv0 32))) (= .cse109 .cse107) (= .cse3 .cse109) (not (bvule .cse110 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse109) .cse110))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse111 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse3 .cse107) (not (bvsge .cse106 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse113 (bvmul (_ bv4 32) .cse112))) (or (not (bvslt .cse112 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse113) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse114 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse115 (bvmul (_ bv4 32) .cse114))) (let ((.cse116 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse115))) (or (not (bvslt .cse114 c_~size~0)) (not (bvsge .cse114 (_ bv0 32))) (= .cse115 .cse113) (= .cse3 .cse115) (not (bvule .cse116 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse115) .cse116))))))))) (= .cse3 .cse113) (not (bvsge .cse112 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse122 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse117 (concat .cse122 v_arrayElimCell_104))) (let ((.cse118 (bvmul (_ bv4 32) .cse117))) (or (not (bvslt .cse117 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse118) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse121 (concat .cse122 v_arrayElimCell_96))) (let ((.cse119 (bvmul (_ bv4 32) .cse121))) (let ((.cse120 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse119))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse119) .cse120)) (= .cse119 .cse118) (not (bvslt .cse121 c_~size~0)) (not (bvule .cse120 .cse2)) (= .cse3 .cse119)))))) (forall ((v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse118) (not (bvsge .cse117 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse123 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse124 (bvmul (_ bv4 32) .cse123))) (or (not (bvslt .cse123 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse124) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse126 (bvmul (_ bv4 32) .cse125))) (let ((.cse127 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse126))) (or (not (bvslt .cse125 c_~size~0)) (not (bvsge .cse125 (_ bv0 32))) (= .cse126 .cse124) (= .cse3 .cse126) (not (bvule .cse127 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse126) .cse127))))))) (= .cse3 .cse124) (not (bvsge .cse123 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse129 (bvmul (_ bv4 32) .cse128))) (or (not (bvslt .cse128 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse129) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse132 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse130 (bvmul (_ bv4 32) .cse132))) (let ((.cse131 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse130))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse130) .cse131)) (not (bvslt .cse132 c_~size~0)) (= .cse129 .cse130) (not (bvsge .cse132 (_ bv0 32))) (not (bvule .cse131 .cse2))))))) (= .cse3 .cse129) (not (bvsge .cse128 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse138 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse133 (concat (concat .cse138 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse134 (bvmul (_ bv4 32) .cse133))) (or (not (bvslt .cse133 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse134) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse137 (concat (concat .cse138 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse135 (bvmul (_ bv4 32) .cse137))) (let ((.cse136 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse135))) (or (= .cse134 .cse135) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse135) .cse136)) (not (bvslt .cse137 c_~size~0)) (not (bvule .cse136 .cse2))))))) (= .cse3 .cse134) (not (bvsge .cse133 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse144 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse139 (concat .cse144 v_arrayElimCell_104))) (let ((.cse140 (bvmul (_ bv4 32) .cse139))) (or (not (bvslt .cse139 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse140) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse143 (concat .cse144 v_arrayElimCell_96))) (let ((.cse141 (bvmul (_ bv4 32) .cse143))) (let ((.cse142 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse141))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse141) .cse142)) (= .cse141 .cse140) (not (bvslt .cse143 c_~size~0)) (not (bvule .cse142 .cse2)) (= .cse3 .cse141)))))) (= .cse3 .cse140) (not (bvsge .cse139 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse146 (bvmul (_ bv4 32) .cse145))) (or (not (bvslt .cse145 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse146) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= c_~x1~0 .cse147) (= .cse3 (bvmul (_ bv4 32) .cse147))))) (= .cse3 .cse146) (not (bvsge .cse145 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse148 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse149 (bvmul (_ bv4 32) .cse148))) (or (not (bvslt .cse148 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse149) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse149) (not (bvsge .cse148 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse155 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse150 (concat (concat .cse155 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse151 (bvmul (_ bv4 32) .cse150))) (or (not (bvslt .cse150 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse151) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse152 (concat (concat .cse155 v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse153 (bvmul (_ bv4 32) .cse152))) (let ((.cse154 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse153))) (or (not (bvslt .cse152 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse153) .cse154)) (= .cse153 .cse151) (not (bvule .cse154 .cse2))))))) (= .cse3 .cse151) (not (bvsge .cse150 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse157 (bvmul (_ bv4 32) .cse156))) (or (not (bvslt .cse156 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse157) .cse2)) (= .cse3 .cse157) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (not (bvsge .cse156 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse159 (bvmul (_ bv4 32) .cse158))) (or (not (bvslt .cse158 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse159) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse162 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse160 (bvmul (_ bv4 32) .cse162))) (let ((.cse161 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse160))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse160) .cse161)) (not (bvslt .cse162 c_~size~0)) (= .cse159 .cse160) (not (bvsge .cse162 (_ bv0 32))) (= .cse3 .cse160) (not (bvule .cse161 .cse2))))))))) (= .cse3 .cse159) (not (bvsge .cse158 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse164 (bvmul (_ bv4 32) .cse163))) (or (not (bvslt .cse163 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse164) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse164) (not (bvsge .cse163 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse166 (bvmul (_ bv4 32) .cse165))) (or (not (bvslt .cse165 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse166) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse169 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse167 (bvmul (_ bv4 32) .cse169))) (let ((.cse168 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse167))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse167) .cse168)) (not (bvslt .cse169 c_~size~0)) (= .cse166 .cse167) (not (bvsge .cse169 (_ bv0 32))) (= .cse3 .cse167) (not (bvule .cse168 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse3 .cse166) (not (bvsge .cse165 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse170 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse174 (bvmul (_ bv4 32) .cse170))) (or (not (bvslt .cse170 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse175 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse172 (concat (concat .cse175 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse171 (bvmul (_ bv4 32) .cse172))) (let ((.cse173 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse171))) (or (= .cse3 .cse171) (not (bvslt .cse172 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse171) .cse173)) (= .cse174 .cse171) (not (bvule .cse173 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse175 v_arrayElimCell_99) v_arrayElimCell_103)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse174) .cse2)) (= .cse3 .cse174) (not (bvsge .cse170 (_ bv0 32))))))) (or .cse105 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse176) (= .cse3 (bvmul (_ bv4 32) .cse176)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse178 (bvmul (_ bv4 32) .cse177))) (or (not (bvslt .cse177 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse178) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse182 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse181 (concat (concat .cse182 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse179 (bvmul (_ bv4 32) .cse181))) (let ((.cse180 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse179))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse179) .cse180)) (not (bvslt .cse181 c_~size~0)) (= .cse178 .cse179) (not (bvsge .cse181 (_ bv0 32))) (= .cse3 .cse179) (not (bvule .cse180 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse182 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse3 .cse178) (not (bvsge .cse177 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse183 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse184 (bvmul (_ bv4 32) .cse183))) (or (not (bvslt .cse183 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse184) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse186 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse187 (bvmul (_ bv4 32) .cse186))) (let ((.cse185 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse187))) (or (not (bvule .cse185 .cse2)) (not (bvslt .cse186 c_~size~0)) (not (bvsge .cse186 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse187) .cse185)) (= .cse187 .cse184)))))) (= .cse3 .cse184) (not (bvsge .cse183 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (or (not (bvslt .cse188 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) .cse188)) .cse2)) (= .cse188 c_~x1~0) (not (bvsge .cse188 (_ bv0 32)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse189 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse190 (bvmul (_ bv4 32) .cse189))) (or (not (bvslt .cse189 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse190) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (= .cse3 .cse190) (not (bvsge .cse189 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse195 (bvmul (_ bv4 32) .cse191))) (or (not (bvslt .cse191 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse193 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse194 (bvmul (_ bv4 32) .cse193))) (let ((.cse192 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse194))) (or (not (bvule .cse192 .cse2)) (not (bvslt .cse193 c_~size~0)) (not (bvsge .cse193 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse194) .cse192)) (= .cse3 .cse194) (= .cse194 .cse195)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse195) .cse2)) (= .cse3 .cse195) (not (bvsge .cse191 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse199 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse196 (concat .cse199 v_arrayElimCell_104))) (let ((.cse197 (bvmul (_ bv4 32) .cse196))) (or (not (bvslt .cse196 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse197) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse198 (concat .cse199 v_arrayElimCell_96))) (or (= c_~x1~0 .cse198) (= .cse3 (bvmul (_ bv4 32) .cse198))))) (= .cse3 .cse197) (not (bvsge .cse196 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse200 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse201 (bvmul (_ bv4 32) .cse200))) (or (not (bvslt .cse200 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse201) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse203 (bvmul (_ bv4 32) .cse202))) (let ((.cse204 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse203))) (or (not (bvslt .cse202 c_~size~0)) (not (bvsge .cse202 (_ bv0 32))) (= .cse203 .cse201) (= .cse3 .cse203) (not (bvule .cse204 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse203) .cse204))))))))) (= .cse3 .cse201) (not (bvsge .cse200 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse209 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse206 (bvmul (_ bv4 32) .cse209))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse205 (bvmul (_ bv4 32) .cse207))) (let ((.cse208 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse205))) (or (= .cse205 .cse206) (not (bvslt .cse207 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse205) .cse208)) (not (bvule .cse208 .cse2))))))) (not (bvslt .cse209 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse206) .cse2)) (= .cse3 .cse206) (not (bvsge .cse209 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse215 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse210 (concat .cse215 v_arrayElimCell_104))) (let ((.cse211 (bvmul (_ bv4 32) .cse210))) (or (not (bvslt .cse210 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse211) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse214 (concat .cse215 v_arrayElimCell_96))) (let ((.cse212 (bvmul (_ bv4 32) .cse214))) (let ((.cse213 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse212))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse212) .cse213)) (= .cse212 .cse211) (not (bvslt .cse214 c_~size~0)) (not (bvule .cse213 .cse2)) (= .cse3 .cse212)))))) (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse215 v_arrayElimCell_103))) (= .cse3 .cse211) (not (bvsge .cse210 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse218 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse216 (concat (concat .cse218 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse217 (bvmul (_ bv4 32) .cse216))) (or (not (bvslt .cse216 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse217) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse218 v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse3 .cse217) (not (bvsge .cse216 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse220 (bvmul (_ bv4 32) .cse219))) (or (not (bvslt .cse219 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse220) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse221 (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105))) (or (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse221 v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse222 (concat .cse221 v_arrayElimCell_96))) (let ((.cse223 (bvmul (_ bv4 32) .cse222))) (let ((.cse224 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse223))) (or (not (bvslt .cse222 c_~size~0)) (not (bvsge .cse222 (_ bv0 32))) (= .cse223 .cse220) (= .cse3 .cse223) (not (bvule .cse224 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse223) .cse224)))))))))) (= .cse3 .cse220) (not (bvsge .cse219 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse226 (bvmul (_ bv4 32) .cse229))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse227 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse225 (bvmul (_ bv4 32) .cse227))) (let ((.cse228 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse225))) (or (= .cse3 .cse225) (= .cse225 .cse226) (not (bvslt .cse227 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse225) .cse228)) (not (bvule .cse228 .cse2))))))) (not (bvslt .cse229 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse226) .cse2)) (= .cse3 .cse226) (not (bvsge .cse229 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse232 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse230 (concat .cse232 v_arrayElimCell_104))) (let ((.cse231 (bvmul (_ bv4 32) .cse230))) (or (not (bvslt .cse230 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse231) .cse2)) (= .cse3 .cse231) (not (bvsge .cse230 (_ bv0 32))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat .cse232 v_arrayElimCell_96)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse234 (bvmul (_ bv4 32) .cse233))) (or (not (bvslt .cse233 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse234) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse236 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse235 (bvmul (_ bv4 32) .cse236))) (let ((.cse237 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse235))) (or (= .cse3 .cse235) (not (bvslt .cse236 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse235) .cse237)) (= .cse234 .cse235) (not (bvule .cse237 .cse2))))))))) (= .cse3 .cse234) (not (bvsge .cse233 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse238 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse239 (bvmul (_ bv4 32) .cse238))) (or (not (bvslt .cse238 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse239) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse240 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse240 c_~x1~0) (= .cse3 (bvmul (_ bv4 32) .cse240))))) (= .cse3 .cse239) (not (bvsge .cse238 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse243 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse241 (concat (concat .cse243 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse242 (bvmul (_ bv4 32) .cse241))) (or (not (bvslt .cse241 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse242) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse243 v_arrayElimCell_107) v_arrayElimCell_104))) (= .cse3 .cse242) (not (bvsge .cse241 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse245 (bvmul (_ bv4 32) .cse244))) (or (not (bvslt .cse244 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse245) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse246 (bvmul (_ bv4 32) .cse248))) (let ((.cse247 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse246))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse246) .cse247)) (not (bvslt .cse248 c_~size~0)) (not (bvule .cse247 .cse2)) (= .cse245 .cse246)))))) (= .cse3 .cse245) (not (bvsge .cse244 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse249 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse250 (bvmul (_ bv4 32) .cse249))) (or (not (bvslt .cse249 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse250) .cse2)) (= .cse3 .cse250) (not (bvsge .cse249 (_ bv0 32))) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse252 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse251 (bvmul (_ bv4 32) .cse252))) (let ((.cse253 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse251))) (or (= .cse3 .cse251) (not (bvsge .cse252 (_ bv0 32))) (not (bvule .cse253 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse251) .cse253)) (not (bvslt .cse252 c_~size~0)) (= .cse251 .cse250)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse255 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse260 (concat .cse255 v_arrayElimCell_105))) (let ((.cse254 (concat .cse260 v_arrayElimCell_104))) (let ((.cse256 (bvmul (_ bv4 32) .cse254))) (or (not (bvslt .cse254 c_~size~0)) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse255 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse256) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse259 (concat .cse260 v_arrayElimCell_96))) (let ((.cse257 (bvmul (_ bv4 32) .cse259))) (let ((.cse258 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse257))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse257) .cse258)) (= .cse257 .cse256) (not (bvslt .cse259 c_~size~0)) (not (bvule .cse258 .cse2)) (= .cse3 .cse257)))))) (= .cse3 .cse256) (not (bvsge .cse254 (_ bv0 32))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse262 (bvmul (_ bv4 32) .cse261))) (or (not (bvslt .cse261 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse262) .cse2)) (= .cse3 .cse262) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse266 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse264 (concat (concat .cse266 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse265 (bvmul (_ bv4 32) .cse264))) (let ((.cse263 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse265))) (or (not (bvule .cse263 .cse2)) (not (bvslt .cse264 c_~size~0)) (not (bvsge .cse264 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse265) .cse263)) (= .cse3 .cse265) (= .cse265 .cse262)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse266 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (not (bvsge .cse261 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse270 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse267 (concat (concat .cse270 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse268 (bvmul (_ bv4 32) .cse267))) (or (not (bvslt .cse267 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse268) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse269 (concat (concat .cse270 v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse269) (= .cse3 (bvmul (_ bv4 32) .cse269))))) (= .cse3 .cse268) (not (bvsge .cse267 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse272 (bvmul (_ bv4 32) .cse271))) (or (not (bvslt .cse271 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse272) .cse2)) (= .cse3 .cse272) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse276 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse274 (concat (concat .cse276 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse273 (bvmul (_ bv4 32) .cse274))) (let ((.cse275 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse273))) (or (= .cse3 .cse273) (= .cse273 .cse272) (not (bvslt .cse274 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse273) .cse275)) (not (bvule .cse275 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse276 v_arrayElimCell_99) v_arrayElimCell_103)))))) (not (bvsge .cse271 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse277 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse278 (bvmul (_ bv4 32) .cse277))) (or (not (bvslt .cse277 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse278) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse280 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse281 (bvmul (_ bv4 32) .cse280))) (let ((.cse279 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse281))) (or (not (bvule .cse279 .cse2)) (not (bvslt .cse280 c_~size~0)) (not (bvsge .cse280 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse281) .cse279)) (= .cse3 .cse281) (= .cse281 .cse278)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse3 .cse278) (not (bvsge .cse277 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse282 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse283 (bvmul (_ bv4 32) .cse282))) (or (not (bvslt .cse282 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse283) .cse2)) (= .cse3 .cse283) (not (bvsge .cse282 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse285 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse284 (bvmul (_ bv4 32) .cse285))) (let ((.cse286 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse284))) (or (= .cse3 .cse284) (not (bvslt .cse285 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse284) .cse286)) (= .cse283 .cse284) (not (bvule .cse286 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse291 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse290 (bvmul (_ bv4 32) .cse291))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse289 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse287 (bvmul (_ bv4 32) .cse289))) (let ((.cse288 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse287))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse287) .cse288)) (not (bvslt .cse289 c_~size~0)) (= .cse290 .cse287) (not (bvsge .cse289 (_ bv0 32))) (= .cse3 .cse287) (not (bvule .cse288 .cse2))))))) (not (bvslt .cse291 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse290) .cse2)) (= .cse3 .cse290) (not (bvsge .cse291 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse292 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse293 (bvmul (_ bv4 32) .cse292))) (or (not (bvslt .cse292 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse293) .cse2)) (= .cse3 .cse293) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (not (bvsge .cse292 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse294 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse295 (bvmul (_ bv4 32) .cse294))) (or (not (bvslt .cse294 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse295) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse297 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse296 (bvmul (_ bv4 32) .cse297))) (let ((.cse298 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse296))) (or (= .cse3 .cse296) (not (bvsge .cse297 (_ bv0 32))) (not (bvule .cse298 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse296) .cse298)) (not (bvslt .cse297 c_~size~0)) (= .cse296 .cse295)))))))) (= .cse3 .cse295) (not (bvsge .cse294 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse304 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse299 (concat (concat .cse304 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse300 (bvmul (_ bv4 32) .cse299))) (or (not (bvslt .cse299 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse300) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse303 (concat (concat .cse304 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse301 (bvmul (_ bv4 32) .cse303))) (let ((.cse302 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse301))) (or (= .cse300 .cse301) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse301) .cse302)) (not (bvslt .cse303 c_~size~0)) (not (bvule .cse302 .cse2)) (= .cse3 .cse301)))))) (= .cse3 .cse300) (not (bvsge .cse299 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse310 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse305 (concat .cse310 v_arrayElimCell_104))) (let ((.cse306 (bvmul (_ bv4 32) .cse305))) (or (not (bvslt .cse305 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse306) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse309 (concat .cse310 v_arrayElimCell_96))) (let ((.cse307 (bvmul (_ bv4 32) .cse309))) (let ((.cse308 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse307))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse307) .cse308)) (= .cse307 .cse306) (not (bvslt .cse309 c_~size~0)) (not (bvule .cse308 .cse2)) (= .cse3 .cse307)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse306) (not (bvsge .cse305 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse311 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse312 (bvmul (_ bv4 32) .cse311))) (or (not (bvslt .cse311 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse312) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse314 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse313 (bvmul (_ bv4 32) .cse314))) (let ((.cse315 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse313 (_ bv4 32)))) (or (= .cse313 .cse312) (not (bvsge .cse314 (_ bv0 32))) (not (bvslt .cse314 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse313) .cse315)) (not (bvule .cse315 .cse2))))))) (= .cse3 .cse312) (not (bvsge .cse311 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse316 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse317 (bvmul (_ bv4 32) .cse316))) (or (not (bvslt .cse316 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse317) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse317) (not (bvsge .cse316 (_ bv0 32))))))) (or (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse323 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse322 (concat .cse323 v_arrayElimCell_96))) (let ((.cse320 (concat .cse323 v_arrayElimCell_104)) (.cse318 (bvmul (_ bv4 32) .cse322))) (let ((.cse319 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse318)) (.cse321 (bvmul (_ bv4 32) .cse320))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse318) .cse319)) (not (bvslt .cse320 c_~size~0)) (= .cse318 .cse321) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse321) .cse2)) (not (bvslt .cse322 c_~size~0)) (not (bvule .cse319 .cse2)) (= .cse3 .cse321) (= .cse3 .cse318) (not (bvsge .cse320 (_ bv0 32))))))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse324 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse325 (bvmul (_ bv4 32) .cse324))) (or (not (bvslt .cse324 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse325) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse326 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse327 (bvmul (_ bv4 32) .cse326))) (let ((.cse328 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse327))) (or (not (bvslt .cse326 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse327) .cse328)) (= .cse325 .cse327) (not (bvule .cse328 .cse2))))))) (= .cse3 .cse325) (not (bvsge .cse324 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse329 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse330 (bvmul (_ bv4 32) .cse329))) (or (not (bvslt .cse329 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse330) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse330) (not (bvsge .cse329 (_ bv0 32))))))))))) is different from true [2022-11-23 02:32:30,729 WARN L859 $PredicateComparison]: unable to prove that (or (bvslt (bvadd |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| (_ bv1 32)) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvsge c_~x2~0 (_ bv0 32))) (not (bvslt c_~x2~0 c_~size~0)) (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (bvmul c_~x2~0 (_ bv4 32)))) (let ((.cse105 (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse332 (bvmul (_ bv4 32) .cse331))) (or (not (bvslt .cse331 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse332) .cse2)) (= .cse3 .cse332) (not (bvsge .cse331 (_ bv0 32))))))))) (and (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse1 (bvmul (_ bv4 32) .cse0))) (or (not (bvslt .cse0 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse1) .cse2)) (= .cse3 .cse1) (not (bvsge .cse0 (_ bv0 32))) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse5 (bvmul (_ bv4 32) .cse4))) (let ((.cse6 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse5))) (or (not (bvsge .cse4 (_ bv0 32))) (not (bvslt .cse4 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse5) .cse6)) (= .cse1 .cse5) (not (bvule .cse6 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse7 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse8 (bvmul (_ bv4 32) .cse7))) (or (not (bvslt .cse7 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse8) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse3 .cse8) (not (bvsge .cse7 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse13 (bvmul (_ bv4 32) .cse9))) (or (not (bvslt .cse9 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse12 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse11 (bvmul (_ bv4 32) .cse12))) (let ((.cse10 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse11))) (or (not (bvule .cse10 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse11) .cse10)) (not (bvslt .cse12 c_~size~0)) (not (bvsge .cse12 (_ bv0 32))) (= .cse11 .cse13)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse13) .cse2)) (= .cse3 .cse13) (not (bvsge .cse9 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse14 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse18 (bvmul (_ bv4 32) .cse14))) (or (not (bvslt .cse14 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse16 (bvmul .cse15 (_ bv4 32)))) (let ((.cse17 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse16))) (or (not (bvslt .cse15 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse16) .cse17)) (= .cse16 .cse18) (not (bvule .cse17 .cse2))))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse18) .cse2)) (= .cse3 .cse18) (not (bvsge .cse14 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse20 (bvmul (_ bv4 32) .cse19))) (or (not (bvslt .cse19 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse20) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse3 (bvmul (_ bv4 32) .cse21)) (= c_~x1~0 .cse21)))) (= .cse3 .cse20) (not (bvsge .cse19 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse27 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse22 (concat (concat .cse27 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse23 (bvmul (_ bv4 32) .cse22))) (or (not (bvslt .cse22 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse26 (concat (concat .cse27 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse24 (bvmul (_ bv4 32) .cse26))) (let ((.cse25 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse24))) (or (= .cse23 .cse24) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse24) .cse25)) (not (bvslt .cse26 c_~size~0)) (not (bvule .cse25 .cse2)) (= .cse3 .cse24)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse23) .cse2)) (= .cse3 .cse23) (not (bvsge .cse22 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse29 (bvmul (_ bv4 32) .cse28))) (or (not (bvslt .cse28 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse29) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse29) (not (bvsge .cse28 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse31 (bvmul (_ bv4 32) .cse30))) (or (not (bvslt .cse30 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse31) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse32 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse34 (bvmul (_ bv4 32) .cse32))) (let ((.cse33 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse34))) (or (not (bvsge .cse32 (_ bv0 32))) (not (bvule .cse33 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse34) .cse33)) (not (bvslt .cse32 c_~size~0)) (= .cse34 .cse31)))))) (= .cse3 .cse31) (not (bvsge .cse30 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse35 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse36 (bvmul (_ bv4 32) .cse35))) (or (not (bvslt .cse35 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse36) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse37 (bvmul (_ bv4 32) .cse38))) (let ((.cse39 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse37))) (or (= .cse3 .cse37) (not (bvsge .cse38 (_ bv0 32))) (not (bvule .cse39 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse37) .cse39)) (not (bvslt .cse38 c_~size~0)) (= .cse37 .cse36)))))))) (= .cse3 .cse36) (not (bvsge .cse35 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse40 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse43 (bvmul (_ bv4 32) .cse40))) (or (not (bvslt .cse40 c_~size~0)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse42 (bvmul (_ bv4 32) .cse41))) (let ((.cse44 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse42))) (or (not (bvslt .cse41 c_~size~0)) (not (bvsge .cse41 (_ bv0 32))) (= .cse42 .cse43) (not (bvule .cse44 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse42) .cse44))))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse43) .cse2)) (= .cse3 .cse43) (not (bvsge .cse40 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse46 (bvmul (_ bv4 32) .cse45))) (or (not (bvslt .cse45 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse46) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse3 .cse46) (not (bvsge .cse45 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse47 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse48 (bvmul (_ bv4 32) .cse47))) (or (not (bvslt .cse47 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse48) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse50 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse51 (bvmul (_ bv4 32) .cse50))) (let ((.cse49 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse51))) (or (not (bvule .cse49 .cse2)) (not (bvsge .cse50 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse51) .cse49)) (= .cse51 .cse48) (not (bvslt .cse50 c_~size~0))))))) (= .cse3 .cse48) (not (bvsge .cse47 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse53 (bvmul (_ bv4 32) .cse52))) (or (not (bvslt .cse52 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse53) .cse2)) (= .cse3 .cse53) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse54 (bvmul (_ bv4 32) .cse55))) (let ((.cse56 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse54))) (or (= .cse3 .cse54) (= .cse54 .cse53) (not (bvslt .cse55 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse54) .cse56)) (not (bvule .cse56 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvsge .cse52 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse58 (bvmul (_ bv4 32) .cse57))) (or (not (bvslt .cse57 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse58) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse60 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse59 (bvmul (_ bv4 32) .cse60))) (let ((.cse61 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse59))) (or (= .cse3 .cse59) (not (bvsge .cse60 (_ bv0 32))) (not (bvule .cse61 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse59) .cse61)) (not (bvslt .cse60 c_~size~0)) (= .cse59 .cse58)))))) (= .cse3 .cse58) (not (bvsge .cse57 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse63 (bvmul (_ bv4 32) .cse62))) (or (not (bvslt .cse62 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse63) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse3 (bvmul (_ bv4 32) .cse64)) (= c_~x1~0 .cse64)))) (= .cse3 .cse63) (not (bvsge .cse62 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse66 (bvmul (_ bv4 32) .cse65))) (or (not (bvslt .cse65 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse66) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse3 .cse66) (not (bvsge .cse65 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse72 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse67 (concat .cse72 v_arrayElimCell_104))) (let ((.cse68 (bvmul (_ bv4 32) .cse67))) (or (not (bvslt .cse67 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse68) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse71 (concat .cse72 v_arrayElimCell_96))) (let ((.cse69 (bvmul (_ bv4 32) .cse71))) (let ((.cse70 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse69))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse69) .cse70)) (= .cse69 .cse68) (not (bvslt .cse71 c_~size~0)) (not (bvule .cse70 .cse2)) (= .cse3 .cse69)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse68) (not (bvsge .cse67 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse78 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse73 (concat .cse78 v_arrayElimCell_104))) (let ((.cse74 (bvmul (_ bv4 32) .cse73))) (or (not (bvslt .cse73 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse74) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse77 (concat .cse78 v_arrayElimCell_96))) (let ((.cse75 (bvmul (_ bv4 32) .cse77))) (let ((.cse76 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse75))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse75) .cse76)) (= .cse75 .cse74) (not (bvslt .cse77 c_~size~0)) (not (bvule .cse76 .cse2)) (= .cse3 .cse75)))))) (= .cse3 .cse74) (not (bvsge .cse73 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse80 (bvmul (_ bv4 32) .cse79))) (or (not (bvslt .cse79 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse80) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse82 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse83 (bvmul (_ bv4 32) .cse82))) (let ((.cse81 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse83))) (or (not (bvule .cse81 .cse2)) (not (bvslt .cse82 c_~size~0)) (not (bvsge .cse82 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse83) .cse81)) (= .cse3 .cse83) (= .cse83 .cse80)))))) (= .cse3 .cse80) (not (bvsge .cse79 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse89 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse84 (concat .cse89 v_arrayElimCell_104))) (let ((.cse85 (bvmul (_ bv4 32) .cse84))) (or (not (bvslt .cse84 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse85) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse88 (concat .cse89 v_arrayElimCell_96))) (let ((.cse86 (bvmul (_ bv4 32) .cse88))) (let ((.cse87 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse86))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse86) .cse87)) (= .cse86 .cse85) (not (bvslt .cse88 c_~size~0)) (not (bvule .cse87 .cse2))))))) (= .cse3 .cse85) (not (bvsge .cse84 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse95 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse90 (concat .cse95 v_arrayElimCell_104))) (let ((.cse91 (bvmul (_ bv4 32) .cse90))) (or (not (bvslt .cse90 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse91) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse94 (concat .cse95 v_arrayElimCell_96))) (let ((.cse92 (bvmul (_ bv4 32) .cse94))) (let ((.cse93 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse92))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse92) .cse93)) (= .cse92 .cse91) (not (bvslt .cse94 c_~size~0)) (not (bvule .cse93 .cse2)) (= .cse3 .cse92)))))) (= .cse3 .cse91) (not (bvsge .cse90 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse101 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse96 (concat (concat .cse101 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse97 (bvmul (_ bv4 32) .cse96))) (or (not (bvslt .cse96 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse97) .cse2)) (= .cse3 .cse97) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse100 (concat (concat .cse101 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse98 (bvmul (_ bv4 32) .cse100))) (let ((.cse99 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse98))) (or (= .cse97 .cse98) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse98) .cse99)) (not (bvslt .cse100 c_~size~0)) (not (bvule .cse99 .cse2)) (= .cse3 .cse98)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvsge .cse96 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse102 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse104 (bvmul (_ bv4 32) .cse102))) (or (not (bvslt .cse102 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse103 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse103 c_~x1~0) (= .cse3 (bvmul (_ bv4 32) .cse103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse104) .cse2)) (= .cse3 .cse104) (not (bvsge .cse102 (_ bv0 32))))))) (or .cse105 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96)))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse107 (bvmul (_ bv4 32) .cse106))) (or (not (bvslt .cse106 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse107) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse111 (concat v_arrayElimCell_100 v_arrayElimCell_101))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse108 (concat (concat .cse111 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse109 (bvmul (_ bv4 32) .cse108))) (let ((.cse110 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse109))) (or (not (bvslt .cse108 c_~size~0)) (not (bvsge .cse108 (_ bv0 32))) (= .cse109 .cse107) (= .cse3 .cse109) (not (bvule .cse110 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse109) .cse110))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse111 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse3 .cse107) (not (bvsge .cse106 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse113 (bvmul (_ bv4 32) .cse112))) (or (not (bvslt .cse112 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse113) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse114 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse115 (bvmul (_ bv4 32) .cse114))) (let ((.cse116 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse115))) (or (not (bvslt .cse114 c_~size~0)) (not (bvsge .cse114 (_ bv0 32))) (= .cse115 .cse113) (= .cse3 .cse115) (not (bvule .cse116 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse115) .cse116))))))))) (= .cse3 .cse113) (not (bvsge .cse112 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse122 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse117 (concat .cse122 v_arrayElimCell_104))) (let ((.cse118 (bvmul (_ bv4 32) .cse117))) (or (not (bvslt .cse117 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse118) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse121 (concat .cse122 v_arrayElimCell_96))) (let ((.cse119 (bvmul (_ bv4 32) .cse121))) (let ((.cse120 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse119))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse119) .cse120)) (= .cse119 .cse118) (not (bvslt .cse121 c_~size~0)) (not (bvule .cse120 .cse2)) (= .cse3 .cse119)))))) (forall ((v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse118) (not (bvsge .cse117 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse123 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse124 (bvmul (_ bv4 32) .cse123))) (or (not (bvslt .cse123 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse124) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse126 (bvmul (_ bv4 32) .cse125))) (let ((.cse127 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse126))) (or (not (bvslt .cse125 c_~size~0)) (not (bvsge .cse125 (_ bv0 32))) (= .cse126 .cse124) (= .cse3 .cse126) (not (bvule .cse127 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse126) .cse127))))))) (= .cse3 .cse124) (not (bvsge .cse123 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse129 (bvmul (_ bv4 32) .cse128))) (or (not (bvslt .cse128 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse129) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse132 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse130 (bvmul (_ bv4 32) .cse132))) (let ((.cse131 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse130))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse130) .cse131)) (not (bvslt .cse132 c_~size~0)) (= .cse129 .cse130) (not (bvsge .cse132 (_ bv0 32))) (not (bvule .cse131 .cse2))))))) (= .cse3 .cse129) (not (bvsge .cse128 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse138 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse133 (concat (concat .cse138 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse134 (bvmul (_ bv4 32) .cse133))) (or (not (bvslt .cse133 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse134) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse137 (concat (concat .cse138 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse135 (bvmul (_ bv4 32) .cse137))) (let ((.cse136 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse135))) (or (= .cse134 .cse135) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse135) .cse136)) (not (bvslt .cse137 c_~size~0)) (not (bvule .cse136 .cse2))))))) (= .cse3 .cse134) (not (bvsge .cse133 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse144 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse139 (concat .cse144 v_arrayElimCell_104))) (let ((.cse140 (bvmul (_ bv4 32) .cse139))) (or (not (bvslt .cse139 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse140) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse143 (concat .cse144 v_arrayElimCell_96))) (let ((.cse141 (bvmul (_ bv4 32) .cse143))) (let ((.cse142 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse141))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse141) .cse142)) (= .cse141 .cse140) (not (bvslt .cse143 c_~size~0)) (not (bvule .cse142 .cse2)) (= .cse3 .cse141)))))) (= .cse3 .cse140) (not (bvsge .cse139 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse146 (bvmul (_ bv4 32) .cse145))) (or (not (bvslt .cse145 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse146) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= c_~x1~0 .cse147) (= .cse3 (bvmul (_ bv4 32) .cse147))))) (= .cse3 .cse146) (not (bvsge .cse145 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse148 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse149 (bvmul (_ bv4 32) .cse148))) (or (not (bvslt .cse148 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse149) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse149) (not (bvsge .cse148 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse155 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse150 (concat (concat .cse155 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse151 (bvmul (_ bv4 32) .cse150))) (or (not (bvslt .cse150 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse151) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse152 (concat (concat .cse155 v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse153 (bvmul (_ bv4 32) .cse152))) (let ((.cse154 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse153))) (or (not (bvslt .cse152 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse153) .cse154)) (= .cse153 .cse151) (not (bvule .cse154 .cse2))))))) (= .cse3 .cse151) (not (bvsge .cse150 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse157 (bvmul (_ bv4 32) .cse156))) (or (not (bvslt .cse156 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse157) .cse2)) (= .cse3 .cse157) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (not (bvsge .cse156 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse159 (bvmul (_ bv4 32) .cse158))) (or (not (bvslt .cse158 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse159) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse162 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse160 (bvmul (_ bv4 32) .cse162))) (let ((.cse161 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse160))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse160) .cse161)) (not (bvslt .cse162 c_~size~0)) (= .cse159 .cse160) (not (bvsge .cse162 (_ bv0 32))) (= .cse3 .cse160) (not (bvule .cse161 .cse2))))))))) (= .cse3 .cse159) (not (bvsge .cse158 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse164 (bvmul (_ bv4 32) .cse163))) (or (not (bvslt .cse163 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse164) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse164) (not (bvsge .cse163 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse166 (bvmul (_ bv4 32) .cse165))) (or (not (bvslt .cse165 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse166) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse169 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse167 (bvmul (_ bv4 32) .cse169))) (let ((.cse168 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse167))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse167) .cse168)) (not (bvslt .cse169 c_~size~0)) (= .cse166 .cse167) (not (bvsge .cse169 (_ bv0 32))) (= .cse3 .cse167) (not (bvule .cse168 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse3 .cse166) (not (bvsge .cse165 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse170 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse174 (bvmul (_ bv4 32) .cse170))) (or (not (bvslt .cse170 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse175 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse172 (concat (concat .cse175 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse171 (bvmul (_ bv4 32) .cse172))) (let ((.cse173 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse171))) (or (= .cse3 .cse171) (not (bvslt .cse172 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse171) .cse173)) (= .cse174 .cse171) (not (bvule .cse173 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse175 v_arrayElimCell_99) v_arrayElimCell_103)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse174) .cse2)) (= .cse3 .cse174) (not (bvsge .cse170 (_ bv0 32))))))) (or .cse105 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse176) (= .cse3 (bvmul (_ bv4 32) .cse176)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse178 (bvmul (_ bv4 32) .cse177))) (or (not (bvslt .cse177 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse178) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse182 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse181 (concat (concat .cse182 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse179 (bvmul (_ bv4 32) .cse181))) (let ((.cse180 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse179))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse179) .cse180)) (not (bvslt .cse181 c_~size~0)) (= .cse178 .cse179) (not (bvsge .cse181 (_ bv0 32))) (= .cse3 .cse179) (not (bvule .cse180 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse182 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse3 .cse178) (not (bvsge .cse177 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse183 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse184 (bvmul (_ bv4 32) .cse183))) (or (not (bvslt .cse183 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse184) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse186 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse187 (bvmul (_ bv4 32) .cse186))) (let ((.cse185 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse187))) (or (not (bvule .cse185 .cse2)) (not (bvslt .cse186 c_~size~0)) (not (bvsge .cse186 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse187) .cse185)) (= .cse187 .cse184)))))) (= .cse3 .cse184) (not (bvsge .cse183 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (or (not (bvslt .cse188 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) .cse188)) .cse2)) (= .cse188 c_~x1~0) (not (bvsge .cse188 (_ bv0 32)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse189 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse190 (bvmul (_ bv4 32) .cse189))) (or (not (bvslt .cse189 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse190) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (= .cse3 .cse190) (not (bvsge .cse189 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse195 (bvmul (_ bv4 32) .cse191))) (or (not (bvslt .cse191 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse193 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse194 (bvmul (_ bv4 32) .cse193))) (let ((.cse192 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse194))) (or (not (bvule .cse192 .cse2)) (not (bvslt .cse193 c_~size~0)) (not (bvsge .cse193 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse194) .cse192)) (= .cse3 .cse194) (= .cse194 .cse195)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse195) .cse2)) (= .cse3 .cse195) (not (bvsge .cse191 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse199 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse196 (concat .cse199 v_arrayElimCell_104))) (let ((.cse197 (bvmul (_ bv4 32) .cse196))) (or (not (bvslt .cse196 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse197) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse198 (concat .cse199 v_arrayElimCell_96))) (or (= c_~x1~0 .cse198) (= .cse3 (bvmul (_ bv4 32) .cse198))))) (= .cse3 .cse197) (not (bvsge .cse196 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse200 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse201 (bvmul (_ bv4 32) .cse200))) (or (not (bvslt .cse200 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse201) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse203 (bvmul (_ bv4 32) .cse202))) (let ((.cse204 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse203))) (or (not (bvslt .cse202 c_~size~0)) (not (bvsge .cse202 (_ bv0 32))) (= .cse203 .cse201) (= .cse3 .cse203) (not (bvule .cse204 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse203) .cse204))))))))) (= .cse3 .cse201) (not (bvsge .cse200 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse209 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse206 (bvmul (_ bv4 32) .cse209))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse205 (bvmul (_ bv4 32) .cse207))) (let ((.cse208 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse205))) (or (= .cse205 .cse206) (not (bvslt .cse207 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse205) .cse208)) (not (bvule .cse208 .cse2))))))) (not (bvslt .cse209 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse206) .cse2)) (= .cse3 .cse206) (not (bvsge .cse209 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse215 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse210 (concat .cse215 v_arrayElimCell_104))) (let ((.cse211 (bvmul (_ bv4 32) .cse210))) (or (not (bvslt .cse210 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse211) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse214 (concat .cse215 v_arrayElimCell_96))) (let ((.cse212 (bvmul (_ bv4 32) .cse214))) (let ((.cse213 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse212))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse212) .cse213)) (= .cse212 .cse211) (not (bvslt .cse214 c_~size~0)) (not (bvule .cse213 .cse2)) (= .cse3 .cse212)))))) (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse215 v_arrayElimCell_103))) (= .cse3 .cse211) (not (bvsge .cse210 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse218 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse216 (concat (concat .cse218 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse217 (bvmul (_ bv4 32) .cse216))) (or (not (bvslt .cse216 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse217) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse218 v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse3 .cse217) (not (bvsge .cse216 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse220 (bvmul (_ bv4 32) .cse219))) (or (not (bvslt .cse219 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse220) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse221 (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105))) (or (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse221 v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse222 (concat .cse221 v_arrayElimCell_96))) (let ((.cse223 (bvmul (_ bv4 32) .cse222))) (let ((.cse224 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse223))) (or (not (bvslt .cse222 c_~size~0)) (not (bvsge .cse222 (_ bv0 32))) (= .cse223 .cse220) (= .cse3 .cse223) (not (bvule .cse224 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse223) .cse224)))))))))) (= .cse3 .cse220) (not (bvsge .cse219 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse226 (bvmul (_ bv4 32) .cse229))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse227 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse225 (bvmul (_ bv4 32) .cse227))) (let ((.cse228 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse225))) (or (= .cse3 .cse225) (= .cse225 .cse226) (not (bvslt .cse227 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse225) .cse228)) (not (bvule .cse228 .cse2))))))) (not (bvslt .cse229 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse226) .cse2)) (= .cse3 .cse226) (not (bvsge .cse229 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse232 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse230 (concat .cse232 v_arrayElimCell_104))) (let ((.cse231 (bvmul (_ bv4 32) .cse230))) (or (not (bvslt .cse230 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse231) .cse2)) (= .cse3 .cse231) (not (bvsge .cse230 (_ bv0 32))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat .cse232 v_arrayElimCell_96)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse234 (bvmul (_ bv4 32) .cse233))) (or (not (bvslt .cse233 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse234) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse236 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse235 (bvmul (_ bv4 32) .cse236))) (let ((.cse237 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse235))) (or (= .cse3 .cse235) (not (bvslt .cse236 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse235) .cse237)) (= .cse234 .cse235) (not (bvule .cse237 .cse2))))))))) (= .cse3 .cse234) (not (bvsge .cse233 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse238 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse239 (bvmul (_ bv4 32) .cse238))) (or (not (bvslt .cse238 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse239) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse240 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse240 c_~x1~0) (= .cse3 (bvmul (_ bv4 32) .cse240))))) (= .cse3 .cse239) (not (bvsge .cse238 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse243 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse241 (concat (concat .cse243 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse242 (bvmul (_ bv4 32) .cse241))) (or (not (bvslt .cse241 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse242) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse243 v_arrayElimCell_107) v_arrayElimCell_104))) (= .cse3 .cse242) (not (bvsge .cse241 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse245 (bvmul (_ bv4 32) .cse244))) (or (not (bvslt .cse244 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse245) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse246 (bvmul (_ bv4 32) .cse248))) (let ((.cse247 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse246))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse246) .cse247)) (not (bvslt .cse248 c_~size~0)) (not (bvule .cse247 .cse2)) (= .cse245 .cse246)))))) (= .cse3 .cse245) (not (bvsge .cse244 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse249 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse250 (bvmul (_ bv4 32) .cse249))) (or (not (bvslt .cse249 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse250) .cse2)) (= .cse3 .cse250) (not (bvsge .cse249 (_ bv0 32))) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse252 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse251 (bvmul (_ bv4 32) .cse252))) (let ((.cse253 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse251))) (or (= .cse3 .cse251) (not (bvsge .cse252 (_ bv0 32))) (not (bvule .cse253 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse251) .cse253)) (not (bvslt .cse252 c_~size~0)) (= .cse251 .cse250)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse255 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse260 (concat .cse255 v_arrayElimCell_105))) (let ((.cse254 (concat .cse260 v_arrayElimCell_104))) (let ((.cse256 (bvmul (_ bv4 32) .cse254))) (or (not (bvslt .cse254 c_~size~0)) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse255 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse256) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse259 (concat .cse260 v_arrayElimCell_96))) (let ((.cse257 (bvmul (_ bv4 32) .cse259))) (let ((.cse258 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse257))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse257) .cse258)) (= .cse257 .cse256) (not (bvslt .cse259 c_~size~0)) (not (bvule .cse258 .cse2)) (= .cse3 .cse257)))))) (= .cse3 .cse256) (not (bvsge .cse254 (_ bv0 32))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse262 (bvmul (_ bv4 32) .cse261))) (or (not (bvslt .cse261 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse262) .cse2)) (= .cse3 .cse262) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse266 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse264 (concat (concat .cse266 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse265 (bvmul (_ bv4 32) .cse264))) (let ((.cse263 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse265))) (or (not (bvule .cse263 .cse2)) (not (bvslt .cse264 c_~size~0)) (not (bvsge .cse264 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse265) .cse263)) (= .cse3 .cse265) (= .cse265 .cse262)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse266 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (not (bvsge .cse261 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse270 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse267 (concat (concat .cse270 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse268 (bvmul (_ bv4 32) .cse267))) (or (not (bvslt .cse267 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse268) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse269 (concat (concat .cse270 v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse269) (= .cse3 (bvmul (_ bv4 32) .cse269))))) (= .cse3 .cse268) (not (bvsge .cse267 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse272 (bvmul (_ bv4 32) .cse271))) (or (not (bvslt .cse271 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse272) .cse2)) (= .cse3 .cse272) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse276 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse274 (concat (concat .cse276 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse273 (bvmul (_ bv4 32) .cse274))) (let ((.cse275 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse273))) (or (= .cse3 .cse273) (= .cse273 .cse272) (not (bvslt .cse274 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse273) .cse275)) (not (bvule .cse275 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse276 v_arrayElimCell_99) v_arrayElimCell_103)))))) (not (bvsge .cse271 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse277 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse278 (bvmul (_ bv4 32) .cse277))) (or (not (bvslt .cse277 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse278) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse280 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse281 (bvmul (_ bv4 32) .cse280))) (let ((.cse279 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse281))) (or (not (bvule .cse279 .cse2)) (not (bvslt .cse280 c_~size~0)) (not (bvsge .cse280 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse281) .cse279)) (= .cse3 .cse281) (= .cse281 .cse278)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse3 .cse278) (not (bvsge .cse277 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse282 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse283 (bvmul (_ bv4 32) .cse282))) (or (not (bvslt .cse282 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse283) .cse2)) (= .cse3 .cse283) (not (bvsge .cse282 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse285 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse284 (bvmul (_ bv4 32) .cse285))) (let ((.cse286 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse284))) (or (= .cse3 .cse284) (not (bvslt .cse285 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse284) .cse286)) (= .cse283 .cse284) (not (bvule .cse286 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse291 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse290 (bvmul (_ bv4 32) .cse291))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse289 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse287 (bvmul (_ bv4 32) .cse289))) (let ((.cse288 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse287))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse287) .cse288)) (not (bvslt .cse289 c_~size~0)) (= .cse290 .cse287) (not (bvsge .cse289 (_ bv0 32))) (= .cse3 .cse287) (not (bvule .cse288 .cse2))))))) (not (bvslt .cse291 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse290) .cse2)) (= .cse3 .cse290) (not (bvsge .cse291 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse292 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse293 (bvmul (_ bv4 32) .cse292))) (or (not (bvslt .cse292 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse293) .cse2)) (= .cse3 .cse293) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (not (bvsge .cse292 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse294 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse295 (bvmul (_ bv4 32) .cse294))) (or (not (bvslt .cse294 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse295) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse297 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse296 (bvmul (_ bv4 32) .cse297))) (let ((.cse298 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse296))) (or (= .cse3 .cse296) (not (bvsge .cse297 (_ bv0 32))) (not (bvule .cse298 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse296) .cse298)) (not (bvslt .cse297 c_~size~0)) (= .cse296 .cse295)))))))) (= .cse3 .cse295) (not (bvsge .cse294 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse304 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse299 (concat (concat .cse304 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse300 (bvmul (_ bv4 32) .cse299))) (or (not (bvslt .cse299 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse300) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse303 (concat (concat .cse304 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse301 (bvmul (_ bv4 32) .cse303))) (let ((.cse302 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse301))) (or (= .cse300 .cse301) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse301) .cse302)) (not (bvslt .cse303 c_~size~0)) (not (bvule .cse302 .cse2)) (= .cse3 .cse301)))))) (= .cse3 .cse300) (not (bvsge .cse299 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse310 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse305 (concat .cse310 v_arrayElimCell_104))) (let ((.cse306 (bvmul (_ bv4 32) .cse305))) (or (not (bvslt .cse305 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse306) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse309 (concat .cse310 v_arrayElimCell_96))) (let ((.cse307 (bvmul (_ bv4 32) .cse309))) (let ((.cse308 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse307))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse307) .cse308)) (= .cse307 .cse306) (not (bvslt .cse309 c_~size~0)) (not (bvule .cse308 .cse2)) (= .cse3 .cse307)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse306) (not (bvsge .cse305 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse311 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse312 (bvmul (_ bv4 32) .cse311))) (or (not (bvslt .cse311 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse312) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse314 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse313 (bvmul (_ bv4 32) .cse314))) (let ((.cse315 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse313 (_ bv4 32)))) (or (= .cse313 .cse312) (not (bvsge .cse314 (_ bv0 32))) (not (bvslt .cse314 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse313) .cse315)) (not (bvule .cse315 .cse2))))))) (= .cse3 .cse312) (not (bvsge .cse311 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse316 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse317 (bvmul (_ bv4 32) .cse316))) (or (not (bvslt .cse316 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse317) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse317) (not (bvsge .cse316 (_ bv0 32))))))) (or (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse323 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse322 (concat .cse323 v_arrayElimCell_96))) (let ((.cse320 (concat .cse323 v_arrayElimCell_104)) (.cse318 (bvmul (_ bv4 32) .cse322))) (let ((.cse319 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse318)) (.cse321 (bvmul (_ bv4 32) .cse320))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse318) .cse319)) (not (bvslt .cse320 c_~size~0)) (= .cse318 .cse321) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse321) .cse2)) (not (bvslt .cse322 c_~size~0)) (not (bvule .cse319 .cse2)) (= .cse3 .cse321) (= .cse3 .cse318) (not (bvsge .cse320 (_ bv0 32))))))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse324 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse325 (bvmul (_ bv4 32) .cse324))) (or (not (bvslt .cse324 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse325) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse326 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse327 (bvmul (_ bv4 32) .cse326))) (let ((.cse328 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse327))) (or (not (bvslt .cse326 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse327) .cse328)) (= .cse325 .cse327) (not (bvule .cse328 .cse2))))))) (= .cse3 .cse325) (not (bvsge .cse324 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse329 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse330 (bvmul (_ bv4 32) .cse329))) (or (not (bvslt .cse329 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse330) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse330) (not (bvsge .cse329 (_ bv0 32))))))))))) is different from true [2022-11-23 02:32:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 02:32:30,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:32:30,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628315928] [2022-11-23 02:32:30,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628315928] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:32:30,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:32:30,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2022-11-23 02:32:30,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231692255] [2022-11-23 02:32:30,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:32:30,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 02:32:30,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:32:30,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 02:32:30,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=48, Unknown=3, NotChecked=48, Total=132 [2022-11-23 02:32:30,972 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 421 [2022-11-23 02:32:30,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 185 transitions, 1968 flow. Second operand has 12 states, 12 states have (on average 115.33333333333333) internal successors, (1384), 12 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:32:30,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:32:30,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 421 [2022-11-23 02:32:30,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:32:33,350 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv0 32)) (= c_~x2~0 (_ bv0 32)) (= c_~x1~0 (_ bv0 32)) (= c_~size~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (bvslt (bvadd |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| (_ bv1 32)) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvsge c_~x2~0 (_ bv0 32))) (not (bvslt c_~x2~0 c_~size~0)) (let ((.cse3 (bvmul c_~x2~0 (_ bv4 32)))) (let ((.cse105 (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse332 (bvmul (_ bv4 32) .cse331))) (or (not (bvslt .cse331 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse332) .cse2)) (= .cse3 .cse332) (not (bvsge .cse331 (_ bv0 32))))))))) (and (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse1 (bvmul (_ bv4 32) .cse0))) (or (not (bvslt .cse0 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse1) .cse2)) (= .cse3 .cse1) (not (bvsge .cse0 (_ bv0 32))) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse5 (bvmul (_ bv4 32) .cse4))) (let ((.cse6 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse5))) (or (not (bvsge .cse4 (_ bv0 32))) (not (bvslt .cse4 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse5) .cse6)) (= .cse1 .cse5) (not (bvule .cse6 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse7 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse8 (bvmul (_ bv4 32) .cse7))) (or (not (bvslt .cse7 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse8) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse3 .cse8) (not (bvsge .cse7 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse13 (bvmul (_ bv4 32) .cse9))) (or (not (bvslt .cse9 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse12 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse11 (bvmul (_ bv4 32) .cse12))) (let ((.cse10 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse11))) (or (not (bvule .cse10 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse11) .cse10)) (not (bvslt .cse12 c_~size~0)) (not (bvsge .cse12 (_ bv0 32))) (= .cse11 .cse13)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse13) .cse2)) (= .cse3 .cse13) (not (bvsge .cse9 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse14 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse18 (bvmul (_ bv4 32) .cse14))) (or (not (bvslt .cse14 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse16 (bvmul .cse15 (_ bv4 32)))) (let ((.cse17 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse16))) (or (not (bvslt .cse15 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse16) .cse17)) (= .cse16 .cse18) (not (bvule .cse17 .cse2))))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse18) .cse2)) (= .cse3 .cse18) (not (bvsge .cse14 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse20 (bvmul (_ bv4 32) .cse19))) (or (not (bvslt .cse19 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse20) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse3 (bvmul (_ bv4 32) .cse21)) (= c_~x1~0 .cse21)))) (= .cse3 .cse20) (not (bvsge .cse19 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse27 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse22 (concat (concat .cse27 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse23 (bvmul (_ bv4 32) .cse22))) (or (not (bvslt .cse22 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse26 (concat (concat .cse27 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse24 (bvmul (_ bv4 32) .cse26))) (let ((.cse25 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse24))) (or (= .cse23 .cse24) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse24) .cse25)) (not (bvslt .cse26 c_~size~0)) (not (bvule .cse25 .cse2)) (= .cse3 .cse24)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse23) .cse2)) (= .cse3 .cse23) (not (bvsge .cse22 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse29 (bvmul (_ bv4 32) .cse28))) (or (not (bvslt .cse28 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse29) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse29) (not (bvsge .cse28 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse31 (bvmul (_ bv4 32) .cse30))) (or (not (bvslt .cse30 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse31) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse32 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse34 (bvmul (_ bv4 32) .cse32))) (let ((.cse33 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse34))) (or (not (bvsge .cse32 (_ bv0 32))) (not (bvule .cse33 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse34) .cse33)) (not (bvslt .cse32 c_~size~0)) (= .cse34 .cse31)))))) (= .cse3 .cse31) (not (bvsge .cse30 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse35 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse36 (bvmul (_ bv4 32) .cse35))) (or (not (bvslt .cse35 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse36) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse37 (bvmul (_ bv4 32) .cse38))) (let ((.cse39 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse37))) (or (= .cse3 .cse37) (not (bvsge .cse38 (_ bv0 32))) (not (bvule .cse39 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse37) .cse39)) (not (bvslt .cse38 c_~size~0)) (= .cse37 .cse36)))))))) (= .cse3 .cse36) (not (bvsge .cse35 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse40 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse43 (bvmul (_ bv4 32) .cse40))) (or (not (bvslt .cse40 c_~size~0)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse42 (bvmul (_ bv4 32) .cse41))) (let ((.cse44 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse42))) (or (not (bvslt .cse41 c_~size~0)) (not (bvsge .cse41 (_ bv0 32))) (= .cse42 .cse43) (not (bvule .cse44 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse42) .cse44))))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse43) .cse2)) (= .cse3 .cse43) (not (bvsge .cse40 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse46 (bvmul (_ bv4 32) .cse45))) (or (not (bvslt .cse45 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse46) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse3 .cse46) (not (bvsge .cse45 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse47 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse48 (bvmul (_ bv4 32) .cse47))) (or (not (bvslt .cse47 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse48) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse50 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse51 (bvmul (_ bv4 32) .cse50))) (let ((.cse49 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse51))) (or (not (bvule .cse49 .cse2)) (not (bvsge .cse50 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse51) .cse49)) (= .cse51 .cse48) (not (bvslt .cse50 c_~size~0))))))) (= .cse3 .cse48) (not (bvsge .cse47 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse53 (bvmul (_ bv4 32) .cse52))) (or (not (bvslt .cse52 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse53) .cse2)) (= .cse3 .cse53) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse54 (bvmul (_ bv4 32) .cse55))) (let ((.cse56 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse54))) (or (= .cse3 .cse54) (= .cse54 .cse53) (not (bvslt .cse55 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse54) .cse56)) (not (bvule .cse56 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvsge .cse52 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse58 (bvmul (_ bv4 32) .cse57))) (or (not (bvslt .cse57 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse58) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse60 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse59 (bvmul (_ bv4 32) .cse60))) (let ((.cse61 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse59))) (or (= .cse3 .cse59) (not (bvsge .cse60 (_ bv0 32))) (not (bvule .cse61 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse59) .cse61)) (not (bvslt .cse60 c_~size~0)) (= .cse59 .cse58)))))) (= .cse3 .cse58) (not (bvsge .cse57 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse63 (bvmul (_ bv4 32) .cse62))) (or (not (bvslt .cse62 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse63) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse3 (bvmul (_ bv4 32) .cse64)) (= c_~x1~0 .cse64)))) (= .cse3 .cse63) (not (bvsge .cse62 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse66 (bvmul (_ bv4 32) .cse65))) (or (not (bvslt .cse65 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse66) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse3 .cse66) (not (bvsge .cse65 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse72 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse67 (concat .cse72 v_arrayElimCell_104))) (let ((.cse68 (bvmul (_ bv4 32) .cse67))) (or (not (bvslt .cse67 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse68) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse71 (concat .cse72 v_arrayElimCell_96))) (let ((.cse69 (bvmul (_ bv4 32) .cse71))) (let ((.cse70 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse69))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse69) .cse70)) (= .cse69 .cse68) (not (bvslt .cse71 c_~size~0)) (not (bvule .cse70 .cse2)) (= .cse3 .cse69)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse68) (not (bvsge .cse67 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse78 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse73 (concat .cse78 v_arrayElimCell_104))) (let ((.cse74 (bvmul (_ bv4 32) .cse73))) (or (not (bvslt .cse73 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse74) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse77 (concat .cse78 v_arrayElimCell_96))) (let ((.cse75 (bvmul (_ bv4 32) .cse77))) (let ((.cse76 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse75))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse75) .cse76)) (= .cse75 .cse74) (not (bvslt .cse77 c_~size~0)) (not (bvule .cse76 .cse2)) (= .cse3 .cse75)))))) (= .cse3 .cse74) (not (bvsge .cse73 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse80 (bvmul (_ bv4 32) .cse79))) (or (not (bvslt .cse79 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse80) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse82 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse83 (bvmul (_ bv4 32) .cse82))) (let ((.cse81 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse83))) (or (not (bvule .cse81 .cse2)) (not (bvslt .cse82 c_~size~0)) (not (bvsge .cse82 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse83) .cse81)) (= .cse3 .cse83) (= .cse83 .cse80)))))) (= .cse3 .cse80) (not (bvsge .cse79 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse89 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse84 (concat .cse89 v_arrayElimCell_104))) (let ((.cse85 (bvmul (_ bv4 32) .cse84))) (or (not (bvslt .cse84 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse85) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse88 (concat .cse89 v_arrayElimCell_96))) (let ((.cse86 (bvmul (_ bv4 32) .cse88))) (let ((.cse87 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse86))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse86) .cse87)) (= .cse86 .cse85) (not (bvslt .cse88 c_~size~0)) (not (bvule .cse87 .cse2))))))) (= .cse3 .cse85) (not (bvsge .cse84 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse95 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse90 (concat .cse95 v_arrayElimCell_104))) (let ((.cse91 (bvmul (_ bv4 32) .cse90))) (or (not (bvslt .cse90 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse91) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse94 (concat .cse95 v_arrayElimCell_96))) (let ((.cse92 (bvmul (_ bv4 32) .cse94))) (let ((.cse93 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse92))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse92) .cse93)) (= .cse92 .cse91) (not (bvslt .cse94 c_~size~0)) (not (bvule .cse93 .cse2)) (= .cse3 .cse92)))))) (= .cse3 .cse91) (not (bvsge .cse90 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse101 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse96 (concat (concat .cse101 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse97 (bvmul (_ bv4 32) .cse96))) (or (not (bvslt .cse96 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse97) .cse2)) (= .cse3 .cse97) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse100 (concat (concat .cse101 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse98 (bvmul (_ bv4 32) .cse100))) (let ((.cse99 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse98))) (or (= .cse97 .cse98) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse98) .cse99)) (not (bvslt .cse100 c_~size~0)) (not (bvule .cse99 .cse2)) (= .cse3 .cse98)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvsge .cse96 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse102 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse104 (bvmul (_ bv4 32) .cse102))) (or (not (bvslt .cse102 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse103 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse103 c_~x1~0) (= .cse3 (bvmul (_ bv4 32) .cse103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse104) .cse2)) (= .cse3 .cse104) (not (bvsge .cse102 (_ bv0 32))))))) (or .cse105 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96)))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse107 (bvmul (_ bv4 32) .cse106))) (or (not (bvslt .cse106 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse107) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse111 (concat v_arrayElimCell_100 v_arrayElimCell_101))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse108 (concat (concat .cse111 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse109 (bvmul (_ bv4 32) .cse108))) (let ((.cse110 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse109))) (or (not (bvslt .cse108 c_~size~0)) (not (bvsge .cse108 (_ bv0 32))) (= .cse109 .cse107) (= .cse3 .cse109) (not (bvule .cse110 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse109) .cse110))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse111 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse3 .cse107) (not (bvsge .cse106 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse113 (bvmul (_ bv4 32) .cse112))) (or (not (bvslt .cse112 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse113) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse114 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse115 (bvmul (_ bv4 32) .cse114))) (let ((.cse116 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse115))) (or (not (bvslt .cse114 c_~size~0)) (not (bvsge .cse114 (_ bv0 32))) (= .cse115 .cse113) (= .cse3 .cse115) (not (bvule .cse116 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse115) .cse116))))))))) (= .cse3 .cse113) (not (bvsge .cse112 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse122 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse117 (concat .cse122 v_arrayElimCell_104))) (let ((.cse118 (bvmul (_ bv4 32) .cse117))) (or (not (bvslt .cse117 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse118) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse121 (concat .cse122 v_arrayElimCell_96))) (let ((.cse119 (bvmul (_ bv4 32) .cse121))) (let ((.cse120 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse119))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse119) .cse120)) (= .cse119 .cse118) (not (bvslt .cse121 c_~size~0)) (not (bvule .cse120 .cse2)) (= .cse3 .cse119)))))) (forall ((v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse118) (not (bvsge .cse117 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse123 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse124 (bvmul (_ bv4 32) .cse123))) (or (not (bvslt .cse123 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse124) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse126 (bvmul (_ bv4 32) .cse125))) (let ((.cse127 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse126))) (or (not (bvslt .cse125 c_~size~0)) (not (bvsge .cse125 (_ bv0 32))) (= .cse126 .cse124) (= .cse3 .cse126) (not (bvule .cse127 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse126) .cse127))))))) (= .cse3 .cse124) (not (bvsge .cse123 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse129 (bvmul (_ bv4 32) .cse128))) (or (not (bvslt .cse128 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse129) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse132 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse130 (bvmul (_ bv4 32) .cse132))) (let ((.cse131 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse130))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse130) .cse131)) (not (bvslt .cse132 c_~size~0)) (= .cse129 .cse130) (not (bvsge .cse132 (_ bv0 32))) (not (bvule .cse131 .cse2))))))) (= .cse3 .cse129) (not (bvsge .cse128 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse138 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse133 (concat (concat .cse138 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse134 (bvmul (_ bv4 32) .cse133))) (or (not (bvslt .cse133 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse134) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse137 (concat (concat .cse138 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse135 (bvmul (_ bv4 32) .cse137))) (let ((.cse136 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse135))) (or (= .cse134 .cse135) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse135) .cse136)) (not (bvslt .cse137 c_~size~0)) (not (bvule .cse136 .cse2))))))) (= .cse3 .cse134) (not (bvsge .cse133 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse144 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse139 (concat .cse144 v_arrayElimCell_104))) (let ((.cse140 (bvmul (_ bv4 32) .cse139))) (or (not (bvslt .cse139 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse140) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse143 (concat .cse144 v_arrayElimCell_96))) (let ((.cse141 (bvmul (_ bv4 32) .cse143))) (let ((.cse142 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse141))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse141) .cse142)) (= .cse141 .cse140) (not (bvslt .cse143 c_~size~0)) (not (bvule .cse142 .cse2)) (= .cse3 .cse141)))))) (= .cse3 .cse140) (not (bvsge .cse139 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse146 (bvmul (_ bv4 32) .cse145))) (or (not (bvslt .cse145 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse146) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= c_~x1~0 .cse147) (= .cse3 (bvmul (_ bv4 32) .cse147))))) (= .cse3 .cse146) (not (bvsge .cse145 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse148 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse149 (bvmul (_ bv4 32) .cse148))) (or (not (bvslt .cse148 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse149) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse149) (not (bvsge .cse148 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse155 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse150 (concat (concat .cse155 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse151 (bvmul (_ bv4 32) .cse150))) (or (not (bvslt .cse150 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse151) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse152 (concat (concat .cse155 v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse153 (bvmul (_ bv4 32) .cse152))) (let ((.cse154 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse153))) (or (not (bvslt .cse152 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse153) .cse154)) (= .cse153 .cse151) (not (bvule .cse154 .cse2))))))) (= .cse3 .cse151) (not (bvsge .cse150 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse157 (bvmul (_ bv4 32) .cse156))) (or (not (bvslt .cse156 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse157) .cse2)) (= .cse3 .cse157) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (not (bvsge .cse156 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse159 (bvmul (_ bv4 32) .cse158))) (or (not (bvslt .cse158 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse159) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse162 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse160 (bvmul (_ bv4 32) .cse162))) (let ((.cse161 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse160))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse160) .cse161)) (not (bvslt .cse162 c_~size~0)) (= .cse159 .cse160) (not (bvsge .cse162 (_ bv0 32))) (= .cse3 .cse160) (not (bvule .cse161 .cse2))))))))) (= .cse3 .cse159) (not (bvsge .cse158 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse164 (bvmul (_ bv4 32) .cse163))) (or (not (bvslt .cse163 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse164) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse164) (not (bvsge .cse163 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse166 (bvmul (_ bv4 32) .cse165))) (or (not (bvslt .cse165 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse166) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse169 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse167 (bvmul (_ bv4 32) .cse169))) (let ((.cse168 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse167))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse167) .cse168)) (not (bvslt .cse169 c_~size~0)) (= .cse166 .cse167) (not (bvsge .cse169 (_ bv0 32))) (= .cse3 .cse167) (not (bvule .cse168 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse3 .cse166) (not (bvsge .cse165 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse170 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse174 (bvmul (_ bv4 32) .cse170))) (or (not (bvslt .cse170 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse175 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse172 (concat (concat .cse175 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse171 (bvmul (_ bv4 32) .cse172))) (let ((.cse173 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse171))) (or (= .cse3 .cse171) (not (bvslt .cse172 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse171) .cse173)) (= .cse174 .cse171) (not (bvule .cse173 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse175 v_arrayElimCell_99) v_arrayElimCell_103)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse174) .cse2)) (= .cse3 .cse174) (not (bvsge .cse170 (_ bv0 32))))))) (or .cse105 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse176) (= .cse3 (bvmul (_ bv4 32) .cse176)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse178 (bvmul (_ bv4 32) .cse177))) (or (not (bvslt .cse177 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse178) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse182 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse181 (concat (concat .cse182 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse179 (bvmul (_ bv4 32) .cse181))) (let ((.cse180 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse179))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse179) .cse180)) (not (bvslt .cse181 c_~size~0)) (= .cse178 .cse179) (not (bvsge .cse181 (_ bv0 32))) (= .cse3 .cse179) (not (bvule .cse180 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse182 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse3 .cse178) (not (bvsge .cse177 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse183 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse184 (bvmul (_ bv4 32) .cse183))) (or (not (bvslt .cse183 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse184) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse186 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse187 (bvmul (_ bv4 32) .cse186))) (let ((.cse185 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse187))) (or (not (bvule .cse185 .cse2)) (not (bvslt .cse186 c_~size~0)) (not (bvsge .cse186 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse187) .cse185)) (= .cse187 .cse184)))))) (= .cse3 .cse184) (not (bvsge .cse183 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (or (not (bvslt .cse188 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) .cse188)) .cse2)) (= .cse188 c_~x1~0) (not (bvsge .cse188 (_ bv0 32)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse189 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse190 (bvmul (_ bv4 32) .cse189))) (or (not (bvslt .cse189 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse190) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (= .cse3 .cse190) (not (bvsge .cse189 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse195 (bvmul (_ bv4 32) .cse191))) (or (not (bvslt .cse191 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse193 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse194 (bvmul (_ bv4 32) .cse193))) (let ((.cse192 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse194))) (or (not (bvule .cse192 .cse2)) (not (bvslt .cse193 c_~size~0)) (not (bvsge .cse193 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse194) .cse192)) (= .cse3 .cse194) (= .cse194 .cse195)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse195) .cse2)) (= .cse3 .cse195) (not (bvsge .cse191 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse199 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse196 (concat .cse199 v_arrayElimCell_104))) (let ((.cse197 (bvmul (_ bv4 32) .cse196))) (or (not (bvslt .cse196 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse197) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse198 (concat .cse199 v_arrayElimCell_96))) (or (= c_~x1~0 .cse198) (= .cse3 (bvmul (_ bv4 32) .cse198))))) (= .cse3 .cse197) (not (bvsge .cse196 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse200 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse201 (bvmul (_ bv4 32) .cse200))) (or (not (bvslt .cse200 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse201) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse203 (bvmul (_ bv4 32) .cse202))) (let ((.cse204 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse203))) (or (not (bvslt .cse202 c_~size~0)) (not (bvsge .cse202 (_ bv0 32))) (= .cse203 .cse201) (= .cse3 .cse203) (not (bvule .cse204 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse203) .cse204))))))))) (= .cse3 .cse201) (not (bvsge .cse200 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse209 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse206 (bvmul (_ bv4 32) .cse209))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse205 (bvmul (_ bv4 32) .cse207))) (let ((.cse208 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse205))) (or (= .cse205 .cse206) (not (bvslt .cse207 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse205) .cse208)) (not (bvule .cse208 .cse2))))))) (not (bvslt .cse209 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse206) .cse2)) (= .cse3 .cse206) (not (bvsge .cse209 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse215 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse210 (concat .cse215 v_arrayElimCell_104))) (let ((.cse211 (bvmul (_ bv4 32) .cse210))) (or (not (bvslt .cse210 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse211) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse214 (concat .cse215 v_arrayElimCell_96))) (let ((.cse212 (bvmul (_ bv4 32) .cse214))) (let ((.cse213 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse212))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse212) .cse213)) (= .cse212 .cse211) (not (bvslt .cse214 c_~size~0)) (not (bvule .cse213 .cse2)) (= .cse3 .cse212)))))) (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse215 v_arrayElimCell_103))) (= .cse3 .cse211) (not (bvsge .cse210 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse218 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse216 (concat (concat .cse218 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse217 (bvmul (_ bv4 32) .cse216))) (or (not (bvslt .cse216 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse217) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse218 v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse3 .cse217) (not (bvsge .cse216 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse220 (bvmul (_ bv4 32) .cse219))) (or (not (bvslt .cse219 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse220) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse221 (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105))) (or (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse221 v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse222 (concat .cse221 v_arrayElimCell_96))) (let ((.cse223 (bvmul (_ bv4 32) .cse222))) (let ((.cse224 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse223))) (or (not (bvslt .cse222 c_~size~0)) (not (bvsge .cse222 (_ bv0 32))) (= .cse223 .cse220) (= .cse3 .cse223) (not (bvule .cse224 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse223) .cse224)))))))))) (= .cse3 .cse220) (not (bvsge .cse219 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse226 (bvmul (_ bv4 32) .cse229))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse227 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse225 (bvmul (_ bv4 32) .cse227))) (let ((.cse228 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse225))) (or (= .cse3 .cse225) (= .cse225 .cse226) (not (bvslt .cse227 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse225) .cse228)) (not (bvule .cse228 .cse2))))))) (not (bvslt .cse229 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse226) .cse2)) (= .cse3 .cse226) (not (bvsge .cse229 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse232 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse230 (concat .cse232 v_arrayElimCell_104))) (let ((.cse231 (bvmul (_ bv4 32) .cse230))) (or (not (bvslt .cse230 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse231) .cse2)) (= .cse3 .cse231) (not (bvsge .cse230 (_ bv0 32))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat .cse232 v_arrayElimCell_96)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse234 (bvmul (_ bv4 32) .cse233))) (or (not (bvslt .cse233 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse234) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse236 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse235 (bvmul (_ bv4 32) .cse236))) (let ((.cse237 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse235))) (or (= .cse3 .cse235) (not (bvslt .cse236 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse235) .cse237)) (= .cse234 .cse235) (not (bvule .cse237 .cse2))))))))) (= .cse3 .cse234) (not (bvsge .cse233 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse238 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse239 (bvmul (_ bv4 32) .cse238))) (or (not (bvslt .cse238 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse239) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse240 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse240 c_~x1~0) (= .cse3 (bvmul (_ bv4 32) .cse240))))) (= .cse3 .cse239) (not (bvsge .cse238 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse243 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse241 (concat (concat .cse243 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse242 (bvmul (_ bv4 32) .cse241))) (or (not (bvslt .cse241 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse242) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse243 v_arrayElimCell_107) v_arrayElimCell_104))) (= .cse3 .cse242) (not (bvsge .cse241 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse245 (bvmul (_ bv4 32) .cse244))) (or (not (bvslt .cse244 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse245) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse246 (bvmul (_ bv4 32) .cse248))) (let ((.cse247 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse246))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse246) .cse247)) (not (bvslt .cse248 c_~size~0)) (not (bvule .cse247 .cse2)) (= .cse245 .cse246)))))) (= .cse3 .cse245) (not (bvsge .cse244 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse249 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse250 (bvmul (_ bv4 32) .cse249))) (or (not (bvslt .cse249 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse250) .cse2)) (= .cse3 .cse250) (not (bvsge .cse249 (_ bv0 32))) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse252 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse251 (bvmul (_ bv4 32) .cse252))) (let ((.cse253 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse251))) (or (= .cse3 .cse251) (not (bvsge .cse252 (_ bv0 32))) (not (bvule .cse253 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse251) .cse253)) (not (bvslt .cse252 c_~size~0)) (= .cse251 .cse250)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse255 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse260 (concat .cse255 v_arrayElimCell_105))) (let ((.cse254 (concat .cse260 v_arrayElimCell_104))) (let ((.cse256 (bvmul (_ bv4 32) .cse254))) (or (not (bvslt .cse254 c_~size~0)) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse255 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse256) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse259 (concat .cse260 v_arrayElimCell_96))) (let ((.cse257 (bvmul (_ bv4 32) .cse259))) (let ((.cse258 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse257))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse257) .cse258)) (= .cse257 .cse256) (not (bvslt .cse259 c_~size~0)) (not (bvule .cse258 .cse2)) (= .cse3 .cse257)))))) (= .cse3 .cse256) (not (bvsge .cse254 (_ bv0 32))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse262 (bvmul (_ bv4 32) .cse261))) (or (not (bvslt .cse261 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse262) .cse2)) (= .cse3 .cse262) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse266 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse264 (concat (concat .cse266 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse265 (bvmul (_ bv4 32) .cse264))) (let ((.cse263 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse265))) (or (not (bvule .cse263 .cse2)) (not (bvslt .cse264 c_~size~0)) (not (bvsge .cse264 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse265) .cse263)) (= .cse3 .cse265) (= .cse265 .cse262)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse266 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (not (bvsge .cse261 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse270 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse267 (concat (concat .cse270 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse268 (bvmul (_ bv4 32) .cse267))) (or (not (bvslt .cse267 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse268) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse269 (concat (concat .cse270 v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse269) (= .cse3 (bvmul (_ bv4 32) .cse269))))) (= .cse3 .cse268) (not (bvsge .cse267 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse272 (bvmul (_ bv4 32) .cse271))) (or (not (bvslt .cse271 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse272) .cse2)) (= .cse3 .cse272) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse276 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse274 (concat (concat .cse276 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse273 (bvmul (_ bv4 32) .cse274))) (let ((.cse275 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse273))) (or (= .cse3 .cse273) (= .cse273 .cse272) (not (bvslt .cse274 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse273) .cse275)) (not (bvule .cse275 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse276 v_arrayElimCell_99) v_arrayElimCell_103)))))) (not (bvsge .cse271 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse277 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse278 (bvmul (_ bv4 32) .cse277))) (or (not (bvslt .cse277 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse278) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse280 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse281 (bvmul (_ bv4 32) .cse280))) (let ((.cse279 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse281))) (or (not (bvule .cse279 .cse2)) (not (bvslt .cse280 c_~size~0)) (not (bvsge .cse280 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse281) .cse279)) (= .cse3 .cse281) (= .cse281 .cse278)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse3 .cse278) (not (bvsge .cse277 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse282 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse283 (bvmul (_ bv4 32) .cse282))) (or (not (bvslt .cse282 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse283) .cse2)) (= .cse3 .cse283) (not (bvsge .cse282 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse285 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse284 (bvmul (_ bv4 32) .cse285))) (let ((.cse286 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse284))) (or (= .cse3 .cse284) (not (bvslt .cse285 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse284) .cse286)) (= .cse283 .cse284) (not (bvule .cse286 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse291 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse290 (bvmul (_ bv4 32) .cse291))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse289 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse287 (bvmul (_ bv4 32) .cse289))) (let ((.cse288 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse287))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse287) .cse288)) (not (bvslt .cse289 c_~size~0)) (= .cse290 .cse287) (not (bvsge .cse289 (_ bv0 32))) (= .cse3 .cse287) (not (bvule .cse288 .cse2))))))) (not (bvslt .cse291 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse290) .cse2)) (= .cse3 .cse290) (not (bvsge .cse291 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse292 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse293 (bvmul (_ bv4 32) .cse292))) (or (not (bvslt .cse292 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse293) .cse2)) (= .cse3 .cse293) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (not (bvsge .cse292 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse294 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse295 (bvmul (_ bv4 32) .cse294))) (or (not (bvslt .cse294 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse295) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse297 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse296 (bvmul (_ bv4 32) .cse297))) (let ((.cse298 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse296))) (or (= .cse3 .cse296) (not (bvsge .cse297 (_ bv0 32))) (not (bvule .cse298 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse296) .cse298)) (not (bvslt .cse297 c_~size~0)) (= .cse296 .cse295)))))))) (= .cse3 .cse295) (not (bvsge .cse294 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse304 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse299 (concat (concat .cse304 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse300 (bvmul (_ bv4 32) .cse299))) (or (not (bvslt .cse299 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse300) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse303 (concat (concat .cse304 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse301 (bvmul (_ bv4 32) .cse303))) (let ((.cse302 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse301))) (or (= .cse300 .cse301) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse301) .cse302)) (not (bvslt .cse303 c_~size~0)) (not (bvule .cse302 .cse2)) (= .cse3 .cse301)))))) (= .cse3 .cse300) (not (bvsge .cse299 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse310 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse305 (concat .cse310 v_arrayElimCell_104))) (let ((.cse306 (bvmul (_ bv4 32) .cse305))) (or (not (bvslt .cse305 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse306) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse309 (concat .cse310 v_arrayElimCell_96))) (let ((.cse307 (bvmul (_ bv4 32) .cse309))) (let ((.cse308 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse307))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse307) .cse308)) (= .cse307 .cse306) (not (bvslt .cse309 c_~size~0)) (not (bvule .cse308 .cse2)) (= .cse3 .cse307)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse306) (not (bvsge .cse305 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse311 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse312 (bvmul (_ bv4 32) .cse311))) (or (not (bvslt .cse311 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse312) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse314 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse313 (bvmul (_ bv4 32) .cse314))) (let ((.cse315 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse313 (_ bv4 32)))) (or (= .cse313 .cse312) (not (bvsge .cse314 (_ bv0 32))) (not (bvslt .cse314 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse313) .cse315)) (not (bvule .cse315 .cse2))))))) (= .cse3 .cse312) (not (bvsge .cse311 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse316 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse317 (bvmul (_ bv4 32) .cse316))) (or (not (bvslt .cse316 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse317) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse317) (not (bvsge .cse316 (_ bv0 32))))))) (or (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse323 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse322 (concat .cse323 v_arrayElimCell_96))) (let ((.cse320 (concat .cse323 v_arrayElimCell_104)) (.cse318 (bvmul (_ bv4 32) .cse322))) (let ((.cse319 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse318)) (.cse321 (bvmul (_ bv4 32) .cse320))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse318) .cse319)) (not (bvslt .cse320 c_~size~0)) (= .cse318 .cse321) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse321) .cse2)) (not (bvslt .cse322 c_~size~0)) (not (bvule .cse319 .cse2)) (= .cse3 .cse321) (= .cse3 .cse318) (not (bvsge .cse320 (_ bv0 32))))))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse324 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse325 (bvmul (_ bv4 32) .cse324))) (or (not (bvslt .cse324 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse325) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse326 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse327 (bvmul (_ bv4 32) .cse326))) (let ((.cse328 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse327))) (or (not (bvslt .cse326 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse327) .cse328)) (= .cse325 .cse327) (not (bvule .cse328 .cse2))))))) (= .cse3 .cse325) (not (bvsge .cse324 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse329 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse330 (bvmul (_ bv4 32) .cse329))) (or (not (bvslt .cse329 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse330) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse330) (not (bvsge .cse329 (_ bv0 32))))))))))) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| (_ bv0 32)) (bvsgt c_~size~0 (_ bv0 32)) (bvule |c_ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (= .cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))) is different from true [2022-11-23 02:32:35,647 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv0 32)) (or (not (bvsge c_~x2~0 (_ bv0 32))) (bvslt |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt c_~x2~0 c_~size~0)) (let ((.cse3 (bvmul c_~x2~0 (_ bv4 32)))) (let ((.cse105 (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse332 (bvmul (_ bv4 32) .cse331))) (or (not (bvslt .cse331 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse332) .cse2)) (= .cse3 .cse332) (not (bvsge .cse331 (_ bv0 32))))))))) (and (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse1 (bvmul (_ bv4 32) .cse0))) (or (not (bvslt .cse0 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse1) .cse2)) (= .cse3 .cse1) (not (bvsge .cse0 (_ bv0 32))) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse5 (bvmul (_ bv4 32) .cse4))) (let ((.cse6 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse5))) (or (not (bvsge .cse4 (_ bv0 32))) (not (bvslt .cse4 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse5) .cse6)) (= .cse1 .cse5) (not (bvule .cse6 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse7 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse8 (bvmul (_ bv4 32) .cse7))) (or (not (bvslt .cse7 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse8) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse3 .cse8) (not (bvsge .cse7 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse13 (bvmul (_ bv4 32) .cse9))) (or (not (bvslt .cse9 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse12 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse11 (bvmul (_ bv4 32) .cse12))) (let ((.cse10 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse11))) (or (not (bvule .cse10 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse11) .cse10)) (not (bvslt .cse12 c_~size~0)) (not (bvsge .cse12 (_ bv0 32))) (= .cse11 .cse13)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse13) .cse2)) (= .cse3 .cse13) (not (bvsge .cse9 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse14 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse18 (bvmul (_ bv4 32) .cse14))) (or (not (bvslt .cse14 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse16 (bvmul .cse15 (_ bv4 32)))) (let ((.cse17 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse16))) (or (not (bvslt .cse15 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse16) .cse17)) (= .cse16 .cse18) (not (bvule .cse17 .cse2))))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse18) .cse2)) (= .cse3 .cse18) (not (bvsge .cse14 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse20 (bvmul (_ bv4 32) .cse19))) (or (not (bvslt .cse19 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse20) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse3 (bvmul (_ bv4 32) .cse21)) (= c_~x1~0 .cse21)))) (= .cse3 .cse20) (not (bvsge .cse19 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse27 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse22 (concat (concat .cse27 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse23 (bvmul (_ bv4 32) .cse22))) (or (not (bvslt .cse22 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse26 (concat (concat .cse27 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse24 (bvmul (_ bv4 32) .cse26))) (let ((.cse25 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse24))) (or (= .cse23 .cse24) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse24) .cse25)) (not (bvslt .cse26 c_~size~0)) (not (bvule .cse25 .cse2)) (= .cse3 .cse24)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse23) .cse2)) (= .cse3 .cse23) (not (bvsge .cse22 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse29 (bvmul (_ bv4 32) .cse28))) (or (not (bvslt .cse28 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse29) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse29) (not (bvsge .cse28 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse31 (bvmul (_ bv4 32) .cse30))) (or (not (bvslt .cse30 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse31) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse32 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse34 (bvmul (_ bv4 32) .cse32))) (let ((.cse33 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse34))) (or (not (bvsge .cse32 (_ bv0 32))) (not (bvule .cse33 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse34) .cse33)) (not (bvslt .cse32 c_~size~0)) (= .cse34 .cse31)))))) (= .cse3 .cse31) (not (bvsge .cse30 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse35 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse36 (bvmul (_ bv4 32) .cse35))) (or (not (bvslt .cse35 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse36) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse37 (bvmul (_ bv4 32) .cse38))) (let ((.cse39 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse37))) (or (= .cse3 .cse37) (not (bvsge .cse38 (_ bv0 32))) (not (bvule .cse39 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse37) .cse39)) (not (bvslt .cse38 c_~size~0)) (= .cse37 .cse36)))))))) (= .cse3 .cse36) (not (bvsge .cse35 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse40 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse43 (bvmul (_ bv4 32) .cse40))) (or (not (bvslt .cse40 c_~size~0)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse42 (bvmul (_ bv4 32) .cse41))) (let ((.cse44 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse42))) (or (not (bvslt .cse41 c_~size~0)) (not (bvsge .cse41 (_ bv0 32))) (= .cse42 .cse43) (not (bvule .cse44 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse42) .cse44))))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse43) .cse2)) (= .cse3 .cse43) (not (bvsge .cse40 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse46 (bvmul (_ bv4 32) .cse45))) (or (not (bvslt .cse45 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse46) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse3 .cse46) (not (bvsge .cse45 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse47 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse48 (bvmul (_ bv4 32) .cse47))) (or (not (bvslt .cse47 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse48) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse50 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse51 (bvmul (_ bv4 32) .cse50))) (let ((.cse49 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse51))) (or (not (bvule .cse49 .cse2)) (not (bvsge .cse50 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse51) .cse49)) (= .cse51 .cse48) (not (bvslt .cse50 c_~size~0))))))) (= .cse3 .cse48) (not (bvsge .cse47 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse53 (bvmul (_ bv4 32) .cse52))) (or (not (bvslt .cse52 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse53) .cse2)) (= .cse3 .cse53) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse54 (bvmul (_ bv4 32) .cse55))) (let ((.cse56 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse54))) (or (= .cse3 .cse54) (= .cse54 .cse53) (not (bvslt .cse55 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse54) .cse56)) (not (bvule .cse56 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvsge .cse52 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse58 (bvmul (_ bv4 32) .cse57))) (or (not (bvslt .cse57 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse58) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse60 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse59 (bvmul (_ bv4 32) .cse60))) (let ((.cse61 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse59))) (or (= .cse3 .cse59) (not (bvsge .cse60 (_ bv0 32))) (not (bvule .cse61 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse59) .cse61)) (not (bvslt .cse60 c_~size~0)) (= .cse59 .cse58)))))) (= .cse3 .cse58) (not (bvsge .cse57 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse63 (bvmul (_ bv4 32) .cse62))) (or (not (bvslt .cse62 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse63) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse3 (bvmul (_ bv4 32) .cse64)) (= c_~x1~0 .cse64)))) (= .cse3 .cse63) (not (bvsge .cse62 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse66 (bvmul (_ bv4 32) .cse65))) (or (not (bvslt .cse65 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse66) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse3 .cse66) (not (bvsge .cse65 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse72 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse67 (concat .cse72 v_arrayElimCell_104))) (let ((.cse68 (bvmul (_ bv4 32) .cse67))) (or (not (bvslt .cse67 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse68) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse71 (concat .cse72 v_arrayElimCell_96))) (let ((.cse69 (bvmul (_ bv4 32) .cse71))) (let ((.cse70 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse69))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse69) .cse70)) (= .cse69 .cse68) (not (bvslt .cse71 c_~size~0)) (not (bvule .cse70 .cse2)) (= .cse3 .cse69)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse68) (not (bvsge .cse67 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse78 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse73 (concat .cse78 v_arrayElimCell_104))) (let ((.cse74 (bvmul (_ bv4 32) .cse73))) (or (not (bvslt .cse73 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse74) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse77 (concat .cse78 v_arrayElimCell_96))) (let ((.cse75 (bvmul (_ bv4 32) .cse77))) (let ((.cse76 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse75))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse75) .cse76)) (= .cse75 .cse74) (not (bvslt .cse77 c_~size~0)) (not (bvule .cse76 .cse2)) (= .cse3 .cse75)))))) (= .cse3 .cse74) (not (bvsge .cse73 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse80 (bvmul (_ bv4 32) .cse79))) (or (not (bvslt .cse79 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse80) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse82 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse83 (bvmul (_ bv4 32) .cse82))) (let ((.cse81 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse83))) (or (not (bvule .cse81 .cse2)) (not (bvslt .cse82 c_~size~0)) (not (bvsge .cse82 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse83) .cse81)) (= .cse3 .cse83) (= .cse83 .cse80)))))) (= .cse3 .cse80) (not (bvsge .cse79 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse89 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse84 (concat .cse89 v_arrayElimCell_104))) (let ((.cse85 (bvmul (_ bv4 32) .cse84))) (or (not (bvslt .cse84 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse85) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse88 (concat .cse89 v_arrayElimCell_96))) (let ((.cse86 (bvmul (_ bv4 32) .cse88))) (let ((.cse87 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse86))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse86) .cse87)) (= .cse86 .cse85) (not (bvslt .cse88 c_~size~0)) (not (bvule .cse87 .cse2))))))) (= .cse3 .cse85) (not (bvsge .cse84 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse95 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse90 (concat .cse95 v_arrayElimCell_104))) (let ((.cse91 (bvmul (_ bv4 32) .cse90))) (or (not (bvslt .cse90 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse91) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse94 (concat .cse95 v_arrayElimCell_96))) (let ((.cse92 (bvmul (_ bv4 32) .cse94))) (let ((.cse93 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse92))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse92) .cse93)) (= .cse92 .cse91) (not (bvslt .cse94 c_~size~0)) (not (bvule .cse93 .cse2)) (= .cse3 .cse92)))))) (= .cse3 .cse91) (not (bvsge .cse90 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse101 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse96 (concat (concat .cse101 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse97 (bvmul (_ bv4 32) .cse96))) (or (not (bvslt .cse96 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse97) .cse2)) (= .cse3 .cse97) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse100 (concat (concat .cse101 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse98 (bvmul (_ bv4 32) .cse100))) (let ((.cse99 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse98))) (or (= .cse97 .cse98) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse98) .cse99)) (not (bvslt .cse100 c_~size~0)) (not (bvule .cse99 .cse2)) (= .cse3 .cse98)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvsge .cse96 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse102 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse104 (bvmul (_ bv4 32) .cse102))) (or (not (bvslt .cse102 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse103 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse103 c_~x1~0) (= .cse3 (bvmul (_ bv4 32) .cse103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse104) .cse2)) (= .cse3 .cse104) (not (bvsge .cse102 (_ bv0 32))))))) (or .cse105 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96)))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse107 (bvmul (_ bv4 32) .cse106))) (or (not (bvslt .cse106 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse107) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse111 (concat v_arrayElimCell_100 v_arrayElimCell_101))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse108 (concat (concat .cse111 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse109 (bvmul (_ bv4 32) .cse108))) (let ((.cse110 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse109))) (or (not (bvslt .cse108 c_~size~0)) (not (bvsge .cse108 (_ bv0 32))) (= .cse109 .cse107) (= .cse3 .cse109) (not (bvule .cse110 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse109) .cse110))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse111 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse3 .cse107) (not (bvsge .cse106 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse113 (bvmul (_ bv4 32) .cse112))) (or (not (bvslt .cse112 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse113) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse114 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse115 (bvmul (_ bv4 32) .cse114))) (let ((.cse116 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse115))) (or (not (bvslt .cse114 c_~size~0)) (not (bvsge .cse114 (_ bv0 32))) (= .cse115 .cse113) (= .cse3 .cse115) (not (bvule .cse116 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse115) .cse116))))))))) (= .cse3 .cse113) (not (bvsge .cse112 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse122 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse117 (concat .cse122 v_arrayElimCell_104))) (let ((.cse118 (bvmul (_ bv4 32) .cse117))) (or (not (bvslt .cse117 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse118) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse121 (concat .cse122 v_arrayElimCell_96))) (let ((.cse119 (bvmul (_ bv4 32) .cse121))) (let ((.cse120 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse119))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse119) .cse120)) (= .cse119 .cse118) (not (bvslt .cse121 c_~size~0)) (not (bvule .cse120 .cse2)) (= .cse3 .cse119)))))) (forall ((v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse118) (not (bvsge .cse117 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse123 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse124 (bvmul (_ bv4 32) .cse123))) (or (not (bvslt .cse123 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse124) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse126 (bvmul (_ bv4 32) .cse125))) (let ((.cse127 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse126))) (or (not (bvslt .cse125 c_~size~0)) (not (bvsge .cse125 (_ bv0 32))) (= .cse126 .cse124) (= .cse3 .cse126) (not (bvule .cse127 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse126) .cse127))))))) (= .cse3 .cse124) (not (bvsge .cse123 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse129 (bvmul (_ bv4 32) .cse128))) (or (not (bvslt .cse128 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse129) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse132 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse130 (bvmul (_ bv4 32) .cse132))) (let ((.cse131 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse130))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse130) .cse131)) (not (bvslt .cse132 c_~size~0)) (= .cse129 .cse130) (not (bvsge .cse132 (_ bv0 32))) (not (bvule .cse131 .cse2))))))) (= .cse3 .cse129) (not (bvsge .cse128 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse138 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse133 (concat (concat .cse138 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse134 (bvmul (_ bv4 32) .cse133))) (or (not (bvslt .cse133 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse134) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse137 (concat (concat .cse138 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse135 (bvmul (_ bv4 32) .cse137))) (let ((.cse136 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse135))) (or (= .cse134 .cse135) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse135) .cse136)) (not (bvslt .cse137 c_~size~0)) (not (bvule .cse136 .cse2))))))) (= .cse3 .cse134) (not (bvsge .cse133 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse144 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse139 (concat .cse144 v_arrayElimCell_104))) (let ((.cse140 (bvmul (_ bv4 32) .cse139))) (or (not (bvslt .cse139 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse140) .cse2)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse143 (concat .cse144 v_arrayElimCell_96))) (let ((.cse141 (bvmul (_ bv4 32) .cse143))) (let ((.cse142 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse141))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse141) .cse142)) (= .cse141 .cse140) (not (bvslt .cse143 c_~size~0)) (not (bvule .cse142 .cse2)) (= .cse3 .cse141)))))) (= .cse3 .cse140) (not (bvsge .cse139 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse146 (bvmul (_ bv4 32) .cse145))) (or (not (bvslt .cse145 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse146) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= c_~x1~0 .cse147) (= .cse3 (bvmul (_ bv4 32) .cse147))))) (= .cse3 .cse146) (not (bvsge .cse145 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse148 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse149 (bvmul (_ bv4 32) .cse148))) (or (not (bvslt .cse148 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse149) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse149) (not (bvsge .cse148 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse155 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse150 (concat (concat .cse155 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse151 (bvmul (_ bv4 32) .cse150))) (or (not (bvslt .cse150 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse151) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse152 (concat (concat .cse155 v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse153 (bvmul (_ bv4 32) .cse152))) (let ((.cse154 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse153))) (or (not (bvslt .cse152 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse153) .cse154)) (= .cse153 .cse151) (not (bvule .cse154 .cse2))))))) (= .cse3 .cse151) (not (bvsge .cse150 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse157 (bvmul (_ bv4 32) .cse156))) (or (not (bvslt .cse156 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse157) .cse2)) (= .cse3 .cse157) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (not (bvsge .cse156 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse159 (bvmul (_ bv4 32) .cse158))) (or (not (bvslt .cse158 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse159) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse162 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse160 (bvmul (_ bv4 32) .cse162))) (let ((.cse161 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse160))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse160) .cse161)) (not (bvslt .cse162 c_~size~0)) (= .cse159 .cse160) (not (bvsge .cse162 (_ bv0 32))) (= .cse3 .cse160) (not (bvule .cse161 .cse2))))))))) (= .cse3 .cse159) (not (bvsge .cse158 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse163 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse164 (bvmul (_ bv4 32) .cse163))) (or (not (bvslt .cse163 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse164) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse164) (not (bvsge .cse163 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse166 (bvmul (_ bv4 32) .cse165))) (or (not (bvslt .cse165 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse166) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse169 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse167 (bvmul (_ bv4 32) .cse169))) (let ((.cse168 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse167))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse167) .cse168)) (not (bvslt .cse169 c_~size~0)) (= .cse166 .cse167) (not (bvsge .cse169 (_ bv0 32))) (= .cse3 .cse167) (not (bvule .cse168 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse3 .cse166) (not (bvsge .cse165 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse170 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse174 (bvmul (_ bv4 32) .cse170))) (or (not (bvslt .cse170 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse175 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse172 (concat (concat .cse175 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse171 (bvmul (_ bv4 32) .cse172))) (let ((.cse173 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse171))) (or (= .cse3 .cse171) (not (bvslt .cse172 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse171) .cse173)) (= .cse174 .cse171) (not (bvule .cse173 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse175 v_arrayElimCell_99) v_arrayElimCell_103)))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse174) .cse2)) (= .cse3 .cse174) (not (bvsge .cse170 (_ bv0 32))))))) (or .cse105 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse176) (= .cse3 (bvmul (_ bv4 32) .cse176)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse178 (bvmul (_ bv4 32) .cse177))) (or (not (bvslt .cse177 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse178) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse182 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse181 (concat (concat .cse182 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse179 (bvmul (_ bv4 32) .cse181))) (let ((.cse180 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse179))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse179) .cse180)) (not (bvslt .cse181 c_~size~0)) (= .cse178 .cse179) (not (bvsge .cse181 (_ bv0 32))) (= .cse3 .cse179) (not (bvule .cse180 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse182 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse3 .cse178) (not (bvsge .cse177 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse183 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse184 (bvmul (_ bv4 32) .cse183))) (or (not (bvslt .cse183 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse184) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse186 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse187 (bvmul (_ bv4 32) .cse186))) (let ((.cse185 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse187))) (or (not (bvule .cse185 .cse2)) (not (bvslt .cse186 c_~size~0)) (not (bvsge .cse186 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse187) .cse185)) (= .cse187 .cse184)))))) (= .cse3 .cse184) (not (bvsge .cse183 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (or (not (bvslt .cse188 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) .cse188)) .cse2)) (= .cse188 c_~x1~0) (not (bvsge .cse188 (_ bv0 32)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse189 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse190 (bvmul (_ bv4 32) .cse189))) (or (not (bvslt .cse189 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse190) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (= .cse3 .cse190) (not (bvsge .cse189 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse195 (bvmul (_ bv4 32) .cse191))) (or (not (bvslt .cse191 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse193 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse194 (bvmul (_ bv4 32) .cse193))) (let ((.cse192 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse194))) (or (not (bvule .cse192 .cse2)) (not (bvslt .cse193 c_~size~0)) (not (bvsge .cse193 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse194) .cse192)) (= .cse3 .cse194) (= .cse194 .cse195)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse195) .cse2)) (= .cse3 .cse195) (not (bvsge .cse191 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse199 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse196 (concat .cse199 v_arrayElimCell_104))) (let ((.cse197 (bvmul (_ bv4 32) .cse196))) (or (not (bvslt .cse196 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse197) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse198 (concat .cse199 v_arrayElimCell_96))) (or (= c_~x1~0 .cse198) (= .cse3 (bvmul (_ bv4 32) .cse198))))) (= .cse3 .cse197) (not (bvsge .cse196 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse200 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse201 (bvmul (_ bv4 32) .cse200))) (or (not (bvslt .cse200 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse201) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse203 (bvmul (_ bv4 32) .cse202))) (let ((.cse204 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse203))) (or (not (bvslt .cse202 c_~size~0)) (not (bvsge .cse202 (_ bv0 32))) (= .cse203 .cse201) (= .cse3 .cse203) (not (bvule .cse204 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse203) .cse204))))))))) (= .cse3 .cse201) (not (bvsge .cse200 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse209 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse206 (bvmul (_ bv4 32) .cse209))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse205 (bvmul (_ bv4 32) .cse207))) (let ((.cse208 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse205))) (or (= .cse205 .cse206) (not (bvslt .cse207 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse205) .cse208)) (not (bvule .cse208 .cse2))))))) (not (bvslt .cse209 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse206) .cse2)) (= .cse3 .cse206) (not (bvsge .cse209 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse215 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse210 (concat .cse215 v_arrayElimCell_104))) (let ((.cse211 (bvmul (_ bv4 32) .cse210))) (or (not (bvslt .cse210 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse211) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse214 (concat .cse215 v_arrayElimCell_96))) (let ((.cse212 (bvmul (_ bv4 32) .cse214))) (let ((.cse213 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse212))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse212) .cse213)) (= .cse212 .cse211) (not (bvslt .cse214 c_~size~0)) (not (bvule .cse213 .cse2)) (= .cse3 .cse212)))))) (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse215 v_arrayElimCell_103))) (= .cse3 .cse211) (not (bvsge .cse210 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse218 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse216 (concat (concat .cse218 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse217 (bvmul (_ bv4 32) .cse216))) (or (not (bvslt .cse216 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse217) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse218 v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse3 .cse217) (not (bvsge .cse216 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse220 (bvmul (_ bv4 32) .cse219))) (or (not (bvslt .cse219 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse220) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse221 (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105))) (or (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse221 v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse222 (concat .cse221 v_arrayElimCell_96))) (let ((.cse223 (bvmul (_ bv4 32) .cse222))) (let ((.cse224 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse223))) (or (not (bvslt .cse222 c_~size~0)) (not (bvsge .cse222 (_ bv0 32))) (= .cse223 .cse220) (= .cse3 .cse223) (not (bvule .cse224 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse223) .cse224)))))))))) (= .cse3 .cse220) (not (bvsge .cse219 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse226 (bvmul (_ bv4 32) .cse229))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse227 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse225 (bvmul (_ bv4 32) .cse227))) (let ((.cse228 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse225))) (or (= .cse3 .cse225) (= .cse225 .cse226) (not (bvslt .cse227 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse225) .cse228)) (not (bvule .cse228 .cse2))))))) (not (bvslt .cse229 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse226) .cse2)) (= .cse3 .cse226) (not (bvsge .cse229 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse232 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse230 (concat .cse232 v_arrayElimCell_104))) (let ((.cse231 (bvmul (_ bv4 32) .cse230))) (or (not (bvslt .cse230 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse231) .cse2)) (= .cse3 .cse231) (not (bvsge .cse230 (_ bv0 32))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat .cse232 v_arrayElimCell_96)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse234 (bvmul (_ bv4 32) .cse233))) (or (not (bvslt .cse233 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse234) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse236 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse235 (bvmul (_ bv4 32) .cse236))) (let ((.cse237 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse235))) (or (= .cse3 .cse235) (not (bvslt .cse236 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse235) .cse237)) (= .cse234 .cse235) (not (bvule .cse237 .cse2))))))))) (= .cse3 .cse234) (not (bvsge .cse233 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse238 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse239 (bvmul (_ bv4 32) .cse238))) (or (not (bvslt .cse238 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse239) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse240 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse240 c_~x1~0) (= .cse3 (bvmul (_ bv4 32) .cse240))))) (= .cse3 .cse239) (not (bvsge .cse238 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse243 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse241 (concat (concat .cse243 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse242 (bvmul (_ bv4 32) .cse241))) (or (not (bvslt .cse241 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse242) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse243 v_arrayElimCell_107) v_arrayElimCell_104))) (= .cse3 .cse242) (not (bvsge .cse241 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse245 (bvmul (_ bv4 32) .cse244))) (or (not (bvslt .cse244 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse245) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse246 (bvmul (_ bv4 32) .cse248))) (let ((.cse247 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse246))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse246) .cse247)) (not (bvslt .cse248 c_~size~0)) (not (bvule .cse247 .cse2)) (= .cse245 .cse246)))))) (= .cse3 .cse245) (not (bvsge .cse244 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse249 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse250 (bvmul (_ bv4 32) .cse249))) (or (not (bvslt .cse249 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse250) .cse2)) (= .cse3 .cse250) (not (bvsge .cse249 (_ bv0 32))) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse252 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse251 (bvmul (_ bv4 32) .cse252))) (let ((.cse253 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse251))) (or (= .cse3 .cse251) (not (bvsge .cse252 (_ bv0 32))) (not (bvule .cse253 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse251) .cse253)) (not (bvslt .cse252 c_~size~0)) (= .cse251 .cse250)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse255 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse260 (concat .cse255 v_arrayElimCell_105))) (let ((.cse254 (concat .cse260 v_arrayElimCell_104))) (let ((.cse256 (bvmul (_ bv4 32) .cse254))) (or (not (bvslt .cse254 c_~size~0)) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse255 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse256) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse259 (concat .cse260 v_arrayElimCell_96))) (let ((.cse257 (bvmul (_ bv4 32) .cse259))) (let ((.cse258 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse257))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse257) .cse258)) (= .cse257 .cse256) (not (bvslt .cse259 c_~size~0)) (not (bvule .cse258 .cse2)) (= .cse3 .cse257)))))) (= .cse3 .cse256) (not (bvsge .cse254 (_ bv0 32))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse262 (bvmul (_ bv4 32) .cse261))) (or (not (bvslt .cse261 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse262) .cse2)) (= .cse3 .cse262) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse266 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse264 (concat (concat .cse266 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse265 (bvmul (_ bv4 32) .cse264))) (let ((.cse263 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse265))) (or (not (bvule .cse263 .cse2)) (not (bvslt .cse264 c_~size~0)) (not (bvsge .cse264 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse265) .cse263)) (= .cse3 .cse265) (= .cse265 .cse262)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse266 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (not (bvsge .cse261 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse270 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse267 (concat (concat .cse270 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse268 (bvmul (_ bv4 32) .cse267))) (or (not (bvslt .cse267 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse268) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse269 (concat (concat .cse270 v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse269) (= .cse3 (bvmul (_ bv4 32) .cse269))))) (= .cse3 .cse268) (not (bvsge .cse267 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse272 (bvmul (_ bv4 32) .cse271))) (or (not (bvslt .cse271 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse272) .cse2)) (= .cse3 .cse272) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse276 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse274 (concat (concat .cse276 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse273 (bvmul (_ bv4 32) .cse274))) (let ((.cse275 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse273))) (or (= .cse3 .cse273) (= .cse273 .cse272) (not (bvslt .cse274 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse273) .cse275)) (not (bvule .cse275 .cse2))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse276 v_arrayElimCell_99) v_arrayElimCell_103)))))) (not (bvsge .cse271 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse277 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse278 (bvmul (_ bv4 32) .cse277))) (or (not (bvslt .cse277 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse278) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse280 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse281 (bvmul (_ bv4 32) .cse280))) (let ((.cse279 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse281))) (or (not (bvule .cse279 .cse2)) (not (bvslt .cse280 c_~size~0)) (not (bvsge .cse280 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse281) .cse279)) (= .cse3 .cse281) (= .cse281 .cse278)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse3 .cse278) (not (bvsge .cse277 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse282 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse283 (bvmul (_ bv4 32) .cse282))) (or (not (bvslt .cse282 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse283) .cse2)) (= .cse3 .cse283) (not (bvsge .cse282 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse285 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse284 (bvmul (_ bv4 32) .cse285))) (let ((.cse286 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse284))) (or (= .cse3 .cse284) (not (bvslt .cse285 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse284) .cse286)) (= .cse283 .cse284) (not (bvule .cse286 .cse2))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse291 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse290 (bvmul (_ bv4 32) .cse291))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse289 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse287 (bvmul (_ bv4 32) .cse289))) (let ((.cse288 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse287))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse287) .cse288)) (not (bvslt .cse289 c_~size~0)) (= .cse290 .cse287) (not (bvsge .cse289 (_ bv0 32))) (= .cse3 .cse287) (not (bvule .cse288 .cse2))))))) (not (bvslt .cse291 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse290) .cse2)) (= .cse3 .cse290) (not (bvsge .cse291 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse292 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse293 (bvmul (_ bv4 32) .cse292))) (or (not (bvslt .cse292 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse293) .cse2)) (= .cse3 .cse293) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (not (bvsge .cse292 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse294 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse295 (bvmul (_ bv4 32) .cse294))) (or (not (bvslt .cse294 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse295) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse297 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse296 (bvmul (_ bv4 32) .cse297))) (let ((.cse298 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse296))) (or (= .cse3 .cse296) (not (bvsge .cse297 (_ bv0 32))) (not (bvule .cse298 .cse2)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse296) .cse298)) (not (bvslt .cse297 c_~size~0)) (= .cse296 .cse295)))))))) (= .cse3 .cse295) (not (bvsge .cse294 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse304 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse299 (concat (concat .cse304 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse300 (bvmul (_ bv4 32) .cse299))) (or (not (bvslt .cse299 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse300) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse303 (concat (concat .cse304 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse301 (bvmul (_ bv4 32) .cse303))) (let ((.cse302 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse301))) (or (= .cse300 .cse301) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse301) .cse302)) (not (bvslt .cse303 c_~size~0)) (not (bvule .cse302 .cse2)) (= .cse3 .cse301)))))) (= .cse3 .cse300) (not (bvsge .cse299 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse310 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse305 (concat .cse310 v_arrayElimCell_104))) (let ((.cse306 (bvmul (_ bv4 32) .cse305))) (or (not (bvslt .cse305 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse306) .cse2)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse309 (concat .cse310 v_arrayElimCell_96))) (let ((.cse307 (bvmul (_ bv4 32) .cse309))) (let ((.cse308 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse307))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse307) .cse308)) (= .cse307 .cse306) (not (bvslt .cse309 c_~size~0)) (not (bvule .cse308 .cse2)) (= .cse3 .cse307)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse3 .cse306) (not (bvsge .cse305 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse311 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse312 (bvmul (_ bv4 32) .cse311))) (or (not (bvslt .cse311 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse312) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse314 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse313 (bvmul (_ bv4 32) .cse314))) (let ((.cse315 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse313 (_ bv4 32)))) (or (= .cse313 .cse312) (not (bvsge .cse314 (_ bv0 32))) (not (bvslt .cse314 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse313) .cse315)) (not (bvule .cse315 .cse2))))))) (= .cse3 .cse312) (not (bvsge .cse311 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse316 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse317 (bvmul (_ bv4 32) .cse316))) (or (not (bvslt .cse316 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse317) .cse2)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse317) (not (bvsge .cse316 (_ bv0 32))))))) (or (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse323 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse322 (concat .cse323 v_arrayElimCell_96))) (let ((.cse320 (concat .cse323 v_arrayElimCell_104)) (.cse318 (bvmul (_ bv4 32) .cse322))) (let ((.cse319 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse318)) (.cse321 (bvmul (_ bv4 32) .cse320))) (or (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse318) .cse319)) (not (bvslt .cse320 c_~size~0)) (= .cse318 .cse321) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse321) .cse2)) (not (bvslt .cse322 c_~size~0)) (not (bvule .cse319 .cse2)) (= .cse3 .cse321) (= .cse3 .cse318) (not (bvsge .cse320 (_ bv0 32))))))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse324 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse325 (bvmul (_ bv4 32) .cse324))) (or (not (bvslt .cse324 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse325) .cse2)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse326 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse327 (bvmul (_ bv4 32) .cse326))) (let ((.cse328 (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse327))) (or (not (bvslt .cse326 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse327) .cse328)) (= .cse325 .cse327) (not (bvule .cse328 .cse2))))))) (= .cse3 .cse325) (not (bvsge .cse324 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse329 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse330 (bvmul (_ bv4 32) .cse329))) (or (not (bvslt .cse329 c_~size~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse330) .cse2)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse3 .cse330) (not (bvsge .cse329 (_ bv0 32))))))))))) (= c_~x2~0 (_ bv0 32)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| (_ bv1 32)) (= c_~x1~0 (_ bv0 32)) (= c_~size~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (bvsgt c_~size~0 (_ bv0 32)) (bvule |c_ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (= .cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))) is different from true [2022-11-23 02:32:41,901 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| c_~f~0.base))) (and (not (bvslt (_ bv1 32) c_~size~0)) (= c_~x2~0 (_ bv0 32)) (= .cse0 (bvmul (_ bv4 32) c_~size~0)) (= c_~x1~0 (_ bv0 32)) (bvsgt c_~size~0 (_ bv0 32)) (or (not (bvsge c_~x2~0 (_ bv0 32))) (let ((.cse5 (bvmul c_~x2~0 (_ bv4 32)))) (let ((.cse16 (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse332 (bvmul (_ bv4 32) .cse331))) (or (not (bvslt .cse331 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse332) .cse0)) (= .cse5 .cse332) (not (bvsge .cse331 (_ bv0 32))))))))) (and (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse1 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse2 (bvmul (_ bv4 32) .cse1))) (or (not (bvslt .cse1 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse2) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse6 (bvmul (_ bv4 32) .cse4))) (let ((.cse3 (bvadd c_~f~0.offset (_ bv4 32) .cse6))) (or (not (bvule .cse3 .cse0)) (not (bvslt .cse4 c_~size~0)) (not (bvsge .cse4 (_ bv0 32))) (= .cse5 .cse6) (not (bvule (bvadd c_~f~0.offset .cse6) .cse3)) (= .cse6 .cse2)))))) (= .cse5 .cse2) (not (bvsge .cse1 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse9 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse7 (concat .cse9 v_arrayElimCell_104))) (let ((.cse10 (bvmul (_ bv4 32) .cse7))) (or (not (bvslt .cse7 c_~size~0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse8 (concat .cse9 v_arrayElimCell_96))) (or (= c_~x1~0 .cse8) (= .cse5 (bvmul (_ bv4 32) .cse8))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse10) .cse0)) (= .cse5 .cse10) (not (bvsge .cse7 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse11 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse12 (bvmul (_ bv4 32) .cse11))) (or (not (bvslt .cse11 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse12) .cse0)) (= .cse5 .cse12) (not (bvsge .cse11 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse14 (bvmul (_ bv4 32) .cse15))) (let ((.cse13 (bvadd c_~f~0.offset (_ bv4 32) .cse14))) (or (not (bvule .cse13 .cse0)) (= .cse5 .cse14) (not (bvslt .cse15 c_~size~0)) (= .cse12 .cse14) (not (bvule (bvadd c_~f~0.offset .cse14) .cse13))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))))))) (or .cse16 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96)))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse17 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse18 (bvmul (_ bv4 32) .cse17))) (or (not (bvslt .cse17 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse18) .cse0)) (= .cse5 .cse18) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (not (bvsge .cse17 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse19 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse23 (bvmul (_ bv4 32) .cse19))) (or (not (bvslt .cse19 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse20 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse21 (bvmul .cse20 (_ bv4 32)))) (let ((.cse22 (bvadd c_~f~0.offset (_ bv4 32) .cse21))) (or (not (bvslt .cse20 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse21) .cse22)) (not (bvule .cse22 .cse0)) (= .cse21 .cse23)))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse23) .cse0)) (= .cse5 .cse23) (not (bvsge .cse19 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse24 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse25 (bvmul (_ bv4 32) .cse24))) (or (not (bvslt .cse24 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse25) .cse0)) (= .cse5 .cse25) (not (bvsge .cse24 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse26 (bvmul (_ bv4 32) .cse28))) (let ((.cse27 (bvadd c_~f~0.offset (_ bv4 32) .cse26))) (or (not (bvule (bvadd c_~f~0.offset .cse26) .cse27)) (= .cse26 .cse25) (not (bvslt .cse28 c_~size~0)) (not (bvule .cse27 .cse0))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse29 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (or (not (bvslt .cse29 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) (bvmul (_ bv4 32) .cse29)) .cse0)) (= .cse29 c_~x1~0) (not (bvsge .cse29 (_ bv0 32)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse31 (bvmul (_ bv4 32) .cse30))) (or (not (bvslt .cse30 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse31) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse32 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse34 (bvmul (_ bv4 32) .cse32))) (let ((.cse33 (bvadd c_~f~0.offset (_ bv4 32) .cse34))) (or (not (bvslt .cse32 c_~size~0)) (not (bvule .cse33 .cse0)) (not (bvsge .cse32 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse34) .cse33)) (= .cse34 .cse31)))))) (= .cse5 .cse31) (not (bvsge .cse30 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse35 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse36 (bvmul (_ bv4 32) .cse35))) (or (not (bvslt .cse35 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse36) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse37 (bvmul (_ bv4 32) .cse38))) (let ((.cse39 (bvadd c_~f~0.offset (_ bv4 32) .cse37))) (or (= .cse5 .cse37) (not (bvsge .cse38 (_ bv0 32))) (not (bvule .cse39 .cse0)) (not (bvslt .cse38 c_~size~0)) (= .cse37 .cse36) (not (bvule (bvadd c_~f~0.offset .cse37) .cse39))))))))) (= .cse5 .cse36) (not (bvsge .cse35 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse45 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse40 (concat (concat .cse45 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse41 (bvmul (_ bv4 32) .cse40))) (or (not (bvslt .cse40 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse41) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse44 (concat (concat .cse45 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse42 (bvmul (_ bv4 32) .cse44))) (let ((.cse43 (bvadd c_~f~0.offset (_ bv4 32) .cse42))) (or (= .cse41 .cse42) (not (bvule (bvadd c_~f~0.offset .cse42) .cse43)) (not (bvule .cse43 .cse0)) (not (bvslt .cse44 c_~size~0)) (= .cse5 .cse42)))))) (= .cse5 .cse41) (not (bvsge .cse40 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse46 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse47 (bvmul (_ bv4 32) .cse46))) (or (not (bvslt .cse46 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse47) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse51 (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse48 (concat .cse51 v_arrayElimCell_96))) (let ((.cse50 (bvmul (_ bv4 32) .cse48))) (let ((.cse49 (bvadd c_~f~0.offset (_ bv4 32) .cse50))) (or (not (bvslt .cse48 c_~size~0)) (not (bvule .cse49 .cse0)) (not (bvsge .cse48 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse50) .cse49)) (= .cse50 .cse47) (= .cse5 .cse50)))))) (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse51 v_arrayElimCell_103)))))) (= .cse5 .cse47) (not (bvsge .cse46 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse53 (bvmul (_ bv4 32) .cse52))) (or (not (bvslt .cse52 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse53) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse54 (bvmul (_ bv4 32) .cse55))) (let ((.cse56 (bvadd c_~f~0.offset (_ bv4 32) .cse54))) (or (= .cse5 .cse54) (not (bvsge .cse55 (_ bv0 32))) (not (bvule .cse56 .cse0)) (not (bvslt .cse55 c_~size~0)) (= .cse54 .cse53) (not (bvule (bvadd c_~f~0.offset .cse54) .cse56))))))) (= .cse5 .cse53) (not (bvsge .cse52 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse58 (bvmul (_ bv4 32) .cse57))) (or (not (bvslt .cse57 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse58) .cse0)) (= .cse5 .cse58) (not (bvsge .cse57 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse62 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse61 (concat (concat .cse62 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse60 (bvmul (_ bv4 32) .cse61))) (let ((.cse59 (bvadd c_~f~0.offset (_ bv4 32) .cse60))) (or (not (bvule .cse59 .cse0)) (= .cse5 .cse60) (not (bvslt .cse61 c_~size~0)) (= .cse58 .cse60) (not (bvule (bvadd c_~f~0.offset .cse60) .cse59))))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse62 v_arrayElimCell_99) v_arrayElimCell_103)))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse68 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse63 (concat .cse68 v_arrayElimCell_104))) (let ((.cse64 (bvmul (_ bv4 32) .cse63))) (or (not (bvslt .cse63 c_~size~0)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse64) .cse0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse67 (concat .cse68 v_arrayElimCell_96))) (let ((.cse65 (bvmul (_ bv4 32) .cse67))) (let ((.cse66 (bvadd c_~f~0.offset (_ bv4 32) .cse65))) (or (= .cse65 .cse64) (not (bvule .cse66 .cse0)) (not (bvslt .cse67 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse65) .cse66)) (= .cse5 .cse65)))))) (= .cse5 .cse64) (not (bvsge .cse63 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse69 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse70 (bvmul (_ bv4 32) .cse69))) (or (not (bvslt .cse69 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse70) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse74 (concat v_arrayElimCell_100 v_arrayElimCell_101))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse71 (concat (concat .cse74 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse73 (bvmul (_ bv4 32) .cse71))) (let ((.cse72 (bvadd c_~f~0.offset (_ bv4 32) .cse73))) (or (not (bvslt .cse71 c_~size~0)) (not (bvule .cse72 .cse0)) (not (bvsge .cse71 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse73) .cse72)) (= .cse73 .cse70) (= .cse5 .cse73)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse74 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (= .cse5 .cse70) (not (bvsge .cse69 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse75 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse79 (bvmul (_ bv4 32) .cse75))) (or (not (bvslt .cse75 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse78 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse76 (bvmul (_ bv4 32) .cse78))) (let ((.cse77 (bvadd c_~f~0.offset (_ bv4 32) .cse76))) (or (not (bvule (bvadd c_~f~0.offset .cse76) .cse77)) (not (bvule .cse77 .cse0)) (not (bvslt .cse78 c_~size~0)) (= .cse79 .cse76) (not (bvsge .cse78 (_ bv0 32))) (= .cse5 .cse76)))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse79) .cse0)) (= .cse5 .cse79) (not (bvsge .cse75 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse80 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse83 (bvmul (_ bv4 32) .cse80))) (or (not (bvslt .cse80 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse84 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse81 (bvmul (_ bv4 32) .cse84))) (let ((.cse82 (bvadd c_~f~0.offset (_ bv4 32) .cse81))) (or (not (bvule (bvadd c_~f~0.offset .cse81) .cse82)) (= .cse5 .cse81) (= .cse81 .cse83) (not (bvslt .cse84 c_~size~0)) (not (bvule .cse82 .cse0))))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse83) .cse0)) (= .cse5 .cse83) (not (bvsge .cse80 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse86 (bvmul (_ bv4 32) .cse85))) (or (not (bvslt .cse85 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse86) .cse0)) (= .cse5 .cse86) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse90 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse88 (concat (concat .cse90 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse89 (bvmul (_ bv4 32) .cse88))) (let ((.cse87 (bvadd c_~f~0.offset (_ bv4 32) .cse89))) (or (not (bvule .cse87 .cse0)) (not (bvslt .cse88 c_~size~0)) (not (bvsge .cse88 (_ bv0 32))) (= .cse5 .cse89) (not (bvule (bvadd c_~f~0.offset .cse89) .cse87)) (= .cse89 .cse86)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse90 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (not (bvsge .cse85 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse96 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse91 (concat .cse96 v_arrayElimCell_104))) (let ((.cse92 (bvmul (_ bv4 32) .cse91))) (or (not (bvslt .cse91 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse92) .cse0)) (= .cse5 .cse92) (not (bvsge .cse91 (_ bv0 32))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse95 (concat .cse96 v_arrayElimCell_96))) (let ((.cse93 (bvmul (_ bv4 32) .cse95))) (let ((.cse94 (bvadd c_~f~0.offset (_ bv4 32) .cse93))) (or (= .cse93 .cse92) (not (bvule .cse94 .cse0)) (not (bvslt .cse95 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse93) .cse94)))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse97 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse98 (bvmul (_ bv4 32) .cse97))) (or (not (bvslt .cse97 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse98) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse101 (bvmul (_ bv4 32) .cse99))) (let ((.cse100 (bvadd c_~f~0.offset (_ bv4 32) .cse101))) (or (not (bvslt .cse99 c_~size~0)) (not (bvule .cse100 .cse0)) (not (bvsge .cse99 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse101) .cse100)) (= .cse101 .cse98) (= .cse5 .cse101)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))))) (= .cse5 .cse98) (not (bvsge .cse97 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse102 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse103 (bvmul (_ bv4 32) .cse102))) (or (not (bvslt .cse102 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse103) .cse0)) (= .cse5 .cse103) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse104 (bvmul (_ bv4 32) .cse106))) (let ((.cse105 (bvadd c_~f~0.offset (_ bv4 32) .cse104))) (or (not (bvule (bvadd c_~f~0.offset .cse104) .cse105)) (not (bvslt .cse106 c_~size~0)) (not (bvule .cse105 .cse0)) (= .cse103 .cse104)))))) (not (bvsge .cse102 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse109 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse107 (concat .cse109 v_arrayElimCell_104))) (let ((.cse108 (bvmul (_ bv4 32) .cse107))) (or (not (bvslt .cse107 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse108) .cse0)) (= .cse5 .cse108) (not (bvsge .cse107 (_ bv0 32))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat .cse109 v_arrayElimCell_96)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse110 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse111 (bvmul (_ bv4 32) .cse110))) (or (not (bvslt .cse110 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse111) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse113 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse114 (bvmul (_ bv4 32) .cse113))) (let ((.cse112 (bvadd c_~f~0.offset (_ bv4 32) .cse114))) (or (not (bvule .cse112 .cse0)) (not (bvslt .cse113 c_~size~0)) (not (bvsge .cse113 (_ bv0 32))) (= .cse5 .cse114) (not (bvule (bvadd c_~f~0.offset .cse114) .cse112)) (= .cse114 .cse111)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse5 .cse111) (not (bvsge .cse110 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse115 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse119 (bvmul (_ bv4 32) .cse115))) (or (not (bvslt .cse115 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse117 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse116 (bvmul (_ bv4 32) .cse117))) (let ((.cse118 (bvadd c_~f~0.offset (_ bv4 32) .cse116))) (or (= .cse5 .cse116) (not (bvsge .cse117 (_ bv0 32))) (not (bvule .cse118 .cse0)) (not (bvslt .cse117 c_~size~0)) (= .cse116 .cse119) (not (bvule (bvadd c_~f~0.offset .cse116) .cse118))))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse119) .cse0)) (= .cse5 .cse119) (not (bvsge .cse115 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse123 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse120 (concat (concat .cse123 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse121 (bvmul (_ bv4 32) .cse120))) (or (not (bvslt .cse120 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse121) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse122 (concat (concat .cse123 v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse122) (= .cse5 (bvmul (_ bv4 32) .cse122))))) (= .cse5 .cse121) (not (bvsge .cse120 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse124 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse125 (bvmul (_ bv4 32) .cse124))) (or (not (bvslt .cse124 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse125) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse126 (bvmul (_ bv4 32) .cse128))) (let ((.cse127 (bvadd c_~f~0.offset (_ bv4 32) .cse126))) (or (not (bvule (bvadd c_~f~0.offset .cse126) .cse127)) (= .cse5 .cse126) (= .cse126 .cse125) (not (bvslt .cse128 c_~size~0)) (not (bvule .cse127 .cse0))))))))) (= .cse5 .cse125) (not (bvsge .cse124 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse129 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse130 (bvmul (_ bv4 32) .cse129))) (or (not (bvslt .cse129 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse130) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse132 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse131 (bvmul (_ bv4 32) .cse132))) (let ((.cse133 (bvadd .cse131 c_~f~0.offset (_ bv4 32)))) (or (= .cse131 .cse130) (not (bvsge .cse132 (_ bv0 32))) (not (bvslt .cse132 c_~size~0)) (not (bvule (bvadd .cse131 c_~f~0.offset) .cse133)) (not (bvule .cse133 .cse0))))))) (= .cse5 .cse130) (not (bvsge .cse129 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse139 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse134 (concat .cse139 v_arrayElimCell_104))) (let ((.cse135 (bvmul (_ bv4 32) .cse134))) (or (not (bvslt .cse134 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse135) .cse0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse138 (concat .cse139 v_arrayElimCell_96))) (let ((.cse136 (bvmul (_ bv4 32) .cse138))) (let ((.cse137 (bvadd c_~f~0.offset (_ bv4 32) .cse136))) (or (= .cse136 .cse135) (not (bvule .cse137 .cse0)) (not (bvslt .cse138 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse136) .cse137)) (= .cse5 .cse136)))))) (forall ((v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat .cse139 v_arrayElimCell_103))) (= .cse5 .cse135) (not (bvsge .cse134 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse141 (bvmul (_ bv4 32) .cse140))) (or (not (bvslt .cse140 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse141) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse144 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse142 (bvmul (_ bv4 32) .cse144))) (let ((.cse143 (bvadd c_~f~0.offset (_ bv4 32) .cse142))) (or (not (bvule (bvadd c_~f~0.offset .cse142) .cse143)) (not (bvule .cse143 .cse0)) (not (bvslt .cse144 c_~size~0)) (= .cse141 .cse142) (not (bvsge .cse144 (_ bv0 32))) (= .cse5 .cse142)))))))) (= .cse5 .cse141) (not (bvsge .cse140 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse146 (bvmul (_ bv4 32) .cse145))) (or (not (bvslt .cse145 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse146) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse5 (bvmul (_ bv4 32) .cse147)) (= c_~x1~0 .cse147)))) (= .cse5 .cse146) (not (bvsge .cse145 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse152 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse151 (bvmul (_ bv4 32) .cse152))) (or (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse150 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse149 (bvmul (_ bv4 32) .cse150))) (let ((.cse148 (bvadd c_~f~0.offset (_ bv4 32) .cse149))) (or (not (bvule .cse148 .cse0)) (= .cse5 .cse149) (not (bvslt .cse150 c_~size~0)) (= .cse151 .cse149) (not (bvule (bvadd c_~f~0.offset .cse149) .cse148))))))) (not (bvslt .cse152 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse151) .cse0)) (= .cse5 .cse151) (not (bvsge .cse152 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse155 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse153 (concat (concat .cse155 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse154 (bvmul (_ bv4 32) .cse153))) (or (not (bvslt .cse153 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse154) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse155 v_arrayElimCell_107) v_arrayElimCell_104))) (= .cse5 .cse154) (not (bvsge .cse153 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse156 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse158 (bvmul (_ bv4 32) .cse156))) (or (not (bvslt .cse156 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse157 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse157 c_~x1~0) (= .cse5 (bvmul (_ bv4 32) .cse157))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse158) .cse0)) (= .cse5 .cse158) (not (bvsge .cse156 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse164 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse159 (concat .cse164 v_arrayElimCell_104))) (let ((.cse160 (bvmul (_ bv4 32) .cse159))) (or (not (bvslt .cse159 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse160) .cse0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse163 (concat .cse164 v_arrayElimCell_96))) (let ((.cse161 (bvmul (_ bv4 32) .cse163))) (let ((.cse162 (bvadd c_~f~0.offset (_ bv4 32) .cse161))) (or (= .cse161 .cse160) (not (bvule .cse162 .cse0)) (not (bvslt .cse163 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse161) .cse162)) (= .cse5 .cse161)))))) (forall ((v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_103) c_~x1~0)) (= .cse5 .cse160) (not (bvsge .cse159 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse167 (bvmul (_ bv4 32) .cse165))) (or (not (bvslt .cse165 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse166 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= .cse5 (bvmul (_ bv4 32) .cse166)) (= c_~x1~0 .cse166)))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse167) .cse0)) (= .cse5 .cse167) (not (bvsge .cse165 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse168 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse169 (bvmul (_ bv4 32) .cse168))) (or (not (bvslt .cse168 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse169) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse170 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse172 (bvmul (_ bv4 32) .cse170))) (let ((.cse171 (bvadd c_~f~0.offset (_ bv4 32) .cse172))) (or (not (bvslt .cse170 c_~size~0)) (not (bvule .cse171 .cse0)) (not (bvsge .cse170 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse172) .cse171)) (= .cse172 .cse169) (= .cse5 .cse172)))))) (= .cse5 .cse169) (not (bvsge .cse168 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse178 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse173 (concat .cse178 v_arrayElimCell_104))) (let ((.cse174 (bvmul (_ bv4 32) .cse173))) (or (not (bvslt .cse173 c_~size~0)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_105) v_arrayElimCell_103))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse174) .cse0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse177 (concat .cse178 v_arrayElimCell_96))) (let ((.cse175 (bvmul (_ bv4 32) .cse177))) (let ((.cse176 (bvadd c_~f~0.offset (_ bv4 32) .cse175))) (or (= .cse175 .cse174) (not (bvule .cse176 .cse0)) (not (bvslt .cse177 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse175) .cse176)) (= .cse5 .cse175)))))) (= .cse5 .cse174) (not (bvsge .cse173 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse179 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse183 (bvmul (_ bv4 32) .cse179))) (or (not (bvslt .cse179 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse181 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse182 (bvmul (_ bv4 32) .cse181))) (let ((.cse180 (bvadd c_~f~0.offset (_ bv4 32) .cse182))) (or (not (bvule .cse180 .cse0)) (not (bvslt .cse181 c_~size~0)) (not (bvsge .cse181 (_ bv0 32))) (= .cse5 .cse182) (not (bvule (bvadd c_~f~0.offset .cse182) .cse180)) (= .cse182 .cse183)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse183) .cse0)) (= .cse5 .cse183) (not (bvsge .cse179 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse184 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse185 (bvmul (_ bv4 32) .cse184))) (or (not (bvslt .cse184 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse185) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (= .cse5 .cse185) (not (bvsge .cse184 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse186 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse187 (bvmul (_ bv4 32) .cse186))) (or (not (bvslt .cse186 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse187) .cse0)) (= .cse5 .cse187) (not (bvsge .cse186 (_ bv0 32))) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse190 (bvmul (_ bv4 32) .cse188))) (let ((.cse189 (bvadd c_~f~0.offset (_ bv4 32) .cse190))) (or (not (bvsge .cse188 (_ bv0 32))) (not (bvule .cse189 .cse0)) (= .cse190 .cse187) (not (bvule (bvadd c_~f~0.offset .cse190) .cse189)) (not (bvslt .cse188 c_~size~0))))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse196 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse191 (concat (concat .cse196 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse192 (bvmul (_ bv4 32) .cse191))) (or (not (bvslt .cse191 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse192) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse195 (concat (concat .cse196 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse193 (bvmul (_ bv4 32) .cse195))) (let ((.cse194 (bvadd c_~f~0.offset (_ bv4 32) .cse193))) (or (= .cse192 .cse193) (not (bvule (bvadd c_~f~0.offset .cse193) .cse194)) (not (bvule .cse194 .cse0)) (not (bvslt .cse195 c_~size~0)) (= .cse5 .cse193)))))))) (= .cse5 .cse192) (not (bvsge .cse191 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse197 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse199 (bvmul (_ bv4 32) .cse197))) (or (not (bvslt .cse197 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse198 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= .cse198 c_~x1~0) (= .cse5 (bvmul (_ bv4 32) .cse198))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse199) .cse0)) (= .cse5 .cse199) (not (bvsge .cse197 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse205 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse200 (concat .cse205 v_arrayElimCell_104))) (let ((.cse201 (bvmul (_ bv4 32) .cse200))) (or (not (bvslt .cse200 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse201) .cse0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse204 (concat .cse205 v_arrayElimCell_96))) (let ((.cse202 (bvmul (_ bv4 32) .cse204))) (let ((.cse203 (bvadd c_~f~0.offset (_ bv4 32) .cse202))) (or (= .cse202 .cse201) (not (bvule .cse203 .cse0)) (not (bvslt .cse204 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse202) .cse203)) (= .cse5 .cse202)))))) (= .cse5 .cse201) (not (bvsge .cse200 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse206 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse210 (bvmul (_ bv4 32) .cse206))) (or (not (bvslt .cse206 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8))) (let ((.cse207 (concat v_arrayElimCell_97 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse207 v_arrayElimCell_99) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse211 (concat (concat .cse207 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse208 (bvmul (_ bv4 32) .cse211))) (let ((.cse209 (bvadd c_~f~0.offset (_ bv4 32) .cse208))) (or (not (bvule (bvadd c_~f~0.offset .cse208) .cse209)) (= .cse5 .cse208) (= .cse208 .cse210) (not (bvslt .cse211 c_~size~0)) (not (bvule .cse209 .cse0)))))))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse210) .cse0)) (= .cse5 .cse210) (not (bvsge .cse206 (_ bv0 32))))))) (or (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse217 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse216 (concat .cse217 v_arrayElimCell_96))) (let ((.cse212 (concat .cse217 v_arrayElimCell_104)) (.cse213 (bvmul (_ bv4 32) .cse216))) (let ((.cse215 (bvadd c_~f~0.offset (_ bv4 32) .cse213)) (.cse214 (bvmul (_ bv4 32) .cse212))) (or (not (bvslt .cse212 c_~size~0)) (= .cse213 .cse214) (not (bvule .cse215 .cse0)) (not (bvslt .cse216 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse213) .cse215)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse214) .cse0)) (= .cse5 .cse214) (= .cse5 .cse213) (not (bvsge .cse212 (_ bv0 32))))))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse219 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse218 (concat (concat .cse219 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse220 (bvmul (_ bv4 32) .cse218))) (or (not (bvslt .cse218 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat .cse219 v_arrayElimCell_107) v_arrayElimCell_96))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse220) .cse0)) (= .cse5 .cse220) (not (bvsge .cse218 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse221 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse222 (bvmul (_ bv4 32) .cse221))) (or (not (bvslt .cse221 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse222) .cse0)) (= .cse5 .cse222) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse225 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse223 (bvmul (_ bv4 32) .cse225))) (let ((.cse224 (bvadd c_~f~0.offset (_ bv4 32) .cse223))) (or (not (bvule (bvadd c_~f~0.offset .cse223) .cse224)) (not (bvule .cse224 .cse0)) (not (bvslt .cse225 c_~size~0)) (= .cse222 .cse223) (not (bvsge .cse225 (_ bv0 32)))))))) (not (bvsge .cse221 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse230 (bvmul (_ bv4 32) .cse226))) (or (not (bvslt .cse226 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse231 (concat v_arrayElimCell_100 v_arrayElimCell_98))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse229 (concat (concat .cse231 v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse227 (bvmul (_ bv4 32) .cse229))) (let ((.cse228 (bvadd c_~f~0.offset (_ bv4 32) .cse227))) (or (not (bvule (bvadd c_~f~0.offset .cse227) .cse228)) (not (bvule .cse228 .cse0)) (not (bvslt .cse229 c_~size~0)) (= .cse230 .cse227) (not (bvsge .cse229 (_ bv0 32))) (= .cse5 .cse227)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse231 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse230) .cse0)) (= .cse5 .cse230) (not (bvsge .cse226 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse232 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse233 (bvmul (_ bv4 32) .cse232))) (or (not (bvslt .cse232 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse233) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (= .cse5 .cse233) (not (bvsge .cse232 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse235 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse240 (concat .cse235 v_arrayElimCell_105))) (let ((.cse234 (concat .cse240 v_arrayElimCell_104))) (let ((.cse236 (bvmul (_ bv4 32) .cse234))) (or (not (bvslt .cse234 c_~size~0)) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat .cse235 v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse236) .cse0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse239 (concat .cse240 v_arrayElimCell_96))) (let ((.cse237 (bvmul (_ bv4 32) .cse239))) (let ((.cse238 (bvadd c_~f~0.offset (_ bv4 32) .cse237))) (or (= .cse237 .cse236) (not (bvule .cse238 .cse0)) (not (bvslt .cse239 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse237) .cse238)) (= .cse5 .cse237)))))) (= .cse5 .cse236) (not (bvsge .cse234 (_ bv0 32))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse241 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse242 (bvmul (_ bv4 32) .cse241))) (or (not (bvslt .cse241 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse242) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse243 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse244 (bvmul (_ bv4 32) .cse243))) (let ((.cse245 (bvadd c_~f~0.offset (_ bv4 32) .cse244))) (or (not (bvsge .cse243 (_ bv0 32))) (not (bvslt .cse243 c_~size~0)) (= .cse242 .cse244) (not (bvule .cse245 .cse0)) (not (bvule (bvadd c_~f~0.offset .cse244) .cse245))))))) (= .cse5 .cse242) (not (bvsge .cse241 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse246 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse247 (bvmul (_ bv4 32) .cse246))) (or (not (bvslt .cse246 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse247) .cse0)) (= .cse5 .cse247) (forall ((v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse250 (bvmul (_ bv4 32) .cse248))) (let ((.cse249 (bvadd c_~f~0.offset (_ bv4 32) .cse250))) (or (not (bvslt .cse248 c_~size~0)) (not (bvule .cse249 .cse0)) (not (bvsge .cse248 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse250) .cse249)) (= .cse250 .cse247) (= .cse5 .cse250)))))) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103))))) (not (bvsge .cse246 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse251 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse252 (bvmul (_ bv4 32) .cse251))) (or (not (bvslt .cse251 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse252) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (= .cse5 .cse252) (not (bvsge .cse251 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse253 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse254 (bvmul (_ bv4 32) .cse253))) (or (not (bvslt .cse253 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse254) .cse0)) (= .cse5 .cse254) (not (bvsge .cse253 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse260 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse255 (concat (concat .cse260 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse256 (bvmul (_ bv4 32) .cse255))) (or (not (bvslt .cse255 c_~size~0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse259 (concat (concat .cse260 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse257 (bvmul (_ bv4 32) .cse259))) (let ((.cse258 (bvadd c_~f~0.offset (_ bv4 32) .cse257))) (or (= .cse256 .cse257) (not (bvule (bvadd c_~f~0.offset .cse257) .cse258)) (not (bvule .cse258 .cse0)) (not (bvslt .cse259 c_~size~0))))))) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse256) .cse0)) (= .cse5 .cse256) (not (bvsge .cse255 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse262 (bvmul (_ bv4 32) .cse261))) (or (not (bvslt .cse261 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse262) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (= .cse5 .cse262) (not (bvsge .cse261 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse263 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse264 (bvmul (_ bv4 32) .cse263))) (or (not (bvslt .cse263 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse264) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse266 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse267 (bvmul (_ bv4 32) .cse266))) (let ((.cse265 (bvadd c_~f~0.offset (_ bv4 32) .cse267))) (or (not (bvule .cse265 .cse0)) (not (bvslt .cse266 c_~size~0)) (not (bvsge .cse266 (_ bv0 32))) (not (bvule (bvadd c_~f~0.offset .cse267) .cse265)) (= .cse267 .cse264)))))) (= .cse5 .cse264) (not (bvsge .cse263 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse273 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse268 (concat .cse273 v_arrayElimCell_104))) (let ((.cse269 (bvmul (_ bv4 32) .cse268))) (or (not (bvslt .cse268 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse269) .cse0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse272 (concat .cse273 v_arrayElimCell_96))) (let ((.cse270 (bvmul (_ bv4 32) .cse272))) (let ((.cse271 (bvadd c_~f~0.offset (_ bv4 32) .cse270))) (or (= .cse270 .cse269) (not (bvule .cse271 .cse0)) (not (bvslt .cse272 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse270) .cse271)) (= .cse5 .cse270)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_101) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (= .cse5 .cse269) (not (bvsge .cse268 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse274 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse275 (bvmul (_ bv4 32) .cse274))) (or (not (bvslt .cse274 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse275) .cse0)) (= .cse5 .cse275) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (let ((.cse278 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse276 (bvmul (_ bv4 32) .cse278))) (let ((.cse277 (bvadd c_~f~0.offset (_ bv4 32) .cse276))) (or (not (bvule (bvadd c_~f~0.offset .cse276) .cse277)) (not (bvslt .cse278 c_~size~0)) (not (bvsge .cse278 (_ bv0 32))) (= .cse276 .cse275) (not (bvule .cse277 .cse0))))))) (not (bvsge .cse274 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse279 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse280 (bvmul (_ bv4 32) .cse279))) (or (not (bvslt .cse279 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse280) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_102 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_102 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse282 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse281 (bvmul (_ bv4 32) .cse282))) (let ((.cse283 (bvadd c_~f~0.offset (_ bv4 32) .cse281))) (or (= .cse5 .cse281) (not (bvsge .cse282 (_ bv0 32))) (not (bvule .cse283 .cse0)) (not (bvslt .cse282 c_~size~0)) (= .cse281 .cse280) (not (bvule (bvadd c_~f~0.offset .cse281) .cse283))))))))) (= .cse5 .cse280) (not (bvsge .cse279 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse284 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse285 (bvmul (_ bv4 32) .cse284))) (or (not (bvslt .cse284 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse285) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (= .cse5 .cse285) (not (bvsge .cse284 (_ bv0 32))))))) (or .cse16 (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse286 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (or (= c_~x1~0 .cse286) (= .cse5 (bvmul (_ bv4 32) .cse286)))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse287 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse288 (bvmul (_ bv4 32) .cse287))) (or (not (bvslt .cse287 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse288) .cse0)) (= .cse5 .cse288) (not (bvsge .cse287 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse294 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse289 (concat (concat .cse294 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse290 (bvmul (_ bv4 32) .cse289))) (or (not (bvslt .cse289 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse290) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (or (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_107) v_arrayElimCell_103))) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse293 (concat (concat .cse294 v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse291 (bvmul (_ bv4 32) .cse293))) (let ((.cse292 (bvadd c_~f~0.offset (_ bv4 32) .cse291))) (or (= .cse290 .cse291) (not (bvule (bvadd c_~f~0.offset .cse291) .cse292)) (not (bvule .cse292 .cse0)) (not (bvslt .cse293 c_~size~0)) (= .cse5 .cse291)))))))) (= .cse5 .cse290) (not (bvsge .cse289 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse300 (concat v_arrayElimCell_97 v_arrayElimCell_101))) (let ((.cse295 (concat (concat .cse300 v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse296 (bvmul (_ bv4 32) .cse295))) (or (not (bvslt .cse295 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse296) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8))) (let ((.cse297 (concat (concat .cse300 v_arrayElimCell_107) v_arrayElimCell_104))) (let ((.cse298 (bvmul (_ bv4 32) .cse297))) (let ((.cse299 (bvadd c_~f~0.offset (_ bv4 32) .cse298))) (or (not (bvslt .cse297 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse298) .cse299)) (= .cse298 .cse296) (not (bvule .cse299 .cse0))))))) (= .cse5 .cse296) (not (bvsge .cse295 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse301 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse302 (bvmul (_ bv4 32) .cse301))) (or (not (bvslt .cse301 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_104) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse302) .cse0)) (= .cse5 .cse302) (not (bvsge .cse301 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse303 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse304 (bvmul (_ bv4 32) .cse303))) (or (not (bvslt .cse303 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse304) .cse0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (or (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse307 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_96))) (let ((.cse305 (bvmul (_ bv4 32) .cse307))) (let ((.cse306 (bvadd c_~f~0.offset (_ bv4 32) .cse305))) (or (not (bvule (bvadd c_~f~0.offset .cse305) .cse306)) (not (bvule .cse306 .cse0)) (not (bvslt .cse307 c_~size~0)) (= .cse304 .cse305) (not (bvsge .cse307 (_ bv0 32))) (= .cse5 .cse305)))))) (forall ((v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_99) v_arrayElimCell_103))))) (= .cse5 .cse304) (not (bvsge .cse303 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse308 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse309 (bvmul (_ bv4 32) .cse308))) (or (not (bvslt .cse308 c_~size~0)) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_98) v_arrayElimCell_105) v_arrayElimCell_104) c_~x1~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse309) .cse0)) (= .cse5 .cse309) (not (bvsge .cse308 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse315 (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105))) (let ((.cse310 (concat .cse315 v_arrayElimCell_104))) (let ((.cse311 (bvmul (_ bv4 32) .cse310))) (or (not (bvslt .cse310 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse311) .cse0)) (forall ((v_arrayElimCell_106 (_ BitVec 8)) (v_arrayElimCell_99 (_ BitVec 8)) (v_arrayElimCell_103 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_106) v_arrayElimCell_99) v_arrayElimCell_103) c_~x1~0)) (forall ((v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse314 (concat .cse315 v_arrayElimCell_96))) (let ((.cse312 (bvmul (_ bv4 32) .cse314))) (let ((.cse313 (bvadd c_~f~0.offset (_ bv4 32) .cse312))) (or (= .cse312 .cse311) (not (bvule .cse313 .cse0)) (not (bvslt .cse314 c_~size~0)) (not (bvule (bvadd c_~f~0.offset .cse312) .cse313)) (= .cse5 .cse312)))))) (= .cse5 .cse311) (not (bvsge .cse310 (_ bv0 32)))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse316 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse317 (bvmul (_ bv4 32) .cse316))) (or (not (bvslt .cse316 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse317) .cse0)) (= .cse5 .cse317) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (= c_~x1~0 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (not (bvsge .cse316 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse318 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse319 (bvmul (_ bv4 32) .cse318))) (or (not (bvslt .cse318 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse319) .cse0)) (forall ((v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse320 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse322 (bvmul (_ bv4 32) .cse320))) (let ((.cse321 (bvadd c_~f~0.offset (_ bv4 32) .cse322))) (or (not (bvsge .cse320 (_ bv0 32))) (not (bvule .cse321 .cse0)) (not (bvslt .cse320 c_~size~0)) (= .cse322 .cse319) (not (bvule (bvadd c_~f~0.offset .cse322) .cse321))))))) (= .cse5 .cse319) (not (bvsge .cse318 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse323 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse324 (bvmul (_ bv4 32) .cse323))) (or (not (bvslt .cse323 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse324) .cse0)) (forall ((v_arrayElimCell_100 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse325 (concat (concat (concat v_arrayElimCell_100 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_96))) (or (= c_~x1~0 .cse325) (= .cse5 (bvmul (_ bv4 32) .cse325))))) (= .cse5 .cse324) (not (bvsge .cse323 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 8)) (v_arrayElimCell_105 (_ BitVec 8)) (v_arrayElimCell_101 (_ BitVec 8)) (v_arrayElimCell_104 (_ BitVec 8))) (let ((.cse326 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_101) v_arrayElimCell_105) v_arrayElimCell_104))) (let ((.cse327 (bvmul (_ bv4 32) .cse326))) (or (not (bvslt .cse326 c_~size~0)) (not (bvule (bvadd c_~f~0.offset (_ bv4 32) .cse327) .cse0)) (= .cse5 .cse327) (forall ((v_arrayElimCell_98 (_ BitVec 8)) (v_arrayElimCell_107 (_ BitVec 8)) (v_arrayElimCell_96 (_ BitVec 8))) (let ((.cse329 (concat (concat (concat v_arrayElimCell_97 v_arrayElimCell_98) v_arrayElimCell_107) v_arrayElimCell_96))) (let ((.cse330 (bvmul (_ bv4 32) .cse329))) (let ((.cse328 (bvadd c_~f~0.offset (_ bv4 32) .cse330))) (or (not (bvule .cse328 .cse0)) (not (bvslt .cse329 c_~size~0)) (= .cse327 .cse330) (not (bvule (bvadd c_~f~0.offset .cse330) .cse328))))))) (not (bvsge .cse326 (_ bv0 32)))))))))) (not (bvslt c_~x2~0 c_~size~0))) (= c_~f~0.offset (_ bv0 32)))) is different from true [2022-11-23 02:32:44,849 INFO L130 PetriNetUnfolder]: 6586/12910 cut-off events. [2022-11-23 02:32:44,849 INFO L131 PetriNetUnfolder]: For 98633/98970 co-relation queries the response was YES. [2022-11-23 02:32:44,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67956 conditions, 12910 events. 6586/12910 cut-off events. For 98633/98970 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 103844 event pairs, 2108 based on Foata normal form. 217/12481 useless extension candidates. Maximal degree in co-relation 67888. Up to 12059 conditions per place. [2022-11-23 02:32:45,021 INFO L137 encePairwiseOnDemand]: 409/421 looper letters, 209 selfloop transitions, 63 changer transitions 41/327 dead transitions. [2022-11-23 02:32:45,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 327 transitions, 4178 flow [2022-11-23 02:32:45,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:32:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:32:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 951 transitions. [2022-11-23 02:32:45,024 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.28236342042755347 [2022-11-23 02:32:45,024 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 951 transitions. [2022-11-23 02:32:45,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 951 transitions. [2022-11-23 02:32:45,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:32:45,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 951 transitions. [2022-11-23 02:32:45,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:32:45,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 421.0) internal successors, (3789), 9 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:32:45,029 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 421.0) internal successors, (3789), 9 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:32:45,029 INFO L175 Difference]: Start difference. First operand has 170 places, 185 transitions, 1968 flow. Second operand 8 states and 951 transitions. [2022-11-23 02:32:45,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 327 transitions, 4178 flow [2022-11-23 02:32:46,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 327 transitions, 4082 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 02:32:46,492 INFO L231 Difference]: Finished difference. Result has 178 places, 240 transitions, 2906 flow [2022-11-23 02:32:46,492 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2906, PETRI_PLACES=178, PETRI_TRANSITIONS=240} [2022-11-23 02:32:46,492 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2022-11-23 02:32:46,492 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 240 transitions, 2906 flow [2022-11-23 02:32:46,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 115.33333333333333) internal successors, (1384), 12 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:32:46,493 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:32:46,493 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:32:46,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-23 02:32:46,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:32:46,693 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:32:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:32:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash -897376731, now seen corresponding path program 5 times [2022-11-23 02:32:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:32:46,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477311276] [2022-11-23 02:32:46,694 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 02:32:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:32:46,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:32:46,695 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:32:46,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-23 02:32:46,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:32:46,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:32:46,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-23 02:32:46,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:32:46,882 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 14 treesize of output 12 [2022-11-23 02:32:47,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-23 02:32:47,652 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 51 treesize of output 19 [2022-11-23 02:32:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:32:47,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:32:49,902 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 176 treesize of output 174 [2022-11-23 02:32:49,910 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 174 treesize of output 172 [2022-11-23 02:32:51,473 INFO L321 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2022-11-23 02:32:51,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 172 treesize of output 115 [2022-11-23 02:32:51,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 19 [2022-11-23 02:32:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:32:52,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:32:52,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477311276] [2022-11-23 02:32:52,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477311276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:32:52,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:32:52,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2022-11-23 02:32:52,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331364120] [2022-11-23 02:32:52,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:32:52,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 02:32:52,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:32:52,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 02:32:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=243, Unknown=2, NotChecked=0, Total=306 [2022-11-23 02:33:00,225 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 421 [2022-11-23 02:33:00,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 240 transitions, 2906 flow. Second operand has 18 states, 18 states have (on average 121.77777777777777) internal successors, (2192), 18 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:33:00,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:33:00,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 421 [2022-11-23 02:33:00,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:33:04,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:33:06,680 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] [2022-11-23 02:33:10,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:33:12,086 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] [2022-11-23 02:33:14,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:33:16,133 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] [2022-11-23 02:33:21,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:33:23,821 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] [2022-11-23 02:33:25,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:33:30,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:33:32,974 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] [2022-11-23 02:33:35,166 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 [0, 1] [2022-11-23 02:33:37,170 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 [0] [2022-11-23 02:33:39,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 02:33:41,447 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] [2022-11-23 02:33:43,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:33:46,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:33:48,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:33:50,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:33:53,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:33:55,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:33:59,309 INFO L130 PetriNetUnfolder]: 9656/18598 cut-off events. [2022-11-23 02:33:59,310 INFO L131 PetriNetUnfolder]: For 136342/136342 co-relation queries the response was YES. [2022-11-23 02:33:59,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101806 conditions, 18598 events. 9656/18598 cut-off events. For 136342/136342 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 153190 event pairs, 230 based on Foata normal form. 200/18758 useless extension candidates. Maximal degree in co-relation 101734. Up to 5827 conditions per place. [2022-11-23 02:33:59,943 INFO L137 encePairwiseOnDemand]: 410/421 looper letters, 158 selfloop transitions, 191 changer transitions 32/381 dead transitions. [2022-11-23 02:33:59,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 381 transitions, 4682 flow [2022-11-23 02:33:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 02:33:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-23 02:33:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2919 transitions. [2022-11-23 02:33:59,955 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.30145616028090466 [2022-11-23 02:33:59,955 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2919 transitions. [2022-11-23 02:33:59,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2919 transitions. [2022-11-23 02:33:59,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:33:59,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2919 transitions. [2022-11-23 02:33:59,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 126.91304347826087) internal successors, (2919), 23 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:33:59,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 421.0) internal successors, (10104), 24 states have internal predecessors, (10104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:33:59,971 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 421.0) internal successors, (10104), 24 states have internal predecessors, (10104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:33:59,971 INFO L175 Difference]: Start difference. First operand has 178 places, 240 transitions, 2906 flow. Second operand 23 states and 2919 transitions. [2022-11-23 02:33:59,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 381 transitions, 4682 flow [2022-11-23 02:34:02,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 381 transitions, 4650 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-23 02:34:02,416 INFO L231 Difference]: Finished difference. Result has 206 places, 281 transitions, 3818 flow [2022-11-23 02:34:02,417 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=2886, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3818, PETRI_PLACES=206, PETRI_TRANSITIONS=281} [2022-11-23 02:34:02,417 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 166 predicate places. [2022-11-23 02:34:02,417 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 281 transitions, 3818 flow [2022-11-23 02:34:02,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 121.77777777777777) internal successors, (2192), 18 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:02,418 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:02,418 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:02,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-11-23 02:34:02,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:34:02,625 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:34:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1028680025, now seen corresponding path program 6 times [2022-11-23 02:34:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:34:02,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811113466] [2022-11-23 02:34:02,625 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-23 02:34:02,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:34:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:34:02,626 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:34:02,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-23 02:34:02,780 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-23 02:34:02,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:34:02,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:34:02,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:34:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:34:02,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:34:03,011 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 60 treesize of output 58 [2022-11-23 02:34:03,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 58 treesize of output 56 [2022-11-23 02:34:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:34:03,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:34:03,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811113466] [2022-11-23 02:34:03,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811113466] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:34:03,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:34:03,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 02:34:03,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931385197] [2022-11-23 02:34:03,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:34:03,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:34:03,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:34:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:34:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-23 02:34:03,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 421 [2022-11-23 02:34:03,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 281 transitions, 3818 flow. Second operand has 10 states, 10 states have (on average 172.2) internal successors, (1722), 10 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:03,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:03,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 421 [2022-11-23 02:34:03,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:14,938 INFO L130 PetriNetUnfolder]: 13839/25191 cut-off events. [2022-11-23 02:34:14,938 INFO L131 PetriNetUnfolder]: For 293294/293294 co-relation queries the response was YES. [2022-11-23 02:34:15,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169611 conditions, 25191 events. 13839/25191 cut-off events. For 293294/293294 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 202173 event pairs, 935 based on Foata normal form. 123/25274 useless extension candidates. Maximal degree in co-relation 169530. Up to 10149 conditions per place. [2022-11-23 02:34:15,506 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 262 selfloop transitions, 192 changer transitions 0/454 dead transitions. [2022-11-23 02:34:15,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 454 transitions, 6917 flow [2022-11-23 02:34:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 02:34:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-23 02:34:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2136 transitions. [2022-11-23 02:34:15,511 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42280285035629456 [2022-11-23 02:34:15,511 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2136 transitions. [2022-11-23 02:34:15,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2136 transitions. [2022-11-23 02:34:15,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:15,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2136 transitions. [2022-11-23 02:34:15,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 178.0) internal successors, (2136), 12 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:15,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 421.0) internal successors, (5473), 13 states have internal predecessors, (5473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:15,522 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 421.0) internal successors, (5473), 13 states have internal predecessors, (5473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:15,522 INFO L175 Difference]: Start difference. First operand has 206 places, 281 transitions, 3818 flow. Second operand 12 states and 2136 transitions. [2022-11-23 02:34:15,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 454 transitions, 6917 flow [2022-11-23 02:34:28,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 454 transitions, 6720 flow, removed 83 selfloop flow, removed 3 redundant places. [2022-11-23 02:34:28,315 INFO L231 Difference]: Finished difference. Result has 214 places, 362 transitions, 5631 flow [2022-11-23 02:34:28,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=3664, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5631, PETRI_PLACES=214, PETRI_TRANSITIONS=362} [2022-11-23 02:34:28,317 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 174 predicate places. [2022-11-23 02:34:28,317 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 362 transitions, 5631 flow [2022-11-23 02:34:28,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 172.2) internal successors, (1722), 10 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:28,317 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:34:28,317 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:34:28,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-23 02:34:28,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:34:28,526 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:34:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:34:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1414575985, now seen corresponding path program 7 times [2022-11-23 02:34:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:34:28,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900970502] [2022-11-23 02:34:28,527 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 02:34:28,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:34:28,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:34:28,528 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:34:28,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-23 02:34:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:34:28,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:34:28,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:34:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:34:28,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:34:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:34:29,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:34:29,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900970502] [2022-11-23 02:34:29,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900970502] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:34:29,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:34:29,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 02:34:29,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208844234] [2022-11-23 02:34:29,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:34:29,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:34:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:34:29,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:34:29,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-23 02:34:29,728 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 421 [2022-11-23 02:34:29,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 362 transitions, 5631 flow. Second operand has 10 states, 10 states have (on average 171.4) internal successors, (1714), 10 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:29,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:34:29,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 421 [2022-11-23 02:34:29,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:34:39,571 INFO L130 PetriNetUnfolder]: 13890/25274 cut-off events. [2022-11-23 02:34:39,571 INFO L131 PetriNetUnfolder]: For 347523/347523 co-relation queries the response was YES. [2022-11-23 02:34:39,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177940 conditions, 25274 events. 13890/25274 cut-off events. For 347523/347523 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 203004 event pairs, 972 based on Foata normal form. 240/25514 useless extension candidates. Maximal degree in co-relation 177856. Up to 9518 conditions per place. [2022-11-23 02:34:39,960 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 258 selfloop transitions, 197 changer transitions 3/458 dead transitions. [2022-11-23 02:34:39,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 458 transitions, 7310 flow [2022-11-23 02:34:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:34:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-23 02:34:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2467 transitions. [2022-11-23 02:34:39,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4185612487275195 [2022-11-23 02:34:39,965 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2467 transitions. [2022-11-23 02:34:39,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2467 transitions. [2022-11-23 02:34:39,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:34:39,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2467 transitions. [2022-11-23 02:34:39,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 176.21428571428572) internal successors, (2467), 14 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:39,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 421.0) internal successors, (6315), 15 states have internal predecessors, (6315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:39,975 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 421.0) internal successors, (6315), 15 states have internal predecessors, (6315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:34:39,975 INFO L175 Difference]: Start difference. First operand has 214 places, 362 transitions, 5631 flow. Second operand 14 states and 2467 transitions. [2022-11-23 02:34:39,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 458 transitions, 7310 flow [2022-11-23 02:35:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 458 transitions, 6860 flow, removed 206 selfloop flow, removed 8 redundant places. [2022-11-23 02:35:00,928 INFO L231 Difference]: Finished difference. Result has 220 places, 367 transitions, 5703 flow [2022-11-23 02:35:00,929 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=5162, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5703, PETRI_PLACES=220, PETRI_TRANSITIONS=367} [2022-11-23 02:35:00,929 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 180 predicate places. [2022-11-23 02:35:00,929 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 367 transitions, 5703 flow [2022-11-23 02:35:00,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 171.4) internal successors, (1714), 10 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:35:00,930 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:35:00,930 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:35:00,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-23 02:35:01,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:35:01,130 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:35:01,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:35:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash -724747795, now seen corresponding path program 8 times [2022-11-23 02:35:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:35:01,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276747555] [2022-11-23 02:35:01,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:35:01,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:35:01,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:35:01,132 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:35:01,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-23 02:35:01,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:35:01,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:35:01,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:35:01,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:35:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:35:01,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:35:01,512 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 60 treesize of output 58 [2022-11-23 02:35:01,519 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 58 treesize of output 56 [2022-11-23 02:35:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:35:01,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:35:01,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276747555] [2022-11-23 02:35:01,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276747555] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:35:01,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:35:01,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 02:35:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327950940] [2022-11-23 02:35:01,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:35:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:35:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:35:01,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:35:01,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-23 02:35:02,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 421 [2022-11-23 02:35:02,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 367 transitions, 5703 flow. Second operand has 10 states, 10 states have (on average 172.2) internal successors, (1722), 10 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:35:02,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:35:02,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 421 [2022-11-23 02:35:02,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:35:12,098 INFO L130 PetriNetUnfolder]: 13910/25252 cut-off events. [2022-11-23 02:35:12,099 INFO L131 PetriNetUnfolder]: For 258591/258591 co-relation queries the response was YES. [2022-11-23 02:35:12,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173346 conditions, 25252 events. 13910/25252 cut-off events. For 258591/258591 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 202764 event pairs, 481 based on Foata normal form. 82/25334 useless extension candidates. Maximal degree in co-relation 173267. Up to 9501 conditions per place. [2022-11-23 02:35:12,653 INFO L137 encePairwiseOnDemand]: 415/421 looper letters, 257 selfloop transitions, 217 changer transitions 0/474 dead transitions. [2022-11-23 02:35:12,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 474 transitions, 7634 flow [2022-11-23 02:35:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 02:35:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-23 02:35:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2485 transitions. [2022-11-23 02:35:12,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42161520190023755 [2022-11-23 02:35:12,659 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2485 transitions. [2022-11-23 02:35:12,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2485 transitions. [2022-11-23 02:35:12,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:35:12,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2485 transitions. [2022-11-23 02:35:12,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 177.5) internal successors, (2485), 14 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:35:12,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 421.0) internal successors, (6315), 15 states have internal predecessors, (6315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:35:12,674 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 421.0) internal successors, (6315), 15 states have internal predecessors, (6315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:35:12,674 INFO L175 Difference]: Start difference. First operand has 220 places, 367 transitions, 5703 flow. Second operand 14 states and 2485 transitions. [2022-11-23 02:35:12,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 474 transitions, 7634 flow [2022-11-23 02:35:29,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 474 transitions, 7210 flow, removed 64 selfloop flow, removed 7 redundant places. [2022-11-23 02:35:29,357 INFO L231 Difference]: Finished difference. Result has 228 places, 378 transitions, 6002 flow [2022-11-23 02:35:29,357 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=421, PETRI_DIFFERENCE_MINUEND_FLOW=5275, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6002, PETRI_PLACES=228, PETRI_TRANSITIONS=378} [2022-11-23 02:35:29,358 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 188 predicate places. [2022-11-23 02:35:29,358 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 378 transitions, 6002 flow [2022-11-23 02:35:29,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 172.2) internal successors, (1722), 10 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:35:29,358 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:35:29,358 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:35:29,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-23 02:35:29,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:35:29,559 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-23 02:35:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:35:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 54323559, now seen corresponding path program 9 times [2022-11-23 02:35:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:35:29,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86212602] [2022-11-23 02:35:29,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 02:35:29,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:35:29,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:35:29,561 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 02:35:29,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b5f42fb-57c2-4388-b0c7-4c51d4f03e5b/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-23 02:35:29,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 02:35:29,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:35:29,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:35:29,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:35:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:35:29,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:35:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:35:30,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:35:30,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86212602] [2022-11-23 02:35:30,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86212602] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:35:30,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:35:30,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 02:35:30,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588417257] [2022-11-23 02:35:30,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 02:35:30,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 02:35:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:35:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 02:35:30,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 02:35:30,535 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 421 [2022-11-23 02:35:30,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 378 transitions, 6002 flow. Second operand has 10 states, 10 states have (on average 171.1) internal successors, (1711), 10 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:35:30,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:35:30,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 421 [2022-11-23 02:35:30,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand