./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN --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 795c382fbb0026f2f6f7212254176553809c7311a8058a10cea47f6b1b03373b --- 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-6b4ec56 [2022-11-20 11:21:05,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:21:05,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:21:05,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:21:05,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:21:05,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:21:05,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:21:05,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:21:05,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:21:05,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:21:05,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:21:05,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:21:05,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:21:05,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:21:05,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:21:05,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:21:05,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:21:05,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:21:05,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:21:05,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:21:05,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:21:05,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:21:05,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:21:05,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:21:05,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:21:05,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:21:05,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:21:05,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:21:05,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:21:05,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:21:05,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:21:05,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:21:05,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:21:05,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:21:05,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:21:05,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:21:05,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:21:05,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:21:05,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:21:05,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:21:06,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:21:06,010 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:21:06,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:21:06,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:21:06,051 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:21:06,051 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:21:06,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:21:06,052 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:21:06,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:21:06,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:21:06,053 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:21:06,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:21:06,053 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:21:06,053 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:21:06,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:21:06,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:21:06,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:21:06,054 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:21:06,054 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:21:06,054 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:21:06,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:21:06,055 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:21:06,055 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:21:06,055 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:21:06,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:21:06,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:21:06,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:21:06,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:21:06,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:21:06,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:21:06,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:21:06,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:21:06,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/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_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN 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 -> 795c382fbb0026f2f6f7212254176553809c7311a8058a10cea47f6b1b03373b [2022-11-20 11:21:06,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:21:06,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:21:06,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:21:06,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:21:06,416 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:21:06,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2022-11-20 11:21:09,527 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:21:09,712 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:21:09,713 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2022-11-20 11:21:09,720 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/data/d3236530c/aec431cc5e9f474c841698817a4805b7/FLAGfb34cafdd [2022-11-20 11:21:09,734 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/data/d3236530c/aec431cc5e9f474c841698817a4805b7 [2022-11-20 11:21:09,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:21:09,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:21:09,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:21:09,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:21:09,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:21:09,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:21:09" (1/1) ... [2022-11-20 11:21:09,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148f457f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:09, skipping insertion in model container [2022-11-20 11:21:09,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:21:09" (1/1) ... [2022-11-20 11:21:09,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:21:09,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:21:09,985 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_fa4d2bef-eca1-44b9-9883-490a2f570a6d/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c[3034,3047] [2022-11-20 11:21:09,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:21:10,008 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-20 11:21:10,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@730add93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:10, skipping insertion in model container [2022-11-20 11:21:10,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:21:10,009 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-20 11:21:10,011 INFO L158 Benchmark]: Toolchain (without parser) took 271.44ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 109.4MB in the end (delta: -1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:21:10,011 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 112.9MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:21:10,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.11ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 109.4MB in the end (delta: -1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:21:10,013 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.29ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 112.9MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.11ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 109.4MB in the end (delta: -1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 118]: 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN --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 795c382fbb0026f2f6f7212254176553809c7311a8058a10cea47f6b1b03373b --- 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-6b4ec56 [2022-11-20 11:21:12,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:21:12,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:21:12,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:21:12,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:21:12,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:21:12,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:21:12,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:21:12,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:21:12,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:21:12,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:21:12,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:21:12,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:21:12,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:21:12,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:21:12,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:21:12,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:21:12,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:21:12,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:21:12,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:21:12,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:21:12,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:21:12,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:21:12,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:21:12,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:21:12,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:21:12,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:21:12,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:21:12,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:21:12,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:21:12,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:21:12,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:21:12,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:21:12,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:21:12,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:21:12,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:21:12,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:21:12,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:21:12,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:21:12,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:21:12,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:21:12,365 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 11:21:12,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:21:12,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:21:12,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:21:12,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:21:12,394 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:21:12,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:21:12,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:21:12,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:21:12,396 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:21:12,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:21:12,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:21:12,397 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:21:12,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:21:12,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:21:12,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:21:12,397 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:21:12,398 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:21:12,398 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:21:12,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:21:12,398 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:21:12,398 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 11:21:12,399 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 11:21:12,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:21:12,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:21:12,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:21:12,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:21:12,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:21:12,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:21:12,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:21:12,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:21:12,401 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 11:21:12,401 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 11:21:12,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 11:21:12,401 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/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_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN 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 -> 795c382fbb0026f2f6f7212254176553809c7311a8058a10cea47f6b1b03373b [2022-11-20 11:21:12,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:21:12,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:21:12,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:21:12,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:21:12,835 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:21:12,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2022-11-20 11:21:15,949 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:21:16,191 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:21:16,191 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2022-11-20 11:21:16,198 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/data/475897324/4132146b4e9e41dab0cc9acffdf013d3/FLAG200e22b1e [2022-11-20 11:21:16,216 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/data/475897324/4132146b4e9e41dab0cc9acffdf013d3 [2022-11-20 11:21:16,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:21:16,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:21:16,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:21:16,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:21:16,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:21:16,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ef4e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16, skipping insertion in model container [2022-11-20 11:21:16,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:21:16,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:21:16,544 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_fa4d2bef-eca1-44b9-9883-490a2f570a6d/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c[3034,3047] [2022-11-20 11:21:16,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:21:16,588 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-20 11:21:16,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:21:16,630 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_fa4d2bef-eca1-44b9-9883-490a2f570a6d/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c[3034,3047] [2022-11-20 11:21:16,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:21:16,640 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:21:16,692 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_fa4d2bef-eca1-44b9-9883-490a2f570a6d/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c[3034,3047] [2022-11-20 11:21:16,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:21:16,720 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:21:16,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16 WrapperNode [2022-11-20 11:21:16,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:21:16,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:21:16,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:21:16,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:21:16,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,803 INFO L138 Inliner]: procedures = 28, calls = 46, calls flagged for inlining = 16, calls inlined = 24, statements flattened = 265 [2022-11-20 11:21:16,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:21:16,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:21:16,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:21:16,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:21:16,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,872 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:21:16,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:21:16,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:21:16,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:21:16,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (1/1) ... [2022-11-20 11:21:16,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:21:16,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:21:16,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:21:16,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:21:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:21:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 11:21:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:21:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 11:21:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 11:21:16,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 11:21:16,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 11:21:16,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 11:21:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 11:21:16,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 11:21:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:21:16,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:21:16,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:21:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:21:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 11:21:16,978 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:21:17,105 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:21:17,107 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:21:17,978 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:21:17,989 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:21:17,989 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 11:21:17,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:21:17 BoogieIcfgContainer [2022-11-20 11:21:17,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:21:17,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:21:17,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:21:17,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:21:17,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:21:16" (1/3) ... [2022-11-20 11:21:17,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68db8ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:21:17, skipping insertion in model container [2022-11-20 11:21:17,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:21:16" (2/3) ... [2022-11-20 11:21:17,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68db8ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:21:17, skipping insertion in model container [2022-11-20 11:21:17,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:21:17" (3/3) ... [2022-11-20 11:21:18,001 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2022-11-20 11:21:18,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:21:18,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-20 11:21:18,020 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:21:18,170 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 11:21:18,210 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 11:21:18,225 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 366 places, 384 transitions, 792 flow [2022-11-20 11:21:18,228 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 366 places, 384 transitions, 792 flow [2022-11-20 11:21:18,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 366 places, 384 transitions, 792 flow [2022-11-20 11:21:18,433 INFO L130 PetriNetUnfolder]: 28/381 cut-off events. [2022-11-20 11:21:18,433 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 11:21:18,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 381 events. 28/381 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 729 event pairs, 0 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 288. Up to 2 conditions per place. [2022-11-20 11:21:18,459 INFO L119 LiptonReduction]: Number of co-enabled transitions 24864 [2022-11-20 11:22:02,495 INFO L134 LiptonReduction]: Checked pairs total: 26050 [2022-11-20 11:22:02,496 INFO L136 LiptonReduction]: Total number of compositions: 449 [2022-11-20 11:22:02,503 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 66 transitions, 156 flow [2022-11-20 11:22:02,645 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2348 states, 1844 states have (on average 4.6545553145336225) internal successors, (8583), 2347 states have internal predecessors, (8583), 0 states have call successors, (0), 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-20 11:22:02,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:22:02,675 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=FINITE_AUTOMATA, 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;@61dc902f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:22:02,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2022-11-20 11:22:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 1844 states have (on average 4.6545553145336225) internal successors, (8583), 2347 states have internal predecessors, (8583), 0 states have call successors, (0), 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-20 11:22:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 11:22:02,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:02,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 11:22:02,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash 48930, now seen corresponding path program 1 times [2022-11-20 11:22:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:02,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7760399] [2022-11-20 11:22:02,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:02,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-20 11:22:02,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:02,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:02,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:02,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:22:02,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:03,021 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:22:03,022 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:22:03,050 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-20 11:22:03,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:03,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:03,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7760399] [2022-11-20 11:22:03,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7760399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:03,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:03,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:22:03,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087458282] [2022-11-20 11:22:03,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:03,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:22:03,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:03,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:22:03,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:22:03,117 INFO L87 Difference]: Start difference. First operand has 2348 states, 1844 states have (on average 4.6545553145336225) internal successors, (8583), 2347 states have internal predecessors, (8583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-20 11:22:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:03,484 INFO L93 Difference]: Finished difference Result 2344 states and 8295 transitions. [2022-11-20 11:22:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:22:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-20 11:22:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:03,519 INFO L225 Difference]: With dead ends: 2344 [2022-11-20 11:22:03,519 INFO L226 Difference]: Without dead ends: 2344 [2022-11-20 11:22:03,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:22:03,523 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:03,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:22:03,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2022-11-20 11:22:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2344. [2022-11-20 11:22:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1844 states have (on average 4.498373101952278) internal successors, (8295), 2343 states have internal predecessors, (8295), 0 states have call successors, (0), 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-20 11:22:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 8295 transitions. [2022-11-20 11:22:03,665 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 8295 transitions. Word has length 2 [2022-11-20 11:22:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:03,666 INFO L495 AbstractCegarLoop]: Abstraction has 2344 states and 8295 transitions. [2022-11-20 11:22:03,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-20 11:22:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 8295 transitions. [2022-11-20 11:22:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-20 11:22:03,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:03,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-20 11:22:03,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:03,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:03,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 48931, now seen corresponding path program 1 times [2022-11-20 11:22:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:03,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676559367] [2022-11-20 11:22:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:03,880 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-20 11:22:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:03,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:03,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:03,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:22:03,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:04,144 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:22:04,145 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:22:04,169 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-20 11:22:04,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:04,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:04,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676559367] [2022-11-20 11:22:04,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676559367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:04,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:04,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:22:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315992104] [2022-11-20 11:22:04,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:04,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:22:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:04,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:22:04,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:22:04,174 INFO L87 Difference]: Start difference. First operand 2344 states and 8295 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-20 11:22:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:04,789 INFO L93 Difference]: Finished difference Result 4684 states and 16586 transitions. [2022-11-20 11:22:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:22:04,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-20 11:22:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:04,827 INFO L225 Difference]: With dead ends: 4684 [2022-11-20 11:22:04,827 INFO L226 Difference]: Without dead ends: 4684 [2022-11-20 11:22:04,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:22:04,833 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:04,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:22:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2022-11-20 11:22:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 2347. [2022-11-20 11:22:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1847 states have (on average 4.495397942609637) internal successors, (8303), 2346 states have internal predecessors, (8303), 0 states have call successors, (0), 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-20 11:22:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 8303 transitions. [2022-11-20 11:22:04,982 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 8303 transitions. Word has length 2 [2022-11-20 11:22:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:04,983 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 8303 transitions. [2022-11-20 11:22:04,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-20 11:22:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 8303 transitions. [2022-11-20 11:22:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:22:04,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:04,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:22:04,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:05,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:05,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:05,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:05,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1526701, now seen corresponding path program 1 times [2022-11-20 11:22:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:05,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381565] [2022-11-20 11:22:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:05,196 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-20 11:22:05,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:05,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:05,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:05,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:22:05,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:05,398 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:22:05,398 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:22:05,442 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-20 11:22:05,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:22:05,576 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-20 11:22:05,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:05,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381565] [2022-11-20 11:22:05,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381565] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:22:05,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:22:05,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2022-11-20 11:22:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169460267] [2022-11-20 11:22:05,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:22:05,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:22:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:05,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:22:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:22:05,578 INFO L87 Difference]: Start difference. First operand 2347 states and 8303 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:08,778 INFO L93 Difference]: Finished difference Result 11704 states and 41459 transitions. [2022-11-20 11:22:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:22:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 11:22:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:08,907 INFO L225 Difference]: With dead ends: 11704 [2022-11-20 11:22:08,907 INFO L226 Difference]: Without dead ends: 11704 [2022-11-20 11:22:08,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:22:08,916 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 384 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:08,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 0 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-20 11:22:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11704 states. [2022-11-20 11:22:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11704 to 2356. [2022-11-20 11:22:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1856 states have (on average 4.486530172413793) internal successors, (8327), 2355 states have internal predecessors, (8327), 0 states have call successors, (0), 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-20 11:22:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 8327 transitions. [2022-11-20 11:22:09,402 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 8327 transitions. Word has length 3 [2022-11-20 11:22:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:09,403 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 8327 transitions. [2022-11-20 11:22:09,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 8327 transitions. [2022-11-20 11:22:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 11:22:09,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:09,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 11:22:09,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:09,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:09,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:09,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:09,617 INFO L85 PathProgramCache]: Analyzing trace with hash 47465829, now seen corresponding path program 1 times [2022-11-20 11:22:09,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:09,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559073444] [2022-11-20 11:22:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:09,618 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-20 11:22:09,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:09,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:09,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:09,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:22:09,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:09,722 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-20 11:22:09,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:09,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559073444] [2022-11-20 11:22:09,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559073444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:09,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:09,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:22:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686518162] [2022-11-20 11:22:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:09,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:22:09,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:22:09,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:22:09,725 INFO L87 Difference]: Start difference. First operand 2356 states and 8327 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-20 11:22:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:10,209 INFO L93 Difference]: Finished difference Result 2356 states and 8322 transitions. [2022-11-20 11:22:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:22:10,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 11:22:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:10,222 INFO L225 Difference]: With dead ends: 2356 [2022-11-20 11:22:10,223 INFO L226 Difference]: Without dead ends: 2356 [2022-11-20 11:22:10,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:22:10,224 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:10,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:22:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-11-20 11:22:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2356. [2022-11-20 11:22:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1856 states have (on average 4.483836206896552) internal successors, (8322), 2355 states have internal predecessors, (8322), 0 states have call successors, (0), 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-20 11:22:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 8322 transitions. [2022-11-20 11:22:10,366 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 8322 transitions. Word has length 4 [2022-11-20 11:22:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:10,366 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 8322 transitions. [2022-11-20 11:22:10,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-20 11:22:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 8322 transitions. [2022-11-20 11:22:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 11:22:10,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:10,367 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-20 11:22:10,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:10,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:10,578 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1752919645, now seen corresponding path program 2 times [2022-11-20 11:22:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:10,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835726696] [2022-11-20 11:22:10,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:22:10,580 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-20 11:22:10,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:10,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:10,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:10,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:22:10,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:22:10,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:22:10,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:10,833 INFO L321 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2022-11-20 11:22:10,834 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 3 case distinctions, treesize of input 17 treesize of output 44 [2022-11-20 11:22:11,068 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-20 11:22:11,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:22:11,839 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-20 11:22:11,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:11,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835726696] [2022-11-20 11:22:11,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835726696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:22:11,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:22:11,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2022-11-20 11:22:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907270695] [2022-11-20 11:22:11,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:22:11,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:22:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:22:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:22:11,842 INFO L87 Difference]: Start difference. First operand 2356 states and 8322 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:15,750 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-20 11:22:17,753 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-20 11:22:19,755 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-20 11:22:21,758 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-20 11:22:23,961 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-20 11:22:25,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:22:27,965 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 [] [2022-11-20 11:22:29,967 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-20 11:22:32,116 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 [] [2022-11-20 11:22:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:36,563 INFO L93 Difference]: Finished difference Result 7042 states and 24897 transitions. [2022-11-20 11:22:36,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:22:36,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 11:22:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:36,604 INFO L225 Difference]: With dead ends: 7042 [2022-11-20 11:22:36,604 INFO L226 Difference]: Without dead ends: 7042 [2022-11-20 11:22:36,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:22:36,606 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 379 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 106 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:36,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 0 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 609 Invalid, 8 Unknown, 0 Unchecked, 23.1s Time] [2022-11-20 11:22:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7042 states. [2022-11-20 11:22:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7042 to 2366. [2022-11-20 11:22:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1866 states have (on average 4.461950696677385) internal successors, (8326), 2365 states have internal predecessors, (8326), 0 states have call successors, (0), 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-20 11:22:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 8326 transitions. [2022-11-20 11:22:36,768 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 8326 transitions. Word has length 6 [2022-11-20 11:22:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:36,768 INFO L495 AbstractCegarLoop]: Abstraction has 2366 states and 8326 transitions. [2022-11-20 11:22:36,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 8326 transitions. [2022-11-20 11:22:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:22:36,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:36,769 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1] [2022-11-20 11:22:36,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:36,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:36,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1045990045, now seen corresponding path program 3 times [2022-11-20 11:22:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:36,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650903619] [2022-11-20 11:22:36,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:22:36,988 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-20 11:22:36,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:36,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:36,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:37,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-20 11:22:37,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:22:37,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 11:22:37,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 11:22:37,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:22:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 11:22:37,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:37,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650903619] [2022-11-20 11:22:37,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650903619] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:22:37,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:22:37,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-11-20 11:22:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761310763] [2022-11-20 11:22:37,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:22:37,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:22:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:22:37,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:22:37,725 INFO L87 Difference]: Start difference. First operand 2366 states and 8326 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:38,556 INFO L93 Difference]: Finished difference Result 2356 states and 8304 transitions. [2022-11-20 11:22:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:22:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:22:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:38,569 INFO L225 Difference]: With dead ends: 2356 [2022-11-20 11:22:38,569 INFO L226 Difference]: Without dead ends: 2356 [2022-11-20 11:22:38,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:22:38,571 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 336 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:38,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 0 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 11:22:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-11-20 11:22:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2356. [2022-11-20 11:22:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1859 states have (on average 4.466917697686928) internal successors, (8304), 2355 states have internal predecessors, (8304), 0 states have call successors, (0), 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-20 11:22:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 8304 transitions. [2022-11-20 11:22:38,656 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 8304 transitions. Word has length 12 [2022-11-20 11:22:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:38,656 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 8304 transitions. [2022-11-20 11:22:38,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 8304 transitions. [2022-11-20 11:22:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:22:38,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:38,658 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1] [2022-11-20 11:22:38,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-20 11:22:38,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:38,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:38,883 INFO L85 PathProgramCache]: Analyzing trace with hash -290038727, now seen corresponding path program 1 times [2022-11-20 11:22:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:38,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977493535] [2022-11-20 11:22:38,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:38,884 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-20 11:22:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:38,885 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:38,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:39,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:22:39,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:39,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:39,360 INFO L321 Elim1Store]: treesize reduction 86, result has 25.9 percent of original size [2022-11-20 11:22:39,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 55 [2022-11-20 11:22:39,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:39,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:22:39,607 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:22:39,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:22:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:39,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:39,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:39,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977493535] [2022-11-20 11:22:39,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977493535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:39,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:39,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:22:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705542039] [2022-11-20 11:22:39,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:39,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:22:39,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:22:39,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:22:39,709 INFO L87 Difference]: Start difference. First operand 2356 states and 8304 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:40,035 INFO L93 Difference]: Finished difference Result 1907 states and 6511 transitions. [2022-11-20 11:22:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:22:40,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 11:22:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:40,044 INFO L225 Difference]: With dead ends: 1907 [2022-11-20 11:22:40,044 INFO L226 Difference]: Without dead ends: 1907 [2022-11-20 11:22:40,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:22:40,045 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:40,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 1 Unchecked, 0.3s Time] [2022-11-20 11:22:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2022-11-20 11:22:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1907. [2022-11-20 11:22:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1536 states have (on average 4.238932291666667) internal successors, (6511), 1906 states have internal predecessors, (6511), 0 states have call successors, (0), 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-20 11:22:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 6511 transitions. [2022-11-20 11:22:40,100 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 6511 transitions. Word has length 19 [2022-11-20 11:22:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:40,101 INFO L495 AbstractCegarLoop]: Abstraction has 1907 states and 6511 transitions. [2022-11-20 11:22:40,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 6511 transitions. [2022-11-20 11:22:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:22:40,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:40,102 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1] [2022-11-20 11:22:40,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:40,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:40,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash -290038726, now seen corresponding path program 1 times [2022-11-20 11:22:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:40,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161845843] [2022-11-20 11:22:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:40,318 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-20 11:22:40,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:40,320 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:40,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:40,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 11:22:40,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:40,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:40,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:40,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:40,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:40,867 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-20 11:22:40,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 29 [2022-11-20 11:22:40,892 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 11:22:40,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-20 11:22:41,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:41,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:22:41,154 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:22:41,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:22:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:41,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:41,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:41,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161845843] [2022-11-20 11:22:41,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161845843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:41,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:41,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:22:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072648823] [2022-11-20 11:22:41,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:41,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:22:41,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:22:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:41,352 INFO L87 Difference]: Start difference. First operand 1907 states and 6511 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:41,763 INFO L93 Difference]: Finished difference Result 1906 states and 6510 transitions. [2022-11-20 11:22:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:22:41,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 11:22:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:41,770 INFO L225 Difference]: With dead ends: 1906 [2022-11-20 11:22:41,771 INFO L226 Difference]: Without dead ends: 1906 [2022-11-20 11:22:41,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:22:41,772 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:41,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 95 Unchecked, 0.3s Time] [2022-11-20 11:22:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2022-11-20 11:22:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1906. [2022-11-20 11:22:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1536 states have (on average 4.23828125) internal successors, (6510), 1905 states have internal predecessors, (6510), 0 states have call successors, (0), 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-20 11:22:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 6510 transitions. [2022-11-20 11:22:41,829 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 6510 transitions. Word has length 19 [2022-11-20 11:22:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:41,830 INFO L495 AbstractCegarLoop]: Abstraction has 1906 states and 6510 transitions. [2022-11-20 11:22:41,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 6510 transitions. [2022-11-20 11:22:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:22:41,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:41,831 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:41,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-20 11:22:42,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:42,059 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:42,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash 445690842, now seen corresponding path program 1 times [2022-11-20 11:22:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:42,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799923753] [2022-11-20 11:22:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:42,060 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-20 11:22:42,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:42,061 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:42,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:42,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:22:42,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:42,622 INFO L321 Elim1Store]: treesize reduction 79, result has 27.5 percent of original size [2022-11-20 11:22:42,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 48 [2022-11-20 11:22:43,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:43,098 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-11-20 11:22:43,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 36 [2022-11-20 11:22:43,478 INFO L321 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2022-11-20 11:22:43,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 32 [2022-11-20 11:22:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:43,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:43,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:43,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799923753] [2022-11-20 11:22:43,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799923753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:43,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:43,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:22:43,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477175256] [2022-11-20 11:22:43,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:43,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:22:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:43,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:22:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:22:43,764 INFO L87 Difference]: Start difference. First operand 1906 states and 6510 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:43,982 INFO L93 Difference]: Finished difference Result 1905 states and 6508 transitions. [2022-11-20 11:22:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:22:43,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 11:22:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:43,989 INFO L225 Difference]: With dead ends: 1905 [2022-11-20 11:22:43,989 INFO L226 Difference]: Without dead ends: 1905 [2022-11-20 11:22:43,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:22:43,990 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:43,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2022-11-20 11:22:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2022-11-20 11:22:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1905. [2022-11-20 11:22:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1535 states have (on average 4.239739413680781) internal successors, (6508), 1904 states have internal predecessors, (6508), 0 states have call successors, (0), 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-20 11:22:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 6508 transitions. [2022-11-20 11:22:44,048 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 6508 transitions. Word has length 21 [2022-11-20 11:22:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:44,049 INFO L495 AbstractCegarLoop]: Abstraction has 1905 states and 6508 transitions. [2022-11-20 11:22:44,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 6508 transitions. [2022-11-20 11:22:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:22:44,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:44,050 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:44,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:44,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:44,265 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash 445690843, now seen corresponding path program 1 times [2022-11-20 11:22:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904100255] [2022-11-20 11:22:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:44,266 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-20 11:22:44,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:44,267 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:44,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:44,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:22:44,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:44,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:44,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:44,806 INFO L321 Elim1Store]: treesize reduction 49, result has 33.8 percent of original size [2022-11-20 11:22:44,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 35 [2022-11-20 11:22:44,835 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 39 treesize of output 37 [2022-11-20 11:22:44,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:44,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:22:45,093 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:22:45,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:22:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:45,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:45,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:45,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904100255] [2022-11-20 11:22:45,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904100255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:45,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:45,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:22:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840444076] [2022-11-20 11:22:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:45,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:22:45,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:45,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:22:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:45,312 INFO L87 Difference]: Start difference. First operand 1905 states and 6508 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:45,665 INFO L93 Difference]: Finished difference Result 1904 states and 6506 transitions. [2022-11-20 11:22:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:22:45,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 11:22:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:45,672 INFO L225 Difference]: With dead ends: 1904 [2022-11-20 11:22:45,673 INFO L226 Difference]: Without dead ends: 1904 [2022-11-20 11:22:45,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:22:45,674 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:45,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2022-11-20 11:22:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2022-11-20 11:22:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1904. [2022-11-20 11:22:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1534 states have (on average 4.241199478487614) internal successors, (6506), 1903 states have internal predecessors, (6506), 0 states have call successors, (0), 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-20 11:22:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6506 transitions. [2022-11-20 11:22:45,742 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6506 transitions. Word has length 21 [2022-11-20 11:22:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:45,742 INFO L495 AbstractCegarLoop]: Abstraction has 1904 states and 6506 transitions. [2022-11-20 11:22:45,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6506 transitions. [2022-11-20 11:22:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:22:45,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:45,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:45,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:45,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:45,963 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:45,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash 931518394, now seen corresponding path program 1 times [2022-11-20 11:22:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:45,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792100641] [2022-11-20 11:22:45,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:45,964 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-20 11:22:45,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:45,966 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:45,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:46,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:22:46,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:46,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 11:22:46,435 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:22:46,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:22:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:46,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:46,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:46,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792100641] [2022-11-20 11:22:46,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792100641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:46,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:46,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:22:46,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190611001] [2022-11-20 11:22:46,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:46,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:22:46,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:22:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:22:46,469 INFO L87 Difference]: Start difference. First operand 1904 states and 6506 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:46,756 INFO L93 Difference]: Finished difference Result 1497 states and 5079 transitions. [2022-11-20 11:22:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:22:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:22:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:46,760 INFO L225 Difference]: With dead ends: 1497 [2022-11-20 11:22:46,760 INFO L226 Difference]: Without dead ends: 1497 [2022-11-20 11:22:46,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:46,761 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:46,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:22:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2022-11-20 11:22:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2022-11-20 11:22:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1247 states have (on average 4.072975140336808) internal successors, (5079), 1496 states have internal predecessors, (5079), 0 states have call successors, (0), 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-20 11:22:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 5079 transitions. [2022-11-20 11:22:46,822 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 5079 transitions. Word has length 22 [2022-11-20 11:22:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:46,823 INFO L495 AbstractCegarLoop]: Abstraction has 1497 states and 5079 transitions. [2022-11-20 11:22:46,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 5079 transitions. [2022-11-20 11:22:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:22:46,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:46,825 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:46,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:47,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:47,040 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 931518395, now seen corresponding path program 1 times [2022-11-20 11:22:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:47,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96312289] [2022-11-20 11:22:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:47,041 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-20 11:22:47,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:47,042 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:47,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:47,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:22:47,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:47,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 11:22:47,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:22:47,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:47,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:22:47,542 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:22:47,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:22:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:47,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:47,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:47,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96312289] [2022-11-20 11:22:47,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96312289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:47,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:47,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:22:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112319294] [2022-11-20 11:22:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:22:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:22:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:47,617 INFO L87 Difference]: Start difference. First operand 1497 states and 5079 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:48,220 INFO L93 Difference]: Finished difference Result 2618 states and 8880 transitions. [2022-11-20 11:22:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:22:48,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:22:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:48,233 INFO L225 Difference]: With dead ends: 2618 [2022-11-20 11:22:48,234 INFO L226 Difference]: Without dead ends: 2618 [2022-11-20 11:22:48,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:22:48,236 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:48,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:22:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-20 11:22:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1676. [2022-11-20 11:22:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1426 states have (on average 4.38078541374474) internal successors, (6247), 1675 states have internal predecessors, (6247), 0 states have call successors, (0), 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-20 11:22:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 6247 transitions. [2022-11-20 11:22:48,312 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 6247 transitions. Word has length 22 [2022-11-20 11:22:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:48,313 INFO L495 AbstractCegarLoop]: Abstraction has 1676 states and 6247 transitions. [2022-11-20 11:22:48,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 6247 transitions. [2022-11-20 11:22:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:22:48,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:48,314 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:48,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:48,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:48,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:48,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash 931518478, now seen corresponding path program 1 times [2022-11-20 11:22:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:48,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92989508] [2022-11-20 11:22:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:48,532 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-20 11:22:48,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:48,533 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:48,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:48,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:22:48,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:48,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:49,041 INFO L321 Elim1Store]: treesize reduction 79, result has 27.5 percent of original size [2022-11-20 11:22:49,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 48 [2022-11-20 11:22:49,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:49,451 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-11-20 11:22:49,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 36 [2022-11-20 11:22:49,782 INFO L321 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2022-11-20 11:22:49,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 32 [2022-11-20 11:22:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:50,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:50,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:50,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92989508] [2022-11-20 11:22:50,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92989508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:50,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:50,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:22:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188785511] [2022-11-20 11:22:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:50,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:22:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:22:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:22:50,108 INFO L87 Difference]: Start difference. First operand 1676 states and 6247 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:50,299 INFO L93 Difference]: Finished difference Result 1675 states and 6242 transitions. [2022-11-20 11:22:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:22:50,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:22:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:50,306 INFO L225 Difference]: With dead ends: 1675 [2022-11-20 11:22:50,306 INFO L226 Difference]: Without dead ends: 1675 [2022-11-20 11:22:50,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:22:50,307 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:50,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2022-11-20 11:22:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-11-20 11:22:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2022-11-20 11:22:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1425 states have (on average 4.380350877192982) internal successors, (6242), 1674 states have internal predecessors, (6242), 0 states have call successors, (0), 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-20 11:22:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 6242 transitions. [2022-11-20 11:22:50,352 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 6242 transitions. Word has length 22 [2022-11-20 11:22:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:50,353 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 6242 transitions. [2022-11-20 11:22:50,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 6242 transitions. [2022-11-20 11:22:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:22:50,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:50,354 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:50,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:50,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:50,569 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash 931518479, now seen corresponding path program 1 times [2022-11-20 11:22:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:50,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735856347] [2022-11-20 11:22:50,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:50,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:22:50,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:50,571 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:50,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:50,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:22:50,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:51,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:51,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:51,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:51,078 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:22:51,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:22:51,091 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-20 11:22:51,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:51,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:22:51,353 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:22:51,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:22:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:51,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:51,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735856347] [2022-11-20 11:22:51,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735856347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:51,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:51,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:22:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446873833] [2022-11-20 11:22:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:51,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:22:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:22:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:51,591 INFO L87 Difference]: Start difference. First operand 1675 states and 6242 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:51,937 INFO L93 Difference]: Finished difference Result 1674 states and 6237 transitions. [2022-11-20 11:22:51,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:22:51,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:22:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:51,943 INFO L225 Difference]: With dead ends: 1674 [2022-11-20 11:22:51,943 INFO L226 Difference]: Without dead ends: 1674 [2022-11-20 11:22:51,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:22:51,944 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:51,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2022-11-20 11:22:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2022-11-20 11:22:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2022-11-20 11:22:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1424 states have (on average 4.379915730337078) internal successors, (6237), 1673 states have internal predecessors, (6237), 0 states have call successors, (0), 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-20 11:22:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 6237 transitions. [2022-11-20 11:22:51,988 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 6237 transitions. Word has length 22 [2022-11-20 11:22:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:51,988 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 6237 transitions. [2022-11-20 11:22:51,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 6237 transitions. [2022-11-20 11:22:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:22:51,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:51,989 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:52,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-20 11:22:52,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:52,204 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash 931518320, now seen corresponding path program 1 times [2022-11-20 11:22:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:52,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643716721] [2022-11-20 11:22:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:52,205 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-20 11:22:52,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:52,209 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:52,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:52,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:22:52,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:52,777 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:22:52,777 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:22:52,820 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 11:22:52,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 11:22:52,850 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:22:52,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:22:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:52,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:52,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:52,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643716721] [2022-11-20 11:22:52,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643716721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:52,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:52,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:22:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154005815] [2022-11-20 11:22:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:52,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:22:52,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:52,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:22:52,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:22:52,876 INFO L87 Difference]: Start difference. First operand 1674 states and 6237 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:53,145 INFO L93 Difference]: Finished difference Result 1316 states and 4756 transitions. [2022-11-20 11:22:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:22:53,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:22:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:53,149 INFO L225 Difference]: With dead ends: 1316 [2022-11-20 11:22:53,149 INFO L226 Difference]: Without dead ends: 1316 [2022-11-20 11:22:53,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:53,150 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:53,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:22:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-11-20 11:22:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2022-11-20 11:22:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1150 states have (on average 4.135652173913043) internal successors, (4756), 1315 states have internal predecessors, (4756), 0 states have call successors, (0), 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-20 11:22:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 4756 transitions. [2022-11-20 11:22:53,185 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 4756 transitions. Word has length 22 [2022-11-20 11:22:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:53,185 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 4756 transitions. [2022-11-20 11:22:53,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 4756 transitions. [2022-11-20 11:22:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:22:53,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:53,187 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:53,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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)] Ended with exit code 0 [2022-11-20 11:22:53,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:53,407 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash 931518321, now seen corresponding path program 1 times [2022-11-20 11:22:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:53,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103346423] [2022-11-20 11:22:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:53,408 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-20 11:22:53,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:53,409 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:53,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:53,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:22:53,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:54,058 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:22:54,058 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:22:54,181 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:22:54,181 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:22:54,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:54,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:22:54,304 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:22:54,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:22:54,360 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:22:54,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:22:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:54,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:54,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:54,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103346423] [2022-11-20 11:22:54,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103346423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:54,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:54,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:22:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630161154] [2022-11-20 11:22:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:54,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:22:54,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:22:54,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:54,434 INFO L87 Difference]: Start difference. First operand 1316 states and 4756 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:55,001 INFO L93 Difference]: Finished difference Result 1826 states and 6104 transitions. [2022-11-20 11:22:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:22:55,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 11:22:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:55,007 INFO L225 Difference]: With dead ends: 1826 [2022-11-20 11:22:55,008 INFO L226 Difference]: Without dead ends: 1826 [2022-11-20 11:22:55,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:22:55,009 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:55,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:22:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2022-11-20 11:22:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1316. [2022-11-20 11:22:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1150 states have (on average 4.0) internal successors, (4600), 1315 states have internal predecessors, (4600), 0 states have call successors, (0), 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-20 11:22:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 4600 transitions. [2022-11-20 11:22:55,057 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 4600 transitions. Word has length 22 [2022-11-20 11:22:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:55,058 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 4600 transitions. [2022-11-20 11:22:55,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 4600 transitions. [2022-11-20 11:22:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:22:55,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:55,059 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:55,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:55,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:55,274 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:55,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1187699415, now seen corresponding path program 1 times [2022-11-20 11:22:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:55,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880917000] [2022-11-20 11:22:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:55,276 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-20 11:22:55,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:55,277 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:55,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:55,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:22:55,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:55,792 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2022-11-20 11:22:55,792 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 4 case distinctions, treesize of input 29 treesize of output 52 [2022-11-20 11:22:55,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:55,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-20 11:22:56,025 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:22:56,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:22:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:56,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:56,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:56,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880917000] [2022-11-20 11:22:56,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880917000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:56,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:56,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:22:56,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652399692] [2022-11-20 11:22:56,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:56,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:22:56,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:56,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:22:56,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:22:56,275 INFO L87 Difference]: Start difference. First operand 1316 states and 4600 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:56,550 INFO L93 Difference]: Finished difference Result 1317 states and 4603 transitions. [2022-11-20 11:22:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:22:56,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:22:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:56,554 INFO L225 Difference]: With dead ends: 1317 [2022-11-20 11:22:56,554 INFO L226 Difference]: Without dead ends: 1317 [2022-11-20 11:22:56,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:22:56,555 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:56,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 118 Unchecked, 0.3s Time] [2022-11-20 11:22:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-11-20 11:22:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2022-11-20 11:22:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1151 states have (on average 3.999131190269331) internal successors, (4603), 1316 states have internal predecessors, (4603), 0 states have call successors, (0), 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-20 11:22:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 4603 transitions. [2022-11-20 11:22:56,598 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 4603 transitions. Word has length 23 [2022-11-20 11:22:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:56,599 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 4603 transitions. [2022-11-20 11:22:56,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 4603 transitions. [2022-11-20 11:22:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:22:56,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:56,600 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:56,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:56,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:56,815 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:56,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:56,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1187699414, now seen corresponding path program 1 times [2022-11-20 11:22:56,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:56,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66678879] [2022-11-20 11:22:56,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:56,816 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-20 11:22:56,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:56,817 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:56,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:57,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:22:57,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:57,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:57,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:57,371 INFO L321 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-11-20 11:22:57,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 36 [2022-11-20 11:22:57,383 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-20 11:22:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:57,565 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-20 11:22:57,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2022-11-20 11:22:57,904 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:22:57,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:22:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:22:58,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:22:58,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:22:58,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66678879] [2022-11-20 11:22:58,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66678879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:22:58,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:22:58,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:22:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057328263] [2022-11-20 11:22:58,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:22:58,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:22:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:22:58,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:22:58,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:58,421 INFO L87 Difference]: Start difference. First operand 1317 states and 4603 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:22:58,696 INFO L93 Difference]: Finished difference Result 1317 states and 4602 transitions. [2022-11-20 11:22:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:22:58,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:22:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:22:58,700 INFO L225 Difference]: With dead ends: 1317 [2022-11-20 11:22:58,700 INFO L226 Difference]: Without dead ends: 1317 [2022-11-20 11:22:58,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:22:58,701 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:22:58,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2022-11-20 11:22:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-11-20 11:22:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2022-11-20 11:22:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1151 states have (on average 3.998262380538662) internal successors, (4602), 1316 states have internal predecessors, (4602), 0 states have call successors, (0), 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-20 11:22:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 4602 transitions. [2022-11-20 11:22:58,726 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 4602 transitions. Word has length 23 [2022-11-20 11:22:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:22:58,727 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 4602 transitions. [2022-11-20 11:22:58,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:22:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 4602 transitions. [2022-11-20 11:22:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:22:58,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:22:58,727 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:22:58,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:58,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:58,930 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:22:58,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:22:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1187697586, now seen corresponding path program 1 times [2022-11-20 11:22:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:22:58,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282984145] [2022-11-20 11:22:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:22:58,931 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-20 11:22:58,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:22:58,932 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:58,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:22:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:22:59,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:22:59,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:22:59,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:59,446 INFO L321 Elim1Store]: treesize reduction 79, result has 27.5 percent of original size [2022-11-20 11:22:59,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 48 [2022-11-20 11:22:59,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:22:59,844 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-11-20 11:22:59,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 36 [2022-11-20 11:23:00,135 INFO L321 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2022-11-20 11:23:00,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 32 [2022-11-20 11:23:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:00,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:00,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282984145] [2022-11-20 11:23:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282984145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:00,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:00,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530021169] [2022-11-20 11:23:00,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:00,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:00,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:00,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:00,493 INFO L87 Difference]: Start difference. First operand 1317 states and 4602 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:00,705 INFO L93 Difference]: Finished difference Result 1318 states and 4604 transitions. [2022-11-20 11:23:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:23:00,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:23:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:00,711 INFO L225 Difference]: With dead ends: 1318 [2022-11-20 11:23:00,711 INFO L226 Difference]: Without dead ends: 1318 [2022-11-20 11:23:00,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:00,712 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:00,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2022-11-20 11:23:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-11-20 11:23:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2022-11-20 11:23:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1152 states have (on average 3.9965277777777777) internal successors, (4604), 1317 states have internal predecessors, (4604), 0 states have call successors, (0), 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-20 11:23:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 4604 transitions. [2022-11-20 11:23:00,743 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 4604 transitions. Word has length 23 [2022-11-20 11:23:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:00,744 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 4604 transitions. [2022-11-20 11:23:00,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 4604 transitions. [2022-11-20 11:23:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:23:00,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:00,745 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:00,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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)] Ended with exit code 0 [2022-11-20 11:23:00,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:00,960 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1187697585, now seen corresponding path program 1 times [2022-11-20 11:23:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:00,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761935283] [2022-11-20 11:23:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:00,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:23:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:00,964 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:00,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:01,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:23:01,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:01,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:01,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:01,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:01,661 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:23:01,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:23:01,676 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-20 11:23:01,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:01,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:01,918 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:01,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:02,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:02,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:02,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761935283] [2022-11-20 11:23:02,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761935283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:02,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:02,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:02,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895233788] [2022-11-20 11:23:02,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:02,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:02,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:02,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:02,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:02,193 INFO L87 Difference]: Start difference. First operand 1318 states and 4604 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:02,406 INFO L93 Difference]: Finished difference Result 1318 states and 4603 transitions. [2022-11-20 11:23:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:23:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:23:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:02,410 INFO L225 Difference]: With dead ends: 1318 [2022-11-20 11:23:02,410 INFO L226 Difference]: Without dead ends: 1318 [2022-11-20 11:23:02,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:02,411 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:02,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2022-11-20 11:23:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-11-20 11:23:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2022-11-20 11:23:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1152 states have (on average 3.9956597222222223) internal successors, (4603), 1317 states have internal predecessors, (4603), 0 states have call successors, (0), 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-20 11:23:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 4603 transitions. [2022-11-20 11:23:02,438 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 4603 transitions. Word has length 23 [2022-11-20 11:23:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:02,438 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 4603 transitions. [2022-11-20 11:23:02,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 4603 transitions. [2022-11-20 11:23:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:23:02,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:02,438 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:02,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:02,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:02,639 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1187794355, now seen corresponding path program 1 times [2022-11-20 11:23:02,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:02,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391828239] [2022-11-20 11:23:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:02,640 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-20 11:23:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:02,642 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:02,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:03,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:03,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:03,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:03,183 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:03,183 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 15 treesize of output 38 [2022-11-20 11:23:03,202 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 300 treesize of output 292 [2022-11-20 11:23:03,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:03,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:03,419 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:03,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:03,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:03,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391828239] [2022-11-20 11:23:03,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391828239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:03,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:03,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898168139] [2022-11-20 11:23:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:03,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:03,677 INFO L87 Difference]: Start difference. First operand 1318 states and 4603 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:03,943 INFO L93 Difference]: Finished difference Result 1317 states and 4600 transitions. [2022-11-20 11:23:03,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:03,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:23:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:03,947 INFO L225 Difference]: With dead ends: 1317 [2022-11-20 11:23:03,947 INFO L226 Difference]: Without dead ends: 1317 [2022-11-20 11:23:03,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:03,948 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:03,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2022-11-20 11:23:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-11-20 11:23:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2022-11-20 11:23:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1151 states have (on average 3.9965247610773242) internal successors, (4600), 1316 states have internal predecessors, (4600), 0 states have call successors, (0), 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-20 11:23:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 4600 transitions. [2022-11-20 11:23:03,967 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 4600 transitions. Word has length 23 [2022-11-20 11:23:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:03,968 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 4600 transitions. [2022-11-20 11:23:03,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 4600 transitions. [2022-11-20 11:23:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:23:03,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:03,969 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:03,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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)] Ended with exit code 0 [2022-11-20 11:23:04,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:04,174 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1187794353, now seen corresponding path program 1 times [2022-11-20 11:23:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:04,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787588439] [2022-11-20 11:23:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:04,175 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-20 11:23:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:04,176 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:04,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:04,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:23:04,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:04,672 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-20 11:23:04,673 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 33 treesize of output 44 [2022-11-20 11:23:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:04,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:04,835 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:23:04,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:04,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:04,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:04,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787588439] [2022-11-20 11:23:04,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787588439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:04,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:04,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:04,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389933748] [2022-11-20 11:23:04,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:04,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:04,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:04,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:04,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:04,948 INFO L87 Difference]: Start difference. First operand 1317 states and 4600 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:05,217 INFO L93 Difference]: Finished difference Result 1316 states and 4597 transitions. [2022-11-20 11:23:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 11:23:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:05,223 INFO L225 Difference]: With dead ends: 1316 [2022-11-20 11:23:05,223 INFO L226 Difference]: Without dead ends: 1316 [2022-11-20 11:23:05,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:05,224 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:05,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-11-20 11:23:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-11-20 11:23:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2022-11-20 11:23:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1150 states have (on average 3.997391304347826) internal successors, (4597), 1315 states have internal predecessors, (4597), 0 states have call successors, (0), 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-20 11:23:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 4597 transitions. [2022-11-20 11:23:05,255 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 4597 transitions. Word has length 23 [2022-11-20 11:23:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:05,255 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 4597 transitions. [2022-11-20 11:23:05,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 4597 transitions. [2022-11-20 11:23:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:05,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:05,256 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:05,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:05,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:05,471 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:05,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1836029096, now seen corresponding path program 1 times [2022-11-20 11:23:05,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:05,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971084591] [2022-11-20 11:23:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:05,472 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-20 11:23:05,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:05,473 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:05,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:05,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:23:05,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:05,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:06,008 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:23:06,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:06,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:06,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:06,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971084591] [2022-11-20 11:23:06,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971084591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:23:06,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:06,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-11-20 11:23:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462215394] [2022-11-20 11:23:06,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:06,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:23:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:23:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:23:06,580 INFO L87 Difference]: Start difference. First operand 1316 states and 4597 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:08,185 INFO L93 Difference]: Finished difference Result 4298 states and 14402 transitions. [2022-11-20 11:23:08,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:23:08,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:08,198 INFO L225 Difference]: With dead ends: 4298 [2022-11-20 11:23:08,198 INFO L226 Difference]: Without dead ends: 4298 [2022-11-20 11:23:08,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:23:08,199 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 407 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:08,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 0 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 11:23:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2022-11-20 11:23:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 2261. [2022-11-20 11:23:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2095 states have (on average 4.23054892601432) internal successors, (8863), 2260 states have internal predecessors, (8863), 0 states have call successors, (0), 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-20 11:23:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 8863 transitions. [2022-11-20 11:23:08,281 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 8863 transitions. Word has length 24 [2022-11-20 11:23:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:08,281 INFO L495 AbstractCegarLoop]: Abstraction has 2261 states and 8863 transitions. [2022-11-20 11:23:08,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 8863 transitions. [2022-11-20 11:23:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:08,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:08,282 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:08,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:08,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:08,493 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:08,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1836029179, now seen corresponding path program 1 times [2022-11-20 11:23:08,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:08,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824088646] [2022-11-20 11:23:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:08,494 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-20 11:23:08,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:08,495 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:08,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:08,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:23:08,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:09,030 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2022-11-20 11:23:09,030 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 4 case distinctions, treesize of input 29 treesize of output 52 [2022-11-20 11:23:09,095 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:23:09,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:23:09,174 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:23:09,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2022-11-20 11:23:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:09,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:09,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:09,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824088646] [2022-11-20 11:23:09,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824088646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:09,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:09,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:23:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752177143] [2022-11-20 11:23:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:09,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:23:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:09,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:23:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:09,477 INFO L87 Difference]: Start difference. First operand 2261 states and 8863 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:09,947 INFO L93 Difference]: Finished difference Result 2303 states and 8957 transitions. [2022-11-20 11:23:09,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:23:09,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:09,957 INFO L225 Difference]: With dead ends: 2303 [2022-11-20 11:23:09,957 INFO L226 Difference]: Without dead ends: 2303 [2022-11-20 11:23:09,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:09,958 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:09,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 65 Unchecked, 0.5s Time] [2022-11-20 11:23:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2022-11-20 11:23:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2260. [2022-11-20 11:23:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2094 states have (on average 4.228271251193887) internal successors, (8854), 2259 states have internal predecessors, (8854), 0 states have call successors, (0), 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-20 11:23:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 8854 transitions. [2022-11-20 11:23:10,017 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 8854 transitions. Word has length 24 [2022-11-20 11:23:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:10,018 INFO L495 AbstractCegarLoop]: Abstraction has 2260 states and 8854 transitions. [2022-11-20 11:23:10,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 8854 transitions. [2022-11-20 11:23:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:10,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:10,019 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:10,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:10,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:10,234 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1836029180, now seen corresponding path program 1 times [2022-11-20 11:23:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372824230] [2022-11-20 11:23:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:10,236 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-20 11:23:10,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:10,237 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:10,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:10,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 11:23:10,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:10,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:10,948 INFO L321 Elim1Store]: treesize reduction 59, result has 36.6 percent of original size [2022-11-20 11:23:10,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 39 [2022-11-20 11:23:10,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-20 11:23:11,114 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:23:11,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-20 11:23:11,289 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:23:11,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 38 [2022-11-20 11:23:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:11,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:11,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:11,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372824230] [2022-11-20 11:23:11,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372824230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:11,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:11,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647888558] [2022-11-20 11:23:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:11,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:11,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:11,697 INFO L87 Difference]: Start difference. First operand 2260 states and 8854 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:12,027 INFO L93 Difference]: Finished difference Result 2208 states and 8702 transitions. [2022-11-20 11:23:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:23:12,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:12,036 INFO L225 Difference]: With dead ends: 2208 [2022-11-20 11:23:12,036 INFO L226 Difference]: Without dead ends: 2208 [2022-11-20 11:23:12,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:12,037 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:12,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 2 Unchecked, 0.3s Time] [2022-11-20 11:23:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2022-11-20 11:23:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2208. [2022-11-20 11:23:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2061 states have (on average 4.222222222222222) internal successors, (8702), 2207 states have internal predecessors, (8702), 0 states have call successors, (0), 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-20 11:23:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 8702 transitions. [2022-11-20 11:23:12,082 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 8702 transitions. Word has length 24 [2022-11-20 11:23:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:12,082 INFO L495 AbstractCegarLoop]: Abstraction has 2208 states and 8702 transitions. [2022-11-20 11:23:12,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 8702 transitions. [2022-11-20 11:23:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:12,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:12,083 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:12,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:12,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:12,299 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1836029022, now seen corresponding path program 1 times [2022-11-20 11:23:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:12,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787034994] [2022-11-20 11:23:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:12,300 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-20 11:23:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:12,301 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:12,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:12,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:23:12,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:12,963 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:23:12,963 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:23:13,088 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:23:13,088 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:23:13,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:13,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:13,181 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:23:13,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:23:13,230 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:23:13,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:13,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:23:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:17,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:17,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787034994] [2022-11-20 11:23:17,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787034994] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:23:17,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:23:17,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2022-11-20 11:23:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573982677] [2022-11-20 11:23:17,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:23:17,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:23:17,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:23:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:23:17,274 INFO L87 Difference]: Start difference. First operand 2208 states and 8702 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 11:23:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:18,686 INFO L93 Difference]: Finished difference Result 3442 states and 11522 transitions. [2022-11-20 11:23:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:23:18,686 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:18,699 INFO L225 Difference]: With dead ends: 3442 [2022-11-20 11:23:18,699 INFO L226 Difference]: Without dead ends: 3442 [2022-11-20 11:23:18,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:23:18,700 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 340 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:18,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 0 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 305 Invalid, 0 Unknown, 93 Unchecked, 1.3s Time] [2022-11-20 11:23:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2022-11-20 11:23:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 2208. [2022-11-20 11:23:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2061 states have (on average 3.994177583697234) internal successors, (8232), 2207 states have internal predecessors, (8232), 0 states have call successors, (0), 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-20 11:23:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 8232 transitions. [2022-11-20 11:23:18,764 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 8232 transitions. Word has length 24 [2022-11-20 11:23:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:18,764 INFO L495 AbstractCegarLoop]: Abstraction has 2208 states and 8232 transitions. [2022-11-20 11:23:18,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 11:23:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 8232 transitions. [2022-11-20 11:23:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:18,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:18,765 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:18,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:18,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:18,981 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1836095873, now seen corresponding path program 1 times [2022-11-20 11:23:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:18,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637171498] [2022-11-20 11:23:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:18,982 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-20 11:23:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:18,983 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:18,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:19,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:19,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:19,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:19,602 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:19,602 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 15 treesize of output 38 [2022-11-20 11:23:19,622 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-20 11:23:19,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:19,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:19,838 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:19,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:20,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:20,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:20,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637171498] [2022-11-20 11:23:20,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637171498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:20,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:20,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:20,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099739346] [2022-11-20 11:23:20,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:20,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:20,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:20,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:20,078 INFO L87 Difference]: Start difference. First operand 2208 states and 8232 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:20,350 INFO L93 Difference]: Finished difference Result 2207 states and 8228 transitions. [2022-11-20 11:23:20,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:20,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:20,357 INFO L225 Difference]: With dead ends: 2207 [2022-11-20 11:23:20,357 INFO L226 Difference]: Without dead ends: 2207 [2022-11-20 11:23:20,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:20,358 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:20,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-11-20 11:23:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-11-20 11:23:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2022-11-20 11:23:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 2060 states have (on average 3.9941747572815536) internal successors, (8228), 2206 states have internal predecessors, (8228), 0 states have call successors, (0), 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-20 11:23:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 8228 transitions. [2022-11-20 11:23:20,434 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 8228 transitions. Word has length 24 [2022-11-20 11:23:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:20,435 INFO L495 AbstractCegarLoop]: Abstraction has 2207 states and 8228 transitions. [2022-11-20 11:23:20,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 8228 transitions. [2022-11-20 11:23:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:20,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:20,436 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:20,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:20,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:20,651 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1836095875, now seen corresponding path program 1 times [2022-11-20 11:23:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:20,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495588939] [2022-11-20 11:23:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:20,652 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-20 11:23:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:20,653 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:20,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:21,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:23:21,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:21,240 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-20 11:23:21,240 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 33 treesize of output 44 [2022-11-20 11:23:21,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:21,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:21,402 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:23:21,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:21,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:21,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:21,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495588939] [2022-11-20 11:23:21,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495588939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:21,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:21,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777507687] [2022-11-20 11:23:21,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:21,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:21,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:21,503 INFO L87 Difference]: Start difference. First operand 2207 states and 8228 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:21,749 INFO L93 Difference]: Finished difference Result 2206 states and 8224 transitions. [2022-11-20 11:23:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:21,755 INFO L225 Difference]: With dead ends: 2206 [2022-11-20 11:23:21,755 INFO L226 Difference]: Without dead ends: 2206 [2022-11-20 11:23:21,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:21,755 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:21,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2022-11-20 11:23:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2022-11-20 11:23:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2206. [2022-11-20 11:23:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2059 states have (on average 3.994171928120447) internal successors, (8224), 2205 states have internal predecessors, (8224), 0 states have call successors, (0), 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-20 11:23:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 8224 transitions. [2022-11-20 11:23:21,793 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 8224 transitions. Word has length 24 [2022-11-20 11:23:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:21,794 INFO L495 AbstractCegarLoop]: Abstraction has 2206 states and 8224 transitions. [2022-11-20 11:23:21,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 8224 transitions. [2022-11-20 11:23:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:21,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:21,795 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:21,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:21,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:21,995 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1833084564, now seen corresponding path program 1 times [2022-11-20 11:23:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:21,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178962728] [2022-11-20 11:23:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:21,997 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-20 11:23:21,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:21,998 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:22,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:22,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:22,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:22,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:22,735 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:22,735 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 15 treesize of output 38 [2022-11-20 11:23:22,753 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 130 treesize of output 126 [2022-11-20 11:23:22,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:22,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:22,983 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:22,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:23,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:23,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:23,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178962728] [2022-11-20 11:23:23,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178962728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:23,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:23,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:23,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663959220] [2022-11-20 11:23:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:23,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:23,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:23,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:23,210 INFO L87 Difference]: Start difference. First operand 2206 states and 8224 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:23,444 INFO L93 Difference]: Finished difference Result 2207 states and 8232 transitions. [2022-11-20 11:23:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:23,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:23,452 INFO L225 Difference]: With dead ends: 2207 [2022-11-20 11:23:23,453 INFO L226 Difference]: Without dead ends: 2207 [2022-11-20 11:23:23,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:23,454 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:23,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-11-20 11:23:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-11-20 11:23:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2022-11-20 11:23:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 2060 states have (on average 3.9961165048543688) internal successors, (8232), 2206 states have internal predecessors, (8232), 0 states have call successors, (0), 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-20 11:23:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 8232 transitions. [2022-11-20 11:23:23,507 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 8232 transitions. Word has length 24 [2022-11-20 11:23:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:23,508 INFO L495 AbstractCegarLoop]: Abstraction has 2207 states and 8232 transitions. [2022-11-20 11:23:23,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 8232 transitions. [2022-11-20 11:23:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:23,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:23,509 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:23,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:23,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:23,723 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:23,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1833084486, now seen corresponding path program 1 times [2022-11-20 11:23:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265933819] [2022-11-20 11:23:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:23,724 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-20 11:23:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:23,725 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:23,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:24,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:23:24,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:24,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 11:23:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:24,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:24,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:24,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265933819] [2022-11-20 11:23:24,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265933819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:24,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:24,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589218684] [2022-11-20 11:23:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:24,167 INFO L87 Difference]: Start difference. First operand 2207 states and 8232 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:24,412 INFO L93 Difference]: Finished difference Result 1647 states and 6083 transitions. [2022-11-20 11:23:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:23:24,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:24,417 INFO L225 Difference]: With dead ends: 1647 [2022-11-20 11:23:24,417 INFO L226 Difference]: Without dead ends: 1647 [2022-11-20 11:23:24,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:24,418 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:24,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:23:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-11-20 11:23:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2022-11-20 11:23:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1557 states have (on average 3.9068721901091843) internal successors, (6083), 1646 states have internal predecessors, (6083), 0 states have call successors, (0), 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-20 11:23:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 6083 transitions. [2022-11-20 11:23:24,444 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 6083 transitions. Word has length 24 [2022-11-20 11:23:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:24,444 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 6083 transitions. [2022-11-20 11:23:24,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 6083 transitions. [2022-11-20 11:23:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:24,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:24,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:24,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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)] Ended with exit code 0 [2022-11-20 11:23:24,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:24,645 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1833084566, now seen corresponding path program 1 times [2022-11-20 11:23:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:24,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727682686] [2022-11-20 11:23:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:24,646 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-20 11:23:24,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:24,647 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:24,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:25,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:23:25,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:25,200 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-20 11:23:25,200 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 33 treesize of output 44 [2022-11-20 11:23:25,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:25,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:25,348 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:23:25,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:25,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:25,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:25,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727682686] [2022-11-20 11:23:25,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727682686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:25,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:25,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425052102] [2022-11-20 11:23:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:25,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:25,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:25,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:25,457 INFO L87 Difference]: Start difference. First operand 1647 states and 6083 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:25,646 INFO L93 Difference]: Finished difference Result 1647 states and 6082 transitions. [2022-11-20 11:23:25,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:25,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:25,650 INFO L225 Difference]: With dead ends: 1647 [2022-11-20 11:23:25,651 INFO L226 Difference]: Without dead ends: 1647 [2022-11-20 11:23:25,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:25,651 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:25,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2022-11-20 11:23:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-11-20 11:23:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2022-11-20 11:23:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1557 states have (on average 3.9062299293513165) internal successors, (6082), 1646 states have internal predecessors, (6082), 0 states have call successors, (0), 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-20 11:23:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 6082 transitions. [2022-11-20 11:23:25,678 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 6082 transitions. Word has length 24 [2022-11-20 11:23:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:25,678 INFO L495 AbstractCegarLoop]: Abstraction has 1647 states and 6082 transitions. [2022-11-20 11:23:25,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 6082 transitions. [2022-11-20 11:23:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:25,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:25,679 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:25,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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)] Ended with exit code 0 [2022-11-20 11:23:25,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:25,882 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1833084487, now seen corresponding path program 1 times [2022-11-20 11:23:25,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:25,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908049782] [2022-11-20 11:23:25,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:25,883 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-20 11:23:25,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:25,884 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:25,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:26,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:23:26,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:26,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:26,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:26,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:26,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908049782] [2022-11-20 11:23:26,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908049782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:26,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:26,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395085556] [2022-11-20 11:23:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:26,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:26,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:26,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:26,373 INFO L87 Difference]: Start difference. First operand 1647 states and 6082 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:26,841 INFO L93 Difference]: Finished difference Result 2714 states and 10076 transitions. [2022-11-20 11:23:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:26,848 INFO L225 Difference]: With dead ends: 2714 [2022-11-20 11:23:26,849 INFO L226 Difference]: Without dead ends: 2714 [2022-11-20 11:23:26,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:26,849 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:26,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:23:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2022-11-20 11:23:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 1906. [2022-11-20 11:23:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1816 states have (on average 4.17511013215859) internal successors, (7582), 1905 states have internal predecessors, (7582), 0 states have call successors, (0), 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-20 11:23:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 7582 transitions. [2022-11-20 11:23:26,905 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 7582 transitions. Word has length 24 [2022-11-20 11:23:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:26,905 INFO L495 AbstractCegarLoop]: Abstraction has 1906 states and 7582 transitions. [2022-11-20 11:23:26,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 7582 transitions. [2022-11-20 11:23:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:23:26,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:26,906 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:26,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:27,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:27,120 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:27,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1833084417, now seen corresponding path program 1 times [2022-11-20 11:23:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:27,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412258898] [2022-11-20 11:23:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:27,121 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-20 11:23:27,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:27,122 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:27,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-20 11:23:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:27,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:27,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:27,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:23:27,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 11:23:27,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:27,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:27,702 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:23:27,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:23:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:27,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:27,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412258898] [2022-11-20 11:23:27,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412258898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:27,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:27,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621420253] [2022-11-20 11:23:27,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:27,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:27,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:27,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:27,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:27,778 INFO L87 Difference]: Start difference. First operand 1906 states and 7582 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:28,249 INFO L93 Difference]: Finished difference Result 2452 states and 9086 transitions. [2022-11-20 11:23:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 11:23:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:28,256 INFO L225 Difference]: With dead ends: 2452 [2022-11-20 11:23:28,256 INFO L226 Difference]: Without dead ends: 2452 [2022-11-20 11:23:28,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:28,257 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:28,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:23:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2022-11-20 11:23:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1906. [2022-11-20 11:23:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1816 states have (on average 4.03193832599119) internal successors, (7322), 1905 states have internal predecessors, (7322), 0 states have call successors, (0), 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-20 11:23:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 7322 transitions. [2022-11-20 11:23:28,296 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 7322 transitions. Word has length 24 [2022-11-20 11:23:28,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:28,297 INFO L495 AbstractCegarLoop]: Abstraction has 1906 states and 7322 transitions. [2022-11-20 11:23:28,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 7322 transitions. [2022-11-20 11:23:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:28,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:28,297 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:28,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-11-20 11:23:28,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:28,498 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1082328540, now seen corresponding path program 2 times [2022-11-20 11:23:28,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:28,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559746439] [2022-11-20 11:23:28,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:23:28,499 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-20 11:23:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:28,499 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:28,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-11-20 11:23:28,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:23:28,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:23:28,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:23:28,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:28,842 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2022-11-20 11:23:28,842 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 4 case distinctions, treesize of input 29 treesize of output 52 [2022-11-20 11:23:28,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:28,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-20 11:23:29,036 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:23:29,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:23:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-20 11:23:29,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:29,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:29,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559746439] [2022-11-20 11:23:29,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559746439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:29,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:29,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889967494] [2022-11-20 11:23:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:29,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:23:29,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:29,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:23:29,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:29,312 INFO L87 Difference]: Start difference. First operand 1906 states and 7322 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:29,514 INFO L93 Difference]: Finished difference Result 1898 states and 7308 transitions. [2022-11-20 11:23:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:29,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:29,520 INFO L225 Difference]: With dead ends: 1898 [2022-11-20 11:23:29,520 INFO L226 Difference]: Without dead ends: 1898 [2022-11-20 11:23:29,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:29,521 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:29,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-11-20 11:23:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-11-20 11:23:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2022-11-20 11:23:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1810 states have (on average 4.037569060773481) internal successors, (7308), 1897 states have internal predecessors, (7308), 0 states have call successors, (0), 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-20 11:23:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7308 transitions. [2022-11-20 11:23:29,569 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7308 transitions. Word has length 25 [2022-11-20 11:23:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:29,570 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 7308 transitions. [2022-11-20 11:23:29,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7308 transitions. [2022-11-20 11:23:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:29,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:29,571 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:29,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:29,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:29,783 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1082330369, now seen corresponding path program 1 times [2022-11-20 11:23:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:29,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208783678] [2022-11-20 11:23:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:29,784 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-20 11:23:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:29,785 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:29,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-20 11:23:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:30,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:23:30,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:30,415 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2022-11-20 11:23:30,415 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 4 case distinctions, treesize of input 29 treesize of output 52 [2022-11-20 11:23:30,737 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2022-11-20 11:23:30,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 68 [2022-11-20 11:23:31,222 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2022-11-20 11:23:31,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 74 [2022-11-20 11:23:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:32,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:32,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:32,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208783678] [2022-11-20 11:23:32,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208783678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:32,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:32,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:23:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834712579] [2022-11-20 11:23:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:32,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:23:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:23:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:32,173 INFO L87 Difference]: Start difference. First operand 1898 states and 7308 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:32,343 INFO L93 Difference]: Finished difference Result 1897 states and 7307 transitions. [2022-11-20 11:23:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:23:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:32,350 INFO L225 Difference]: With dead ends: 1897 [2022-11-20 11:23:32,350 INFO L226 Difference]: Without dead ends: 1897 [2022-11-20 11:23:32,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:23:32,351 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:32,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2022-11-20 11:23:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-11-20 11:23:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1896. [2022-11-20 11:23:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1809 states have (on average 4.03869541182974) internal successors, (7306), 1895 states have internal predecessors, (7306), 0 states have call successors, (0), 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-20 11:23:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 7306 transitions. [2022-11-20 11:23:32,389 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 7306 transitions. Word has length 25 [2022-11-20 11:23:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:32,389 INFO L495 AbstractCegarLoop]: Abstraction has 1896 states and 7306 transitions. [2022-11-20 11:23:32,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 7306 transitions. [2022-11-20 11:23:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:32,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:32,390 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:32,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:32,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:32,591 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:32,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1082199004, now seen corresponding path program 1 times [2022-11-20 11:23:32,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:32,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930504857] [2022-11-20 11:23:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:32,592 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-20 11:23:32,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:32,593 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:32,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-20 11:23:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:33,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:33,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:33,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:33,415 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:33,416 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 15 treesize of output 38 [2022-11-20 11:23:33,442 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-20 11:23:33,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:33,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:33,695 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:33,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:33,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:33,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:33,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930504857] [2022-11-20 11:23:33,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930504857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:33,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:33,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132295674] [2022-11-20 11:23:33,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:33,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:33,965 INFO L87 Difference]: Start difference. First operand 1896 states and 7306 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:34,193 INFO L93 Difference]: Finished difference Result 1895 states and 7303 transitions. [2022-11-20 11:23:34,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:34,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:34,198 INFO L225 Difference]: With dead ends: 1895 [2022-11-20 11:23:34,199 INFO L226 Difference]: Without dead ends: 1895 [2022-11-20 11:23:34,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:34,199 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:34,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2022-11-20 11:23:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2022-11-20 11:23:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1895. [2022-11-20 11:23:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1808 states have (on average 4.039269911504425) internal successors, (7303), 1894 states have internal predecessors, (7303), 0 states have call successors, (0), 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-20 11:23:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 7303 transitions. [2022-11-20 11:23:34,231 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 7303 transitions. Word has length 25 [2022-11-20 11:23:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:34,231 INFO L495 AbstractCegarLoop]: Abstraction has 1895 states and 7303 transitions. [2022-11-20 11:23:34,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 7303 transitions. [2022-11-20 11:23:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:34,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:34,232 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:34,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-11-20 11:23:34,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:34,432 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1082199006, now seen corresponding path program 1 times [2022-11-20 11:23:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:34,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438134715] [2022-11-20 11:23:34,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:34,433 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-20 11:23:34,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:34,434 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:34,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-20 11:23:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:34,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:23:34,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:35,062 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2022-11-20 11:23:35,062 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 3 case distinctions, treesize of input 15 treesize of output 41 [2022-11-20 11:23:35,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:35,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-20 11:23:35,245 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:23:35,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:23:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:35,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:35,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438134715] [2022-11-20 11:23:35,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438134715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:35,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:35,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131846766] [2022-11-20 11:23:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:35,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:23:35,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:35,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:23:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:35,492 INFO L87 Difference]: Start difference. First operand 1895 states and 7303 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:35,709 INFO L93 Difference]: Finished difference Result 1897 states and 7308 transitions. [2022-11-20 11:23:35,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:35,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:35,714 INFO L225 Difference]: With dead ends: 1897 [2022-11-20 11:23:35,714 INFO L226 Difference]: Without dead ends: 1897 [2022-11-20 11:23:35,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:35,715 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:35,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 76 Unchecked, 0.2s Time] [2022-11-20 11:23:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-11-20 11:23:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1897. [2022-11-20 11:23:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1810 states have (on average 4.037569060773481) internal successors, (7308), 1896 states have internal predecessors, (7308), 0 states have call successors, (0), 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-20 11:23:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 7308 transitions. [2022-11-20 11:23:35,746 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 7308 transitions. Word has length 25 [2022-11-20 11:23:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:35,747 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 7308 transitions. [2022-11-20 11:23:35,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 7308 transitions. [2022-11-20 11:23:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:35,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:35,747 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:35,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:35,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:35,948 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1084395666, now seen corresponding path program 2 times [2022-11-20 11:23:35,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:35,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43997634] [2022-11-20 11:23:35,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:23:35,949 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-20 11:23:35,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:35,950 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:35,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-20 11:23:36,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:23:36,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:23:36,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:23:36,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:36,323 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2022-11-20 11:23:36,324 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 3 case distinctions, treesize of input 15 treesize of output 41 [2022-11-20 11:23:36,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:36,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-20 11:23:36,525 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:23:36,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:23:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:36,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:36,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:36,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43997634] [2022-11-20 11:23:36,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43997634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:36,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:36,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140576389] [2022-11-20 11:23:36,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:36,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:23:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:23:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:36,794 INFO L87 Difference]: Start difference. First operand 1897 states and 7308 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:37,024 INFO L93 Difference]: Finished difference Result 1898 states and 7311 transitions. [2022-11-20 11:23:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:37,030 INFO L225 Difference]: With dead ends: 1898 [2022-11-20 11:23:37,030 INFO L226 Difference]: Without dead ends: 1898 [2022-11-20 11:23:37,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:37,031 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:37,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-11-20 11:23:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-11-20 11:23:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1897. [2022-11-20 11:23:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1810 states have (on average 4.037569060773481) internal successors, (7308), 1896 states have internal predecessors, (7308), 0 states have call successors, (0), 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-20 11:23:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 7308 transitions. [2022-11-20 11:23:37,087 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 7308 transitions. Word has length 25 [2022-11-20 11:23:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:37,087 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 7308 transitions. [2022-11-20 11:23:37,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 7308 transitions. [2022-11-20 11:23:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:37,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:37,088 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:37,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-11-20 11:23:37,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:37,290 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1084401120, now seen corresponding path program 1 times [2022-11-20 11:23:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:37,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445991218] [2022-11-20 11:23:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:37,291 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-20 11:23:37,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:37,292 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:37,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-20 11:23:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:37,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:37,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:37,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:37,962 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:37,962 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 15 treesize of output 38 [2022-11-20 11:23:37,982 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 510 treesize of output 494 [2022-11-20 11:23:38,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:38,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:38,243 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:38,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:38,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:38,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:38,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445991218] [2022-11-20 11:23:38,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445991218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:38,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:38,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:38,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316997478] [2022-11-20 11:23:38,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:38,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:38,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:38,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:38,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:38,555 INFO L87 Difference]: Start difference. First operand 1897 states and 7308 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:38,811 INFO L93 Difference]: Finished difference Result 1896 states and 7303 transitions. [2022-11-20 11:23:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:38,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:38,817 INFO L225 Difference]: With dead ends: 1896 [2022-11-20 11:23:38,817 INFO L226 Difference]: Without dead ends: 1896 [2022-11-20 11:23:38,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:38,817 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:38,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2022-11-20 11:23:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2022-11-20 11:23:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2022-11-20 11:23:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1809 states have (on average 4.037037037037037) internal successors, (7303), 1895 states have internal predecessors, (7303), 0 states have call successors, (0), 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-20 11:23:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 7303 transitions. [2022-11-20 11:23:38,874 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 7303 transitions. Word has length 25 [2022-11-20 11:23:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:38,874 INFO L495 AbstractCegarLoop]: Abstraction has 1896 states and 7303 transitions. [2022-11-20 11:23:38,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 7303 transitions. [2022-11-20 11:23:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:38,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:38,878 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:38,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2022-11-20 11:23:39,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:39,086 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1084401122, now seen corresponding path program 1 times [2022-11-20 11:23:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:39,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930690424] [2022-11-20 11:23:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:39,087 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-20 11:23:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:39,088 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:39,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-11-20 11:23:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:39,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:23:39,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:39,733 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-20 11:23:39,733 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 33 treesize of output 44 [2022-11-20 11:23:39,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:39,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:39,910 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:23:39,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:40,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:40,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:40,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930690424] [2022-11-20 11:23:40,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930690424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:40,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:40,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:40,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391428492] [2022-11-20 11:23:40,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:40,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:40,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:40,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:40,050 INFO L87 Difference]: Start difference. First operand 1896 states and 7303 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:40,289 INFO L93 Difference]: Finished difference Result 1895 states and 7298 transitions. [2022-11-20 11:23:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:40,295 INFO L225 Difference]: With dead ends: 1895 [2022-11-20 11:23:40,295 INFO L226 Difference]: Without dead ends: 1895 [2022-11-20 11:23:40,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:40,296 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:40,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2022-11-20 11:23:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2022-11-20 11:23:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1895. [2022-11-20 11:23:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1808 states have (on average 4.036504424778761) internal successors, (7298), 1894 states have internal predecessors, (7298), 0 states have call successors, (0), 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-20 11:23:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 7298 transitions. [2022-11-20 11:23:40,331 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 7298 transitions. Word has length 25 [2022-11-20 11:23:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:40,331 INFO L495 AbstractCegarLoop]: Abstraction has 1895 states and 7298 transitions. [2022-11-20 11:23:40,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 7298 transitions. [2022-11-20 11:23:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:40,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:40,332 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:40,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-11-20 11:23:40,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:40,532 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1084397493, now seen corresponding path program 1 times [2022-11-20 11:23:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:40,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592197653] [2022-11-20 11:23:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:40,533 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-20 11:23:40,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:40,535 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:40,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-20 11:23:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:41,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:41,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:41,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:41,277 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:41,278 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 15 treesize of output 38 [2022-11-20 11:23:41,297 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 460 treesize of output 444 [2022-11-20 11:23:41,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:41,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:41,564 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:41,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:41,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:41,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:41,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592197653] [2022-11-20 11:23:41,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592197653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:41,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:41,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852563779] [2022-11-20 11:23:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:41,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:41,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:41,859 INFO L87 Difference]: Start difference. First operand 1895 states and 7298 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:42,143 INFO L93 Difference]: Finished difference Result 1898 states and 7303 transitions. [2022-11-20 11:23:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:42,155 INFO L225 Difference]: With dead ends: 1898 [2022-11-20 11:23:42,155 INFO L226 Difference]: Without dead ends: 1898 [2022-11-20 11:23:42,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:42,156 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:42,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2022-11-20 11:23:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-11-20 11:23:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2022-11-20 11:23:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1811 states have (on average 4.032578685808946) internal successors, (7303), 1897 states have internal predecessors, (7303), 0 states have call successors, (0), 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-20 11:23:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7303 transitions. [2022-11-20 11:23:42,191 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7303 transitions. Word has length 25 [2022-11-20 11:23:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:42,192 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 7303 transitions. [2022-11-20 11:23:42,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7303 transitions. [2022-11-20 11:23:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:42,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:42,193 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:42,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:42,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:42,408 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:42,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:42,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1084397495, now seen corresponding path program 1 times [2022-11-20 11:23:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:42,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616180010] [2022-11-20 11:23:42,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:42,409 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-20 11:23:42,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:42,410 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:42,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-20 11:23:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:42,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:23:42,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:43,039 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-20 11:23:43,040 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 33 treesize of output 44 [2022-11-20 11:23:43,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:43,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:43,209 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:23:43,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 11:23:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:43,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:43,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:43,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616180010] [2022-11-20 11:23:43,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616180010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:43,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:43,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782336453] [2022-11-20 11:23:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:43,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:43,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:43,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:43,376 INFO L87 Difference]: Start difference. First operand 1898 states and 7303 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:43,653 INFO L93 Difference]: Finished difference Result 1898 states and 7302 transitions. [2022-11-20 11:23:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:43,659 INFO L225 Difference]: With dead ends: 1898 [2022-11-20 11:23:43,660 INFO L226 Difference]: Without dead ends: 1898 [2022-11-20 11:23:43,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:43,660 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:43,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2022-11-20 11:23:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-11-20 11:23:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2022-11-20 11:23:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1811 states have (on average 4.0320265046935395) internal successors, (7302), 1897 states have internal predecessors, (7302), 0 states have call successors, (0), 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-20 11:23:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7302 transitions. [2022-11-20 11:23:43,695 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7302 transitions. Word has length 25 [2022-11-20 11:23:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:43,695 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 7302 transitions. [2022-11-20 11:23:43,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7302 transitions. [2022-11-20 11:23:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:43,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:43,696 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:43,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-11-20 11:23:43,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:43,896 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:43,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1084620726, now seen corresponding path program 3 times [2022-11-20 11:23:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:43,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708237593] [2022-11-20 11:23:43,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:23:43,897 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-20 11:23:43,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:43,899 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:43,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-11-20 11:23:44,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 11:23:44,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:23:44,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:23:44,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:44,382 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2022-11-20 11:23:44,382 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 3 case distinctions, treesize of input 15 treesize of output 41 [2022-11-20 11:23:44,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:44,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-20 11:23:44,586 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:23:44,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:23:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:44,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:44,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:44,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708237593] [2022-11-20 11:23:44,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708237593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:44,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:44,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:44,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998292891] [2022-11-20 11:23:44,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:44,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:23:44,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:44,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:23:44,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:44,848 INFO L87 Difference]: Start difference. First operand 1898 states and 7302 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:45,059 INFO L93 Difference]: Finished difference Result 1897 states and 7299 transitions. [2022-11-20 11:23:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:45,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:45,065 INFO L225 Difference]: With dead ends: 1897 [2022-11-20 11:23:45,065 INFO L226 Difference]: Without dead ends: 1897 [2022-11-20 11:23:45,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:45,066 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:45,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2022-11-20 11:23:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-11-20 11:23:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1895. [2022-11-20 11:23:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1808 states have (on average 4.03429203539823) internal successors, (7294), 1894 states have internal predecessors, (7294), 0 states have call successors, (0), 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-20 11:23:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 7294 transitions. [2022-11-20 11:23:45,120 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 7294 transitions. Word has length 25 [2022-11-20 11:23:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:45,120 INFO L495 AbstractCegarLoop]: Abstraction has 1895 states and 7294 transitions. [2022-11-20 11:23:45,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 7294 transitions. [2022-11-20 11:23:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:45,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:45,121 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:45,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-11-20 11:23:45,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:45,321 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash 990960712, now seen corresponding path program 1 times [2022-11-20 11:23:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:45,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084321717] [2022-11-20 11:23:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:45,322 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-20 11:23:45,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:45,323 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:45,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-20 11:23:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:45,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:23:45,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:45,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:45,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:45,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084321717] [2022-11-20 11:23:45,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084321717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:45,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:45,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:23:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539460433] [2022-11-20 11:23:45,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:45,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:45,890 INFO L87 Difference]: Start difference. First operand 1895 states and 7294 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:46,175 INFO L93 Difference]: Finished difference Result 1440 states and 5269 transitions. [2022-11-20 11:23:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:23:46,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:46,179 INFO L225 Difference]: With dead ends: 1440 [2022-11-20 11:23:46,180 INFO L226 Difference]: Without dead ends: 1440 [2022-11-20 11:23:46,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:46,180 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:46,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:23:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2022-11-20 11:23:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2022-11-20 11:23:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1380 states have (on average 3.8181159420289856) internal successors, (5269), 1439 states have internal predecessors, (5269), 0 states have call successors, (0), 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-20 11:23:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 5269 transitions. [2022-11-20 11:23:46,209 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 5269 transitions. Word has length 25 [2022-11-20 11:23:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:46,210 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 5269 transitions. [2022-11-20 11:23:46,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 5269 transitions. [2022-11-20 11:23:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:46,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:46,211 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:46,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:46,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:46,411 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:46,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 991045674, now seen corresponding path program 1 times [2022-11-20 11:23:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:46,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585017294] [2022-11-20 11:23:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:23:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:46,413 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:46,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-20 11:23:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:47,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 11:23:47,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:47,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:47,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:47,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:47,167 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:23:47,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:23:47,176 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 18 treesize of output 16 [2022-11-20 11:23:47,226 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:47,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:47,352 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:23:47,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-20 11:23:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:47,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:47,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:47,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585017294] [2022-11-20 11:23:47,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585017294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:47,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:47,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195195494] [2022-11-20 11:23:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:47,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:47,632 INFO L87 Difference]: Start difference. First operand 1440 states and 5269 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:47,886 INFO L93 Difference]: Finished difference Result 1441 states and 5273 transitions. [2022-11-20 11:23:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:47,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:47,892 INFO L225 Difference]: With dead ends: 1441 [2022-11-20 11:23:47,892 INFO L226 Difference]: Without dead ends: 1441 [2022-11-20 11:23:47,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:47,893 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:47,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-11-20 11:23:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-11-20 11:23:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1441. [2022-11-20 11:23:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1381 states have (on average 3.8182476466328747) internal successors, (5273), 1440 states have internal predecessors, (5273), 0 states have call successors, (0), 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-20 11:23:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 5273 transitions. [2022-11-20 11:23:47,920 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 5273 transitions. Word has length 25 [2022-11-20 11:23:47,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:47,920 INFO L495 AbstractCegarLoop]: Abstraction has 1441 states and 5273 transitions. [2022-11-20 11:23:47,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 5273 transitions. [2022-11-20 11:23:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:47,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:47,921 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:47,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:48,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:48,122 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash 991045676, now seen corresponding path program 1 times [2022-11-20 11:23:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:48,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610069191] [2022-11-20 11:23:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:48,123 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-20 11:23:48,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:48,124 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:48,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-20 11:23:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:48,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:23:48,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:48,882 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-20 11:23:48,882 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 33 treesize of output 44 [2022-11-20 11:23:48,934 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:23:48,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 24 [2022-11-20 11:23:48,997 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 11:23:48,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-20 11:23:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:49,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:49,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:49,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610069191] [2022-11-20 11:23:49,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610069191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:49,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:49,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:49,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183770648] [2022-11-20 11:23:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:49,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:49,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:49,152 INFO L87 Difference]: Start difference. First operand 1441 states and 5273 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:49,429 INFO L93 Difference]: Finished difference Result 1350 states and 4967 transitions. [2022-11-20 11:23:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:23:49,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:49,433 INFO L225 Difference]: With dead ends: 1350 [2022-11-20 11:23:49,434 INFO L226 Difference]: Without dead ends: 1350 [2022-11-20 11:23:49,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:49,434 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:49,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 1 Unchecked, 0.3s Time] [2022-11-20 11:23:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2022-11-20 11:23:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2022-11-20 11:23:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1302 states have (on average 3.814900153609831) internal successors, (4967), 1349 states have internal predecessors, (4967), 0 states have call successors, (0), 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-20 11:23:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 4967 transitions. [2022-11-20 11:23:49,463 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 4967 transitions. Word has length 25 [2022-11-20 11:23:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:49,464 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 4967 transitions. [2022-11-20 11:23:49,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 4967 transitions. [2022-11-20 11:23:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:23:49,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:49,465 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:49,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:49,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:49,665 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash 991046883, now seen corresponding path program 1 times [2022-11-20 11:23:49,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:49,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546901744] [2022-11-20 11:23:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:49,666 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-20 11:23:49,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:49,667 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:49,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-11-20 11:23:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:50,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:50,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:50,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:50,366 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:50,366 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 15 treesize of output 38 [2022-11-20 11:23:50,385 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 186 treesize of output 178 [2022-11-20 11:23:50,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:50,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:50,589 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:50,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:50,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:50,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:50,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546901744] [2022-11-20 11:23:50,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546901744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:50,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:50,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504666507] [2022-11-20 11:23:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:50,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:50,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:50,842 INFO L87 Difference]: Start difference. First operand 1350 states and 4967 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:51,087 INFO L93 Difference]: Finished difference Result 1351 states and 4969 transitions. [2022-11-20 11:23:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 11:23:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:51,092 INFO L225 Difference]: With dead ends: 1351 [2022-11-20 11:23:51,092 INFO L226 Difference]: Without dead ends: 1351 [2022-11-20 11:23:51,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:51,093 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:51,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 65 Unchecked, 0.2s Time] [2022-11-20 11:23:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-11-20 11:23:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2022-11-20 11:23:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1303 states have (on average 3.8135072908672294) internal successors, (4969), 1350 states have internal predecessors, (4969), 0 states have call successors, (0), 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-20 11:23:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 4969 transitions. [2022-11-20 11:23:51,138 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 4969 transitions. Word has length 25 [2022-11-20 11:23:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:51,138 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 4969 transitions. [2022-11-20 11:23:51,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 4969 transitions. [2022-11-20 11:23:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:23:51,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:51,140 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:51,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:51,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:51,358 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:51,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -807481554, now seen corresponding path program 1 times [2022-11-20 11:23:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:51,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729227396] [2022-11-20 11:23:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:51,359 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-20 11:23:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:51,360 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:51,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-11-20 11:23:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:52,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:23:52,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:52,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:52,216 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:52,216 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 15 treesize of output 38 [2022-11-20 11:23:52,239 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-20 11:23:52,311 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:52,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:52,450 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:23:52,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-20 11:23:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:52,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:52,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:52,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729227396] [2022-11-20 11:23:52,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729227396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:52,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:52,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645648822] [2022-11-20 11:23:52,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:52,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:52,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:52,739 INFO L87 Difference]: Start difference. First operand 1351 states and 4969 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:52,982 INFO L93 Difference]: Finished difference Result 1344 states and 4942 transitions. [2022-11-20 11:23:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:52,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:23:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:52,987 INFO L225 Difference]: With dead ends: 1344 [2022-11-20 11:23:52,987 INFO L226 Difference]: Without dead ends: 1344 [2022-11-20 11:23:52,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:52,987 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:52,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-11-20 11:23:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-11-20 11:23:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2022-11-20 11:23:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1296 states have (on average 3.8132716049382718) internal successors, (4942), 1343 states have internal predecessors, (4942), 0 states have call successors, (0), 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-20 11:23:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 4942 transitions. [2022-11-20 11:23:53,010 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 4942 transitions. Word has length 26 [2022-11-20 11:23:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:53,010 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 4942 transitions. [2022-11-20 11:23:53,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 4942 transitions. [2022-11-20 11:23:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:23:53,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:53,011 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:53,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Ended with exit code 0 [2022-11-20 11:23:53,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:53,212 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash -811565339, now seen corresponding path program 1 times [2022-11-20 11:23:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:53,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079824603] [2022-11-20 11:23:53,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:53,212 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-20 11:23:53,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:53,214 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:53,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-20 11:23:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:53,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:53,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:53,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:54,048 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:54,048 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 15 treesize of output 38 [2022-11-20 11:23:54,069 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 88 treesize of output 84 [2022-11-20 11:23:54,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:54,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:54,295 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:54,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:54,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:54,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:54,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079824603] [2022-11-20 11:23:54,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079824603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:54,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:54,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065598378] [2022-11-20 11:23:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:54,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:54,648 INFO L87 Difference]: Start difference. First operand 1344 states and 4942 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:54,950 INFO L93 Difference]: Finished difference Result 1343 states and 4938 transitions. [2022-11-20 11:23:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:54,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:23:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:54,957 INFO L225 Difference]: With dead ends: 1343 [2022-11-20 11:23:54,957 INFO L226 Difference]: Without dead ends: 1343 [2022-11-20 11:23:54,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:54,958 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:54,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-11-20 11:23:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-11-20 11:23:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2022-11-20 11:23:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1295 states have (on average 3.8131274131274133) internal successors, (4938), 1342 states have internal predecessors, (4938), 0 states have call successors, (0), 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-20 11:23:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 4938 transitions. [2022-11-20 11:23:54,998 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 4938 transitions. Word has length 26 [2022-11-20 11:23:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:54,998 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 4938 transitions. [2022-11-20 11:23:54,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 4938 transitions. [2022-11-20 11:23:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:23:54,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:55,000 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:55,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:55,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:55,219 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -743304610, now seen corresponding path program 1 times [2022-11-20 11:23:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:55,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480333175] [2022-11-20 11:23:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:55,220 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-20 11:23:55,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:55,221 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:55,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-11-20 11:23:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:56,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:23:56,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:56,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:56,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:56,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:56,097 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:23:56,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:23:56,107 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 18 treesize of output 16 [2022-11-20 11:23:56,159 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:56,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:56,292 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:23:56,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-20 11:23:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:56,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:56,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:56,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480333175] [2022-11-20 11:23:56,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480333175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:56,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:56,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:56,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891420506] [2022-11-20 11:23:56,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:56,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:56,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:56,555 INFO L87 Difference]: Start difference. First operand 1343 states and 4938 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:56,765 INFO L93 Difference]: Finished difference Result 1344 states and 4942 transitions. [2022-11-20 11:23:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:23:56,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:23:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:56,769 INFO L225 Difference]: With dead ends: 1344 [2022-11-20 11:23:56,769 INFO L226 Difference]: Without dead ends: 1344 [2022-11-20 11:23:56,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:56,770 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:56,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-11-20 11:23:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-11-20 11:23:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2022-11-20 11:23:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1296 states have (on average 3.8132716049382718) internal successors, (4942), 1343 states have internal predecessors, (4942), 0 states have call successors, (0), 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-20 11:23:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 4942 transitions. [2022-11-20 11:23:56,792 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 4942 transitions. Word has length 26 [2022-11-20 11:23:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:56,793 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 4942 transitions. [2022-11-20 11:23:56,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 4942 transitions. [2022-11-20 11:23:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:23:56,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:56,794 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:56,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:56,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:56,994 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -743303401, now seen corresponding path program 1 times [2022-11-20 11:23:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:56,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391030292] [2022-11-20 11:23:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:56,995 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-20 11:23:56,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:56,996 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:56,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-11-20 11:23:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:57,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:23:57,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:57,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:57,852 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:23:57,853 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 15 treesize of output 38 [2022-11-20 11:23:57,878 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-20 11:23:58,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:23:58,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:23:58,149 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:23:58,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:23:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:58,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:58,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:58,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391030292] [2022-11-20 11:23:58,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391030292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:58,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:58,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:23:58,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558532524] [2022-11-20 11:23:58,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:58,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:23:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:58,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:23:58,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:23:58,483 INFO L87 Difference]: Start difference. First operand 1344 states and 4942 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:23:58,726 INFO L93 Difference]: Finished difference Result 1345 states and 4945 transitions. [2022-11-20 11:23:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:23:58,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:23:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:23:58,731 INFO L225 Difference]: With dead ends: 1345 [2022-11-20 11:23:58,731 INFO L226 Difference]: Without dead ends: 1345 [2022-11-20 11:23:58,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:23:58,731 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:23:58,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2022-11-20 11:23:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-11-20 11:23:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2022-11-20 11:23:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1297 states have (on average 3.8126445643793367) internal successors, (4945), 1344 states have internal predecessors, (4945), 0 states have call successors, (0), 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-20 11:23:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 4945 transitions. [2022-11-20 11:23:58,768 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 4945 transitions. Word has length 26 [2022-11-20 11:23:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:23:58,768 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 4945 transitions. [2022-11-20 11:23:58,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:23:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 4945 transitions. [2022-11-20 11:23:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:23:58,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:23:58,770 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:23:58,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2022-11-20 11:23:58,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:58,986 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:23:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:23:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash -743303370, now seen corresponding path program 1 times [2022-11-20 11:23:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:23:58,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448233176] [2022-11-20 11:23:58,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:23:58,987 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-20 11:23:58,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:23:58,988 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:23:58,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-11-20 11:23:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:23:59,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:23:59,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:23:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:23:59,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:23:59,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:23:59,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448233176] [2022-11-20 11:23:59,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448233176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:23:59,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:23:59,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:23:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596275013] [2022-11-20 11:23:59,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:23:59,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:23:59,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:23:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:23:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:23:59,543 INFO L87 Difference]: Start difference. First operand 1345 states and 4945 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:00,257 INFO L93 Difference]: Finished difference Result 1820 states and 6327 transitions. [2022-11-20 11:24:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:24:00,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:24:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:00,265 INFO L225 Difference]: With dead ends: 1820 [2022-11-20 11:24:00,265 INFO L226 Difference]: Without dead ends: 1820 [2022-11-20 11:24:00,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:00,266 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:00,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:24:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2022-11-20 11:24:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1424. [2022-11-20 11:24:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1376 states have (on average 3.79578488372093) internal successors, (5223), 1423 states have internal predecessors, (5223), 0 states have call successors, (0), 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-20 11:24:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 5223 transitions. [2022-11-20 11:24:00,313 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 5223 transitions. Word has length 26 [2022-11-20 11:24:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:00,314 INFO L495 AbstractCegarLoop]: Abstraction has 1424 states and 5223 transitions. [2022-11-20 11:24:00,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 5223 transitions. [2022-11-20 11:24:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:24:00,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:00,315 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:00,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:00,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:00,533 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:00,533 INFO L85 PathProgramCache]: Analyzing trace with hash -743412180, now seen corresponding path program 2 times [2022-11-20 11:24:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:00,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540622639] [2022-11-20 11:24:00,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:24:00,534 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-20 11:24:00,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:00,536 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:00,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2022-11-20 11:24:00,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:24:00,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:00,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:24:00,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:00,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:00,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:00,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540622639] [2022-11-20 11:24:00,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540622639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:00,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:00,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:24:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724197536] [2022-11-20 11:24:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:00,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:24:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:00,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:24:00,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:24:00,931 INFO L87 Difference]: Start difference. First operand 1424 states and 5223 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:01,632 INFO L93 Difference]: Finished difference Result 1635 states and 5784 transitions. [2022-11-20 11:24:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:24:01,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:24:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:01,638 INFO L225 Difference]: With dead ends: 1635 [2022-11-20 11:24:01,639 INFO L226 Difference]: Without dead ends: 1634 [2022-11-20 11:24:01,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:01,640 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:01,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:24:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2022-11-20 11:24:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1449. [2022-11-20 11:24:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1396 states have (on average 3.7722063037249285) internal successors, (5266), 1448 states have internal predecessors, (5266), 0 states have call successors, (0), 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-20 11:24:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 5266 transitions. [2022-11-20 11:24:01,675 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 5266 transitions. Word has length 26 [2022-11-20 11:24:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:01,676 INFO L495 AbstractCegarLoop]: Abstraction has 1449 states and 5266 transitions. [2022-11-20 11:24:01,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 5266 transitions. [2022-11-20 11:24:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:24:01,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:01,676 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:01,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:01,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:01,877 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 655019180, now seen corresponding path program 1 times [2022-11-20 11:24:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201640803] [2022-11-20 11:24:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:01,878 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-20 11:24:01,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:01,880 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:01,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2022-11-20 11:24:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:02,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 11:24:02,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:02,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:24:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:02,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:02,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:02,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201640803] [2022-11-20 11:24:02,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201640803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:02,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:02,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:24:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866113624] [2022-11-20 11:24:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:02,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:02,620 INFO L87 Difference]: Start difference. First operand 1449 states and 5266 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:03,057 INFO L93 Difference]: Finished difference Result 2119 states and 7798 transitions. [2022-11-20 11:24:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:24:03,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:24:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:03,065 INFO L225 Difference]: With dead ends: 2119 [2022-11-20 11:24:03,066 INFO L226 Difference]: Without dead ends: 2119 [2022-11-20 11:24:03,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:24:03,066 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:03,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:24:03,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-11-20 11:24:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1672. [2022-11-20 11:24:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1619 states have (on average 4.048795552810377) internal successors, (6555), 1671 states have internal predecessors, (6555), 0 states have call successors, (0), 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-20 11:24:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 6555 transitions. [2022-11-20 11:24:03,116 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 6555 transitions. Word has length 26 [2022-11-20 11:24:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:03,117 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 6555 transitions. [2022-11-20 11:24:03,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 6555 transitions. [2022-11-20 11:24:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:24:03,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:03,118 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:03,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:03,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:03,335 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash 655019033, now seen corresponding path program 1 times [2022-11-20 11:24:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:03,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573125370] [2022-11-20 11:24:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:03,336 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-20 11:24:03,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:03,337 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:03,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2022-11-20 11:24:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:03,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 11:24:03,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:04,074 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:24:04,074 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:24:04,192 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:24:04,193 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:24:04,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:04,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:04,296 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:24:04,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:24:04,349 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:04,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:04,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:04,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:04,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573125370] [2022-11-20 11:24:04,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573125370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:04,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:04,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:24:04,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062374506] [2022-11-20 11:24:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:04,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:04,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:04,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:04,434 INFO L87 Difference]: Start difference. First operand 1672 states and 6555 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:04,895 INFO L93 Difference]: Finished difference Result 1896 states and 6954 transitions. [2022-11-20 11:24:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:24:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:24:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:04,901 INFO L225 Difference]: With dead ends: 1896 [2022-11-20 11:24:04,901 INFO L226 Difference]: Without dead ends: 1896 [2022-11-20 11:24:04,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:24:04,902 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:04,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:24:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2022-11-20 11:24:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1672. [2022-11-20 11:24:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1619 states have (on average 3.9110562075355157) internal successors, (6332), 1671 states have internal predecessors, (6332), 0 states have call successors, (0), 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-20 11:24:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 6332 transitions. [2022-11-20 11:24:04,934 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 6332 transitions. Word has length 26 [2022-11-20 11:24:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:04,935 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 6332 transitions. [2022-11-20 11:24:04,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 6332 transitions. [2022-11-20 11:24:04,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:24:04,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:04,936 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:04,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:05,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:05,151 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 657795016, now seen corresponding path program 3 times [2022-11-20 11:24:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:05,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679461721] [2022-11-20 11:24:05,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:24:05,152 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-20 11:24:05,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:05,154 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:05,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Waiting until timeout for monitored process [2022-11-20 11:24:05,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 11:24:05,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:05,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:24:05,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:05,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:05,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:05,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679461721] [2022-11-20 11:24:05,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679461721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:05,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:05,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:24:05,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106332307] [2022-11-20 11:24:05,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:05,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:24:05,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:05,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:24:05,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:24:05,519 INFO L87 Difference]: Start difference. First operand 1672 states and 6332 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:06,071 INFO L93 Difference]: Finished difference Result 1761 states and 6570 transitions. [2022-11-20 11:24:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:24:06,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:24:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:06,078 INFO L225 Difference]: With dead ends: 1761 [2022-11-20 11:24:06,078 INFO L226 Difference]: Without dead ends: 1761 [2022-11-20 11:24:06,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:06,079 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:06,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:24:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2022-11-20 11:24:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1581. [2022-11-20 11:24:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1528 states have (on average 3.8658376963350785) internal successors, (5907), 1580 states have internal predecessors, (5907), 0 states have call successors, (0), 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-20 11:24:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 5907 transitions. [2022-11-20 11:24:06,109 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 5907 transitions. Word has length 26 [2022-11-20 11:24:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:06,110 INFO L495 AbstractCegarLoop]: Abstraction has 1581 states and 5907 transitions. [2022-11-20 11:24:06,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 5907 transitions. [2022-11-20 11:24:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:24:06,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:06,111 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:06,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (57)] Ended with exit code 0 [2022-11-20 11:24:06,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:06,312 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 657649843, now seen corresponding path program 1 times [2022-11-20 11:24:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:06,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305455071] [2022-11-20 11:24:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:06,313 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-20 11:24:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:06,314 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:06,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2022-11-20 11:24:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:07,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:24:07,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:07,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:07,192 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:24:07,192 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 15 treesize of output 38 [2022-11-20 11:24:07,211 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 282 treesize of output 266 [2022-11-20 11:24:07,314 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:07,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:07,465 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:24:07,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-20 11:24:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:07,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:07,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:07,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305455071] [2022-11-20 11:24:07,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305455071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:07,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:07,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:24:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846083414] [2022-11-20 11:24:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:07,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:07,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:07,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:07,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:07,764 INFO L87 Difference]: Start difference. First operand 1581 states and 5907 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:07,949 INFO L93 Difference]: Finished difference Result 1579 states and 5898 transitions. [2022-11-20 11:24:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:24:07,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:24:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:07,955 INFO L225 Difference]: With dead ends: 1579 [2022-11-20 11:24:07,955 INFO L226 Difference]: Without dead ends: 1579 [2022-11-20 11:24:07,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:07,955 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:07,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-11-20 11:24:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2022-11-20 11:24:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2022-11-20 11:24:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1526 states have (on average 3.865006553079948) internal successors, (5898), 1578 states have internal predecessors, (5898), 0 states have call successors, (0), 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-20 11:24:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 5898 transitions. [2022-11-20 11:24:07,983 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 5898 transitions. Word has length 26 [2022-11-20 11:24:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:07,984 INFO L495 AbstractCegarLoop]: Abstraction has 1579 states and 5898 transitions. [2022-11-20 11:24:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 5898 transitions. [2022-11-20 11:24:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:24:07,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:07,984 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:07,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Ended with exit code 0 [2022-11-20 11:24:08,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:08,185 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:08,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash 657649766, now seen corresponding path program 1 times [2022-11-20 11:24:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:08,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670422976] [2022-11-20 11:24:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:08,186 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-20 11:24:08,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:08,187 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:08,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Waiting until timeout for monitored process [2022-11-20 11:24:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:08,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:24:08,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:08,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:24:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:08,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:09,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:09,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670422976] [2022-11-20 11:24:09,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670422976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:24:09,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:09,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-11-20 11:24:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949438895] [2022-11-20 11:24:09,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:09,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:24:09,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:09,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:24:09,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:24:09,182 INFO L87 Difference]: Start difference. First operand 1579 states and 5898 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 11:24:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:10,542 INFO L93 Difference]: Finished difference Result 4627 states and 16879 transitions. [2022-11-20 11:24:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:24:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:24:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:10,560 INFO L225 Difference]: With dead ends: 4627 [2022-11-20 11:24:10,560 INFO L226 Difference]: Without dead ends: 4627 [2022-11-20 11:24:10,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:24:10,561 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 282 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:10,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 0 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 11:24:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-11-20 11:24:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 2848. [2022-11-20 11:24:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2795 states have (on average 4.253667262969588) internal successors, (11889), 2847 states have internal predecessors, (11889), 0 states have call successors, (0), 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-20 11:24:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 11889 transitions. [2022-11-20 11:24:10,664 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 11889 transitions. Word has length 26 [2022-11-20 11:24:10,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:10,665 INFO L495 AbstractCegarLoop]: Abstraction has 2848 states and 11889 transitions. [2022-11-20 11:24:10,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 11:24:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 11889 transitions. [2022-11-20 11:24:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:24:10,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:10,666 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:10,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:10,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:10,880 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 657649696, now seen corresponding path program 1 times [2022-11-20 11:24:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:10,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868708495] [2022-11-20 11:24:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:10,881 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-20 11:24:10,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:10,882 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:10,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2022-11-20 11:24:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:11,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 11:24:11,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:11,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 11:24:11,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:24:11,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:11,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:11,579 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:24:11,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:24:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:11,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:12,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:12,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868708495] [2022-11-20 11:24:12,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868708495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:24:12,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:12,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-11-20 11:24:12,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129701226] [2022-11-20 11:24:12,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:12,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:24:12,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:12,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:24:12,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:24:12,199 INFO L87 Difference]: Start difference. First operand 2848 states and 11889 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:13,611 INFO L93 Difference]: Finished difference Result 3776 states and 13721 transitions. [2022-11-20 11:24:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:24:13,612 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 11:24:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:13,621 INFO L225 Difference]: With dead ends: 3776 [2022-11-20 11:24:13,621 INFO L226 Difference]: Without dead ends: 3776 [2022-11-20 11:24:13,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:24:13,622 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 349 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:13,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 11:24:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2022-11-20 11:24:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 2848. [2022-11-20 11:24:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2795 states have (on average 4.026118067978533) internal successors, (11253), 2847 states have internal predecessors, (11253), 0 states have call successors, (0), 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-20 11:24:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 11253 transitions. [2022-11-20 11:24:13,700 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 11253 transitions. Word has length 26 [2022-11-20 11:24:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:13,700 INFO L495 AbstractCegarLoop]: Abstraction has 2848 states and 11253 transitions. [2022-11-20 11:24:13,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 11253 transitions. [2022-11-20 11:24:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:13,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:13,701 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:13,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Ended with exit code 0 [2022-11-20 11:24:13,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:13,902 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash 737879507, now seen corresponding path program 1 times [2022-11-20 11:24:13,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:13,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120582006] [2022-11-20 11:24:13,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:13,903 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-20 11:24:13,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:13,905 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:13,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (61)] Waiting until timeout for monitored process [2022-11-20 11:24:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:14,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 11:24:14,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:14,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:14,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:14,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:14,743 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:24:14,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:24:14,753 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 18 treesize of output 16 [2022-11-20 11:24:14,808 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:14,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:14,941 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:24:14,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-20 11:24:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:15,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:15,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:15,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120582006] [2022-11-20 11:24:15,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120582006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:15,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:15,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:24:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401405100] [2022-11-20 11:24:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:15,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:15,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:15,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:15,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:15,229 INFO L87 Difference]: Start difference. First operand 2848 states and 11253 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:15,422 INFO L93 Difference]: Finished difference Result 2841 states and 11219 transitions. [2022-11-20 11:24:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:24:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:15,432 INFO L225 Difference]: With dead ends: 2841 [2022-11-20 11:24:15,432 INFO L226 Difference]: Without dead ends: 2841 [2022-11-20 11:24:15,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:15,432 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:15,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-11-20 11:24:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2022-11-20 11:24:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2841. [2022-11-20 11:24:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2788 states have (on average 4.024031563845051) internal successors, (11219), 2840 states have internal predecessors, (11219), 0 states have call successors, (0), 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-20 11:24:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 11219 transitions. [2022-11-20 11:24:15,510 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 11219 transitions. Word has length 27 [2022-11-20 11:24:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:15,511 INFO L495 AbstractCegarLoop]: Abstraction has 2841 states and 11219 transitions. [2022-11-20 11:24:15,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 11219 transitions. [2022-11-20 11:24:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:15,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:15,511 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:15,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (61)] Ended with exit code 0 [2022-11-20 11:24:15,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:15,712 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:15,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash 737875880, now seen corresponding path program 1 times [2022-11-20 11:24:15,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:15,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891304648] [2022-11-20 11:24:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:15,713 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-20 11:24:15,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:15,714 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:15,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2022-11-20 11:24:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:16,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 11:24:16,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:16,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:16,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:16,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:16,594 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:24:16,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:24:16,602 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 18 treesize of output 16 [2022-11-20 11:24:16,650 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:16,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:16,780 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:24:16,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-20 11:24:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-20 11:24:17,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:17,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:17,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891304648] [2022-11-20 11:24:17,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891304648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:17,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:17,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:24:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174524343] [2022-11-20 11:24:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:17,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:17,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:17,036 INFO L87 Difference]: Start difference. First operand 2841 states and 11219 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:17,241 INFO L93 Difference]: Finished difference Result 2840 states and 11217 transitions. [2022-11-20 11:24:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:24:17,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:17,249 INFO L225 Difference]: With dead ends: 2840 [2022-11-20 11:24:17,249 INFO L226 Difference]: Without dead ends: 2840 [2022-11-20 11:24:17,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:17,250 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:17,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-11-20 11:24:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-11-20 11:24:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2840. [2022-11-20 11:24:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2787 states have (on average 4.02475780409042) internal successors, (11217), 2839 states have internal predecessors, (11217), 0 states have call successors, (0), 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-20 11:24:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 11217 transitions. [2022-11-20 11:24:17,334 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 11217 transitions. Word has length 27 [2022-11-20 11:24:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:17,334 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 11217 transitions. [2022-11-20 11:24:17,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 11217 transitions. [2022-11-20 11:24:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:17,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:17,335 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:17,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Ended with exit code 0 [2022-11-20 11:24:17,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:17,535 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash 611277305, now seen corresponding path program 1 times [2022-11-20 11:24:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:17,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913806501] [2022-11-20 11:24:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:17,537 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-20 11:24:17,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:17,537 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:17,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Waiting until timeout for monitored process [2022-11-20 11:24:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:18,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 11:24:18,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:18,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:18,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:18,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:18,324 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:24:18,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:24:18,333 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 18 treesize of output 16 [2022-11-20 11:24:18,390 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:18,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:18,505 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:18,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 11:24:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:19,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:19,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:19,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913806501] [2022-11-20 11:24:19,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913806501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:19,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:19,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:24:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634515945] [2022-11-20 11:24:19,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:19,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:24:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:19,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:24:19,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:24:19,048 INFO L87 Difference]: Start difference. First operand 2840 states and 11217 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:19,310 INFO L93 Difference]: Finished difference Result 2844 states and 11231 transitions. [2022-11-20 11:24:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:24:19,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:19,319 INFO L225 Difference]: With dead ends: 2844 [2022-11-20 11:24:19,319 INFO L226 Difference]: Without dead ends: 2844 [2022-11-20 11:24:19,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:24:19,320 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:19,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 88 Unchecked, 0.2s Time] [2022-11-20 11:24:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2022-11-20 11:24:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2842. [2022-11-20 11:24:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2842 states, 2789 states have (on average 4.02438149874507) internal successors, (11224), 2841 states have internal predecessors, (11224), 0 states have call successors, (0), 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-20 11:24:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 11224 transitions. [2022-11-20 11:24:19,374 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 11224 transitions. Word has length 27 [2022-11-20 11:24:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:19,375 INFO L495 AbstractCegarLoop]: Abstraction has 2842 states and 11224 transitions. [2022-11-20 11:24:19,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 11224 transitions. [2022-11-20 11:24:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:19,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:19,375 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:19,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Ended with exit code 0 [2022-11-20 11:24:19,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:19,578 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:19,579 INFO L85 PathProgramCache]: Analyzing trace with hash 611278514, now seen corresponding path program 1 times [2022-11-20 11:24:19,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:19,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438330983] [2022-11-20 11:24:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:19,579 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-20 11:24:19,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:19,580 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:19,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (64)] Waiting until timeout for monitored process [2022-11-20 11:24:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:20,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 11:24:20,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:20,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:20,451 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:24:20,452 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 15 treesize of output 38 [2022-11-20 11:24:20,473 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 88 treesize of output 84 [2022-11-20 11:24:20,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:20,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:20,672 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:20,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:20,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:20,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:20,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438330983] [2022-11-20 11:24:20,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438330983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:20,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:20,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:24:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069336147] [2022-11-20 11:24:20,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:20,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:20,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:20,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:20,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:20,988 INFO L87 Difference]: Start difference. First operand 2842 states and 11224 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:21,211 INFO L93 Difference]: Finished difference Result 2843 states and 11226 transitions. [2022-11-20 11:24:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:24:21,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:21,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:21,219 INFO L225 Difference]: With dead ends: 2843 [2022-11-20 11:24:21,219 INFO L226 Difference]: Without dead ends: 2843 [2022-11-20 11:24:21,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:24:21,219 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:21,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2022-11-20 11:24:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2022-11-20 11:24:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2843. [2022-11-20 11:24:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2790 states have (on average 4.023655913978494) internal successors, (11226), 2842 states have internal predecessors, (11226), 0 states have call successors, (0), 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-20 11:24:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 11226 transitions. [2022-11-20 11:24:21,273 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 11226 transitions. Word has length 27 [2022-11-20 11:24:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:21,273 INFO L495 AbstractCegarLoop]: Abstraction has 2843 states and 11226 transitions. [2022-11-20 11:24:21,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 11226 transitions. [2022-11-20 11:24:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:21,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:21,274 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:21,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (64)] Ended with exit code 0 [2022-11-20 11:24:21,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:21,482 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1567625651, now seen corresponding path program 2 times [2022-11-20 11:24:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:21,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232383295] [2022-11-20 11:24:21,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:24:21,482 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-20 11:24:21,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:21,484 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:21,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Waiting until timeout for monitored process [2022-11-20 11:24:21,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:24:21,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:21,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:24:21,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:21,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:22,039 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:24:22,040 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 15 treesize of output 38 [2022-11-20 11:24:22,057 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-20 11:24:22,148 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:22,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:22,262 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:22,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 11:24:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:22,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:22,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:22,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232383295] [2022-11-20 11:24:22,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232383295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:22,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:22,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:24:22,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030317118] [2022-11-20 11:24:22,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:22,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:24:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:22,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:24:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:24:22,785 INFO L87 Difference]: Start difference. First operand 2843 states and 11226 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:23,056 INFO L93 Difference]: Finished difference Result 2848 states and 11244 transitions. [2022-11-20 11:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:24:23,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:23,069 INFO L225 Difference]: With dead ends: 2848 [2022-11-20 11:24:23,069 INFO L226 Difference]: Without dead ends: 2848 [2022-11-20 11:24:23,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:24:23,070 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:23,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2022-11-20 11:24:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2022-11-20 11:24:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 2847. [2022-11-20 11:24:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2794 states have (on average 4.023264137437366) internal successors, (11241), 2846 states have internal predecessors, (11241), 0 states have call successors, (0), 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-20 11:24:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 11241 transitions. [2022-11-20 11:24:23,134 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 11241 transitions. Word has length 27 [2022-11-20 11:24:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:23,135 INFO L495 AbstractCegarLoop]: Abstraction has 2847 states and 11241 transitions. [2022-11-20 11:24:23,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 11241 transitions. [2022-11-20 11:24:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:23,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:23,136 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:23,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (65)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:23,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:23,351 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1567607981, now seen corresponding path program 3 times [2022-11-20 11:24:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:23,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420312847] [2022-11-20 11:24:23,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:24:23,352 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-20 11:24:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:23,353 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:23,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (66)] Waiting until timeout for monitored process [2022-11-20 11:24:23,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 11:24:23,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:23,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 11:24:23,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:23,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:23,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:23,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:23,899 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:24:23,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:24:23,912 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 18 treesize of output 16 [2022-11-20 11:24:23,969 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:23,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:24,100 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:24,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 11:24:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:24,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:24,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:24,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420312847] [2022-11-20 11:24:24,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420312847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:24,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:24,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:24:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657176483] [2022-11-20 11:24:24,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:24,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:24:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:24,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:24:24,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:24:24,620 INFO L87 Difference]: Start difference. First operand 2847 states and 11241 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:24,894 INFO L93 Difference]: Finished difference Result 2858 states and 11278 transitions. [2022-11-20 11:24:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:24:24,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:24,902 INFO L225 Difference]: With dead ends: 2858 [2022-11-20 11:24:24,902 INFO L226 Difference]: Without dead ends: 2858 [2022-11-20 11:24:24,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:24:24,903 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:24,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2022-11-20 11:24:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2022-11-20 11:24:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2022-11-20 11:24:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2805 states have (on average 4.020677361853832) internal successors, (11278), 2857 states have internal predecessors, (11278), 0 states have call successors, (0), 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-20 11:24:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 11278 transitions. [2022-11-20 11:24:24,954 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 11278 transitions. Word has length 27 [2022-11-20 11:24:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:24,954 INFO L495 AbstractCegarLoop]: Abstraction has 2858 states and 11278 transitions. [2022-11-20 11:24:24,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:24,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 11278 transitions. [2022-11-20 11:24:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:24,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:24,956 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:24,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (66)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:25,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:25,169 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1567601409, now seen corresponding path program 1 times [2022-11-20 11:24:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:25,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042377212] [2022-11-20 11:24:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:25,170 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-20 11:24:25,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:25,171 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:25,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (67)] Waiting until timeout for monitored process [2022-11-20 11:24:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:25,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 11:24:25,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:25,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:25,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:25,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:25,963 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:24:25,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:24:25,973 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 18 treesize of output 16 [2022-11-20 11:24:26,034 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:26,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:26,151 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:26,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 11:24:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:26,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:26,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042377212] [2022-11-20 11:24:26,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042377212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:26,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:26,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:24:26,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108600605] [2022-11-20 11:24:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:26,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:24:26,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:24:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:24:26,628 INFO L87 Difference]: Start difference. First operand 2858 states and 11278 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:26,880 INFO L93 Difference]: Finished difference Result 2859 states and 11282 transitions. [2022-11-20 11:24:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:24:26,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:26,888 INFO L225 Difference]: With dead ends: 2859 [2022-11-20 11:24:26,888 INFO L226 Difference]: Without dead ends: 2859 [2022-11-20 11:24:26,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:24:26,890 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:26,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 65 Unchecked, 0.2s Time] [2022-11-20 11:24:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2022-11-20 11:24:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2859. [2022-11-20 11:24:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2806 states have (on average 4.020669992872416) internal successors, (11282), 2858 states have internal predecessors, (11282), 0 states have call successors, (0), 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-20 11:24:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 11282 transitions. [2022-11-20 11:24:26,957 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 11282 transitions. Word has length 27 [2022-11-20 11:24:26,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:26,957 INFO L495 AbstractCegarLoop]: Abstraction has 2859 states and 11282 transitions. [2022-11-20 11:24:26,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 11282 transitions. [2022-11-20 11:24:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:26,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:26,958 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:26,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (67)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:27,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:27,174 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:27,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1169235053, now seen corresponding path program 1 times [2022-11-20 11:24:27,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:27,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755554035] [2022-11-20 11:24:27,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:27,175 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-20 11:24:27,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:27,176 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:27,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (68)] Waiting until timeout for monitored process [2022-11-20 11:24:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:27,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:24:27,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:27,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:24:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:27,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:28,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:28,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755554035] [2022-11-20 11:24:28,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755554035] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:24:28,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:28,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-11-20 11:24:28,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712350853] [2022-11-20 11:24:28,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:28,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:24:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:24:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:24:28,278 INFO L87 Difference]: Start difference. First operand 2859 states and 11282 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:29,826 INFO L93 Difference]: Finished difference Result 6713 states and 26008 transitions. [2022-11-20 11:24:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:24:29,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:29,851 INFO L225 Difference]: With dead ends: 6713 [2022-11-20 11:24:29,851 INFO L226 Difference]: Without dead ends: 6713 [2022-11-20 11:24:29,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:24:29,852 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 268 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:29,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 0 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 11:24:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6713 states. [2022-11-20 11:24:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6713 to 4014. [2022-11-20 11:24:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4014 states, 3961 states have (on average 4.575107296137339) internal successors, (18122), 4013 states have internal predecessors, (18122), 0 states have call successors, (0), 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-20 11:24:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 18122 transitions. [2022-11-20 11:24:30,027 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 18122 transitions. Word has length 27 [2022-11-20 11:24:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:30,027 INFO L495 AbstractCegarLoop]: Abstraction has 4014 states and 18122 transitions. [2022-11-20 11:24:30,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 18122 transitions. [2022-11-20 11:24:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:30,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:30,029 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:30,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (68)] Ended with exit code 0 [2022-11-20 11:24:30,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:30,230 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1169235200, now seen corresponding path program 1 times [2022-11-20 11:24:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:30,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937228023] [2022-11-20 11:24:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:30,231 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-20 11:24:30,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:30,232 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:30,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (69)] Waiting until timeout for monitored process [2022-11-20 11:24:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:31,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:24:31,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:31,150 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:24:31,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:24:31,296 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:24:31,297 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:24:31,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:31,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:31,414 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:24:31,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:24:31,469 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:31,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:31,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:34,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:34,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937228023] [2022-11-20 11:24:34,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937228023] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:24:34,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:34,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2022-11-20 11:24:34,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578630630] [2022-11-20 11:24:34,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:34,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:24:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:34,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:24:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:24:34,504 INFO L87 Difference]: Start difference. First operand 4014 states and 18122 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:35,640 INFO L93 Difference]: Finished difference Result 5558 states and 21475 transitions. [2022-11-20 11:24:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:24:35,641 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:35,656 INFO L225 Difference]: With dead ends: 5558 [2022-11-20 11:24:35,656 INFO L226 Difference]: Without dead ends: 5558 [2022-11-20 11:24:35,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:24:35,656 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:35,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 80 Unchecked, 0.9s Time] [2022-11-20 11:24:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2022-11-20 11:24:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 4014. [2022-11-20 11:24:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4014 states, 3961 states have (on average 4.283514264074729) internal successors, (16967), 4013 states have internal predecessors, (16967), 0 states have call successors, (0), 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-20 11:24:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 16967 transitions. [2022-11-20 11:24:35,735 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 16967 transitions. Word has length 27 [2022-11-20 11:24:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:35,735 INFO L495 AbstractCegarLoop]: Abstraction has 4014 states and 16967 transitions. [2022-11-20 11:24:35,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 16967 transitions. [2022-11-20 11:24:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:35,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:35,736 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:35,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (69)] Ended with exit code 0 [2022-11-20 11:24:35,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:35,936 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1083248645, now seen corresponding path program 4 times [2022-11-20 11:24:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:35,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232632954] [2022-11-20 11:24:35,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:24:35,937 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-20 11:24:35,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:35,938 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:35,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (70)] Waiting until timeout for monitored process [2022-11-20 11:24:36,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:24:36,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:36,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:24:36,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:36,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:36,808 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-20 11:24:36,808 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 15 treesize of output 38 [2022-11-20 11:24:36,825 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 186 treesize of output 178 [2022-11-20 11:24:36,898 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:36,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:37,025 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-20 11:24:37,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-20 11:24:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:37,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:37,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:37,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232632954] [2022-11-20 11:24:37,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232632954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:37,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:37,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:24:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959332249] [2022-11-20 11:24:37,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:37,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:37,273 INFO L87 Difference]: Start difference. First operand 4014 states and 16967 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:37,469 INFO L93 Difference]: Finished difference Result 4013 states and 16964 transitions. [2022-11-20 11:24:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:24:37,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:37,480 INFO L225 Difference]: With dead ends: 4013 [2022-11-20 11:24:37,480 INFO L226 Difference]: Without dead ends: 4013 [2022-11-20 11:24:37,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:37,481 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:37,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-11-20 11:24:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2022-11-20 11:24:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 4011. [2022-11-20 11:24:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4011 states, 3958 states have (on average 4.284234461849419) internal successors, (16957), 4010 states have internal predecessors, (16957), 0 states have call successors, (0), 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-20 11:24:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 16957 transitions. [2022-11-20 11:24:37,546 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 16957 transitions. Word has length 27 [2022-11-20 11:24:37,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:37,546 INFO L495 AbstractCegarLoop]: Abstraction has 4011 states and 16957 transitions. [2022-11-20 11:24:37,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 16957 transitions. [2022-11-20 11:24:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 11:24:37,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:37,547 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:37,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (70)] Ended with exit code 0 [2022-11-20 11:24:37,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:37,748 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:37,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1083224403, now seen corresponding path program 2 times [2022-11-20 11:24:37,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:37,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911986452] [2022-11-20 11:24:37,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:24:37,748 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-20 11:24:37,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:37,749 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:37,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (71)] Waiting until timeout for monitored process [2022-11-20 11:24:38,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:24:38,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:38,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 11:24:38,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:38,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:38,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:38,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:38,301 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 11:24:38,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-11-20 11:24:38,307 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 18 treesize of output 16 [2022-11-20 11:24:38,359 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:38,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 11:24:38,466 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 11:24:38,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 11:24:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:38,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:38,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:38,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911986452] [2022-11-20 11:24:38,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911986452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:38,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:38,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:24:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266866009] [2022-11-20 11:24:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:24:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:24:38,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:24:38,965 INFO L87 Difference]: Start difference. First operand 4011 states and 16957 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:39,796 INFO L93 Difference]: Finished difference Result 4168 states and 17364 transitions. [2022-11-20 11:24:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:24:39,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 11:24:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:39,807 INFO L225 Difference]: With dead ends: 4168 [2022-11-20 11:24:39,807 INFO L226 Difference]: Without dead ends: 4168 [2022-11-20 11:24:39,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:24:39,808 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:39,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 196 Invalid, 0 Unknown, 38 Unchecked, 0.6s Time] [2022-11-20 11:24:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2022-11-20 11:24:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 3845. [2022-11-20 11:24:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3804 states have (on average 4.30993690851735) internal successors, (16395), 3844 states have internal predecessors, (16395), 0 states have call successors, (0), 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-20 11:24:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 16395 transitions. [2022-11-20 11:24:39,875 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 16395 transitions. Word has length 27 [2022-11-20 11:24:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:39,875 INFO L495 AbstractCegarLoop]: Abstraction has 3845 states and 16395 transitions. [2022-11-20 11:24:39,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 16395 transitions. [2022-11-20 11:24:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 11:24:39,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:39,876 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:39,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (71)] Ended with exit code 0 [2022-11-20 11:24:40,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:40,076 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1465992281, now seen corresponding path program 1 times [2022-11-20 11:24:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:40,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843270612] [2022-11-20 11:24:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:40,077 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-20 11:24:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:40,078 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:40,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (72)] Waiting until timeout for monitored process [2022-11-20 11:24:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:40,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 11:24:40,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:40,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:40,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:40,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843270612] [2022-11-20 11:24:40,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843270612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:40,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:40,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:24:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702528404] [2022-11-20 11:24:40,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:40,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:24:40,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:24:40,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:24:40,673 INFO L87 Difference]: Start difference. First operand 3845 states and 16395 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 11:24:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:40,881 INFO L93 Difference]: Finished difference Result 3719 states and 15934 transitions. [2022-11-20 11:24:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:24:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-20 11:24:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:40,891 INFO L225 Difference]: With dead ends: 3719 [2022-11-20 11:24:40,891 INFO L226 Difference]: Without dead ends: 3716 [2022-11-20 11:24:40,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:24:40,892 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:40,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:24:40,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2022-11-20 11:24:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3716. [2022-11-20 11:24:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 3687 states have (on average 4.316517493897478) internal successors, (15915), 3715 states have internal predecessors, (15915), 0 states have call successors, (0), 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-20 11:24:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 15915 transitions. [2022-11-20 11:24:40,952 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 15915 transitions. Word has length 29 [2022-11-20 11:24:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:40,953 INFO L495 AbstractCegarLoop]: Abstraction has 3716 states and 15915 transitions. [2022-11-20 11:24:40,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-20 11:24:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 15915 transitions. [2022-11-20 11:24:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:24:40,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:40,954 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:40,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (72)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:41,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:41,169 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1083777041, now seen corresponding path program 2 times [2022-11-20 11:24:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:41,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675611975] [2022-11-20 11:24:41,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:24:41,170 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-20 11:24:41,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:41,171 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:41,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (73)] Waiting until timeout for monitored process [2022-11-20 11:24:41,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:24:41,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:41,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-20 11:24:41,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:41,832 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:24:41,832 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:24:41,984 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:24:41,984 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:24:42,106 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:42,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:42,137 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 11:24:42,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 11:24:42,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:42,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:42,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-20 11:24:42,332 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-20 11:24:42,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:24:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-20 11:24:42,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:42,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:42,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675611975] [2022-11-20 11:24:42,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675611975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:42,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:42,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:24:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750893013] [2022-11-20 11:24:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:42,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:24:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:42,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:24:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:24:42,865 INFO L87 Difference]: Start difference. First operand 3716 states and 15915 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:43,195 INFO L93 Difference]: Finished difference Result 3715 states and 15913 transitions. [2022-11-20 11:24:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:24:43,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 11:24:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:43,207 INFO L225 Difference]: With dead ends: 3715 [2022-11-20 11:24:43,207 INFO L226 Difference]: Without dead ends: 3715 [2022-11-20 11:24:43,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:24:43,208 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:43,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2022-11-20 11:24:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2022-11-20 11:24:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3715. [2022-11-20 11:24:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3715 states, 3686 states have (on average 4.3171459576777) internal successors, (15913), 3714 states have internal predecessors, (15913), 0 states have call successors, (0), 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-20 11:24:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3715 states to 3715 states and 15913 transitions. [2022-11-20 11:24:43,286 INFO L78 Accepts]: Start accepts. Automaton has 3715 states and 15913 transitions. Word has length 30 [2022-11-20 11:24:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:43,287 INFO L495 AbstractCegarLoop]: Abstraction has 3715 states and 15913 transitions. [2022-11-20 11:24:43,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 15913 transitions. [2022-11-20 11:24:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:24:43,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:43,289 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:43,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (73)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:43,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:43,504 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:43,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1083777115, now seen corresponding path program 2 times [2022-11-20 11:24:43,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:43,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162089611] [2022-11-20 11:24:43,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:24:43,504 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-20 11:24:43,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:43,505 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:43,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (74)] Waiting until timeout for monitored process [2022-11-20 11:24:44,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:24:44,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:44,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:24:44,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:44,422 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:24:44,422 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:24:44,549 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:24:44,550 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:24:44,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:44,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:44,656 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 11:24:44,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 11:24:44,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:44,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:44,734 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:24:44,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:24:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:44,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:46,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:46,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162089611] [2022-11-20 11:24:46,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162089611] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:24:46,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:46,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2022-11-20 11:24:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384390639] [2022-11-20 11:24:46,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:46,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:24:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:24:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:24:46,720 INFO L87 Difference]: Start difference. First operand 3715 states and 15913 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 11:24:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:49,287 INFO L93 Difference]: Finished difference Result 6878 states and 27647 transitions. [2022-11-20 11:24:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:24:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 11:24:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:49,342 INFO L225 Difference]: With dead ends: 6878 [2022-11-20 11:24:49,342 INFO L226 Difference]: Without dead ends: 6878 [2022-11-20 11:24:49,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2022-11-20 11:24:49,343 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 703 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:49,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 0 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1024 Invalid, 0 Unknown, 147 Unchecked, 2.3s Time] [2022-11-20 11:24:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6878 states. [2022-11-20 11:24:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6878 to 4239. [2022-11-20 11:24:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4239 states, 4210 states have (on average 4.419477434679335) internal successors, (18606), 4238 states have internal predecessors, (18606), 0 states have call successors, (0), 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-20 11:24:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 18606 transitions. [2022-11-20 11:24:49,426 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 18606 transitions. Word has length 30 [2022-11-20 11:24:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:49,426 INFO L495 AbstractCegarLoop]: Abstraction has 4239 states and 18606 transitions. [2022-11-20 11:24:49,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 11:24:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 18606 transitions. [2022-11-20 11:24:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:24:49,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:49,428 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:49,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (74)] Ended with exit code 0 [2022-11-20 11:24:49,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:49,629 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash -489894292, now seen corresponding path program 2 times [2022-11-20 11:24:49,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:49,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698379884] [2022-11-20 11:24:49,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:24:49,630 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-20 11:24:49,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:49,631 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:49,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (75)] Waiting until timeout for monitored process [2022-11-20 11:24:50,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:24:50,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:50,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 11:24:50,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:50,239 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:24:50,239 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:24:50,357 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:24:50,357 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:24:50,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:50,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:50,461 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:24:50,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:24:50,508 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:50,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-20 11:24:50,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:24:50,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:50,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698379884] [2022-11-20 11:24:50,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698379884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:24:50,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:24:50,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:24:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215732423] [2022-11-20 11:24:50,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:24:50,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:24:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:50,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:24:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:24:50,718 INFO L87 Difference]: Start difference. First operand 4239 states and 18606 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:51,042 INFO L93 Difference]: Finished difference Result 3817 states and 16892 transitions. [2022-11-20 11:24:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:24:51,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 11:24:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:51,053 INFO L225 Difference]: With dead ends: 3817 [2022-11-20 11:24:51,054 INFO L226 Difference]: Without dead ends: 3817 [2022-11-20 11:24:51,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:24:51,054 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:51,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:24:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2022-11-20 11:24:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3817. [2022-11-20 11:24:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3817 states, 3798 states have (on average 4.447604002106372) internal successors, (16892), 3816 states have internal predecessors, (16892), 0 states have call successors, (0), 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-20 11:24:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 16892 transitions. [2022-11-20 11:24:51,153 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 16892 transitions. Word has length 30 [2022-11-20 11:24:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:51,153 INFO L495 AbstractCegarLoop]: Abstraction has 3817 states and 16892 transitions. [2022-11-20 11:24:51,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:24:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 16892 transitions. [2022-11-20 11:24:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:24:51,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:51,155 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:51,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (75)] Forceful destruction successful, exit code 0 [2022-11-20 11:24:51,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:51,367 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash -489894439, now seen corresponding path program 2 times [2022-11-20 11:24:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:51,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644418372] [2022-11-20 11:24:51,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:24:51,369 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-20 11:24:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:51,370 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:51,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (76)] Waiting until timeout for monitored process [2022-11-20 11:24:52,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:24:52,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:24:52,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 11:24:52,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:52,354 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-20 11:24:52,354 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 3 case distinctions, treesize of input 15 treesize of output 50 [2022-11-20 11:24:52,470 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-20 11:24:52,470 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-20 11:24:52,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:52,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:52,569 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 11:24:52,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 11:24:52,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:24:52,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:52,635 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:24:52,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:24:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:52,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:54,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:54,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644418372] [2022-11-20 11:24:54,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644418372] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:24:54,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:54,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2022-11-20 11:24:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958113321] [2022-11-20 11:24:54,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:54,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:24:54,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:54,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:24:54,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:24:54,453 INFO L87 Difference]: Start difference. First operand 3817 states and 16892 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 11:24:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:24:56,605 INFO L93 Difference]: Finished difference Result 6339 states and 25469 transitions. [2022-11-20 11:24:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:24:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 11:24:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:24:56,622 INFO L225 Difference]: With dead ends: 6339 [2022-11-20 11:24:56,622 INFO L226 Difference]: Without dead ends: 6339 [2022-11-20 11:24:56,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-11-20 11:24:56,623 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 426 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:24:56,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 0 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 800 Invalid, 0 Unknown, 2 Unchecked, 1.9s Time] [2022-11-20 11:24:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2022-11-20 11:24:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 4239. [2022-11-20 11:24:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4239 states, 4220 states have (on average 4.508056872037915) internal successors, (19024), 4238 states have internal predecessors, (19024), 0 states have call successors, (0), 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-20 11:24:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 19024 transitions. [2022-11-20 11:24:56,737 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 19024 transitions. Word has length 30 [2022-11-20 11:24:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:24:56,737 INFO L495 AbstractCegarLoop]: Abstraction has 4239 states and 19024 transitions. [2022-11-20 11:24:56,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 11:24:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 19024 transitions. [2022-11-20 11:24:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 11:24:56,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:24:56,738 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:24:56,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (76)] Ended with exit code 0 [2022-11-20 11:24:56,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:56,939 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:24:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:24:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash 762654030, now seen corresponding path program 1 times [2022-11-20 11:24:56,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:24:56,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545844410] [2022-11-20 11:24:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:24:56,940 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-20 11:24:56,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:24:56,940 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:24:56,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (77)] Waiting until timeout for monitored process [2022-11-20 11:24:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:24:57,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 11:24:57,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:24:57,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:24:57,833 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:24:57,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:24:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:58,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:24:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:24:58,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:24:58,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545844410] [2022-11-20 11:24:58,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545844410] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:24:58,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:24:58,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-20 11:24:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621445615] [2022-11-20 11:24:58,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:24:58,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:24:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:24:58,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:24:58,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:24:58,923 INFO L87 Difference]: Start difference. First operand 4239 states and 19024 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 11:25:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:00,797 INFO L93 Difference]: Finished difference Result 6565 states and 27078 transitions. [2022-11-20 11:25:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:25:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 11:25:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:00,815 INFO L225 Difference]: With dead ends: 6565 [2022-11-20 11:25:00,815 INFO L226 Difference]: Without dead ends: 6565 [2022-11-20 11:25:00,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:25:00,816 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 472 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:00,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 0 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 794 Invalid, 0 Unknown, 95 Unchecked, 1.8s Time] [2022-11-20 11:25:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2022-11-20 11:25:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 4239. [2022-11-20 11:25:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4239 states, 4220 states have (on average 4.446208530805687) internal successors, (18763), 4238 states have internal predecessors, (18763), 0 states have call successors, (0), 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-20 11:25:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 18763 transitions. [2022-11-20 11:25:00,936 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 18763 transitions. Word has length 31 [2022-11-20 11:25:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:00,936 INFO L495 AbstractCegarLoop]: Abstraction has 4239 states and 18763 transitions. [2022-11-20 11:25:00,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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-20 11:25:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 18763 transitions. [2022-11-20 11:25:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 11:25:00,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:00,938 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:00,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (77)] Ended with exit code 0 [2022-11-20 11:25:01,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:01,139 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1993152832, now seen corresponding path program 3 times [2022-11-20 11:25:01,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:01,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874723748] [2022-11-20 11:25:01,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:25:01,140 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-20 11:25:01,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:01,141 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:01,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (78)] Waiting until timeout for monitored process [2022-11-20 11:25:02,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 11:25:02,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:02,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:25:02,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:02,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:02,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:02,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874723748] [2022-11-20 11:25:02,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874723748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:02,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:25:02,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-11-20 11:25:02,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589189153] [2022-11-20 11:25:02,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:02,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:25:02,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:02,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:25:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:25:02,337 INFO L87 Difference]: Start difference. First operand 4239 states and 18763 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:04,097 INFO L93 Difference]: Finished difference Result 5917 states and 22968 transitions. [2022-11-20 11:25:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:25:04,097 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 11:25:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:04,111 INFO L225 Difference]: With dead ends: 5917 [2022-11-20 11:25:04,111 INFO L226 Difference]: Without dead ends: 5885 [2022-11-20 11:25:04,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:25:04,112 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 440 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:04,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 0 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-20 11:25:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5885 states. [2022-11-20 11:25:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5885 to 3785. [2022-11-20 11:25:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3776 states have (on average 4.392478813559322) internal successors, (16586), 3784 states have internal predecessors, (16586), 0 states have call successors, (0), 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-20 11:25:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 16586 transitions. [2022-11-20 11:25:04,198 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 16586 transitions. Word has length 31 [2022-11-20 11:25:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:04,198 INFO L495 AbstractCegarLoop]: Abstraction has 3785 states and 16586 transitions. [2022-11-20 11:25:04,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 16586 transitions. [2022-11-20 11:25:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 11:25:04,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:04,200 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:04,218 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (78)] Ended with exit code 0 [2022-11-20 11:25:04,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:04,410 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2127601774, now seen corresponding path program 3 times [2022-11-20 11:25:04,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:04,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095831561] [2022-11-20 11:25:04,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:25:04,411 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-20 11:25:04,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:04,412 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:04,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (79)] Waiting until timeout for monitored process [2022-11-20 11:25:05,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-20 11:25:05,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:05,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:25:05,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:05,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:06,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:06,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095831561] [2022-11-20 11:25:06,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095831561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:06,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:25:06,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-11-20 11:25:06,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306327810] [2022-11-20 11:25:06,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:06,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:25:06,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:25:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:25:06,041 INFO L87 Difference]: Start difference. First operand 3785 states and 16586 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:07,908 INFO L93 Difference]: Finished difference Result 5162 states and 20716 transitions. [2022-11-20 11:25:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:25:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 11:25:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:07,924 INFO L225 Difference]: With dead ends: 5162 [2022-11-20 11:25:07,924 INFO L226 Difference]: Without dead ends: 5162 [2022-11-20 11:25:07,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:25:07,925 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:07,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 0 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 11:25:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2022-11-20 11:25:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 3314. [2022-11-20 11:25:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 3311 states have (on average 4.343098761703413) internal successors, (14380), 3313 states have internal predecessors, (14380), 0 states have call successors, (0), 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-20 11:25:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 14380 transitions. [2022-11-20 11:25:07,999 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 14380 transitions. Word has length 32 [2022-11-20 11:25:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:07,999 INFO L495 AbstractCegarLoop]: Abstraction has 3314 states and 14380 transitions. [2022-11-20 11:25:07,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 14380 transitions. [2022-11-20 11:25:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 11:25:08,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:08,001 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:08,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (79)] Ended with exit code 0 [2022-11-20 11:25:08,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:08,209 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:08,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:08,209 INFO L85 PathProgramCache]: Analyzing trace with hash -140818365, now seen corresponding path program 2 times [2022-11-20 11:25:08,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:08,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911680644] [2022-11-20 11:25:08,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:25:08,209 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-20 11:25:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:08,210 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:08,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (80)] Waiting until timeout for monitored process [2022-11-20 11:25:08,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:25:08,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:08,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 11:25:08,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:08,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:25:08,754 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:25:08,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:25:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-20 11:25:08,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:08,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:08,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911680644] [2022-11-20 11:25:08,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911680644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:08,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:08,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:08,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14762151] [2022-11-20 11:25:08,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:08,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:08,973 INFO L87 Difference]: Start difference. First operand 3314 states and 14380 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:09,217 INFO L93 Difference]: Finished difference Result 3064 states and 13360 transitions. [2022-11-20 11:25:09,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:09,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 11:25:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:09,226 INFO L225 Difference]: With dead ends: 3064 [2022-11-20 11:25:09,226 INFO L226 Difference]: Without dead ends: 3064 [2022-11-20 11:25:09,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:09,226 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:09,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2022-11-20 11:25:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3064. [2022-11-20 11:25:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 3062 states have (on average 4.363161332462443) internal successors, (13360), 3063 states have internal predecessors, (13360), 0 states have call successors, (0), 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-20 11:25:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 13360 transitions. [2022-11-20 11:25:09,278 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 13360 transitions. Word has length 32 [2022-11-20 11:25:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:09,278 INFO L495 AbstractCegarLoop]: Abstraction has 3064 states and 13360 transitions. [2022-11-20 11:25:09,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 13360 transitions. [2022-11-20 11:25:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 11:25:09,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:09,280 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:09,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (80)] Ended with exit code 0 [2022-11-20 11:25:09,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:09,487 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash -140818435, now seen corresponding path program 2 times [2022-11-20 11:25:09,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:09,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672078748] [2022-11-20 11:25:09,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:25:09,487 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-20 11:25:09,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:09,488 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:09,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (81)] Waiting until timeout for monitored process [2022-11-20 11:25:10,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:25:10,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:10,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 11:25:10,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:10,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 11:25:10,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:25:10,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:10,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:25:10,348 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:25:10,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 11:25:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:10,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:11,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:11,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672078748] [2022-11-20 11:25:11,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672078748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:11,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:25:11,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-20 11:25:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434722909] [2022-11-20 11:25:11,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:11,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:25:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:25:11,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:25:11,643 INFO L87 Difference]: Start difference. First operand 3064 states and 13360 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:14,708 INFO L93 Difference]: Finished difference Result 8744 states and 35220 transitions. [2022-11-20 11:25:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:25:14,708 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 11:25:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:14,729 INFO L225 Difference]: With dead ends: 8744 [2022-11-20 11:25:14,729 INFO L226 Difference]: Without dead ends: 8744 [2022-11-20 11:25:14,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:25:14,730 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 681 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:14,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 0 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 709 Invalid, 0 Unknown, 93 Unchecked, 2.1s Time] [2022-11-20 11:25:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8744 states. [2022-11-20 11:25:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8744 to 6064. [2022-11-20 11:25:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6064 states, 6062 states have (on average 4.470471791487958) internal successors, (27100), 6063 states have internal predecessors, (27100), 0 states have call successors, (0), 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-20 11:25:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6064 states to 6064 states and 27100 transitions. [2022-11-20 11:25:14,853 INFO L78 Accepts]: Start accepts. Automaton has 6064 states and 27100 transitions. Word has length 32 [2022-11-20 11:25:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:14,854 INFO L495 AbstractCegarLoop]: Abstraction has 6064 states and 27100 transitions. [2022-11-20 11:25:14,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6064 states and 27100 transitions. [2022-11-20 11:25:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:25:14,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:14,860 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:14,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (81)] Ended with exit code 0 [2022-11-20 11:25:15,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:15,070 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash 547349009, now seen corresponding path program 1 times [2022-11-20 11:25:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:15,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319859522] [2022-11-20 11:25:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:15,071 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-20 11:25:15,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:15,073 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:15,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (82)] Waiting until timeout for monitored process [2022-11-20 11:25:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 11:25:15,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:15,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:15,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319859522] [2022-11-20 11:25:15,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319859522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:15,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:15,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846820373] [2022-11-20 11:25:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:15,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:25:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:25:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:15,862 INFO L87 Difference]: Start difference. First operand 6064 states and 27100 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:16,592 INFO L93 Difference]: Finished difference Result 6479 states and 28440 transitions. [2022-11-20 11:25:16,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:25:16,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:25:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:16,610 INFO L225 Difference]: With dead ends: 6479 [2022-11-20 11:25:16,611 INFO L226 Difference]: Without dead ends: 6418 [2022-11-20 11:25:16,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:16,611 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:16,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:25:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6418 states. [2022-11-20 11:25:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6418 to 6092. [2022-11-20 11:25:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6092 states, 6090 states have (on average 4.4714285714285715) internal successors, (27231), 6091 states have internal predecessors, (27231), 0 states have call successors, (0), 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-20 11:25:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 27231 transitions. [2022-11-20 11:25:16,726 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 27231 transitions. Word has length 39 [2022-11-20 11:25:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:16,727 INFO L495 AbstractCegarLoop]: Abstraction has 6092 states and 27231 transitions. [2022-11-20 11:25:16,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 27231 transitions. [2022-11-20 11:25:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:25:16,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:16,733 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:16,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (82)] Ended with exit code 0 [2022-11-20 11:25:16,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:16,938 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash -715507537, now seen corresponding path program 2 times [2022-11-20 11:25:16,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:16,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417065462] [2022-11-20 11:25:16,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:25:16,939 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-20 11:25:16,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:16,939 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:16,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (83)] Waiting until timeout for monitored process [2022-11-20 11:25:17,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:25:17,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:17,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:25:17,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:17,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:17,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:17,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417065462] [2022-11-20 11:25:17,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417065462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:17,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:17,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675619733] [2022-11-20 11:25:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:17,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:25:17,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:25:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:17,738 INFO L87 Difference]: Start difference. First operand 6092 states and 27231 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:18,494 INFO L93 Difference]: Finished difference Result 7127 states and 31571 transitions. [2022-11-20 11:25:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:25:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:25:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:18,514 INFO L225 Difference]: With dead ends: 7127 [2022-11-20 11:25:18,514 INFO L226 Difference]: Without dead ends: 7096 [2022-11-20 11:25:18,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:18,514 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:18,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:25:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7096 states. [2022-11-20 11:25:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7096 to 6120. [2022-11-20 11:25:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6120 states, 6118 states have (on average 4.463223275580255) internal successors, (27306), 6119 states have internal predecessors, (27306), 0 states have call successors, (0), 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-20 11:25:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 27306 transitions. [2022-11-20 11:25:18,676 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 27306 transitions. Word has length 39 [2022-11-20 11:25:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:18,677 INFO L495 AbstractCegarLoop]: Abstraction has 6120 states and 27306 transitions. [2022-11-20 11:25:18,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 27306 transitions. [2022-11-20 11:25:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:25:18,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:18,681 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:18,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (83)] Ended with exit code 0 [2022-11-20 11:25:18,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:18,881 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:18,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:18,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2111025999, now seen corresponding path program 3 times [2022-11-20 11:25:18,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:18,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690110560] [2022-11-20 11:25:18,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:25:18,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-20 11:25:18,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:18,883 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:18,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (84)] Waiting until timeout for monitored process [2022-11-20 11:25:19,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 11:25:19,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:19,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 11:25:19,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:19,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:19,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690110560] [2022-11-20 11:25:19,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690110560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:19,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:19,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990856666] [2022-11-20 11:25:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:19,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:25:19,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:19,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:25:19,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:19,539 INFO L87 Difference]: Start difference. First operand 6120 states and 27306 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:20,305 INFO L93 Difference]: Finished difference Result 6449 states and 28247 transitions. [2022-11-20 11:25:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:25:20,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:25:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:20,324 INFO L225 Difference]: With dead ends: 6449 [2022-11-20 11:25:20,324 INFO L226 Difference]: Without dead ends: 6332 [2022-11-20 11:25:20,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:25:20,324 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:20,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:25:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6332 states. [2022-11-20 11:25:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 6120. [2022-11-20 11:25:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6120 states, 6118 states have (on average 4.454396861719516) internal successors, (27252), 6119 states have internal predecessors, (27252), 0 states have call successors, (0), 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-20 11:25:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 27252 transitions. [2022-11-20 11:25:20,439 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 27252 transitions. Word has length 39 [2022-11-20 11:25:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:20,440 INFO L495 AbstractCegarLoop]: Abstraction has 6120 states and 27252 transitions. [2022-11-20 11:25:20,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 27252 transitions. [2022-11-20 11:25:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:25:20,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:20,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:20,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (84)] Ended with exit code 0 [2022-11-20 11:25:20,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:20,645 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 387016589, now seen corresponding path program 4 times [2022-11-20 11:25:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656191140] [2022-11-20 11:25:20,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:25:20,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:25:20,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:20,646 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:20,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (85)] Waiting until timeout for monitored process [2022-11-20 11:25:21,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:25:21,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:21,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 11:25:21,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:21,423 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:21,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:21,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:21,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656191140] [2022-11-20 11:25:21,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656191140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:21,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:21,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:21,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609852790] [2022-11-20 11:25:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:21,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:25:21,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:21,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:25:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:21,424 INFO L87 Difference]: Start difference. First operand 6120 states and 27252 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:21,915 INFO L93 Difference]: Finished difference Result 6209 states and 27512 transitions. [2022-11-20 11:25:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:21,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:25:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:21,932 INFO L225 Difference]: With dead ends: 6209 [2022-11-20 11:25:21,932 INFO L226 Difference]: Without dead ends: 6148 [2022-11-20 11:25:21,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:25:21,933 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:21,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:25:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6148 states. [2022-11-20 11:25:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6148 to 6120. [2022-11-20 11:25:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6120 states, 6118 states have (on average 4.449820202680614) internal successors, (27224), 6119 states have internal predecessors, (27224), 0 states have call successors, (0), 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-20 11:25:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 27224 transitions. [2022-11-20 11:25:22,049 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 27224 transitions. Word has length 39 [2022-11-20 11:25:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:22,050 INFO L495 AbstractCegarLoop]: Abstraction has 6120 states and 27224 transitions. [2022-11-20 11:25:22,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 27224 transitions. [2022-11-20 11:25:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:25:22,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:22,054 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:22,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (85)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:22,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:22,255 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash -875839957, now seen corresponding path program 5 times [2022-11-20 11:25:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:22,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2632052] [2022-11-20 11:25:22,256 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:25:22,256 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-20 11:25:22,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:22,257 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:22,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (86)] Waiting until timeout for monitored process [2022-11-20 11:25:23,229 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-20 11:25:23,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:23,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:25:23,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:23,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:23,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:23,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2632052] [2022-11-20 11:25:23,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2632052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:23,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:23,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:25:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669694650] [2022-11-20 11:25:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:23,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:23,290 INFO L87 Difference]: Start difference. First operand 6120 states and 27224 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:23,601 INFO L93 Difference]: Finished difference Result 6795 states and 29307 transitions. [2022-11-20 11:25:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:23,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:25:23,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:23,619 INFO L225 Difference]: With dead ends: 6795 [2022-11-20 11:25:23,619 INFO L226 Difference]: Without dead ends: 6764 [2022-11-20 11:25:23,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:23,620 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:23,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:25:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2022-11-20 11:25:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 6680. [2022-11-20 11:25:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6680 states, 6678 states have (on average 4.292602575621443) internal successors, (28666), 6679 states have internal predecessors, (28666), 0 states have call successors, (0), 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-20 11:25:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 28666 transitions. [2022-11-20 11:25:23,736 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 28666 transitions. Word has length 39 [2022-11-20 11:25:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:23,737 INFO L495 AbstractCegarLoop]: Abstraction has 6680 states and 28666 transitions. [2022-11-20 11:25:23,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 28666 transitions. [2022-11-20 11:25:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:25:23,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:23,742 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:23,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (86)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:23,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:23,942 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1745860168, now seen corresponding path program 1 times [2022-11-20 11:25:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:23,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102107028] [2022-11-20 11:25:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:23,943 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-20 11:25:23,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:23,944 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:23,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (87)] Waiting until timeout for monitored process [2022-11-20 11:25:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:24,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:25:24,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:24,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:25:24,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:24,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102107028] [2022-11-20 11:25:24,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102107028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:24,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:24,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354631212] [2022-11-20 11:25:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:24,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:24,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:24,746 INFO L87 Difference]: Start difference. First operand 6680 states and 28666 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:25,417 INFO L93 Difference]: Finished difference Result 7142 states and 30346 transitions. [2022-11-20 11:25:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:25,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 11:25:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:25,436 INFO L225 Difference]: With dead ends: 7142 [2022-11-20 11:25:25,436 INFO L226 Difference]: Without dead ends: 7142 [2022-11-20 11:25:25,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:25:25,436 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:25,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:25:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7142 states. [2022-11-20 11:25:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7142 to 6876. [2022-11-20 11:25:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6876 states, 6874 states have (on average 4.2913878382310156) internal successors, (29499), 6875 states have internal predecessors, (29499), 0 states have call successors, (0), 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-20 11:25:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6876 states to 6876 states and 29499 transitions. [2022-11-20 11:25:25,573 INFO L78 Accepts]: Start accepts. Automaton has 6876 states and 29499 transitions. Word has length 40 [2022-11-20 11:25:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:25,573 INFO L495 AbstractCegarLoop]: Abstraction has 6876 states and 29499 transitions. [2022-11-20 11:25:25,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6876 states and 29499 transitions. [2022-11-20 11:25:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:25:25,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:25,579 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:25,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (87)] Ended with exit code 0 [2022-11-20 11:25:25,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:25,794 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:25,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1070522444, now seen corresponding path program 2 times [2022-11-20 11:25:25,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:25,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979495046] [2022-11-20 11:25:25,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:25:25,795 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-20 11:25:25,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:25,796 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:25,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (88)] Waiting until timeout for monitored process [2022-11-20 11:25:26,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:25:26,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:26,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:25:26,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:26,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:26,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:26,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979495046] [2022-11-20 11:25:26,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979495046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:26,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:25:26,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-20 11:25:26,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896238224] [2022-11-20 11:25:26,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:26,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:25:26,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:26,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:25:26,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:26,674 INFO L87 Difference]: Start difference. First operand 6876 states and 29499 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:27,807 INFO L93 Difference]: Finished difference Result 7671 states and 32285 transitions. [2022-11-20 11:25:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:25:27,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 11:25:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:27,878 INFO L225 Difference]: With dead ends: 7671 [2022-11-20 11:25:27,878 INFO L226 Difference]: Without dead ends: 7490 [2022-11-20 11:25:27,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:25:27,879 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:27,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 11:25:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7490 states. [2022-11-20 11:25:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7490 to 6848. [2022-11-20 11:25:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6848 states, 6846 states have (on average 4.289804265264388) internal successors, (29368), 6847 states have internal predecessors, (29368), 0 states have call successors, (0), 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-20 11:25:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 29368 transitions. [2022-11-20 11:25:28,024 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 29368 transitions. Word has length 40 [2022-11-20 11:25:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:28,025 INFO L495 AbstractCegarLoop]: Abstraction has 6848 states and 29368 transitions. [2022-11-20 11:25:28,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 29368 transitions. [2022-11-20 11:25:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:25:28,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:28,032 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:28,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (88)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:28,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:28,233 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1396118668, now seen corresponding path program 3 times [2022-11-20 11:25:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:28,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626477763] [2022-11-20 11:25:28,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:25:28,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:25:28,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:28,235 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:28,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (89)] Waiting until timeout for monitored process [2022-11-20 11:25:28,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 11:25:28,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:25:28,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:25:28,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:28,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:25:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 11:25:28,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:25:28,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626477763] [2022-11-20 11:25:28,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626477763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:25:28,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:25:28,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-11-20 11:25:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776246040] [2022-11-20 11:25:28,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:25:28,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:25:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:25:28,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:25:28,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:25:28,962 INFO L87 Difference]: Start difference. First operand 6848 states and 29368 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:29,827 INFO L93 Difference]: Finished difference Result 7197 states and 30551 transitions. [2022-11-20 11:25:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:25:29,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 11:25:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:29,846 INFO L225 Difference]: With dead ends: 7197 [2022-11-20 11:25:29,846 INFO L226 Difference]: Without dead ends: 7016 [2022-11-20 11:25:29,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:25:29,847 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:29,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 11:25:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2022-11-20 11:25:30,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 6680. [2022-11-20 11:25:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6680 states, 6678 states have (on average 4.267445342917041) internal successors, (28498), 6679 states have internal predecessors, (28498), 0 states have call successors, (0), 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-20 11:25:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 28498 transitions. [2022-11-20 11:25:30,033 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 28498 transitions. Word has length 40 [2022-11-20 11:25:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:30,033 INFO L495 AbstractCegarLoop]: Abstraction has 6680 states and 28498 transitions. [2022-11-20 11:25:30,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:25:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 28498 transitions. [2022-11-20 11:25:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 11:25:30,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:30,039 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:30,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (89)] Forceful destruction successful, exit code 0 [2022-11-20 11:25:30,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:30,239 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 11:25:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1262150169, now seen corresponding path program 1 times [2022-11-20 11:25:30,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:25:30,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318535234] [2022-11-20 11:25:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:30,240 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-20 11:25:30,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:25:30,241 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -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-20 11:25:30,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa4d2bef-eca1-44b9-9883-490a2f570a6d/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (90)] Waiting until timeout for monitored process [2022-11-20 11:25:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:31,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 11:25:31,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:25:31,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:31,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:31,598 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 18 treesize of output 16 [2022-11-20 11:25:32,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:32,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:32,740 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:25:32,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 170 [2022-11-20 11:25:33,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:33,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:33,308 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:25:33,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 170 [2022-11-20 11:25:35,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:25:35,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:25:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:25:35,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:25:35,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:25:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:25:35,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:25:35,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:25:35,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:25:36,362 INFO L321 Elim1Store]: treesize reduction 64, result has 63.0 percent of original size [2022-11-20 11:25:36,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 10 disjoint index pairs (out of 276 index pairs), introduced 16 new quantified variables, introduced 220 case distinctions, treesize of input 599 treesize of output 275 [2022-11-20 11:25:56,964 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_thread3Thread1of1ForFork2_~i~2#1| (_ bv1 32)) (= |c_thread2Thread1of1ForFork0_~i~1#1| (_ bv1 32)) (let ((.cse0 (= c_~result_10~0 (_ bv0 32)))) (or (and (not .cse0) (= (_ bv1 8) |c_thread2Thread1of1ForFork0_~stop~1#1|)) (and .cse0 (= |c_thread2Thread1of1ForFork0_~stop~1#1| (_ bv0 8))))) (or (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse6 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse2 (concat (concat .cse6 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse1 (concat (concat .cse6 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse1) .cse2)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse5 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse3 (bvneg .cse5))) (let ((.cse4 (bvmul (_ bv4294967295 32) .cse3))) (and (= (bvadd .cse2 .cse3) c_~result_13~0) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse4)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse5))) (bvsle (bvadd .cse4 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse5)) (bvsge .cse5 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse1 .cse3))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse14 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse13 (concat .cse14 v_arrayElimCell_222)) (.cse7 (concat .cse14 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse10 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse8 (bvneg .cse10))) (let ((.cse12 (bvmul (_ bv4294967295 32) .cse8))) (let ((.cse9 (bvadd c_~result_10~0 .cse12)) (.cse11 (bvadd (_ bv2147483647 32) .cse10))) (and (= c_~result_13~0 (bvadd .cse7 .cse8)) (bvsge ((_ sign_extend 32) .cse9) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse10))) (bvsle .cse9 .cse11) (bvsle (bvadd .cse12 c_~result_13~0) .cse11) (= c_~result_10~0 (bvadd .cse13 .cse8)))))))) (= (bvadd (bvneg .cse13) .cse7) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse15) .cse15) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse18 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse19 (bvneg .cse18))) (let ((.cse17 (bvmul (_ bv4294967295 32) .cse19)) (.cse16 (bvadd .cse15 .cse19))) (and (= c_~result_13~0 .cse16) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse17)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse18))) (bvsle (bvadd .cse17 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse18)) (bvsge .cse18 (_ bv0 32)) (= c_~result_10~0 .cse16))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse24 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse23 (concat .cse24 v_arrayElimCell_222)) (.cse20 (concat .cse24 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse22 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse21 (bvneg .cse22))) (and (= c_~result_13~0 (bvadd .cse20 .cse21)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse21))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse22))) (bvsge .cse22 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse23 .cse21)))))) (= (bvadd (bvneg .cse23) .cse20) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse26 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse25 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse25) .cse26) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse28 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse29 (bvneg .cse28))) (let ((.cse27 (bvmul (_ bv4294967295 32) .cse29))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse27)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse28))) (bvsle (bvadd .cse27 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse28)) (bvsge .cse28 (_ bv0 32)) (= (bvadd .cse29 .cse26) c_~result_13~0) (= c_~result_10~0 (bvadd .cse25 .cse29)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse37 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse34 (concat (concat .cse37 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse36 (concat (concat .cse37 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse31 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse35 (bvneg .cse31))) (let ((.cse33 (bvmul (_ bv4294967295 32) .cse35))) (let ((.cse30 (bvadd c_~result_10~0 .cse33)) (.cse32 (bvadd (_ bv2147483647 32) .cse31))) (and (bvsge ((_ sign_extend 32) .cse30) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse31))) (bvsle .cse30 .cse32) (bvsle (bvadd .cse33 c_~result_13~0) .cse32) (= c_~result_10~0 (bvadd .cse34 .cse35)) (= c_~result_13~0 (bvadd .cse36 .cse35)))))))) (= (bvadd (bvneg .cse34) .cse36) c_~result_7~0))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse39 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse38 (bvneg .cse39))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse38) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse39))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse43 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse42 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse40 (bvneg .cse42))) (let ((.cse41 (bvmul (_ bv4294967295 32) .cse40))) (and (= c_~result_10~0 (bvadd .cse39 .cse40)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse41)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse42))) (bvsle (bvadd .cse41 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse42)) (bvsge .cse42 (_ bv0 32)) (= (bvadd .cse40 .cse43) c_~result_13~0)))))) (= (bvadd .cse38 .cse43) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse44 (bvneg .cse45))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse44) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse45))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse46 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse44 .cse46) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse49 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse47 (bvneg .cse49))) (let ((.cse51 (bvmul (_ bv4294967295 32) .cse47))) (let ((.cse48 (bvadd c_~result_10~0 .cse51)) (.cse50 (bvadd (_ bv2147483647 32) .cse49))) (and (= c_~result_10~0 (bvadd .cse45 .cse47)) (bvsge ((_ sign_extend 32) .cse48) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse49))) (bvsle .cse48 .cse50) (bvsle (bvadd .cse51 c_~result_13~0) .cse50) (= (bvadd .cse47 .cse46) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse53 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse52 (bvneg .cse53))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse52) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse53))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse54 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse57 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse55 (bvneg .cse57))) (let ((.cse56 (bvmul (_ bv4294967295 32) .cse55))) (and (= c_~result_13~0 (bvadd .cse54 .cse55)) (= c_~result_10~0 (bvadd .cse53 .cse55)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse56)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse57))) (bvsle (bvadd .cse56 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse57)) (bvsge .cse57 (_ bv0 32))))))) (= (bvadd .cse54 .cse52) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse59 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse58 (bvneg .cse59))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse58) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse59))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse63 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse60 (bvneg .cse62))) (let ((.cse61 (bvmul (_ bv4294967295 32) .cse60))) (and (= c_~result_10~0 (bvadd .cse59 .cse60)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse61)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse62))) (bvsle (bvadd .cse61 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse62)) (bvsge .cse62 (_ bv0 32)) (= (bvadd .cse60 .cse63) c_~result_13~0)))))) (= (bvadd .cse58 .cse63) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse64 (bvneg .cse65))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse64) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse65))) (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse66 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse66 .cse64) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse69 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse67 (bvneg .cse69))) (let ((.cse68 (bvmul (_ bv4294967295 32) .cse67))) (and (= c_~result_13~0 (bvadd .cse66 .cse67)) (= c_~result_10~0 (bvadd .cse65 .cse67)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse68)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse69))) (bvsle (bvadd .cse68 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse69)) (bvsge .cse69 (_ bv0 32)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse71 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse70 (bvneg .cse71))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse70) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse71))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse75 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse72 (bvneg .cse74))) (let ((.cse73 (bvmul (_ bv4294967295 32) .cse72))) (and (= c_~result_10~0 (bvadd .cse71 .cse72)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse73)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse74))) (bvsle (bvadd .cse73 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse74)) (bvsge .cse74 (_ bv0 32)) (= c_~result_13~0 (bvadd .cse75 .cse72))))))) (= (bvadd .cse75 .cse70) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse76 (bvneg .cse77))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse76) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse77))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse78 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse76 .cse78) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse81 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse79 (bvneg .cse81))) (let ((.cse83 (bvmul (_ bv4294967295 32) .cse79))) (let ((.cse80 (bvadd c_~result_10~0 .cse83)) (.cse82 (bvadd (_ bv2147483647 32) .cse81))) (and (= c_~result_10~0 (bvadd .cse77 .cse79)) (bvsge ((_ sign_extend 32) .cse80) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse81))) (bvsle .cse80 .cse82) (bvsle (bvadd .cse83 c_~result_13~0) .cse82) (= (bvadd .cse79 .cse78) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse84 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse88 (bvneg .cse84))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse87 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse86 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse85 (bvneg .cse86))) (and (= c_~result_10~0 (bvadd .cse84 .cse85)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse85))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse86))) (bvsge .cse86 (_ bv0 32)) (= (bvadd .cse85 .cse87) c_~result_13~0))))) (= (bvadd .cse88 .cse87) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse88) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse84))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse90 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse89 (bvneg .cse90))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse89) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse90))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse92 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse94 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse91 (bvneg .cse94))) (let ((.cse96 (bvmul (_ bv4294967295 32) .cse91))) (let ((.cse93 (bvadd c_~result_10~0 .cse96)) (.cse95 (bvadd (_ bv2147483647 32) .cse94))) (and (= c_~result_10~0 (bvadd .cse90 .cse91)) (= c_~result_13~0 (bvadd .cse92 .cse91)) (bvsge ((_ sign_extend 32) .cse93) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse94))) (bvsle .cse93 .cse95) (bvsle (bvadd .cse96 c_~result_13~0) .cse95))))))) (= (bvadd .cse92 .cse89) c_~result_7~0)))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse97 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse98 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse97 (bvneg .cse98)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse100 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse103 (bvneg .cse100))) (let ((.cse102 (bvmul (_ bv4294967295 32) .cse103))) (let ((.cse99 (bvadd c_~result_10~0 .cse102)) (.cse101 (bvadd (_ bv2147483647 32) .cse100))) (and (bvsge ((_ sign_extend 32) .cse99) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse100))) (bvsle .cse99 .cse101) (bvsle (bvadd .cse102 c_~result_13~0) .cse101) (= (bvadd .cse97 .cse103) c_~result_13~0) (= c_~result_10~0 (bvadd .cse98 .cse103))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse104 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse105 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse104 (bvneg .cse105)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse108 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse106 (bvneg .cse108))) (let ((.cse107 (bvmul (_ bv4294967295 32) .cse106))) (and (= c_~result_13~0 (bvadd .cse104 .cse106)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse107)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse108))) (bvsle (bvadd .cse107 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse108)) (bvsge .cse108 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse105 .cse106)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse110 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse109 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse109) .cse110) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse111 (bvneg .cse112))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse111))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse112))) (bvsge .cse112 (_ bv0 32)) (= (bvadd .cse111 .cse110) c_~result_13~0) (= c_~result_10~0 (bvadd .cse109 .cse111))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse116 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse114 (bvneg .cse116))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse113 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse113 .cse114) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse117 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse115 (bvneg .cse117))) (and (= c_~result_13~0 (bvadd .cse113 .cse115)) (= c_~result_10~0 (bvadd .cse116 .cse115)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse115))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse117))) (bvsge .cse117 (_ bv0 32))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse114) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse116))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse119 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse118 (bvneg .cse119))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse118) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse119))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse120 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse120 .cse118) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse123 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse121 (bvneg .cse123))) (let ((.cse125 (bvmul (_ bv4294967295 32) .cse121))) (let ((.cse122 (bvadd c_~result_10~0 .cse125)) (.cse124 (bvadd (_ bv2147483647 32) .cse123))) (and (= c_~result_10~0 (bvadd .cse119 .cse121)) (bvsge ((_ sign_extend 32) .cse122) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse123))) (bvsle .cse122 .cse124) (bvsle (bvadd .cse125 c_~result_13~0) .cse124) (= (bvadd .cse120 .cse121) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse126 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse132 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse129 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse127 (bvneg .cse129))) (let ((.cse131 (bvmul (_ bv4294967295 32) .cse127))) (let ((.cse128 (bvadd c_~result_10~0 .cse131)) (.cse130 (bvadd (_ bv2147483647 32) .cse129))) (and (= c_~result_13~0 (bvadd .cse126 .cse127)) (bvsge ((_ sign_extend 32) .cse128) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse129))) (bvsle .cse128 .cse130) (bvsle (bvadd .cse131 c_~result_13~0) .cse130) (= c_~result_10~0 (bvadd .cse132 .cse127)))))))) (= (bvadd .cse126 (bvneg .cse132)) c_~result_7~0)))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse134 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse133 (bvneg .cse134))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse133) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse134))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse135 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse135 .cse133) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse138 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse136 (bvneg .cse138))) (let ((.cse140 (bvmul (_ bv4294967295 32) .cse136))) (let ((.cse137 (bvadd c_~result_10~0 .cse140)) (.cse139 (bvadd (_ bv2147483647 32) .cse138))) (and (= (bvadd .cse135 .cse136) c_~result_13~0) (= c_~result_10~0 (bvadd .cse134 .cse136)) (bvsge ((_ sign_extend 32) .cse137) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse138))) (bvsle .cse137 .cse139) (bvsle (bvadd .cse140 c_~result_13~0) .cse139)))))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse141 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse141) .cse141) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse144 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse143 (bvneg .cse144))) (let ((.cse142 (bvadd .cse141 .cse143))) (and (= c_~result_13~0 .cse142) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse143))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse144))) (bvsge .cse144 (_ bv0 32)) (= c_~result_10~0 .cse142))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse146 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228)) (.cse145 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse145) .cse146) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse148 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse149 (bvneg .cse148))) (let ((.cse147 (bvmul (_ bv4294967295 32) .cse149))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse147)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse148))) (bvsle (bvadd .cse147 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse148)) (bvsge .cse148 (_ bv0 32)) (= (bvadd .cse149 .cse146) c_~result_13~0) (= c_~result_10~0 (bvadd .cse145 .cse149)))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse151 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse150 (bvneg .cse151))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse150) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse151))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse154 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse153 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse152 (bvneg .cse153))) (and (= c_~result_10~0 (bvadd .cse151 .cse152)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse152))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse153))) (bvsge .cse153 (_ bv0 32)) (= c_~result_13~0 (bvadd .cse154 .cse152)))))) (= (bvadd .cse154 .cse150) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse156 (bvneg .cse158))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse155 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse155 .cse156) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse159 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse157 (bvneg .cse159))) (and (= c_~result_13~0 (bvadd .cse155 .cse157)) (= c_~result_10~0 (bvadd .cse158 .cse157)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse157))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse159))) (bvsge .cse159 (_ bv0 32))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse156) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse158))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse164 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse162 (concat (concat .cse164 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse163 (concat (concat .cse164 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse161 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse160 (bvneg .cse161))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse160))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse161))) (bvsge .cse161 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse162 .cse160)) (= c_~result_13~0 (bvadd .cse163 .cse160)))))) (= (bvadd (bvneg .cse162) .cse163) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse170 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse167 (concat (concat .cse170 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse169 (concat (concat .cse170 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse166 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse168 (bvneg .cse166))) (let ((.cse165 (bvmul (_ bv4294967295 32) .cse168))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse165)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse166))) (bvsle (bvadd .cse165 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse166)) (bvsge .cse166 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse167 .cse168)) (= c_~result_13~0 (bvadd .cse169 .cse168))))))) (= (bvadd (bvneg .cse167) .cse169) c_~result_7~0))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse176 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse172 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse175 (bvneg .cse172))) (let ((.cse174 (bvmul (_ bv4294967295 32) .cse175))) (let ((.cse171 (bvadd c_~result_10~0 .cse174)) (.cse173 (bvadd (_ bv2147483647 32) .cse172))) (and (bvsge ((_ sign_extend 32) .cse171) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse172))) (bvsle .cse171 .cse173) (bvsle (bvadd .cse174 c_~result_13~0) .cse173) (= (bvadd .cse175 .cse176) c_~result_13~0) (= c_~result_10~0 (bvadd .cse177 .cse175)))))))) (= (bvadd (bvneg .cse177) .cse176) c_~result_7~0)))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse179 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228)) (.cse178 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse178) .cse179) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse181 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse180 (bvneg .cse181))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse180))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse181))) (bvsge .cse181 (_ bv0 32)) (= (bvadd .cse180 .cse179) c_~result_13~0) (= c_~result_10~0 (bvadd .cse178 .cse180))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse183 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse182 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse182) .cse183) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse185 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse188 (bvneg .cse185))) (let ((.cse187 (bvmul (_ bv4294967295 32) .cse188))) (let ((.cse184 (bvadd c_~result_10~0 .cse187)) (.cse186 (bvadd (_ bv2147483647 32) .cse185))) (and (bvsge ((_ sign_extend 32) .cse184) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse185))) (bvsle .cse184 .cse186) (bvsle (bvadd .cse187 c_~result_13~0) .cse186) (= (bvadd .cse188 .cse183) c_~result_13~0) (= c_~result_10~0 (bvadd .cse182 .cse188))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse189 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse189) .cse189) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse192 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse193 (bvneg .cse192))) (let ((.cse191 (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse193))) (.cse190 (bvadd .cse189 .cse193))) (and (= c_~result_13~0 .cse190) (bvsge ((_ sign_extend 32) .cse191) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse192))) (bvsle .cse191 (bvadd (_ bv2147483647 32) .cse192)) (= c_~result_10~0 .cse190))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse199 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse198 (concat .cse199 v_arrayElimCell_222)) (.cse194 (concat .cse199 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse197 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse195 (bvneg .cse197))) (let ((.cse196 (bvmul (_ bv4294967295 32) .cse195))) (and (= c_~result_13~0 (bvadd .cse194 .cse195)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse196)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse197))) (bvsle (bvadd .cse196 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse197)) (bvsge .cse197 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse198 .cse195))))))) (= (bvadd (bvneg .cse198) .cse194) c_~result_7~0))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse204 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse201 (concat (concat .cse204 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse200 (concat (concat .cse204 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse200) .cse201)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse203 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse202 (bvneg .cse203))) (and (= (bvadd .cse201 .cse202) c_~result_13~0) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse202))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse203))) (bvsge .cse203 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse200 .cse202)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse205 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse206 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse205 (bvneg .cse206)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse208 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse209 (bvneg .cse208))) (let ((.cse207 (bvmul (_ bv4294967295 32) .cse209))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse207)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse208))) (bvsle (bvadd .cse207 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse208)) (bvsge .cse208 (_ bv0 32)) (= (bvadd .cse205 .cse209) c_~result_13~0) (= c_~result_10~0 (bvadd .cse206 .cse209)))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse213 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse211 (bvneg .cse213))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse210 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse210 .cse211) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse215 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse212 (bvneg .cse215))) (let ((.cse217 (bvmul (_ bv4294967295 32) .cse212))) (let ((.cse214 (bvadd c_~result_10~0 .cse217)) (.cse216 (bvadd (_ bv2147483647 32) .cse215))) (and (= c_~result_13~0 (bvadd .cse210 .cse212)) (= c_~result_10~0 (bvadd .cse213 .cse212)) (bvsge ((_ sign_extend 32) .cse214) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse215))) (bvsle .cse214 .cse216) (bvsle (bvadd .cse217 c_~result_13~0) .cse216)))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse211) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse213))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse218 (bvneg .cse219))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse218) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse219))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse220 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse220 .cse218) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse223 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse221 (bvneg .cse223))) (let ((.cse222 (bvmul (_ bv4294967295 32) .cse221))) (and (= c_~result_10~0 (bvadd .cse219 .cse221)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse222)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse223))) (bvsle (bvadd .cse222 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse223)) (bvsge .cse223 (_ bv0 32)) (= (bvadd .cse220 .cse221) c_~result_13~0))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse224 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse231 (bvneg .cse224))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse230 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse227 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse225 (bvneg .cse227))) (let ((.cse229 (bvmul (_ bv4294967295 32) .cse225))) (let ((.cse226 (bvadd c_~result_10~0 .cse229)) (.cse228 (bvadd (_ bv2147483647 32) .cse227))) (and (= c_~result_10~0 (bvadd .cse224 .cse225)) (bvsge ((_ sign_extend 32) .cse226) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse227))) (bvsle .cse226 .cse228) (bvsle (bvadd .cse229 c_~result_13~0) .cse228) (= c_~result_13~0 (bvadd .cse230 .cse225)))))))) (= (bvadd .cse230 .cse231) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse231) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse224))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse232 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse237 (bvneg .cse232))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse234 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse236 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse233 (bvneg .cse236))) (let ((.cse235 (bvmul (_ bv4294967295 32) .cse233))) (and (= c_~result_10~0 (bvadd .cse232 .cse233)) (= c_~result_13~0 (bvadd .cse234 .cse233)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse235)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse236))) (bvsle (bvadd .cse235 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse236)) (bvsge .cse236 (_ bv0 32))))))) (= (bvadd .cse234 .cse237) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse237) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse232))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse241 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse239 (bvneg .cse241))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse238 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse238 .cse239) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse243 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse240 (bvneg .cse243))) (let ((.cse242 (bvmul (_ bv4294967295 32) .cse240))) (and (= (bvadd .cse238 .cse240) c_~result_13~0) (= c_~result_10~0 (bvadd .cse241 .cse240)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse242)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse243))) (bvsle (bvadd .cse242 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse243)) (bvsge .cse243 (_ bv0 32)))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse239) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse241))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse245 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse244 (bvneg .cse245))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse244) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse245))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse246 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse246 .cse244) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse249 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse247 (bvneg .cse249))) (let ((.cse251 (bvmul (_ bv4294967295 32) .cse247))) (let ((.cse248 (bvadd c_~result_10~0 .cse251)) (.cse250 (bvadd (_ bv2147483647 32) .cse249))) (and (= c_~result_13~0 (bvadd .cse246 .cse247)) (= c_~result_10~0 (bvadd .cse245 .cse247)) (bvsge ((_ sign_extend 32) .cse248) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse249))) (bvsle .cse248 .cse250) (bvsle (bvadd .cse251 c_~result_13~0) .cse250)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse252 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse256 (bvneg .cse252))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse255 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse254 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse253 (bvneg .cse254))) (and (= c_~result_10~0 (bvadd .cse252 .cse253)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse253))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse254))) (bvsge .cse254 (_ bv0 32)) (= (bvadd .cse253 .cse255) c_~result_13~0))))) (= (bvadd .cse256 .cse255) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse256) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse252))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse258 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse257 (bvneg .cse258))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse257) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse258))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse259 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse259 .cse257) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse260 (bvneg .cse261))) (and (= c_~result_10~0 (bvadd .cse258 .cse260)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse260))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse261))) (bvsge .cse261 (_ bv0 32)) (= (bvadd .cse259 .cse260) c_~result_13~0)))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse269 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse263 (concat (concat .cse269 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse262 (concat (concat .cse269 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse262) .cse263)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse266 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse264 (bvneg .cse266))) (let ((.cse268 (bvmul (_ bv4294967295 32) .cse264))) (let ((.cse265 (bvadd c_~result_10~0 .cse268)) (.cse267 (bvadd (_ bv2147483647 32) .cse266))) (and (= (bvadd .cse263 .cse264) c_~result_13~0) (bvsge ((_ sign_extend 32) .cse265) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse266))) (bvsle .cse265 .cse267) (bvsle (bvadd .cse268 c_~result_13~0) .cse267) (= c_~result_10~0 (bvadd .cse262 .cse264)))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse272 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse273 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse270 (bvneg .cse271))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse270))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse271))) (bvsge .cse271 (_ bv0 32)) (= (bvadd .cse272 .cse270) c_~result_13~0) (= c_~result_10~0 (bvadd .cse273 .cse270)))))) (= (bvadd .cse272 (bvneg .cse273)) c_~result_7~0)))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse274 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse275 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse274 (bvneg .cse275)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse277 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse276 (bvneg .cse277))) (and (= c_~result_13~0 (bvadd .cse274 .cse276)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse276))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse277))) (bvsge .cse277 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse275 .cse276))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse279 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse278 (bvneg .cse279))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse278) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse279))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse280 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse280 .cse278) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse282 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse281 (bvneg .cse282))) (and (= c_~result_10~0 (bvadd .cse279 .cse281)) (= c_~result_13~0 (bvadd .cse280 .cse281)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse281))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse282))) (bvsge .cse282 (_ bv0 32))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse284 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse283 (bvneg .cse284))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse283) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse284))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse285 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse285 .cse283) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse287 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse286 (bvneg .cse287))) (and (= (bvadd .cse285 .cse286) c_~result_13~0) (= c_~result_10~0 (bvadd .cse284 .cse286)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse286))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse287))) (bvsge .cse287 (_ bv0 32)))))))))))))) (let ((.cse288 (= c_~result_13~0 (_ bv0 32)))) (or (and (= (_ bv1 8) |c_thread3Thread1of1ForFork2_~stop~2#1|) (not .cse288)) (and (= |c_thread3Thread1of1ForFork2_~stop~2#1| (_ bv0 8)) .cse288))) (= (_ bv1 32) |c_thread1Thread1of1ForFork1_~i~0#1|)) is different from false [2022-11-20 11:26:08,658 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_thread3Thread1of1ForFork2_~i~2#1| (_ bv1 32)) (or (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse5 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse1 (concat (concat .cse5 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse0 (concat (concat .cse5 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse0) .cse1)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse2 (bvneg .cse4))) (let ((.cse3 (bvmul (_ bv4294967295 32) .cse2))) (and (= (bvadd .cse1 .cse2) c_~result_13~0) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse3)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse4))) (bvsle (bvadd .cse3 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse4)) (bvsge .cse4 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse0 .cse2))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse13 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse12 (concat .cse13 v_arrayElimCell_222)) (.cse6 (concat .cse13 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse7 (bvneg .cse9))) (let ((.cse11 (bvmul (_ bv4294967295 32) .cse7))) (let ((.cse8 (bvadd c_~result_10~0 .cse11)) (.cse10 (bvadd (_ bv2147483647 32) .cse9))) (and (= c_~result_13~0 (bvadd .cse6 .cse7)) (bvsge ((_ sign_extend 32) .cse8) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse9))) (bvsle .cse8 .cse10) (bvsle (bvadd .cse11 c_~result_13~0) .cse10) (= c_~result_10~0 (bvadd .cse12 .cse7)))))))) (= (bvadd (bvneg .cse12) .cse6) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse14 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse14) .cse14) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse17 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse18 (bvneg .cse17))) (let ((.cse16 (bvmul (_ bv4294967295 32) .cse18)) (.cse15 (bvadd .cse14 .cse18))) (and (= c_~result_13~0 .cse15) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse16)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse17))) (bvsle (bvadd .cse16 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse17)) (bvsge .cse17 (_ bv0 32)) (= c_~result_10~0 .cse15))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse23 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse22 (concat .cse23 v_arrayElimCell_222)) (.cse19 (concat .cse23 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse20 (bvneg .cse21))) (and (= c_~result_13~0 (bvadd .cse19 .cse20)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse20))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse21))) (bvsge .cse21 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse22 .cse20)))))) (= (bvadd (bvneg .cse22) .cse19) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse25 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse24 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse24) .cse25) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse27 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse28 (bvneg .cse27))) (let ((.cse26 (bvmul (_ bv4294967295 32) .cse28))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse26)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse27))) (bvsle (bvadd .cse26 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse27)) (bvsge .cse27 (_ bv0 32)) (= (bvadd .cse28 .cse25) c_~result_13~0) (= c_~result_10~0 (bvadd .cse24 .cse28)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse36 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse33 (concat (concat .cse36 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse35 (concat (concat .cse36 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse34 (bvneg .cse30))) (let ((.cse32 (bvmul (_ bv4294967295 32) .cse34))) (let ((.cse29 (bvadd c_~result_10~0 .cse32)) (.cse31 (bvadd (_ bv2147483647 32) .cse30))) (and (bvsge ((_ sign_extend 32) .cse29) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse30))) (bvsle .cse29 .cse31) (bvsle (bvadd .cse32 c_~result_13~0) .cse31) (= c_~result_10~0 (bvadd .cse33 .cse34)) (= c_~result_13~0 (bvadd .cse35 .cse34)))))))) (= (bvadd (bvneg .cse33) .cse35) c_~result_7~0))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse37 (bvneg .cse38))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse37) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse38))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse42 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse39 (bvneg .cse41))) (let ((.cse40 (bvmul (_ bv4294967295 32) .cse39))) (and (= c_~result_10~0 (bvadd .cse38 .cse39)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse40)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse41))) (bvsle (bvadd .cse40 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse41)) (bvsge .cse41 (_ bv0 32)) (= (bvadd .cse39 .cse42) c_~result_13~0)))))) (= (bvadd .cse37 .cse42) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse44 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse43 (bvneg .cse44))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse43) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse44))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse43 .cse45) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse48 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse46 (bvneg .cse48))) (let ((.cse50 (bvmul (_ bv4294967295 32) .cse46))) (let ((.cse47 (bvadd c_~result_10~0 .cse50)) (.cse49 (bvadd (_ bv2147483647 32) .cse48))) (and (= c_~result_10~0 (bvadd .cse44 .cse46)) (bvsge ((_ sign_extend 32) .cse47) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse48))) (bvsle .cse47 .cse49) (bvsle (bvadd .cse50 c_~result_13~0) .cse49) (= (bvadd .cse46 .cse45) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse51 (bvneg .cse52))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse51) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse52))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse53 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse56 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse54 (bvneg .cse56))) (let ((.cse55 (bvmul (_ bv4294967295 32) .cse54))) (and (= c_~result_13~0 (bvadd .cse53 .cse54)) (= c_~result_10~0 (bvadd .cse52 .cse54)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse55)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse56))) (bvsle (bvadd .cse55 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse56)) (bvsge .cse56 (_ bv0 32))))))) (= (bvadd .cse53 .cse51) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse58 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse57 (bvneg .cse58))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse57) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse58))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse61 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse59 (bvneg .cse61))) (let ((.cse60 (bvmul (_ bv4294967295 32) .cse59))) (and (= c_~result_10~0 (bvadd .cse58 .cse59)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse60)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse61))) (bvsle (bvadd .cse60 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse61)) (bvsge .cse61 (_ bv0 32)) (= (bvadd .cse59 .cse62) c_~result_13~0)))))) (= (bvadd .cse57 .cse62) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse63 (bvneg .cse64))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse63) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse64))) (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse65 .cse63) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse68 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse66 (bvneg .cse68))) (let ((.cse67 (bvmul (_ bv4294967295 32) .cse66))) (and (= c_~result_13~0 (bvadd .cse65 .cse66)) (= c_~result_10~0 (bvadd .cse64 .cse66)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse67)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse68))) (bvsle (bvadd .cse67 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse68)) (bvsge .cse68 (_ bv0 32)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse70 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse69 (bvneg .cse70))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse69) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse70))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse73 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse71 (bvneg .cse73))) (let ((.cse72 (bvmul (_ bv4294967295 32) .cse71))) (and (= c_~result_10~0 (bvadd .cse70 .cse71)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse72)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse73))) (bvsle (bvadd .cse72 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse73)) (bvsge .cse73 (_ bv0 32)) (= c_~result_13~0 (bvadd .cse74 .cse71))))))) (= (bvadd .cse74 .cse69) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse76 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse75 (bvneg .cse76))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse75) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse76))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse75 .cse77) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse80 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse78 (bvneg .cse80))) (let ((.cse82 (bvmul (_ bv4294967295 32) .cse78))) (let ((.cse79 (bvadd c_~result_10~0 .cse82)) (.cse81 (bvadd (_ bv2147483647 32) .cse80))) (and (= c_~result_10~0 (bvadd .cse76 .cse78)) (bvsge ((_ sign_extend 32) .cse79) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse80))) (bvsle .cse79 .cse81) (bvsle (bvadd .cse82 c_~result_13~0) .cse81) (= (bvadd .cse78 .cse77) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse87 (bvneg .cse83))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse86 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse84 (bvneg .cse85))) (and (= c_~result_10~0 (bvadd .cse83 .cse84)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse84))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse85))) (bvsge .cse85 (_ bv0 32)) (= (bvadd .cse84 .cse86) c_~result_13~0))))) (= (bvadd .cse87 .cse86) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse87) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse83))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse89 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse88 (bvneg .cse89))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse88) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse89))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse91 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse93 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse90 (bvneg .cse93))) (let ((.cse95 (bvmul (_ bv4294967295 32) .cse90))) (let ((.cse92 (bvadd c_~result_10~0 .cse95)) (.cse94 (bvadd (_ bv2147483647 32) .cse93))) (and (= c_~result_10~0 (bvadd .cse89 .cse90)) (= c_~result_13~0 (bvadd .cse91 .cse90)) (bvsge ((_ sign_extend 32) .cse92) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse93))) (bvsle .cse92 .cse94) (bvsle (bvadd .cse95 c_~result_13~0) .cse94))))))) (= (bvadd .cse91 .cse88) c_~result_7~0)))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse96 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse97 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse96 (bvneg .cse97)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse102 (bvneg .cse99))) (let ((.cse101 (bvmul (_ bv4294967295 32) .cse102))) (let ((.cse98 (bvadd c_~result_10~0 .cse101)) (.cse100 (bvadd (_ bv2147483647 32) .cse99))) (and (bvsge ((_ sign_extend 32) .cse98) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse99))) (bvsle .cse98 .cse100) (bvsle (bvadd .cse101 c_~result_13~0) .cse100) (= (bvadd .cse96 .cse102) c_~result_13~0) (= c_~result_10~0 (bvadd .cse97 .cse102))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse103 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse104 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse103 (bvneg .cse104)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse107 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse105 (bvneg .cse107))) (let ((.cse106 (bvmul (_ bv4294967295 32) .cse105))) (and (= c_~result_13~0 (bvadd .cse103 .cse105)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse106)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse107))) (bvsle (bvadd .cse106 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse107)) (bvsge .cse107 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse104 .cse105)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse109 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse108 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse108) .cse109) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse111 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse110 (bvneg .cse111))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse110))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse111))) (bvsge .cse111 (_ bv0 32)) (= (bvadd .cse110 .cse109) c_~result_13~0) (= c_~result_10~0 (bvadd .cse108 .cse110))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse115 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse113 (bvneg .cse115))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse112 .cse113) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse116 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse114 (bvneg .cse116))) (and (= c_~result_13~0 (bvadd .cse112 .cse114)) (= c_~result_10~0 (bvadd .cse115 .cse114)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse114))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse116))) (bvsge .cse116 (_ bv0 32))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse113) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse115))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse118 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse117 (bvneg .cse118))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse117) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse118))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse119 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse119 .cse117) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse122 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse120 (bvneg .cse122))) (let ((.cse124 (bvmul (_ bv4294967295 32) .cse120))) (let ((.cse121 (bvadd c_~result_10~0 .cse124)) (.cse123 (bvadd (_ bv2147483647 32) .cse122))) (and (= c_~result_10~0 (bvadd .cse118 .cse120)) (bvsge ((_ sign_extend 32) .cse121) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse122))) (bvsle .cse121 .cse123) (bvsle (bvadd .cse124 c_~result_13~0) .cse123) (= (bvadd .cse119 .cse120) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse131 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse126 (bvneg .cse128))) (let ((.cse130 (bvmul (_ bv4294967295 32) .cse126))) (let ((.cse127 (bvadd c_~result_10~0 .cse130)) (.cse129 (bvadd (_ bv2147483647 32) .cse128))) (and (= c_~result_13~0 (bvadd .cse125 .cse126)) (bvsge ((_ sign_extend 32) .cse127) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse128))) (bvsle .cse127 .cse129) (bvsle (bvadd .cse130 c_~result_13~0) .cse129) (= c_~result_10~0 (bvadd .cse131 .cse126)))))))) (= (bvadd .cse125 (bvneg .cse131)) c_~result_7~0)))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse133 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse132 (bvneg .cse133))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse132) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse133))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse134 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse134 .cse132) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse137 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse135 (bvneg .cse137))) (let ((.cse139 (bvmul (_ bv4294967295 32) .cse135))) (let ((.cse136 (bvadd c_~result_10~0 .cse139)) (.cse138 (bvadd (_ bv2147483647 32) .cse137))) (and (= (bvadd .cse134 .cse135) c_~result_13~0) (= c_~result_10~0 (bvadd .cse133 .cse135)) (bvsge ((_ sign_extend 32) .cse136) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse137))) (bvsle .cse136 .cse138) (bvsle (bvadd .cse139 c_~result_13~0) .cse138)))))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse140) .cse140) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse143 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse142 (bvneg .cse143))) (let ((.cse141 (bvadd .cse140 .cse142))) (and (= c_~result_13~0 .cse141) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse142))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse143))) (bvsge .cse143 (_ bv0 32)) (= c_~result_10~0 .cse141))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228)) (.cse144 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse144) .cse145) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse148 (bvneg .cse147))) (let ((.cse146 (bvmul (_ bv4294967295 32) .cse148))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse146)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse147))) (bvsle (bvadd .cse146 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse147)) (bvsge .cse147 (_ bv0 32)) (= (bvadd .cse148 .cse145) c_~result_13~0) (= c_~result_10~0 (bvadd .cse144 .cse148)))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse150 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse149 (bvneg .cse150))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse149) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse150))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse153 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse152 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse151 (bvneg .cse152))) (and (= c_~result_10~0 (bvadd .cse150 .cse151)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse151))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse152))) (bvsge .cse152 (_ bv0 32)) (= c_~result_13~0 (bvadd .cse153 .cse151)))))) (= (bvadd .cse153 .cse149) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse157 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse155 (bvneg .cse157))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse154 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse154 .cse155) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse156 (bvneg .cse158))) (and (= c_~result_13~0 (bvadd .cse154 .cse156)) (= c_~result_10~0 (bvadd .cse157 .cse156)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse156))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse158))) (bvsge .cse158 (_ bv0 32))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse155) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse157))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse163 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse161 (concat (concat .cse163 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse162 (concat (concat .cse163 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse160 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse159 (bvneg .cse160))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse159))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse160))) (bvsge .cse160 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse161 .cse159)) (= c_~result_13~0 (bvadd .cse162 .cse159)))))) (= (bvadd (bvneg .cse161) .cse162) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse169 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse166 (concat (concat .cse169 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse168 (concat (concat .cse169 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse167 (bvneg .cse165))) (let ((.cse164 (bvmul (_ bv4294967295 32) .cse167))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse164)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse165))) (bvsle (bvadd .cse164 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse165)) (bvsge .cse165 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse166 .cse167)) (= c_~result_13~0 (bvadd .cse168 .cse167))))))) (= (bvadd (bvneg .cse166) .cse168) c_~result_7~0))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse175 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse171 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse174 (bvneg .cse171))) (let ((.cse173 (bvmul (_ bv4294967295 32) .cse174))) (let ((.cse170 (bvadd c_~result_10~0 .cse173)) (.cse172 (bvadd (_ bv2147483647 32) .cse171))) (and (bvsge ((_ sign_extend 32) .cse170) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse171))) (bvsle .cse170 .cse172) (bvsle (bvadd .cse173 c_~result_13~0) .cse172) (= (bvadd .cse174 .cse175) c_~result_13~0) (= c_~result_10~0 (bvadd .cse176 .cse174)))))))) (= (bvadd (bvneg .cse176) .cse175) c_~result_7~0)))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse178 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228)) (.cse177 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse177) .cse178) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse180 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse179 (bvneg .cse180))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse179))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse180))) (bvsge .cse180 (_ bv0 32)) (= (bvadd .cse179 .cse178) c_~result_13~0) (= c_~result_10~0 (bvadd .cse177 .cse179))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse182 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse181 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse181) .cse182) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse184 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse187 (bvneg .cse184))) (let ((.cse186 (bvmul (_ bv4294967295 32) .cse187))) (let ((.cse183 (bvadd c_~result_10~0 .cse186)) (.cse185 (bvadd (_ bv2147483647 32) .cse184))) (and (bvsge ((_ sign_extend 32) .cse183) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse184))) (bvsle .cse183 .cse185) (bvsle (bvadd .cse186 c_~result_13~0) .cse185) (= (bvadd .cse187 .cse182) c_~result_13~0) (= c_~result_10~0 (bvadd .cse181 .cse187))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse188) .cse188) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse192 (bvneg .cse191))) (let ((.cse190 (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse192))) (.cse189 (bvadd .cse188 .cse192))) (and (= c_~result_13~0 .cse189) (bvsge ((_ sign_extend 32) .cse190) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse191))) (bvsle .cse190 (bvadd (_ bv2147483647 32) .cse191)) (= c_~result_10~0 .cse189))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse198 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse197 (concat .cse198 v_arrayElimCell_222)) (.cse193 (concat .cse198 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse196 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse194 (bvneg .cse196))) (let ((.cse195 (bvmul (_ bv4294967295 32) .cse194))) (and (= c_~result_13~0 (bvadd .cse193 .cse194)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse195)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse196))) (bvsle (bvadd .cse195 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse196)) (bvsge .cse196 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse197 .cse194))))))) (= (bvadd (bvneg .cse197) .cse193) c_~result_7~0))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse203 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse200 (concat (concat .cse203 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse199 (concat (concat .cse203 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse199) .cse200)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse201 (bvneg .cse202))) (and (= (bvadd .cse200 .cse201) c_~result_13~0) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse201))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse202))) (bvsge .cse202 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse199 .cse201)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse204 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse205 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse204 (bvneg .cse205)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse208 (bvneg .cse207))) (let ((.cse206 (bvmul (_ bv4294967295 32) .cse208))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse206)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse207))) (bvsle (bvadd .cse206 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse207)) (bvsge .cse207 (_ bv0 32)) (= (bvadd .cse204 .cse208) c_~result_13~0) (= c_~result_10~0 (bvadd .cse205 .cse208)))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse212 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse210 (bvneg .cse212))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse209 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse209 .cse210) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse214 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse211 (bvneg .cse214))) (let ((.cse216 (bvmul (_ bv4294967295 32) .cse211))) (let ((.cse213 (bvadd c_~result_10~0 .cse216)) (.cse215 (bvadd (_ bv2147483647 32) .cse214))) (and (= c_~result_13~0 (bvadd .cse209 .cse211)) (= c_~result_10~0 (bvadd .cse212 .cse211)) (bvsge ((_ sign_extend 32) .cse213) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse214))) (bvsle .cse213 .cse215) (bvsle (bvadd .cse216 c_~result_13~0) .cse215)))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse210) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse212))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse218 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse217 (bvneg .cse218))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse217) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse218))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse219 .cse217) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse222 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse220 (bvneg .cse222))) (let ((.cse221 (bvmul (_ bv4294967295 32) .cse220))) (and (= c_~result_10~0 (bvadd .cse218 .cse220)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse221)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse222))) (bvsle (bvadd .cse221 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse222)) (bvsge .cse222 (_ bv0 32)) (= (bvadd .cse219 .cse220) c_~result_13~0))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse223 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse230 (bvneg .cse223))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse224 (bvneg .cse226))) (let ((.cse228 (bvmul (_ bv4294967295 32) .cse224))) (let ((.cse225 (bvadd c_~result_10~0 .cse228)) (.cse227 (bvadd (_ bv2147483647 32) .cse226))) (and (= c_~result_10~0 (bvadd .cse223 .cse224)) (bvsge ((_ sign_extend 32) .cse225) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse226))) (bvsle .cse225 .cse227) (bvsle (bvadd .cse228 c_~result_13~0) .cse227) (= c_~result_13~0 (bvadd .cse229 .cse224)))))))) (= (bvadd .cse229 .cse230) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse230) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse223))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse231 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse236 (bvneg .cse231))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse235 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse232 (bvneg .cse235))) (let ((.cse234 (bvmul (_ bv4294967295 32) .cse232))) (and (= c_~result_10~0 (bvadd .cse231 .cse232)) (= c_~result_13~0 (bvadd .cse233 .cse232)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse234)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse235))) (bvsle (bvadd .cse234 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse235)) (bvsge .cse235 (_ bv0 32))))))) (= (bvadd .cse233 .cse236) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse236) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse231))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse240 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse238 (bvneg .cse240))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse237 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse237 .cse238) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse242 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse239 (bvneg .cse242))) (let ((.cse241 (bvmul (_ bv4294967295 32) .cse239))) (and (= (bvadd .cse237 .cse239) c_~result_13~0) (= c_~result_10~0 (bvadd .cse240 .cse239)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse241)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse242))) (bvsle (bvadd .cse241 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse242)) (bvsge .cse242 (_ bv0 32)))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse238) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse240))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse243 (bvneg .cse244))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse243) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse244))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse245 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse245 .cse243) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse246 (bvneg .cse248))) (let ((.cse250 (bvmul (_ bv4294967295 32) .cse246))) (let ((.cse247 (bvadd c_~result_10~0 .cse250)) (.cse249 (bvadd (_ bv2147483647 32) .cse248))) (and (= c_~result_13~0 (bvadd .cse245 .cse246)) (= c_~result_10~0 (bvadd .cse244 .cse246)) (bvsge ((_ sign_extend 32) .cse247) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse248))) (bvsle .cse247 .cse249) (bvsle (bvadd .cse250 c_~result_13~0) .cse249)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse251 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse255 (bvneg .cse251))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse254 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse253 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse252 (bvneg .cse253))) (and (= c_~result_10~0 (bvadd .cse251 .cse252)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse252))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse253))) (bvsge .cse253 (_ bv0 32)) (= (bvadd .cse252 .cse254) c_~result_13~0))))) (= (bvadd .cse255 .cse254) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse255) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse251))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse257 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse256 (bvneg .cse257))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse256) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse257))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse258 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse258 .cse256) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse260 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse259 (bvneg .cse260))) (and (= c_~result_10~0 (bvadd .cse257 .cse259)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse259))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse260))) (bvsge .cse260 (_ bv0 32)) (= (bvadd .cse258 .cse259) c_~result_13~0)))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse268 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse262 (concat (concat .cse268 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse261 (concat (concat .cse268 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse261) .cse262)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse265 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse263 (bvneg .cse265))) (let ((.cse267 (bvmul (_ bv4294967295 32) .cse263))) (let ((.cse264 (bvadd c_~result_10~0 .cse267)) (.cse266 (bvadd (_ bv2147483647 32) .cse265))) (and (= (bvadd .cse262 .cse263) c_~result_13~0) (bvsge ((_ sign_extend 32) .cse264) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse265))) (bvsle .cse264 .cse266) (bvsle (bvadd .cse267 c_~result_13~0) .cse266) (= c_~result_10~0 (bvadd .cse261 .cse263)))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse272 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse270 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse269 (bvneg .cse270))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse269))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse270))) (bvsge .cse270 (_ bv0 32)) (= (bvadd .cse271 .cse269) c_~result_13~0) (= c_~result_10~0 (bvadd .cse272 .cse269)))))) (= (bvadd .cse271 (bvneg .cse272)) c_~result_7~0)))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse273 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse274 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse273 (bvneg .cse274)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse276 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse275 (bvneg .cse276))) (and (= c_~result_13~0 (bvadd .cse273 .cse275)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse275))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse276))) (bvsge .cse276 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse274 .cse275))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse278 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse277 (bvneg .cse278))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse277) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse278))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse279 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse279 .cse277) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse281 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse280 (bvneg .cse281))) (and (= c_~result_10~0 (bvadd .cse278 .cse280)) (= c_~result_13~0 (bvadd .cse279 .cse280)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse280))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse281))) (bvsge .cse281 (_ bv0 32))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse283 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse282 (bvneg .cse283))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse282) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse283))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse284 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse284 .cse282) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse286 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse285 (bvneg .cse286))) (and (= (bvadd .cse284 .cse285) c_~result_13~0) (= c_~result_10~0 (bvadd .cse283 .cse285)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse285))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse286))) (bvsge .cse286 (_ bv0 32)))))))))))))) (not (= c_~result_10~0 (_ bv0 32))) (let ((.cse287 (= c_~result_13~0 (_ bv0 32)))) (or (and (= (_ bv1 8) |c_thread3Thread1of1ForFork2_~stop~2#1|) (not .cse287)) (and (= |c_thread3Thread1of1ForFork2_~stop~2#1| (_ bv0 8)) .cse287))) (= (_ bv1 32) |c_thread1Thread1of1ForFork1_~i~0#1|)) is different from false [2022-11-20 11:26:20,507 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_thread3Thread1of1ForFork2_~i~2#1| (_ bv1 32)) (or (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse5 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse1 (concat (concat .cse5 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse0 (concat (concat .cse5 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse0) .cse1)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse2 (bvneg .cse4))) (let ((.cse3 (bvmul (_ bv4294967295 32) .cse2))) (and (= (bvadd .cse1 .cse2) c_~result_13~0) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse3)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse4))) (bvsle (bvadd .cse3 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse4)) (bvsge .cse4 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse0 .cse2))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse13 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse12 (concat .cse13 v_arrayElimCell_222)) (.cse6 (concat .cse13 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse7 (bvneg .cse9))) (let ((.cse11 (bvmul (_ bv4294967295 32) .cse7))) (let ((.cse8 (bvadd c_~result_10~0 .cse11)) (.cse10 (bvadd (_ bv2147483647 32) .cse9))) (and (= c_~result_13~0 (bvadd .cse6 .cse7)) (bvsge ((_ sign_extend 32) .cse8) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse9))) (bvsle .cse8 .cse10) (bvsle (bvadd .cse11 c_~result_13~0) .cse10) (= c_~result_10~0 (bvadd .cse12 .cse7)))))))) (= (bvadd (bvneg .cse12) .cse6) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse14 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse14) .cse14) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse17 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse18 (bvneg .cse17))) (let ((.cse16 (bvmul (_ bv4294967295 32) .cse18)) (.cse15 (bvadd .cse14 .cse18))) (and (= c_~result_13~0 .cse15) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse16)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse17))) (bvsle (bvadd .cse16 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse17)) (bvsge .cse17 (_ bv0 32)) (= c_~result_10~0 .cse15))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse23 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse22 (concat .cse23 v_arrayElimCell_222)) (.cse19 (concat .cse23 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse20 (bvneg .cse21))) (and (= c_~result_13~0 (bvadd .cse19 .cse20)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse20))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse21))) (bvsge .cse21 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse22 .cse20)))))) (= (bvadd (bvneg .cse22) .cse19) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse25 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse24 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse24) .cse25) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse27 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse28 (bvneg .cse27))) (let ((.cse26 (bvmul (_ bv4294967295 32) .cse28))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse26)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse27))) (bvsle (bvadd .cse26 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse27)) (bvsge .cse27 (_ bv0 32)) (= (bvadd .cse28 .cse25) c_~result_13~0) (= c_~result_10~0 (bvadd .cse24 .cse28)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse36 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse33 (concat (concat .cse36 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse35 (concat (concat .cse36 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse34 (bvneg .cse30))) (let ((.cse32 (bvmul (_ bv4294967295 32) .cse34))) (let ((.cse29 (bvadd c_~result_10~0 .cse32)) (.cse31 (bvadd (_ bv2147483647 32) .cse30))) (and (bvsge ((_ sign_extend 32) .cse29) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse30))) (bvsle .cse29 .cse31) (bvsle (bvadd .cse32 c_~result_13~0) .cse31) (= c_~result_10~0 (bvadd .cse33 .cse34)) (= c_~result_13~0 (bvadd .cse35 .cse34)))))))) (= (bvadd (bvneg .cse33) .cse35) c_~result_7~0))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse37 (bvneg .cse38))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse37) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse38))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse42 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse39 (bvneg .cse41))) (let ((.cse40 (bvmul (_ bv4294967295 32) .cse39))) (and (= c_~result_10~0 (bvadd .cse38 .cse39)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse40)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse41))) (bvsle (bvadd .cse40 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse41)) (bvsge .cse41 (_ bv0 32)) (= (bvadd .cse39 .cse42) c_~result_13~0)))))) (= (bvadd .cse37 .cse42) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse44 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse43 (bvneg .cse44))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse43) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse44))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse43 .cse45) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse48 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse46 (bvneg .cse48))) (let ((.cse50 (bvmul (_ bv4294967295 32) .cse46))) (let ((.cse47 (bvadd c_~result_10~0 .cse50)) (.cse49 (bvadd (_ bv2147483647 32) .cse48))) (and (= c_~result_10~0 (bvadd .cse44 .cse46)) (bvsge ((_ sign_extend 32) .cse47) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse48))) (bvsle .cse47 .cse49) (bvsle (bvadd .cse50 c_~result_13~0) .cse49) (= (bvadd .cse46 .cse45) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse51 (bvneg .cse52))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse51) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse52))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse53 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse56 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse54 (bvneg .cse56))) (let ((.cse55 (bvmul (_ bv4294967295 32) .cse54))) (and (= c_~result_13~0 (bvadd .cse53 .cse54)) (= c_~result_10~0 (bvadd .cse52 .cse54)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse55)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse56))) (bvsle (bvadd .cse55 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse56)) (bvsge .cse56 (_ bv0 32))))))) (= (bvadd .cse53 .cse51) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse58 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse57 (bvneg .cse58))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse57) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse58))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse61 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse59 (bvneg .cse61))) (let ((.cse60 (bvmul (_ bv4294967295 32) .cse59))) (and (= c_~result_10~0 (bvadd .cse58 .cse59)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse60)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse61))) (bvsle (bvadd .cse60 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse61)) (bvsge .cse61 (_ bv0 32)) (= (bvadd .cse59 .cse62) c_~result_13~0)))))) (= (bvadd .cse57 .cse62) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse63 (bvneg .cse64))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse63) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse64))) (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse65 .cse63) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse68 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse66 (bvneg .cse68))) (let ((.cse67 (bvmul (_ bv4294967295 32) .cse66))) (and (= c_~result_13~0 (bvadd .cse65 .cse66)) (= c_~result_10~0 (bvadd .cse64 .cse66)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse67)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse68))) (bvsle (bvadd .cse67 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse68)) (bvsge .cse68 (_ bv0 32)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse70 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse69 (bvneg .cse70))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse69) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse70))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse73 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse71 (bvneg .cse73))) (let ((.cse72 (bvmul (_ bv4294967295 32) .cse71))) (and (= c_~result_10~0 (bvadd .cse70 .cse71)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse72)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse73))) (bvsle (bvadd .cse72 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse73)) (bvsge .cse73 (_ bv0 32)) (= c_~result_13~0 (bvadd .cse74 .cse71))))))) (= (bvadd .cse74 .cse69) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse76 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse75 (bvneg .cse76))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse75) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse76))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse75 .cse77) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse80 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse78 (bvneg .cse80))) (let ((.cse82 (bvmul (_ bv4294967295 32) .cse78))) (let ((.cse79 (bvadd c_~result_10~0 .cse82)) (.cse81 (bvadd (_ bv2147483647 32) .cse80))) (and (= c_~result_10~0 (bvadd .cse76 .cse78)) (bvsge ((_ sign_extend 32) .cse79) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse80))) (bvsle .cse79 .cse81) (bvsle (bvadd .cse82 c_~result_13~0) .cse81) (= (bvadd .cse78 .cse77) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse87 (bvneg .cse83))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse86 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse84 (bvneg .cse85))) (and (= c_~result_10~0 (bvadd .cse83 .cse84)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse84))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse85))) (bvsge .cse85 (_ bv0 32)) (= (bvadd .cse84 .cse86) c_~result_13~0))))) (= (bvadd .cse87 .cse86) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse87) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse83))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse89 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse88 (bvneg .cse89))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse88) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse89))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse91 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse93 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse90 (bvneg .cse93))) (let ((.cse95 (bvmul (_ bv4294967295 32) .cse90))) (let ((.cse92 (bvadd c_~result_10~0 .cse95)) (.cse94 (bvadd (_ bv2147483647 32) .cse93))) (and (= c_~result_10~0 (bvadd .cse89 .cse90)) (= c_~result_13~0 (bvadd .cse91 .cse90)) (bvsge ((_ sign_extend 32) .cse92) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse93))) (bvsle .cse92 .cse94) (bvsle (bvadd .cse95 c_~result_13~0) .cse94))))))) (= (bvadd .cse91 .cse88) c_~result_7~0)))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse96 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse97 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse96 (bvneg .cse97)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse102 (bvneg .cse99))) (let ((.cse101 (bvmul (_ bv4294967295 32) .cse102))) (let ((.cse98 (bvadd c_~result_10~0 .cse101)) (.cse100 (bvadd (_ bv2147483647 32) .cse99))) (and (bvsge ((_ sign_extend 32) .cse98) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse99))) (bvsle .cse98 .cse100) (bvsle (bvadd .cse101 c_~result_13~0) .cse100) (= (bvadd .cse96 .cse102) c_~result_13~0) (= c_~result_10~0 (bvadd .cse97 .cse102))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse103 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse104 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse103 (bvneg .cse104)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse107 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse105 (bvneg .cse107))) (let ((.cse106 (bvmul (_ bv4294967295 32) .cse105))) (and (= c_~result_13~0 (bvadd .cse103 .cse105)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse106)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse107))) (bvsle (bvadd .cse106 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse107)) (bvsge .cse107 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse104 .cse105)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse109 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse108 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse108) .cse109) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse111 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse110 (bvneg .cse111))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse110))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse111))) (bvsge .cse111 (_ bv0 32)) (= (bvadd .cse110 .cse109) c_~result_13~0) (= c_~result_10~0 (bvadd .cse108 .cse110))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse115 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse113 (bvneg .cse115))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse112 .cse113) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse116 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse114 (bvneg .cse116))) (and (= c_~result_13~0 (bvadd .cse112 .cse114)) (= c_~result_10~0 (bvadd .cse115 .cse114)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse114))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse116))) (bvsge .cse116 (_ bv0 32))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse113) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse115))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse118 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse117 (bvneg .cse118))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse117) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse118))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse119 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse119 .cse117) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse122 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse120 (bvneg .cse122))) (let ((.cse124 (bvmul (_ bv4294967295 32) .cse120))) (let ((.cse121 (bvadd c_~result_10~0 .cse124)) (.cse123 (bvadd (_ bv2147483647 32) .cse122))) (and (= c_~result_10~0 (bvadd .cse118 .cse120)) (bvsge ((_ sign_extend 32) .cse121) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse122))) (bvsle .cse121 .cse123) (bvsle (bvadd .cse124 c_~result_13~0) .cse123) (= (bvadd .cse119 .cse120) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse131 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse126 (bvneg .cse128))) (let ((.cse130 (bvmul (_ bv4294967295 32) .cse126))) (let ((.cse127 (bvadd c_~result_10~0 .cse130)) (.cse129 (bvadd (_ bv2147483647 32) .cse128))) (and (= c_~result_13~0 (bvadd .cse125 .cse126)) (bvsge ((_ sign_extend 32) .cse127) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse128))) (bvsle .cse127 .cse129) (bvsle (bvadd .cse130 c_~result_13~0) .cse129) (= c_~result_10~0 (bvadd .cse131 .cse126)))))))) (= (bvadd .cse125 (bvneg .cse131)) c_~result_7~0)))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse133 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse132 (bvneg .cse133))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse132) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse133))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse134 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse134 .cse132) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse137 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse135 (bvneg .cse137))) (let ((.cse139 (bvmul (_ bv4294967295 32) .cse135))) (let ((.cse136 (bvadd c_~result_10~0 .cse139)) (.cse138 (bvadd (_ bv2147483647 32) .cse137))) (and (= (bvadd .cse134 .cse135) c_~result_13~0) (= c_~result_10~0 (bvadd .cse133 .cse135)) (bvsge ((_ sign_extend 32) .cse136) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse137))) (bvsle .cse136 .cse138) (bvsle (bvadd .cse139 c_~result_13~0) .cse138)))))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse140) .cse140) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse143 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse142 (bvneg .cse143))) (let ((.cse141 (bvadd .cse140 .cse142))) (and (= c_~result_13~0 .cse141) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse142))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse143))) (bvsge .cse143 (_ bv0 32)) (= c_~result_10~0 .cse141))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228)) (.cse144 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse144) .cse145) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse148 (bvneg .cse147))) (let ((.cse146 (bvmul (_ bv4294967295 32) .cse148))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse146)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse147))) (bvsle (bvadd .cse146 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse147)) (bvsge .cse147 (_ bv0 32)) (= (bvadd .cse148 .cse145) c_~result_13~0) (= c_~result_10~0 (bvadd .cse144 .cse148)))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse150 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse149 (bvneg .cse150))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse149) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse150))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse153 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse152 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse151 (bvneg .cse152))) (and (= c_~result_10~0 (bvadd .cse150 .cse151)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse151))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse152))) (bvsge .cse152 (_ bv0 32)) (= c_~result_13~0 (bvadd .cse153 .cse151)))))) (= (bvadd .cse153 .cse149) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse157 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse155 (bvneg .cse157))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse154 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse154 .cse155) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse156 (bvneg .cse158))) (and (= c_~result_13~0 (bvadd .cse154 .cse156)) (= c_~result_10~0 (bvadd .cse157 .cse156)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse156))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse158))) (bvsge .cse158 (_ bv0 32))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse155) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse157))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse163 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse161 (concat (concat .cse163 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse162 (concat (concat .cse163 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse160 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse159 (bvneg .cse160))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse159))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse160))) (bvsge .cse160 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse161 .cse159)) (= c_~result_13~0 (bvadd .cse162 .cse159)))))) (= (bvadd (bvneg .cse161) .cse162) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse169 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse166 (concat (concat .cse169 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse168 (concat (concat .cse169 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse167 (bvneg .cse165))) (let ((.cse164 (bvmul (_ bv4294967295 32) .cse167))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse164)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse165))) (bvsle (bvadd .cse164 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse165)) (bvsge .cse165 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse166 .cse167)) (= c_~result_13~0 (bvadd .cse168 .cse167))))))) (= (bvadd (bvneg .cse166) .cse168) c_~result_7~0))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse175 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse171 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse174 (bvneg .cse171))) (let ((.cse173 (bvmul (_ bv4294967295 32) .cse174))) (let ((.cse170 (bvadd c_~result_10~0 .cse173)) (.cse172 (bvadd (_ bv2147483647 32) .cse171))) (and (bvsge ((_ sign_extend 32) .cse170) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse171))) (bvsle .cse170 .cse172) (bvsle (bvadd .cse173 c_~result_13~0) .cse172) (= (bvadd .cse174 .cse175) c_~result_13~0) (= c_~result_10~0 (bvadd .cse176 .cse174)))))))) (= (bvadd (bvneg .cse176) .cse175) c_~result_7~0)))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse178 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228)) (.cse177 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse177) .cse178) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse180 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse179 (bvneg .cse180))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse179))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse180))) (bvsge .cse180 (_ bv0 32)) (= (bvadd .cse179 .cse178) c_~result_13~0) (= c_~result_10~0 (bvadd .cse177 .cse179))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse182 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse181 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse181) .cse182) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse184 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse187 (bvneg .cse184))) (let ((.cse186 (bvmul (_ bv4294967295 32) .cse187))) (let ((.cse183 (bvadd c_~result_10~0 .cse186)) (.cse185 (bvadd (_ bv2147483647 32) .cse184))) (and (bvsge ((_ sign_extend 32) .cse183) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse184))) (bvsle .cse183 .cse185) (bvsle (bvadd .cse186 c_~result_13~0) .cse185) (= (bvadd .cse187 .cse182) c_~result_13~0) (= c_~result_10~0 (bvadd .cse181 .cse187))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse188) .cse188) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse192 (bvneg .cse191))) (let ((.cse190 (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse192))) (.cse189 (bvadd .cse188 .cse192))) (and (= c_~result_13~0 .cse189) (bvsge ((_ sign_extend 32) .cse190) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse191))) (bvsle .cse190 (bvadd (_ bv2147483647 32) .cse191)) (= c_~result_10~0 .cse189))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse198 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse197 (concat .cse198 v_arrayElimCell_222)) (.cse193 (concat .cse198 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse196 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse194 (bvneg .cse196))) (let ((.cse195 (bvmul (_ bv4294967295 32) .cse194))) (and (= c_~result_13~0 (bvadd .cse193 .cse194)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse195)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse196))) (bvsle (bvadd .cse195 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse196)) (bvsge .cse196 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse197 .cse194))))))) (= (bvadd (bvneg .cse197) .cse193) c_~result_7~0))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse203 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse200 (concat (concat .cse203 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse199 (concat (concat .cse203 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse199) .cse200)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse201 (bvneg .cse202))) (and (= (bvadd .cse200 .cse201) c_~result_13~0) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse201))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse202))) (bvsge .cse202 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse199 .cse201)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse204 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse205 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse204 (bvneg .cse205)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse208 (bvneg .cse207))) (let ((.cse206 (bvmul (_ bv4294967295 32) .cse208))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse206)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse207))) (bvsle (bvadd .cse206 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse207)) (bvsge .cse207 (_ bv0 32)) (= (bvadd .cse204 .cse208) c_~result_13~0) (= c_~result_10~0 (bvadd .cse205 .cse208)))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse212 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse210 (bvneg .cse212))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse209 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse209 .cse210) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse214 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse211 (bvneg .cse214))) (let ((.cse216 (bvmul (_ bv4294967295 32) .cse211))) (let ((.cse213 (bvadd c_~result_10~0 .cse216)) (.cse215 (bvadd (_ bv2147483647 32) .cse214))) (and (= c_~result_13~0 (bvadd .cse209 .cse211)) (= c_~result_10~0 (bvadd .cse212 .cse211)) (bvsge ((_ sign_extend 32) .cse213) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse214))) (bvsle .cse213 .cse215) (bvsle (bvadd .cse216 c_~result_13~0) .cse215)))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse210) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse212))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse218 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse217 (bvneg .cse218))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse217) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse218))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse219 .cse217) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse222 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse220 (bvneg .cse222))) (let ((.cse221 (bvmul (_ bv4294967295 32) .cse220))) (and (= c_~result_10~0 (bvadd .cse218 .cse220)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse221)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse222))) (bvsle (bvadd .cse221 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse222)) (bvsge .cse222 (_ bv0 32)) (= (bvadd .cse219 .cse220) c_~result_13~0))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse223 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse230 (bvneg .cse223))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse224 (bvneg .cse226))) (let ((.cse228 (bvmul (_ bv4294967295 32) .cse224))) (let ((.cse225 (bvadd c_~result_10~0 .cse228)) (.cse227 (bvadd (_ bv2147483647 32) .cse226))) (and (= c_~result_10~0 (bvadd .cse223 .cse224)) (bvsge ((_ sign_extend 32) .cse225) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse226))) (bvsle .cse225 .cse227) (bvsle (bvadd .cse228 c_~result_13~0) .cse227) (= c_~result_13~0 (bvadd .cse229 .cse224)))))))) (= (bvadd .cse229 .cse230) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse230) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse223))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse231 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse236 (bvneg .cse231))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse235 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse232 (bvneg .cse235))) (let ((.cse234 (bvmul (_ bv4294967295 32) .cse232))) (and (= c_~result_10~0 (bvadd .cse231 .cse232)) (= c_~result_13~0 (bvadd .cse233 .cse232)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse234)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse235))) (bvsle (bvadd .cse234 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse235)) (bvsge .cse235 (_ bv0 32))))))) (= (bvadd .cse233 .cse236) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse236) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse231))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse240 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse238 (bvneg .cse240))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse237 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse237 .cse238) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse242 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse239 (bvneg .cse242))) (let ((.cse241 (bvmul (_ bv4294967295 32) .cse239))) (and (= (bvadd .cse237 .cse239) c_~result_13~0) (= c_~result_10~0 (bvadd .cse240 .cse239)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse241)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse242))) (bvsle (bvadd .cse241 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse242)) (bvsge .cse242 (_ bv0 32)))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse238) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse240))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse243 (bvneg .cse244))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse243) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse244))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse245 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse245 .cse243) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse246 (bvneg .cse248))) (let ((.cse250 (bvmul (_ bv4294967295 32) .cse246))) (let ((.cse247 (bvadd c_~result_10~0 .cse250)) (.cse249 (bvadd (_ bv2147483647 32) .cse248))) (and (= c_~result_13~0 (bvadd .cse245 .cse246)) (= c_~result_10~0 (bvadd .cse244 .cse246)) (bvsge ((_ sign_extend 32) .cse247) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse248))) (bvsle .cse247 .cse249) (bvsle (bvadd .cse250 c_~result_13~0) .cse249)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse251 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse255 (bvneg .cse251))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse254 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse253 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse252 (bvneg .cse253))) (and (= c_~result_10~0 (bvadd .cse251 .cse252)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse252))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse253))) (bvsge .cse253 (_ bv0 32)) (= (bvadd .cse252 .cse254) c_~result_13~0))))) (= (bvadd .cse255 .cse254) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse255) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse251))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse257 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse256 (bvneg .cse257))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse256) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse257))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse258 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse258 .cse256) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse260 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse259 (bvneg .cse260))) (and (= c_~result_10~0 (bvadd .cse257 .cse259)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse259))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse260))) (bvsge .cse260 (_ bv0 32)) (= (bvadd .cse258 .cse259) c_~result_13~0)))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse268 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse262 (concat (concat .cse268 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse261 (concat (concat .cse268 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse261) .cse262)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse265 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse263 (bvneg .cse265))) (let ((.cse267 (bvmul (_ bv4294967295 32) .cse263))) (let ((.cse264 (bvadd c_~result_10~0 .cse267)) (.cse266 (bvadd (_ bv2147483647 32) .cse265))) (and (= (bvadd .cse262 .cse263) c_~result_13~0) (bvsge ((_ sign_extend 32) .cse264) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse265))) (bvsle .cse264 .cse266) (bvsle (bvadd .cse267 c_~result_13~0) .cse266) (= c_~result_10~0 (bvadd .cse261 .cse263)))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse272 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse270 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse269 (bvneg .cse270))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse269))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse270))) (bvsge .cse270 (_ bv0 32)) (= (bvadd .cse271 .cse269) c_~result_13~0) (= c_~result_10~0 (bvadd .cse272 .cse269)))))) (= (bvadd .cse271 (bvneg .cse272)) c_~result_7~0)))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse273 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse274 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse273 (bvneg .cse274)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse276 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse275 (bvneg .cse276))) (and (= c_~result_13~0 (bvadd .cse273 .cse275)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse275))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse276))) (bvsge .cse276 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse274 .cse275))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse278 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse277 (bvneg .cse278))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse277) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse278))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse279 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse279 .cse277) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse281 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse280 (bvneg .cse281))) (and (= c_~result_10~0 (bvadd .cse278 .cse280)) (= c_~result_13~0 (bvadd .cse279 .cse280)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse280))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse281))) (bvsge .cse281 (_ bv0 32))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse283 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse282 (bvneg .cse283))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse282) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse283))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse284 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse284 .cse282) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse286 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse285 (bvneg .cse286))) (and (= (bvadd .cse284 .cse285) c_~result_13~0) (= c_~result_10~0 (bvadd .cse283 .cse285)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse285))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse286))) (bvsge .cse286 (_ bv0 32)))))))))))))) (not (= c_~result_10~0 (_ bv0 32))) (let ((.cse287 (= c_~result_13~0 (_ bv0 32)))) (or (and (= (_ bv1 8) |c_thread3Thread1of1ForFork2_~stop~2#1|) (not .cse287)) (and (= |c_thread3Thread1of1ForFork2_~stop~2#1| (_ bv0 8)) .cse287)))) is different from false [2022-11-20 11:27:06,004 WARN L837 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse5 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse1 (concat (concat .cse5 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse0 (concat (concat .cse5 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse0) .cse1)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse2 (bvneg .cse4))) (let ((.cse3 (bvmul (_ bv4294967295 32) .cse2))) (and (= (bvadd .cse1 .cse2) c_~result_13~0) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse3)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse4))) (bvsle (bvadd .cse3 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse4)) (bvsge .cse4 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse0 .cse2))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse13 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse12 (concat .cse13 v_arrayElimCell_222)) (.cse6 (concat .cse13 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse7 (bvneg .cse9))) (let ((.cse11 (bvmul (_ bv4294967295 32) .cse7))) (let ((.cse8 (bvadd c_~result_10~0 .cse11)) (.cse10 (bvadd (_ bv2147483647 32) .cse9))) (and (= c_~result_13~0 (bvadd .cse6 .cse7)) (bvsge ((_ sign_extend 32) .cse8) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse9))) (bvsle .cse8 .cse10) (bvsle (bvadd .cse11 c_~result_13~0) .cse10) (= c_~result_10~0 (bvadd .cse12 .cse7)))))))) (= (bvadd (bvneg .cse12) .cse6) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse14 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse14) .cse14) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse17 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse18 (bvneg .cse17))) (let ((.cse16 (bvmul (_ bv4294967295 32) .cse18)) (.cse15 (bvadd .cse14 .cse18))) (and (= c_~result_13~0 .cse15) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse16)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse17))) (bvsle (bvadd .cse16 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse17)) (bvsge .cse17 (_ bv0 32)) (= c_~result_10~0 .cse15))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse23 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse22 (concat .cse23 v_arrayElimCell_222)) (.cse19 (concat .cse23 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse20 (bvneg .cse21))) (and (= c_~result_13~0 (bvadd .cse19 .cse20)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse20))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse21))) (bvsge .cse21 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse22 .cse20)))))) (= (bvadd (bvneg .cse22) .cse19) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse25 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse24 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse24) .cse25) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse27 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse28 (bvneg .cse27))) (let ((.cse26 (bvmul (_ bv4294967295 32) .cse28))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse26)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse27))) (bvsle (bvadd .cse26 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse27)) (bvsge .cse27 (_ bv0 32)) (= (bvadd .cse28 .cse25) c_~result_13~0) (= c_~result_10~0 (bvadd .cse24 .cse28)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse36 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse33 (concat (concat .cse36 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse35 (concat (concat .cse36 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse34 (bvneg .cse30))) (let ((.cse32 (bvmul (_ bv4294967295 32) .cse34))) (let ((.cse29 (bvadd c_~result_10~0 .cse32)) (.cse31 (bvadd (_ bv2147483647 32) .cse30))) (and (bvsge ((_ sign_extend 32) .cse29) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse30))) (bvsle .cse29 .cse31) (bvsle (bvadd .cse32 c_~result_13~0) .cse31) (= c_~result_10~0 (bvadd .cse33 .cse34)) (= c_~result_13~0 (bvadd .cse35 .cse34)))))))) (= (bvadd (bvneg .cse33) .cse35) c_~result_7~0))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse38 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse37 (bvneg .cse38))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse37) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse38))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse42 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse41 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse39 (bvneg .cse41))) (let ((.cse40 (bvmul (_ bv4294967295 32) .cse39))) (and (= c_~result_10~0 (bvadd .cse38 .cse39)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse40)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse41))) (bvsle (bvadd .cse40 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse41)) (bvsge .cse41 (_ bv0 32)) (= (bvadd .cse39 .cse42) c_~result_13~0)))))) (= (bvadd .cse37 .cse42) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse44 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse43 (bvneg .cse44))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse43) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse44))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse43 .cse45) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse48 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse46 (bvneg .cse48))) (let ((.cse50 (bvmul (_ bv4294967295 32) .cse46))) (let ((.cse47 (bvadd c_~result_10~0 .cse50)) (.cse49 (bvadd (_ bv2147483647 32) .cse48))) (and (= c_~result_10~0 (bvadd .cse44 .cse46)) (bvsge ((_ sign_extend 32) .cse47) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse48))) (bvsle .cse47 .cse49) (bvsle (bvadd .cse50 c_~result_13~0) .cse49) (= (bvadd .cse46 .cse45) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse51 (bvneg .cse52))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse51) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse52))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse53 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse56 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse54 (bvneg .cse56))) (let ((.cse55 (bvmul (_ bv4294967295 32) .cse54))) (and (= c_~result_13~0 (bvadd .cse53 .cse54)) (= c_~result_10~0 (bvadd .cse52 .cse54)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse55)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse56))) (bvsle (bvadd .cse55 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse56)) (bvsge .cse56 (_ bv0 32))))))) (= (bvadd .cse53 .cse51) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse58 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse57 (bvneg .cse58))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse57) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse58))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse62 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse61 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse59 (bvneg .cse61))) (let ((.cse60 (bvmul (_ bv4294967295 32) .cse59))) (and (= c_~result_10~0 (bvadd .cse58 .cse59)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse60)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse61))) (bvsle (bvadd .cse60 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse61)) (bvsge .cse61 (_ bv0 32)) (= (bvadd .cse59 .cse62) c_~result_13~0)))))) (= (bvadd .cse57 .cse62) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse64 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse63 (bvneg .cse64))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse63) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse64))) (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse65 .cse63) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse68 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse66 (bvneg .cse68))) (let ((.cse67 (bvmul (_ bv4294967295 32) .cse66))) (and (= c_~result_13~0 (bvadd .cse65 .cse66)) (= c_~result_10~0 (bvadd .cse64 .cse66)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse67)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse68))) (bvsle (bvadd .cse67 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse68)) (bvsge .cse68 (_ bv0 32)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse70 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse69 (bvneg .cse70))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse69) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse70))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse73 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse71 (bvneg .cse73))) (let ((.cse72 (bvmul (_ bv4294967295 32) .cse71))) (and (= c_~result_10~0 (bvadd .cse70 .cse71)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse72)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse73))) (bvsle (bvadd .cse72 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse73)) (bvsge .cse73 (_ bv0 32)) (= c_~result_13~0 (bvadd .cse74 .cse71))))))) (= (bvadd .cse74 .cse69) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse76 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse75 (bvneg .cse76))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse75) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse76))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse75 .cse77) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse80 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse78 (bvneg .cse80))) (let ((.cse82 (bvmul (_ bv4294967295 32) .cse78))) (let ((.cse79 (bvadd c_~result_10~0 .cse82)) (.cse81 (bvadd (_ bv2147483647 32) .cse80))) (and (= c_~result_10~0 (bvadd .cse76 .cse78)) (bvsge ((_ sign_extend 32) .cse79) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse80))) (bvsle .cse79 .cse81) (bvsle (bvadd .cse82 c_~result_13~0) .cse81) (= (bvadd .cse78 .cse77) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse87 (bvneg .cse83))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse86 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse84 (bvneg .cse85))) (and (= c_~result_10~0 (bvadd .cse83 .cse84)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse84))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse85))) (bvsge .cse85 (_ bv0 32)) (= (bvadd .cse84 .cse86) c_~result_13~0))))) (= (bvadd .cse87 .cse86) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse87) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse83))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse89 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse88 (bvneg .cse89))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse88) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse89))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse91 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse93 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse90 (bvneg .cse93))) (let ((.cse95 (bvmul (_ bv4294967295 32) .cse90))) (let ((.cse92 (bvadd c_~result_10~0 .cse95)) (.cse94 (bvadd (_ bv2147483647 32) .cse93))) (and (= c_~result_10~0 (bvadd .cse89 .cse90)) (= c_~result_13~0 (bvadd .cse91 .cse90)) (bvsge ((_ sign_extend 32) .cse92) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse93))) (bvsle .cse92 .cse94) (bvsle (bvadd .cse95 c_~result_13~0) .cse94))))))) (= (bvadd .cse91 .cse88) c_~result_7~0)))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse96 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse97 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse96 (bvneg .cse97)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse102 (bvneg .cse99))) (let ((.cse101 (bvmul (_ bv4294967295 32) .cse102))) (let ((.cse98 (bvadd c_~result_10~0 .cse101)) (.cse100 (bvadd (_ bv2147483647 32) .cse99))) (and (bvsge ((_ sign_extend 32) .cse98) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse99))) (bvsle .cse98 .cse100) (bvsle (bvadd .cse101 c_~result_13~0) .cse100) (= (bvadd .cse96 .cse102) c_~result_13~0) (= c_~result_10~0 (bvadd .cse97 .cse102))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse103 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse104 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse103 (bvneg .cse104)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse107 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse105 (bvneg .cse107))) (let ((.cse106 (bvmul (_ bv4294967295 32) .cse105))) (and (= c_~result_13~0 (bvadd .cse103 .cse105)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse106)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse107))) (bvsle (bvadd .cse106 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse107)) (bvsge .cse107 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse104 .cse105)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse109 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse108 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse108) .cse109) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse111 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse110 (bvneg .cse111))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse110))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse111))) (bvsge .cse111 (_ bv0 32)) (= (bvadd .cse110 .cse109) c_~result_13~0) (= c_~result_10~0 (bvadd .cse108 .cse110))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse115 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse113 (bvneg .cse115))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse112 .cse113) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse116 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse114 (bvneg .cse116))) (and (= c_~result_13~0 (bvadd .cse112 .cse114)) (= c_~result_10~0 (bvadd .cse115 .cse114)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse114))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse116))) (bvsge .cse116 (_ bv0 32))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse113) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse115))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse118 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse117 (bvneg .cse118))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse117) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse118))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse119 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse119 .cse117) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse122 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse120 (bvneg .cse122))) (let ((.cse124 (bvmul (_ bv4294967295 32) .cse120))) (let ((.cse121 (bvadd c_~result_10~0 .cse124)) (.cse123 (bvadd (_ bv2147483647 32) .cse122))) (and (= c_~result_10~0 (bvadd .cse118 .cse120)) (bvsge ((_ sign_extend 32) .cse121) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse122))) (bvsle .cse121 .cse123) (bvsle (bvadd .cse124 c_~result_13~0) .cse123) (= (bvadd .cse119 .cse120) c_~result_13~0)))))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse131 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse128 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse126 (bvneg .cse128))) (let ((.cse130 (bvmul (_ bv4294967295 32) .cse126))) (let ((.cse127 (bvadd c_~result_10~0 .cse130)) (.cse129 (bvadd (_ bv2147483647 32) .cse128))) (and (= c_~result_13~0 (bvadd .cse125 .cse126)) (bvsge ((_ sign_extend 32) .cse127) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse128))) (bvsle .cse127 .cse129) (bvsle (bvadd .cse130 c_~result_13~0) .cse129) (= c_~result_10~0 (bvadd .cse131 .cse126)))))))) (= (bvadd .cse125 (bvneg .cse131)) c_~result_7~0)))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse133 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse132 (bvneg .cse133))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse132) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse133))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse134 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse134 .cse132) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse137 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse135 (bvneg .cse137))) (let ((.cse139 (bvmul (_ bv4294967295 32) .cse135))) (let ((.cse136 (bvadd c_~result_10~0 .cse139)) (.cse138 (bvadd (_ bv2147483647 32) .cse137))) (and (= (bvadd .cse134 .cse135) c_~result_13~0) (= c_~result_10~0 (bvadd .cse133 .cse135)) (bvsge ((_ sign_extend 32) .cse136) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse137))) (bvsle .cse136 .cse138) (bvsle (bvadd .cse139 c_~result_13~0) .cse138)))))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse140) .cse140) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse143 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse142 (bvneg .cse143))) (let ((.cse141 (bvadd .cse140 .cse142))) (and (= c_~result_13~0 .cse141) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse142))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse143))) (bvsge .cse143 (_ bv0 32)) (= c_~result_10~0 .cse141))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse145 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228)) (.cse144 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse144) .cse145) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse147 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse148 (bvneg .cse147))) (let ((.cse146 (bvmul (_ bv4294967295 32) .cse148))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse146)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse147))) (bvsle (bvadd .cse146 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse147)) (bvsge .cse147 (_ bv0 32)) (= (bvadd .cse148 .cse145) c_~result_13~0) (= c_~result_10~0 (bvadd .cse144 .cse148)))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse150 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse149 (bvneg .cse150))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse149) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse150))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse153 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse152 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse151 (bvneg .cse152))) (and (= c_~result_10~0 (bvadd .cse150 .cse151)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse151))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse152))) (bvsge .cse152 (_ bv0 32)) (= c_~result_13~0 (bvadd .cse153 .cse151)))))) (= (bvadd .cse153 .cse149) c_~result_7~0)))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse157 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse155 (bvneg .cse157))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse154 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse154 .cse155) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse158 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse156 (bvneg .cse158))) (and (= c_~result_13~0 (bvadd .cse154 .cse156)) (= c_~result_10~0 (bvadd .cse157 .cse156)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse156))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse158))) (bvsge .cse158 (_ bv0 32))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse155) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse157))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse163 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse161 (concat (concat .cse163 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse162 (concat (concat .cse163 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse160 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse159 (bvneg .cse160))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse159))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse160))) (bvsge .cse160 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse161 .cse159)) (= c_~result_13~0 (bvadd .cse162 .cse159)))))) (= (bvadd (bvneg .cse161) .cse162) c_~result_7~0))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse169 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse166 (concat (concat .cse169 v_arrayElimCell_232) v_arrayElimCell_222)) (.cse168 (concat (concat .cse169 v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse165 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse167 (bvneg .cse165))) (let ((.cse164 (bvmul (_ bv4294967295 32) .cse167))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse164)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse165))) (bvsle (bvadd .cse164 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse165)) (bvsge .cse165 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse166 .cse167)) (= c_~result_13~0 (bvadd .cse168 .cse167))))))) (= (bvadd (bvneg .cse166) .cse168) c_~result_7~0))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse175 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse171 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse174 (bvneg .cse171))) (let ((.cse173 (bvmul (_ bv4294967295 32) .cse174))) (let ((.cse170 (bvadd c_~result_10~0 .cse173)) (.cse172 (bvadd (_ bv2147483647 32) .cse171))) (and (bvsge ((_ sign_extend 32) .cse170) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse171))) (bvsle .cse170 .cse172) (bvsle (bvadd .cse173 c_~result_13~0) .cse172) (= (bvadd .cse174 .cse175) c_~result_13~0) (= c_~result_10~0 (bvadd .cse176 .cse174)))))))) (= (bvadd (bvneg .cse176) .cse175) c_~result_7~0)))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse178 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228)) (.cse177 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse177) .cse178) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse180 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse179 (bvneg .cse180))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse179))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse180))) (bvsge .cse180 (_ bv0 32)) (= (bvadd .cse179 .cse178) c_~result_13~0) (= c_~result_10~0 (bvadd .cse177 .cse179))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse182 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_222)) (.cse181 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse181) .cse182) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse184 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse187 (bvneg .cse184))) (let ((.cse186 (bvmul (_ bv4294967295 32) .cse187))) (let ((.cse183 (bvadd c_~result_10~0 .cse186)) (.cse185 (bvadd (_ bv2147483647 32) .cse184))) (and (bvsge ((_ sign_extend 32) .cse183) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse184))) (bvsle .cse183 .cse185) (bvsle (bvadd .cse186 c_~result_13~0) .cse185) (= (bvadd .cse187 .cse182) c_~result_13~0) (= c_~result_10~0 (bvadd .cse181 .cse187))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse188 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd (bvneg .cse188) .cse188) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse191 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse192 (bvneg .cse191))) (let ((.cse190 (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse192))) (.cse189 (bvadd .cse188 .cse192))) (and (= c_~result_13~0 .cse189) (bvsge ((_ sign_extend 32) .cse190) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse191))) (bvsle .cse190 (bvadd (_ bv2147483647 32) .cse191)) (= c_~result_10~0 .cse189))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse198 (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232))) (let ((.cse197 (concat .cse198 v_arrayElimCell_222)) (.cse193 (concat .cse198 v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse196 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse194 (bvneg .cse196))) (let ((.cse195 (bvmul (_ bv4294967295 32) .cse194))) (and (= c_~result_13~0 (bvadd .cse193 .cse194)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse195)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse196))) (bvsle (bvadd .cse195 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse196)) (bvsge .cse196 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse197 .cse194))))))) (= (bvadd (bvneg .cse197) .cse193) c_~result_7~0))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse203 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse200 (concat (concat .cse203 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse199 (concat (concat .cse203 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse199) .cse200)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse202 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse201 (bvneg .cse202))) (and (= (bvadd .cse200 .cse201) c_~result_13~0) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse201))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse202))) (bvsge .cse202 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse199 .cse201)))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse204 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse205 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse204 (bvneg .cse205)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse208 (bvneg .cse207))) (let ((.cse206 (bvmul (_ bv4294967295 32) .cse208))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse206)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse207))) (bvsle (bvadd .cse206 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse207)) (bvsge .cse207 (_ bv0 32)) (= (bvadd .cse204 .cse208) c_~result_13~0) (= c_~result_10~0 (bvadd .cse205 .cse208)))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse212 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse210 (bvneg .cse212))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse209 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse209 .cse210) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse214 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse211 (bvneg .cse214))) (let ((.cse216 (bvmul (_ bv4294967295 32) .cse211))) (let ((.cse213 (bvadd c_~result_10~0 .cse216)) (.cse215 (bvadd (_ bv2147483647 32) .cse214))) (and (= c_~result_13~0 (bvadd .cse209 .cse211)) (= c_~result_10~0 (bvadd .cse212 .cse211)) (bvsge ((_ sign_extend 32) .cse213) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse214))) (bvsle .cse213 .cse215) (bvsle (bvadd .cse216 c_~result_13~0) .cse215)))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse210) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse212))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse218 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse217 (bvneg .cse218))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse217) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse218))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse219 .cse217) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse222 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse220 (bvneg .cse222))) (let ((.cse221 (bvmul (_ bv4294967295 32) .cse220))) (and (= c_~result_10~0 (bvadd .cse218 .cse220)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse221)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse222))) (bvsle (bvadd .cse221 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse222)) (bvsge .cse222 (_ bv0 32)) (= (bvadd .cse219 .cse220) c_~result_13~0))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse223 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse230 (bvneg .cse223))) (and (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse224 (bvneg .cse226))) (let ((.cse228 (bvmul (_ bv4294967295 32) .cse224))) (let ((.cse225 (bvadd c_~result_10~0 .cse228)) (.cse227 (bvadd (_ bv2147483647 32) .cse226))) (and (= c_~result_10~0 (bvadd .cse223 .cse224)) (bvsge ((_ sign_extend 32) .cse225) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse226))) (bvsle .cse225 .cse227) (bvsle (bvadd .cse228 c_~result_13~0) .cse227) (= c_~result_13~0 (bvadd .cse229 .cse224)))))))) (= (bvadd .cse229 .cse230) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse230) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse223))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse231 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse236 (bvneg .cse231))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse235 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse232 (bvneg .cse235))) (let ((.cse234 (bvmul (_ bv4294967295 32) .cse232))) (and (= c_~result_10~0 (bvadd .cse231 .cse232)) (= c_~result_13~0 (bvadd .cse233 .cse232)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse234)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse235))) (bvsle (bvadd .cse234 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse235)) (bvsge .cse235 (_ bv0 32))))))) (= (bvadd .cse233 .cse236) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse236) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse231))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse240 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse238 (bvneg .cse240))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse237 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse237 .cse238) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse242 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse239 (bvneg .cse242))) (let ((.cse241 (bvmul (_ bv4294967295 32) .cse239))) (and (= (bvadd .cse237 .cse239) c_~result_13~0) (= c_~result_10~0 (bvadd .cse240 .cse239)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 .cse241)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse242))) (bvsle (bvadd .cse241 c_~result_13~0) (bvadd (_ bv2147483647 32) .cse242)) (bvsge .cse242 (_ bv0 32)))))))))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse238) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse240))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse243 (bvneg .cse244))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse243) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse244))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse245 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse245 .cse243) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse246 (bvneg .cse248))) (let ((.cse250 (bvmul (_ bv4294967295 32) .cse246))) (let ((.cse247 (bvadd c_~result_10~0 .cse250)) (.cse249 (bvadd (_ bv2147483647 32) .cse248))) (and (= c_~result_13~0 (bvadd .cse245 .cse246)) (= c_~result_10~0 (bvadd .cse244 .cse246)) (bvsge ((_ sign_extend 32) .cse247) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse248))) (bvsle .cse247 .cse249) (bvsle (bvadd .cse250 c_~result_13~0) .cse249)))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse251 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse255 (bvneg .cse251))) (and (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse254 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_228))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse253 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse252 (bvneg .cse253))) (and (= c_~result_10~0 (bvadd .cse251 .cse252)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse252))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse253))) (bvsge .cse253 (_ bv0 32)) (= (bvadd .cse252 .cse254) c_~result_13~0))))) (= (bvadd .cse255 .cse254) c_~result_7~0)))) (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse255) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse251))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse257 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse256 (bvneg .cse257))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse256) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse257))) (exists ((v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse258 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222))) (and (= (bvadd .cse258 .cse256) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse260 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse259 (bvneg .cse260))) (and (= c_~result_10~0 (bvadd .cse257 .cse259)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse259))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse260))) (bvsge .cse260 (_ bv0 32)) (= (bvadd .cse258 .cse259) c_~result_13~0)))))))))))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse268 (concat v_arrayElimCell_224 v_arrayElimCell_230))) (let ((.cse262 (concat (concat .cse268 v_arrayElimCell_219) v_arrayElimCell_228)) (.cse261 (concat (concat .cse268 v_arrayElimCell_232) v_arrayElimCell_222))) (and (= c_~result_7~0 (bvadd (bvneg .cse261) .cse262)) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse265 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse263 (bvneg .cse265))) (let ((.cse267 (bvmul (_ bv4294967295 32) .cse263))) (let ((.cse264 (bvadd c_~result_10~0 .cse267)) (.cse266 (bvadd (_ bv2147483647 32) .cse265))) (and (= (bvadd .cse262 .cse263) c_~result_13~0) (bvsge ((_ sign_extend 32) .cse264) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse265))) (bvsle .cse264 .cse266) (bvsle (bvadd .cse267 c_~result_13~0) .cse266) (= c_~result_10~0 (bvadd .cse261 .cse263)))))))))))) (exists ((v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse271 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_219) v_arrayElimCell_222)) (.cse272 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse270 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse269 (bvneg .cse270))) (and (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse269))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse270))) (bvsge .cse270 (_ bv0 32)) (= (bvadd .cse271 .cse269) c_~result_13~0) (= c_~result_10~0 (bvadd .cse272 .cse269)))))) (= (bvadd .cse271 (bvneg .cse272)) c_~result_7~0)))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8)) (v_arrayElimCell_231 (_ BitVec 8))) (let ((.cse273 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_231) v_arrayElimCell_232) v_arrayElimCell_228)) (.cse274 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (and (= (bvadd .cse273 (bvneg .cse274)) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse276 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse275 (bvneg .cse276))) (and (= c_~result_13~0 (bvadd .cse273 .cse275)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse275))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse276))) (bvsge .cse276 (_ bv0 32)) (= c_~result_10~0 (bvadd .cse274 .cse275))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse278 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse277 (bvneg .cse278))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse277) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse278))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8))) (let ((.cse279 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_228))) (and (= (bvadd .cse279 .cse277) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse281 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse280 (bvneg .cse281))) (and (= c_~result_10~0 (bvadd .cse278 .cse280)) (= c_~result_13~0 (bvadd .cse279 .cse280)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse280))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse281))) (bvsge .cse281 (_ bv0 32))))))))))))) (exists ((v_arrayElimCell_223 (_ BitVec 8)) (v_arrayElimCell_222 (_ BitVec 8)) (v_arrayElimCell_230 (_ BitVec 8)) (v_arrayElimCell_232 (_ BitVec 8))) (let ((.cse283 (concat (concat (concat v_arrayElimCell_223 v_arrayElimCell_230) v_arrayElimCell_232) v_arrayElimCell_222))) (let ((.cse282 (bvneg .cse283))) (and (bvsge ((_ sign_extend 32) (bvadd (bvmul (_ bv4294967295 32) .cse282) c_~result_7~0)) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse283))) (exists ((v_arrayElimCell_228 (_ BitVec 8)) (v_arrayElimCell_224 (_ BitVec 8)) (v_arrayElimCell_219 (_ BitVec 8))) (let ((.cse284 (concat (concat (concat v_arrayElimCell_224 v_arrayElimCell_230) v_arrayElimCell_219) v_arrayElimCell_228))) (and (= (bvadd .cse284 .cse282) c_~result_7~0) (exists ((v_arrayElimCell_218 (_ BitVec 8)) (v_arrayElimCell_229 (_ BitVec 8)) (v_arrayElimCell_221 (_ BitVec 8)) (v_arrayElimCell_220 (_ BitVec 8))) (let ((.cse286 (concat (concat (concat v_arrayElimCell_221 v_arrayElimCell_218) v_arrayElimCell_229) v_arrayElimCell_220))) (let ((.cse285 (bvneg .cse286))) (and (= (bvadd .cse284 .cse285) c_~result_13~0) (= c_~result_10~0 (bvadd .cse283 .cse285)) (bvsge ((_ sign_extend 32) (bvadd c_~result_10~0 (bvmul (_ bv4294967295 32) .cse285))) (bvadd (_ bv18446744071562067968 64) ((_ sign_extend 32) .cse286))) (bvsge .cse286 (_ bv0 32)))))))))))))) (not (= c_~result_10~0 (_ bv0 32))) (not (= c_~result_13~0 (_ bv0 32)))) is different from false [2022-11-20 11:27:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 3 not checked. [2022-11-20 11:27:14,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:28:45,339 WARN L233 SmtUtils]: Spent 58.63s on a formula simplification. DAG size of input: 805 DAG size of output: 701 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 11:28:45,345 INFO L321 Elim1Store]: treesize reduction 345, result has 89.0 percent of original size [2022-11-20 11:28:45,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 15931 treesize of output 15710 [2022-11-20 11:28:47,427 INFO L217 Elim1Store]: Index analysis took 680 ms [2022-11-20 11:28:53,753 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 11:28:53,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:28:53,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 18 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 48 case distinctions, treesize of input 12891 treesize of output 12452 [2022-11-20 11:28:55,361 INFO L217 Elim1Store]: Index analysis took 695 ms [2022-11-20 11:29:00,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:29:00,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 18 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 48 case distinctions, treesize of input 11995 treesize of output 10660 [2022-11-20 11:29:02,166 INFO L217 Elim1Store]: Index analysis took 848 ms [2022-11-20 11:29:06,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:29:06,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 18 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 48 case distinctions, treesize of input 10203 treesize of output 8812 [2022-11-20 11:29:09,327 INFO L217 Elim1Store]: Index analysis took 921 ms [2022-11-20 11:29:14,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:29:14,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 18 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 48 case distinctions, treesize of input 8355 treesize of output 7888