./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:41:37,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:41:37,824 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:41:37,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:41:37,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:41:37,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:41:37,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:41:37,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:41:37,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:41:37,857 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:41:37,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:41:37,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:41:37,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:41:37,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:41:37,860 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:41:37,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:41:37,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:41:37,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:41:37,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:41:37,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:41:37,863 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:41:37,868 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:41:37,868 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:41:37,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:41:37,869 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:41:37,869 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:41:37,870 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:41:37,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:41:37,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:41:37,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:41:37,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:41:37,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:41:37,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:41:37,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:41:37,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:41:37,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:41:37,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:41:37,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:41:37,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:41:37,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:41:37,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:41:37,881 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2023-11-29 02:41:38,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:41:38,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:41:38,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:41:38,128 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:41:38,129 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:41:38,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2023-11-29 02:41:40,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:41:41,270 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:41:41,271 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2023-11-29 02:41:41,289 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/data/33d332055/b2afb4c4c10f4aa5b8db752831c8322f/FLAG865ebd841 [2023-11-29 02:41:41,302 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/data/33d332055/b2afb4c4c10f4aa5b8db752831c8322f [2023-11-29 02:41:41,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:41:41,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:41:41,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:41:41,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:41:41,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:41:41,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:41:41" (1/1) ... [2023-11-29 02:41:41,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edc7a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:41, skipping insertion in model container [2023-11-29 02:41:41,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:41:41" (1/1) ... [2023-11-29 02:41:41,381 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:41:41,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:41:41,871 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 02:41:41,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@41e0d741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:41, skipping insertion in model container [2023-11-29 02:41:41,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:41:41,873 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 02:41:41,875 INFO L158 Benchmark]: Toolchain (without parser) took 567.75ms. Allocated memory is still 134.2MB. Free memory was 85.9MB in the beginning and 65.8MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 02:41:41,876 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:41:41,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.99ms. Allocated memory is still 134.2MB. Free memory was 85.9MB in the beginning and 65.8MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 02:41:41,878 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.99ms. Allocated memory is still 134.2MB. Free memory was 85.9MB in the beginning and 65.8MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:41:43,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:41:43,798 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:41:43,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:41:43,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:41:43,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:41:43,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:41:43,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:41:43,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:41:43,832 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:41:43,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:41:43,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:41:43,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:41:43,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:41:43,835 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:41:43,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:41:43,836 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:41:43,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:41:43,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:41:43,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:41:43,838 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:41:43,839 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:41:43,839 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:41:43,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:41:43,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:41:43,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:41:43,841 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:41:43,841 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:41:43,841 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:41:43,841 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:41:43,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:41:43,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:41:43,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:41:43,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:41:43,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:41:43,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:41:43,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:41:43,844 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:41:43,844 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:41:43,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:41:43,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:41:43,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:41:43,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:41:43,845 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:41:43,845 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2023-11-29 02:41:44,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:41:44,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:41:44,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:41:44,170 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:41:44,171 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:41:44,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2023-11-29 02:41:47,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:41:47,386 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:41:47,387 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2023-11-29 02:41:47,407 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/data/7dafe650e/0ea918e385834a7c9b19c0727163f44f/FLAGeb3d1e3e5 [2023-11-29 02:41:47,436 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/data/7dafe650e/0ea918e385834a7c9b19c0727163f44f [2023-11-29 02:41:47,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:41:47,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:41:47,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:41:47,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:41:47,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:41:47,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:41:47" (1/1) ... [2023-11-29 02:41:47,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b33af0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:47, skipping insertion in model container [2023-11-29 02:41:47,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:41:47" (1/1) ... [2023-11-29 02:41:47,532 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:41:48,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:41:48,120 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 02:41:48,144 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:41:48,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:41:48,248 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:41:48,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:41:48,401 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:41:48,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48 WrapperNode [2023-11-29 02:41:48,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:41:48,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:41:48,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:41:48,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:41:48,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,500 INFO L138 Inliner]: procedures = 180, calls = 340, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1135 [2023-11-29 02:41:48,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:41:48,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:41:48,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:41:48,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:41:48,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,624 INFO L175 MemorySlicer]: Split 319 memory accesses to 4 slices as follows [2, 5, 5, 307]. 96 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 84 writes are split as follows [0, 1, 1, 82]. [2023-11-29 02:41:48,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:41:48,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:41:48,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:41:48,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:41:48,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (1/1) ... [2023-11-29 02:41:48,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:41:48,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:41:48,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:41:48,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:41:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 02:41:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 02:41:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 02:41:48,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 02:41:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 02:41:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 02:41:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 02:41:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 02:41:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 02:41:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 02:41:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 02:41:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 02:41:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 02:41:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 02:41:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 02:41:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 02:41:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:41:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:41:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:41:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:41:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:41:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:41:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 02:41:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:41:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:41:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:41:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:41:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:41:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:41:48,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:41:49,035 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:41:49,038 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:41:49,043 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:41:49,103 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:41:49,128 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:41:49,151 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:41:54,722 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:41:54,969 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:41:54,969 INFO L309 CfgBuilder]: Removed 60 assume(true) statements. [2023-11-29 02:41:54,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:41:54 BoogieIcfgContainer [2023-11-29 02:41:54,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:41:54,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:41:54,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:41:54,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:41:54,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:41:47" (1/3) ... [2023-11-29 02:41:54,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e695a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:41:54, skipping insertion in model container [2023-11-29 02:41:54,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:48" (2/3) ... [2023-11-29 02:41:54,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e695a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:41:54, skipping insertion in model container [2023-11-29 02:41:54,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:41:54" (3/3) ... [2023-11-29 02:41:54,980 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-1.i [2023-11-29 02:41:55,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:41:55,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2023-11-29 02:41:55,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:41:55,079 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@185ddbbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:41:55,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2023-11-29 02:41:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 1137 states, 487 states have (on average 2.564681724845996) internal successors, (1249), 1129 states have internal predecessors, (1249), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:41:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 02:41:55,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:55,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 02:41:55,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr647ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:41:55,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1851143, now seen corresponding path program 1 times [2023-11-29 02:41:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:41:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873413610] [2023-11-29 02:41:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:55,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:55,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:41:55,117 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:41:55,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 02:41:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:55,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:41:55,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:55,333 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:41:55,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:41:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873413610] [2023-11-29 02:41:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873413610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:55,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:41:55,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936547002] [2023-11-29 02:41:55,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:55,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:41:55,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:41:55,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:41:55,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:41:55,408 INFO L87 Difference]: Start difference. First operand has 1137 states, 487 states have (on average 2.564681724845996) internal successors, (1249), 1129 states have internal predecessors, (1249), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:41:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:58,063 INFO L93 Difference]: Finished difference Result 1139 states and 1197 transitions. [2023-11-29 02:41:58,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:41:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 [2023-11-29 02:41:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:58,085 INFO L225 Difference]: With dead ends: 1139 [2023-11-29 02:41:58,085 INFO L226 Difference]: Without dead ends: 1136 [2023-11-29 02:41:58,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:41:58,089 INFO L413 NwaCegarLoop]: 1044 mSDtfsCounter, 24 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:58,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1575 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 02:41:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-11-29 02:41:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1127. [2023-11-29 02:41:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 488 states have (on average 2.4139344262295084) internal successors, (1178), 1119 states have internal predecessors, (1178), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:41:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1190 transitions. [2023-11-29 02:41:58,184 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1190 transitions. Word has length 3 [2023-11-29 02:41:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:58,185 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1190 transitions. [2023-11-29 02:41:58,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:41:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1190 transitions. [2023-11-29 02:41:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:41:58,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:58,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:41:58,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:41:58,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:58,387 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:41:58,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1777262702, now seen corresponding path program 1 times [2023-11-29 02:41:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:41:58,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341972783] [2023-11-29 02:41:58,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:58,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:58,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:41:58,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:41:58,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 02:41:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:58,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:41:58,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:58,582 INFO L378 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 [2023-11-29 02:41:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:58,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:41:58,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:41:58,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341972783] [2023-11-29 02:41:58,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341972783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:58,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:58,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:41:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25356577] [2023-11-29 02:41:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:58,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:41:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:41:58,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:41:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:41:58,600 INFO L87 Difference]: Start difference. First operand 1127 states and 1190 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:01,250 INFO L93 Difference]: Finished difference Result 1157 states and 1231 transitions. [2023-11-29 02:42:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:42:01,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-11-29 02:42:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:01,259 INFO L225 Difference]: With dead ends: 1157 [2023-11-29 02:42:01,259 INFO L226 Difference]: Without dead ends: 1157 [2023-11-29 02:42:01,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:01,261 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 1029 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:01,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 533 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 02:42:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2023-11-29 02:42:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1100. [2023-11-29 02:42:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 554 states have (on average 2.1805054151624548) internal successors, (1208), 1092 states have internal predecessors, (1208), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:42:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1220 transitions. [2023-11-29 02:42:01,293 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1220 transitions. Word has length 5 [2023-11-29 02:42:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:01,293 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1220 transitions. [2023-11-29 02:42:01,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1220 transitions. [2023-11-29 02:42:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:42:01,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:01,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:42:01,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 02:42:01,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:01,495 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:01,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1777262703, now seen corresponding path program 1 times [2023-11-29 02:42:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:01,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038268390] [2023-11-29 02:42:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:01,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:01,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:01,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:01,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 02:42:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:01,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:42:01,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:01,609 INFO L378 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 [2023-11-29 02:42:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:01,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:01,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038268390] [2023-11-29 02:42:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038268390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:42:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927598725] [2023-11-29 02:42:01,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:01,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:42:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:01,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:42:01,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:01,634 INFO L87 Difference]: Start difference. First operand 1100 states and 1220 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:05,527 INFO L93 Difference]: Finished difference Result 1372 states and 1512 transitions. [2023-11-29 02:42:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:42:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-11-29 02:42:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:05,534 INFO L225 Difference]: With dead ends: 1372 [2023-11-29 02:42:05,534 INFO L226 Difference]: Without dead ends: 1372 [2023-11-29 02:42:05,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:05,535 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 456 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:05,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1123 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 02:42:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2023-11-29 02:42:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1223. [2023-11-29 02:42:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 687 states have (on average 2.155749636098981) internal successors, (1481), 1215 states have internal predecessors, (1481), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:42:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1493 transitions. [2023-11-29 02:42:05,571 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1493 transitions. Word has length 5 [2023-11-29 02:42:05,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:05,571 INFO L495 AbstractCegarLoop]: Abstraction has 1223 states and 1493 transitions. [2023-11-29 02:42:05,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1493 transitions. [2023-11-29 02:42:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:42:05,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:05,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:42:05,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-29 02:42:05,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:05,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:05,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash -737739788, now seen corresponding path program 1 times [2023-11-29 02:42:05,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:05,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400021995] [2023-11-29 02:42:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:05,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:05,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:05,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:05,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 02:42:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:05,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:42:05,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:05,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:05,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400021995] [2023-11-29 02:42:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400021995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:05,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:05,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722257020] [2023-11-29 02:42:05,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:05,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:05,923 INFO L87 Difference]: Start difference. First operand 1223 states and 1493 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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) [2023-11-29 02:42:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:08,354 INFO L93 Difference]: Finished difference Result 1979 states and 2434 transitions. [2023-11-29 02:42:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:42:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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 6 [2023-11-29 02:42:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:08,362 INFO L225 Difference]: With dead ends: 1979 [2023-11-29 02:42:08,362 INFO L226 Difference]: Without dead ends: 1977 [2023-11-29 02:42:08,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:08,363 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 699 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:08,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 2558 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 02:42:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2023-11-29 02:42:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1667. [2023-11-29 02:42:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1131 states have (on average 2.1343943412908932) internal successors, (2414), 1656 states have internal predecessors, (2414), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2432 transitions. [2023-11-29 02:42:08,409 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2432 transitions. Word has length 6 [2023-11-29 02:42:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:08,410 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 2432 transitions. [2023-11-29 02:42:08,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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) [2023-11-29 02:42:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2432 transitions. [2023-11-29 02:42:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:42:08,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:08,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:08,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 02:42:08,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:08,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:08,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 624379352, now seen corresponding path program 1 times [2023-11-29 02:42:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554957805] [2023-11-29 02:42:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:08,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:08,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:08,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 02:42:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:08,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:42:08,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:08,786 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:08,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:08,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554957805] [2023-11-29 02:42:08,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554957805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:08,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:08,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909844882] [2023-11-29 02:42:08,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:42:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:42:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:08,789 INFO L87 Difference]: Start difference. First operand 1667 states and 2432 transitions. Second operand has 3 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) [2023-11-29 02:42:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:09,835 INFO L93 Difference]: Finished difference Result 1613 states and 2352 transitions. [2023-11-29 02:42:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:42:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 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 11 [2023-11-29 02:42:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:09,847 INFO L225 Difference]: With dead ends: 1613 [2023-11-29 02:42:09,847 INFO L226 Difference]: Without dead ends: 1613 [2023-11-29 02:42:09,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:09,849 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 70 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:09,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1741 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:42:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2023-11-29 02:42:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2023-11-29 02:42:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1101 states have (on average 2.119891008174387) internal successors, (2334), 1602 states have internal predecessors, (2334), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2352 transitions. [2023-11-29 02:42:09,892 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2352 transitions. Word has length 11 [2023-11-29 02:42:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:09,892 INFO L495 AbstractCegarLoop]: Abstraction has 1613 states and 2352 transitions. [2023-11-29 02:42:09,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2023-11-29 02:42:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2352 transitions. [2023-11-29 02:42:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 02:42:09,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:09,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:09,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 02:42:10,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:10,103 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:10,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1266867310, now seen corresponding path program 1 times [2023-11-29 02:42:10,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149418072] [2023-11-29 02:42:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:10,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:10,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:10,106 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:10,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 02:42:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:10,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:42:10,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:10,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:10,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149418072] [2023-11-29 02:42:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149418072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:10,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195237400] [2023-11-29 02:42:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:10,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:10,310 INFO L87 Difference]: Start difference. First operand 1613 states and 2352 transitions. Second operand has 4 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) [2023-11-29 02:42:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:11,994 INFO L93 Difference]: Finished difference Result 1599 states and 2310 transitions. [2023-11-29 02:42:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 13 [2023-11-29 02:42:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:12,006 INFO L225 Difference]: With dead ends: 1599 [2023-11-29 02:42:12,006 INFO L226 Difference]: Without dead ends: 1599 [2023-11-29 02:42:12,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:12,007 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 58 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:12,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2568 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 02:42:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2023-11-29 02:42:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1597. [2023-11-29 02:42:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1099 states have (on average 2.083712465878071) internal successors, (2290), 1586 states have internal predecessors, (2290), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2308 transitions. [2023-11-29 02:42:12,052 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2308 transitions. Word has length 13 [2023-11-29 02:42:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:12,053 INFO L495 AbstractCegarLoop]: Abstraction has 1597 states and 2308 transitions. [2023-11-29 02:42:12,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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) [2023-11-29 02:42:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2308 transitions. [2023-11-29 02:42:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:42:12,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:12,054 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:42:12,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 02:42:12,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:12,257 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:12,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1039830624, now seen corresponding path program 1 times [2023-11-29 02:42:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:12,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083558285] [2023-11-29 02:42:12,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:12,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:12,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:12,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:12,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 02:42:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:12,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:42:12,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:12,424 INFO L378 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 [2023-11-29 02:42:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:12,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:12,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083558285] [2023-11-29 02:42:12,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083558285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:12,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:12,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:12,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846557223] [2023-11-29 02:42:12,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:12,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:12,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:12,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:12,525 INFO L87 Difference]: Start difference. First operand 1597 states and 2308 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) [2023-11-29 02:42:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:16,059 INFO L93 Difference]: Finished difference Result 1650 states and 2311 transitions. [2023-11-29 02:42:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:16,060 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 27 [2023-11-29 02:42:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:16,068 INFO L225 Difference]: With dead ends: 1650 [2023-11-29 02:42:16,068 INFO L226 Difference]: Without dead ends: 1650 [2023-11-29 02:42:16,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:16,069 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 964 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:16,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 853 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 02:42:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2023-11-29 02:42:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1593. [2023-11-29 02:42:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1099 states have (on average 2.0764331210191083) internal successors, (2282), 1582 states have internal predecessors, (2282), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2300 transitions. [2023-11-29 02:42:16,113 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2300 transitions. Word has length 27 [2023-11-29 02:42:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:16,113 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2300 transitions. [2023-11-29 02:42:16,114 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) [2023-11-29 02:42:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2300 transitions. [2023-11-29 02:42:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:42:16,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:16,115 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:42:16,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 02:42:16,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:16,316 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:16,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1039830623, now seen corresponding path program 1 times [2023-11-29 02:42:16,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:16,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581368274] [2023-11-29 02:42:16,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:16,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:16,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:16,318 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:16,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 02:42:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:16,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:42:16,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:16,541 INFO L378 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 [2023-11-29 02:42:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:16,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:16,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581368274] [2023-11-29 02:42:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581368274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147347397] [2023-11-29 02:42:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:16,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:16,753 INFO L87 Difference]: Start difference. First operand 1593 states and 2300 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) [2023-11-29 02:42:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:21,559 INFO L93 Difference]: Finished difference Result 1739 states and 2312 transitions. [2023-11-29 02:42:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:21,560 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 27 [2023-11-29 02:42:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:21,567 INFO L225 Difference]: With dead ends: 1739 [2023-11-29 02:42:21,568 INFO L226 Difference]: Without dead ends: 1739 [2023-11-29 02:42:21,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:21,568 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 393 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:21,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1563 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-29 02:42:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2023-11-29 02:42:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1589. [2023-11-29 02:42:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1099 states have (on average 2.0691537761601455) internal successors, (2274), 1578 states have internal predecessors, (2274), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2292 transitions. [2023-11-29 02:42:21,597 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2292 transitions. Word has length 27 [2023-11-29 02:42:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:21,598 INFO L495 AbstractCegarLoop]: Abstraction has 1589 states and 2292 transitions. [2023-11-29 02:42:21,598 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) [2023-11-29 02:42:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2292 transitions. [2023-11-29 02:42:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:42:21,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:21,599 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:21,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 02:42:21,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:21,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:21,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2039883290, now seen corresponding path program 1 times [2023-11-29 02:42:21,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:21,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829084862] [2023-11-29 02:42:21,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:21,802 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:21,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 02:42:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:21,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:42:21,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:22,017 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:22,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:22,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829084862] [2023-11-29 02:42:22,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829084862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:22,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:22,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:22,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575347992] [2023-11-29 02:42:22,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:22,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:22,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:22,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:22,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:22,019 INFO L87 Difference]: Start difference. First operand 1589 states and 2292 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:23,246 INFO L93 Difference]: Finished difference Result 1577 states and 2272 transitions. [2023-11-29 02:42:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-29 02:42:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:23,255 INFO L225 Difference]: With dead ends: 1577 [2023-11-29 02:42:23,255 INFO L226 Difference]: Without dead ends: 1577 [2023-11-29 02:42:23,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:23,256 INFO L413 NwaCegarLoop]: 858 mSDtfsCounter, 23 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:23,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2554 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:42:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2023-11-29 02:42:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2023-11-29 02:42:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1087 states have (on average 2.0735970561177552) internal successors, (2254), 1566 states have internal predecessors, (2254), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2272 transitions. [2023-11-29 02:42:23,305 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2272 transitions. Word has length 43 [2023-11-29 02:42:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:23,305 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2272 transitions. [2023-11-29 02:42:23,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2272 transitions. [2023-11-29 02:42:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 02:42:23,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:23,307 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:23,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 02:42:23,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:23,508 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:23,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2056350726, now seen corresponding path program 1 times [2023-11-29 02:42:23,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137519936] [2023-11-29 02:42:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:23,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:23,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:23,511 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:23,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 02:42:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:23,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:42:23,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:23,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:23,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:23,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137519936] [2023-11-29 02:42:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137519936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:42:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685064412] [2023-11-29 02:42:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:23,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:42:23,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:42:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:23,960 INFO L87 Difference]: Start difference. First operand 1577 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:24,985 INFO L93 Difference]: Finished difference Result 1469 states and 2048 transitions. [2023-11-29 02:42:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:42:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2023-11-29 02:42:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:24,995 INFO L225 Difference]: With dead ends: 1469 [2023-11-29 02:42:24,996 INFO L226 Difference]: Without dead ends: 1469 [2023-11-29 02:42:24,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:24,997 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 59 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:24,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1667 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:42:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2023-11-29 02:42:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2023-11-29 02:42:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 979 states have (on average 2.073544433094995) internal successors, (2030), 1458 states have internal predecessors, (2030), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2048 transitions. [2023-11-29 02:42:25,031 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2048 transitions. Word has length 47 [2023-11-29 02:42:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:25,032 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 2048 transitions. [2023-11-29 02:42:25,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2048 transitions. [2023-11-29 02:42:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 02:42:25,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:25,034 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:25,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 02:42:25,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:25,237 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:25,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1733385412, now seen corresponding path program 1 times [2023-11-29 02:42:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567477609] [2023-11-29 02:42:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:25,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:25,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:25,240 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:25,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 02:42:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:25,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:42:25,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:25,709 INFO L378 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 [2023-11-29 02:42:25,716 INFO L378 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 [2023-11-29 02:42:26,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:42:26,208 INFO L378 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 9 [2023-11-29 02:42:26,229 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:42:26,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:42:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:26,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:26,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567477609] [2023-11-29 02:42:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567477609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332966935] [2023-11-29 02:42:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:26,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:26,257 INFO L87 Difference]: Start difference. First operand 1469 states and 2048 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:29,235 INFO L93 Difference]: Finished difference Result 1441 states and 1932 transitions. [2023-11-29 02:42:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 02:42:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:29,242 INFO L225 Difference]: With dead ends: 1441 [2023-11-29 02:42:29,242 INFO L226 Difference]: Without dead ends: 1441 [2023-11-29 02:42:29,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:29,243 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 943 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:29,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 290 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 02:42:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2023-11-29 02:42:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1252. [2023-11-29 02:42:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 846 states have (on average 1.9148936170212767) internal successors, (1620), 1241 states have internal predecessors, (1620), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1638 transitions. [2023-11-29 02:42:29,261 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1638 transitions. Word has length 50 [2023-11-29 02:42:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:29,261 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1638 transitions. [2023-11-29 02:42:29,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1638 transitions. [2023-11-29 02:42:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:42:29,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:29,263 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-11-29 02:42:29,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 02:42:29,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:29,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:29,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash -422384629, now seen corresponding path program 1 times [2023-11-29 02:42:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974146599] [2023-11-29 02:42:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:29,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:29,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:29,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 02:42:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:29,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:42:29,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:29,717 INFO L378 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 [2023-11-29 02:42:29,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:42:29,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:42:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:29,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:29,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:29,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974146599] [2023-11-29 02:42:29,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974146599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:29,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:29,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:29,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94915767] [2023-11-29 02:42:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:29,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:42:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:29,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:42:29,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:29,773 INFO L87 Difference]: Start difference. First operand 1252 states and 1638 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:33,433 INFO L93 Difference]: Finished difference Result 1251 states and 1636 transitions. [2023-11-29 02:42:33,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:42:33,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-11-29 02:42:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:33,442 INFO L225 Difference]: With dead ends: 1251 [2023-11-29 02:42:33,442 INFO L226 Difference]: Without dead ends: 1251 [2023-11-29 02:42:33,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:42:33,443 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 3 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:33,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1963 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 02:42:33,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-11-29 02:42:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2023-11-29 02:42:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 846 states have (on average 1.9125295508274232) internal successors, (1618), 1240 states have internal predecessors, (1618), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1636 transitions. [2023-11-29 02:42:33,461 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1636 transitions. Word has length 54 [2023-11-29 02:42:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:33,462 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 1636 transitions. [2023-11-29 02:42:33,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1636 transitions. [2023-11-29 02:42:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:42:33,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:33,464 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2023-11-29 02:42:33,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 02:42:33,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:33,669 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:33,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash -422384628, now seen corresponding path program 1 times [2023-11-29 02:42:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917121950] [2023-11-29 02:42:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:33,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:33,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:33,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:33,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 02:42:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:33,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 02:42:33,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:33,972 INFO L378 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 [2023-11-29 02:42:33,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:42:34,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:42:34,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 02:42:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:34,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:34,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:34,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917121950] [2023-11-29 02:42:34,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917121950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:34,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:34,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868614324] [2023-11-29 02:42:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:34,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:42:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:42:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:34,086 INFO L87 Difference]: Start difference. First operand 1251 states and 1636 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:38,652 INFO L93 Difference]: Finished difference Result 1250 states and 1634 transitions. [2023-11-29 02:42:38,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:42:38,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-11-29 02:42:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:38,659 INFO L225 Difference]: With dead ends: 1250 [2023-11-29 02:42:38,659 INFO L226 Difference]: Without dead ends: 1250 [2023-11-29 02:42:38,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:42:38,660 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 1 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:38,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1986 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 02:42:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-11-29 02:42:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2023-11-29 02:42:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 844 states have (on average 1.914691943127962) internal successors, (1616), 1239 states have internal predecessors, (1616), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:42:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1634 transitions. [2023-11-29 02:42:38,675 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1634 transitions. Word has length 54 [2023-11-29 02:42:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:38,676 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1634 transitions. [2023-11-29 02:42:38,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1634 transitions. [2023-11-29 02:42:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:42:38,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:38,677 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:38,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 02:42:38,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:38,877 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:38,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1614663759, now seen corresponding path program 1 times [2023-11-29 02:42:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36673066] [2023-11-29 02:42:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:38,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 [2023-11-29 02:42:38,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:38,879 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:38,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 02:42:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:39,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:42:39,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:39,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:39,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36673066] [2023-11-29 02:42:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36673066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:39,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:39,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:39,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343824769] [2023-11-29 02:42:39,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:39,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:39,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:39,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:39,152 INFO L87 Difference]: Start difference. First operand 1250 states and 1634 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:42:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:40,529 INFO L93 Difference]: Finished difference Result 1252 states and 1639 transitions. [2023-11-29 02:42:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:40,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-11-29 02:42:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:40,540 INFO L225 Difference]: With dead ends: 1252 [2023-11-29 02:42:40,540 INFO L226 Difference]: Without dead ends: 1252 [2023-11-29 02:42:40,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:40,541 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 1 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:40,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2349 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:42:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2023-11-29 02:42:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2023-11-29 02:42:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 845 states have (on average 1.9147928994082841) internal successors, (1618), 1241 states have internal predecessors, (1618), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:42:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1639 transitions. [2023-11-29 02:42:40,563 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1639 transitions. Word has length 60 [2023-11-29 02:42:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:40,564 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 1639 transitions. [2023-11-29 02:42:40,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:42:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1639 transitions. [2023-11-29 02:42:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 02:42:40,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:40,565 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:40,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 02:42:40,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:40,765 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:40,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1015966998, now seen corresponding path program 1 times [2023-11-29 02:42:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530477865] [2023-11-29 02:42:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:40,767 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:40,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 02:42:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:41,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:42:41,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:41,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:41,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530477865] [2023-11-29 02:42:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530477865] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:41,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:41,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 02:42:41,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554518934] [2023-11-29 02:42:41,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:41,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:42:41,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:42:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:42:41,094 INFO L87 Difference]: Start difference. First operand 1252 states and 1639 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:44,172 INFO L93 Difference]: Finished difference Result 1261 states and 1655 transitions. [2023-11-29 02:42:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:42:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2023-11-29 02:42:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:44,179 INFO L225 Difference]: With dead ends: 1261 [2023-11-29 02:42:44,180 INFO L226 Difference]: Without dead ends: 1261 [2023-11-29 02:42:44,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:42:44,180 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 6 mSDsluCounter, 4674 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:44,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5457 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 02:42:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2023-11-29 02:42:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1260. [2023-11-29 02:42:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 852 states have (on average 1.914319248826291) internal successors, (1631), 1248 states have internal predecessors, (1631), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:42:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1652 transitions. [2023-11-29 02:42:44,200 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1652 transitions. Word has length 61 [2023-11-29 02:42:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:44,200 INFO L495 AbstractCegarLoop]: Abstraction has 1260 states and 1652 transitions. [2023-11-29 02:42:44,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1652 transitions. [2023-11-29 02:42:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 02:42:44,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:44,201 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:44,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 02:42:44,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:44,402 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:44,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1038240271, now seen corresponding path program 2 times [2023-11-29 02:42:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:44,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825124416] [2023-11-29 02:42:44,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:42:44,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:44,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:44,404 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:44,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 02:42:44,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:42:44,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:42:44,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:42:44,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:44,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:45,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:45,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825124416] [2023-11-29 02:42:45,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825124416] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:45,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 02:42:45,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445427851] [2023-11-29 02:42:45,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:45,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:42:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:42:45,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:42:45,015 INFO L87 Difference]: Start difference. First operand 1260 states and 1652 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:47,967 INFO L93 Difference]: Finished difference Result 1275 states and 1682 transitions. [2023-11-29 02:42:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:42:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2023-11-29 02:42:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:47,974 INFO L225 Difference]: With dead ends: 1275 [2023-11-29 02:42:47,974 INFO L226 Difference]: Without dead ends: 1273 [2023-11-29 02:42:47,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:42:47,976 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 12 mSDsluCounter, 3905 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4688 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:47,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4688 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 02:42:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2023-11-29 02:42:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1269. [2023-11-29 02:42:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 861 states have (on average 1.9082462253193961) internal successors, (1643), 1257 states have internal predecessors, (1643), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:42:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1664 transitions. [2023-11-29 02:42:47,999 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1664 transitions. Word has length 64 [2023-11-29 02:42:47,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:48,000 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1664 transitions. [2023-11-29 02:42:48,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1664 transitions. [2023-11-29 02:42:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 02:42:48,000 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:48,001 INFO L195 NwaCegarLoop]: trace histogram [10, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:48,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 02:42:48,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:48,201 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:48,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2112840529, now seen corresponding path program 3 times [2023-11-29 02:42:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:48,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225667798] [2023-11-29 02:42:48,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:42:48,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:48,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:48,203 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:48,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 02:42:48,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 02:42:48,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:42:48,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 02:42:48,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:48,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:49,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:49,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225667798] [2023-11-29 02:42:49,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225667798] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:49,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:49,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 02:42:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811222388] [2023-11-29 02:42:49,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:49,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 02:42:49,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:49,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 02:42:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:42:49,517 INFO L87 Difference]: Start difference. First operand 1269 states and 1664 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:56,717 INFO L93 Difference]: Finished difference Result 1299 states and 1742 transitions. [2023-11-29 02:42:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:42:56,717 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-11-29 02:42:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:56,723 INFO L225 Difference]: With dead ends: 1299 [2023-11-29 02:42:56,723 INFO L226 Difference]: Without dead ends: 1296 [2023-11-29 02:42:56,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 02:42:56,724 INFO L413 NwaCegarLoop]: 781 mSDtfsCounter, 25 mSDsluCounter, 9342 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10123 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:56,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10123 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-29 02:42:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2023-11-29 02:42:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1287. [2023-11-29 02:42:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 879 states have (on average 1.8953356086461888) internal successors, (1666), 1275 states have internal predecessors, (1666), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:42:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1687 transitions. [2023-11-29 02:42:56,755 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1687 transitions. Word has length 70 [2023-11-29 02:42:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:56,755 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1687 transitions. [2023-11-29 02:42:56,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:42:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1687 transitions. [2023-11-29 02:42:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 02:42:56,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:56,756 INFO L195 NwaCegarLoop]: trace histogram [22, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:56,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 02:42:56,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:56,961 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:42:56,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1278879249, now seen corresponding path program 4 times [2023-11-29 02:42:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090250776] [2023-11-29 02:42:56,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:42:56,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:56,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:56,963 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:56,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 02:42:57,293 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:42:57,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:42:57,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:42:57,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:57,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:59,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:59,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090250776] [2023-11-29 02:42:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090250776] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:59,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:59,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 02:42:59,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190687216] [2023-11-29 02:42:59,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:59,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 02:42:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:59,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 02:42:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 02:42:59,294 INFO L87 Difference]: Start difference. First operand 1287 states and 1687 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:43:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:43:16,362 INFO L93 Difference]: Finished difference Result 1344 states and 1818 transitions. [2023-11-29 02:43:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 02:43:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2023-11-29 02:43:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:43:16,368 INFO L225 Difference]: With dead ends: 1344 [2023-11-29 02:43:16,368 INFO L226 Difference]: Without dead ends: 1342 [2023-11-29 02:43:16,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 02:43:16,372 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 48 mSDsluCounter, 17963 mSDsCounter, 0 mSdLazyCounter, 5650 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 18746 SdHoareTripleChecker+Invalid, 5777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 5650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:43:16,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 18746 Invalid, 5777 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [127 Valid, 5650 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2023-11-29 02:43:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2023-11-29 02:43:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1321. [2023-11-29 02:43:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 913 states have (on average 1.8751369112814895) internal successors, (1712), 1309 states have internal predecessors, (1712), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:43:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1733 transitions. [2023-11-29 02:43:16,396 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1733 transitions. Word has length 82 [2023-11-29 02:43:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:43:16,397 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1733 transitions. [2023-11-29 02:43:16,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:43:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1733 transitions. [2023-11-29 02:43:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:43:16,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:43:16,398 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:43:16,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 02:43:16,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:43:16,598 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:43:16,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:43:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1320217487, now seen corresponding path program 5 times [2023-11-29 02:43:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:43:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599653195] [2023-11-29 02:43:16,599 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:43:16,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:43:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:43:16,600 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:43:16,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 02:43:18,027 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:43:18,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:43:18,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 02:43:18,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:43:18,083 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:43:18,084 INFO L378 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 22 [2023-11-29 02:43:18,482 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:43:18,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 02:43:18,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:43:18,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2023-11-29 02:43:21,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:43:21,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2023-11-29 02:43:21,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2023-11-29 02:43:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:43:21,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:43:26,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:43:26,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599653195] [2023-11-29 02:43:26,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599653195] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:43:26,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1910833860] [2023-11-29 02:43:26,225 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:43:26,225 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:43:26,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:43:26,226 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:43:26,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 02:44:34,235 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:44:34,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:44:34,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:44:34,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:34,523 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:44:34,523 INFO L378 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 [2023-11-29 02:44:34,979 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:44:34,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:44:35,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:44:35,817 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:44:35,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:44:35,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:44:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:44:35,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:44:36,398 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 02:44:36,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-11-29 02:44:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1910833860] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:44:36,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:44:36,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2023-11-29 02:44:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323217505] [2023-11-29 02:44:36,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:44:36,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:44:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:44:36,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:44:36,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=473, Unknown=18, NotChecked=0, Total=552 [2023-11-29 02:44:36,504 INFO L87 Difference]: Start difference. First operand 1321 states and 1733 transitions. Second operand has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:44:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:57,295 INFO L93 Difference]: Finished difference Result 2306 states and 2744 transitions. [2023-11-29 02:44:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 02:44:57,295 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2023-11-29 02:44:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:57,301 INFO L225 Difference]: With dead ends: 2306 [2023-11-29 02:44:57,302 INFO L226 Difference]: Without dead ends: 2302 [2023-11-29 02:44:57,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=278, Invalid=1774, Unknown=18, NotChecked=0, Total=2070 [2023-11-29 02:44:57,303 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 4038 mSDsluCounter, 5587 mSDsCounter, 0 mSdLazyCounter, 8492 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 6100 SdHoareTripleChecker+Invalid, 8624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 8492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:57,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4038 Valid, 6100 Invalid, 8624 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [132 Valid, 8492 Invalid, 0 Unknown, 0 Unchecked, 19.5s Time] [2023-11-29 02:44:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2023-11-29 02:44:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 1770. [2023-11-29 02:44:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1357 states have (on average 1.7796610169491525) internal successors, (2415), 1750 states have internal predecessors, (2415), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:44:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2450 transitions. [2023-11-29 02:44:57,336 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2450 transitions. Word has length 104 [2023-11-29 02:44:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:57,336 INFO L495 AbstractCegarLoop]: Abstraction has 1770 states and 2450 transitions. [2023-11-29 02:44:57,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:44:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2450 transitions. [2023-11-29 02:44:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:44:57,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:57,338 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:44:57,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 02:44:57,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 02:44:57,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:44:57,740 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:44:57,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1320217488, now seen corresponding path program 1 times [2023-11-29 02:44:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:44:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789085593] [2023-11-29 02:44:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:57,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:44:57,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:44:57,742 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:44:57,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 02:44:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:58,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 02:44:58,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:58,550 INFO L378 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 [2023-11-29 02:44:58,833 INFO L378 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 [2023-11-29 02:44:58,846 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:44:58,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:44:58,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:44:58,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:44:58,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:44:58,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:44:59,849 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:44:59,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:44:59,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:44:59,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:44:59,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:44:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:44:59,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:45:01,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2624 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2625 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2625) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:45:01,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:45:01,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789085593] [2023-11-29 02:45:01,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789085593] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:45:01,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [895348559] [2023-11-29 02:45:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:45:01,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:45:01,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:45:01,430 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:45:01,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 02:46:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:47,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 02:46:47,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:47,118 INFO L378 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 [2023-11-29 02:46:47,403 INFO L378 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 [2023-11-29 02:46:47,422 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:46:47,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:46:47,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:46:47,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:46:47,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:46:47,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:46:48,300 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:46:48,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:46:48,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:46:48,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:46:48,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:46:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:46:48,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:49,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3160 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:46:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [895348559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:49,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:46:49,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 02:46:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133407764] [2023-11-29 02:46:49,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:46:49,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:46:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:46:49,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:46:49,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 02:46:49,664 INFO L87 Difference]: Start difference. First operand 1770 states and 2450 transitions. Second operand has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:47:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:47:05,391 INFO L93 Difference]: Finished difference Result 2113 states and 2759 transitions. [2023-11-29 02:47:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:47:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2023-11-29 02:47:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:47:05,399 INFO L225 Difference]: With dead ends: 2113 [2023-11-29 02:47:05,399 INFO L226 Difference]: Without dead ends: 2113 [2023-11-29 02:47:05,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 02:47:05,400 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 706 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 5658 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 5669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:47:05,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 2770 Invalid, 5669 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 5658 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2023-11-29 02:47:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2023-11-29 02:47:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1769. [2023-11-29 02:47:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1357 states have (on average 1.7774502579218865) internal successors, (2412), 1749 states have internal predecessors, (2412), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:47:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2447 transitions. [2023-11-29 02:47:05,427 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2447 transitions. Word has length 104 [2023-11-29 02:47:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:47:05,427 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2447 transitions. [2023-11-29 02:47:05,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:47:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2447 transitions. [2023-11-29 02:47:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 02:47:05,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:47:05,429 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:05,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 02:47:05,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-29 02:47:05,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:47:05,829 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:47:05,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:05,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1715188646, now seen corresponding path program 1 times [2023-11-29 02:47:05,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:47:05,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38432240] [2023-11-29 02:47:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:05,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:47:05,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:47:05,831 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:47:05,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 02:47:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:06,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 02:47:06,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:47:06,683 INFO L378 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 [2023-11-29 02:47:06,832 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:47:06,832 INFO L378 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 [2023-11-29 02:47:06,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:47:06,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:47:07,917 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:07,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:47:08,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:08,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:47:08,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:47:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:47:08,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:12,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 02:47:12,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3613))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3567)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:47:12,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:47:12,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38432240] [2023-11-29 02:47:12,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38432240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:12,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [780931369] [2023-11-29 02:47:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:12,575 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:47:12,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:47:12,576 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:47:12,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 02:47:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:16,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 02:47:16,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:47:16,662 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:47:16,663 INFO L378 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 [2023-11-29 02:47:17,085 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:47:17,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:47:17,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:47:17,974 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:47:17,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:47:18,192 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:47:18,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:47:18,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:47:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:47:18,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:18,296 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 02:47:18,311 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:47:18,819 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 02:47:18,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-11-29 02:47:18,831 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4064 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4064))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4018)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:47:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [780931369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:18,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:47:18,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2023-11-29 02:47:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319929420] [2023-11-29 02:47:18,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:47:18,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 02:47:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:47:18,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 02:47:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=486, Unknown=6, NotChecked=240, Total=812 [2023-11-29 02:47:18,836 INFO L87 Difference]: Start difference. First operand 1769 states and 2447 transitions. Second operand has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:47:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:47:44,653 INFO L93 Difference]: Finished difference Result 2298 states and 2730 transitions. [2023-11-29 02:47:44,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:47:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 02:47:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:47:44,660 INFO L225 Difference]: With dead ends: 2298 [2023-11-29 02:47:44,660 INFO L226 Difference]: Without dead ends: 2298 [2023-11-29 02:47:44,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=201, Invalid=1219, Unknown=6, NotChecked=380, Total=1806 [2023-11-29 02:47:44,661 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 1544 mSDsluCounter, 7040 mSDsCounter, 0 mSdLazyCounter, 10470 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 7559 SdHoareTripleChecker+Invalid, 10511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 10470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:47:44,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 7559 Invalid, 10511 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 10470 Invalid, 0 Unknown, 0 Unchecked, 24.9s Time] [2023-11-29 02:47:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2023-11-29 02:47:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1768. [2023-11-29 02:47:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1357 states have (on average 1.7752394988946205) internal successors, (2409), 1748 states have internal predecessors, (2409), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:47:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2444 transitions. [2023-11-29 02:47:44,691 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2444 transitions. Word has length 106 [2023-11-29 02:47:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:47:44,691 INFO L495 AbstractCegarLoop]: Abstraction has 1768 states and 2444 transitions. [2023-11-29 02:47:44,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:47:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2444 transitions. [2023-11-29 02:47:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 02:47:44,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:47:44,693 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:44,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-11-29 02:47:44,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 02:47:45,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:47:45,093 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:47:45,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1715188647, now seen corresponding path program 1 times [2023-11-29 02:47:45,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:47:45,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370481621] [2023-11-29 02:47:45,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:47:45,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:47:45,095 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:47:45,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 02:47:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:45,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 02:47:45,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:47:45,992 INFO L378 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 [2023-11-29 02:47:46,126 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:47:46,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:47:46,136 INFO L378 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:47:46,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:47:46,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:47:46,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:47:46,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-11-29 02:47:47,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:47,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:47:47,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:47:47,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:47,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:47:47,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:47:47,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:47:47,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-11-29 02:47:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:47:47,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:47,519 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:47:47,560 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_4515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_4515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_4516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:47:49,028 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4608 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4607) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4608) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4608 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4608))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4607) .cse2 v_ArrVal_4515) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:47:49,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:47:49,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370481621] [2023-11-29 02:47:49,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370481621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:49,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1849014842] [2023-11-29 02:47:49,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:49,041 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:47:49,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:47:49,042 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:47:49,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 02:47:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:53,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 02:47:53,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:47:53,152 INFO L378 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 [2023-11-29 02:47:53,518 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:47:53,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:47:53,533 INFO L378 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:47:53,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:47:53,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:47:53,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:47:53,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:47:54,554 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:47:54,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:47:54,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:47:54,739 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:47:54,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:47:54,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:47:54,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:47:54,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:47:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:47:54,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:54,843 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5059 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-11-29 02:47:54,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5059 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 02:47:56,402 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5059 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5151))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5152) .cse0 v_ArrVal_5060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5152) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5060) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 02:47:56,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1849014842] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:56,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:47:56,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 02:47:56,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754532948] [2023-11-29 02:47:56,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:47:56,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:47:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:47:56,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:47:56,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 02:47:56,415 INFO L87 Difference]: Start difference. First operand 1768 states and 2444 transitions. Second operand has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:48:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:48:16,437 INFO L93 Difference]: Finished difference Result 2121 states and 2764 transitions. [2023-11-29 02:48:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:48:16,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 02:48:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:48:16,442 INFO L225 Difference]: With dead ends: 2121 [2023-11-29 02:48:16,442 INFO L226 Difference]: Without dead ends: 2121 [2023-11-29 02:48:16,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 02:48:16,443 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1596 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 7220 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 7251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 7220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:48:16,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 2343 Invalid, 7251 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 7220 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2023-11-29 02:48:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2023-11-29 02:48:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1767. [2023-11-29 02:48:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1357 states have (on average 1.7730287398673545) internal successors, (2406), 1747 states have internal predecessors, (2406), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:48:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2441 transitions. [2023-11-29 02:48:16,477 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2441 transitions. Word has length 106 [2023-11-29 02:48:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:48:16,477 INFO L495 AbstractCegarLoop]: Abstraction has 1767 states and 2441 transitions. [2023-11-29 02:48:16,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:48:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2441 transitions. [2023-11-29 02:48:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:48:16,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:16,479 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:16,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 02:48:16,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 02:48:16,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:48:16,881 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:48:16,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash -969622441, now seen corresponding path program 1 times [2023-11-29 02:48:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:48:16,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826923763] [2023-11-29 02:48:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:16,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 [2023-11-29 02:48:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:48:16,883 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:48:16,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 02:48:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:17,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 02:48:17,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:17,845 INFO L378 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 [2023-11-29 02:48:17,992 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:48:17,992 INFO L378 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 [2023-11-29 02:48:18,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:48:18,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:48:19,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:48:19,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:48:19,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:48:19,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:48:19,442 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:48:19,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:48:19,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:48:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:48:19,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:48:19,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5574) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 02:48:19,591 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5574) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:48:19,608 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5574 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5573))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5574)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:48:21,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:48:21,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826923763] [2023-11-29 02:48:21,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826923763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:48:21,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1943158645] [2023-11-29 02:48:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:21,112 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:48:21,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:48:21,113 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:48:21,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 02:48:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:54,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 02:48:54,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:54,791 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:48:54,791 INFO L378 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 [2023-11-29 02:48:55,324 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:48:55,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:48:55,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:48:56,230 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:56,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:48:56,444 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:56,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:48:56,572 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:56,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:48:56,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:48:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:48:56,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:49:00,818 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:49:00,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6040))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6041)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:49:00,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6040))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6041)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:49:01,324 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 02:49:01,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2023-11-29 02:49:01,339 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6087 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6087))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6040)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6041)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:49:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1943158645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:49:01,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:49:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2023-11-29 02:49:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750740302] [2023-11-29 02:49:01,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:49:01,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 02:49:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 02:49:01,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=658, Unknown=20, NotChecked=406, Total=1190 [2023-11-29 02:49:01,344 INFO L87 Difference]: Start difference. First operand 1767 states and 2441 transitions. Second operand has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:49:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:49:29,019 INFO L93 Difference]: Finished difference Result 2294 states and 2724 transitions. [2023-11-29 02:49:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 02:49:29,019 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 02:49:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:49:29,025 INFO L225 Difference]: With dead ends: 2294 [2023-11-29 02:49:29,025 INFO L226 Difference]: Without dead ends: 2294 [2023-11-29 02:49:29,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=247, Invalid=1567, Unknown=20, NotChecked=616, Total=2450 [2023-11-29 02:49:29,026 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 2235 mSDsluCounter, 7072 mSDsCounter, 0 mSdLazyCounter, 10628 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2249 SdHoareTripleChecker+Valid, 7590 SdHoareTripleChecker+Invalid, 10687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 10628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:49:29,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2249 Valid, 7590 Invalid, 10687 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 10628 Invalid, 0 Unknown, 0 Unchecked, 26.6s Time] [2023-11-29 02:49:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2023-11-29 02:49:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 1766. [2023-11-29 02:49:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1357 states have (on average 1.7708179808400883) internal successors, (2403), 1746 states have internal predecessors, (2403), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:49:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2438 transitions. [2023-11-29 02:49:29,049 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2438 transitions. Word has length 108 [2023-11-29 02:49:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:49:29,050 INFO L495 AbstractCegarLoop]: Abstraction has 1766 states and 2438 transitions. [2023-11-29 02:49:29,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:49:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2438 transitions. [2023-11-29 02:49:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:49:29,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:49:29,051 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:49:29,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 02:49:29,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 02:49:29,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:49:29,451 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:49:29,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -969622440, now seen corresponding path program 1 times [2023-11-29 02:49:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:29,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613272888] [2023-11-29 02:49:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:29,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:49:29,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:29,454 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:49:29,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 02:49:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:30,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 02:49:30,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:30,478 INFO L378 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 [2023-11-29 02:49:30,590 INFO L378 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 [2023-11-29 02:49:30,604 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:49:30,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:49:30,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:49:30,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:49:30,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:49:30,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-11-29 02:49:31,550 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:49:31,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:49:31,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:49:31,703 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:49:31,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:49:31,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:49:31,821 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:49:31,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:49:31,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:49:31,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:49:31,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-11-29 02:49:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:49:31,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:49:32,081 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:49:32,121 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:49:32,256 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6553))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6554) .cse0 v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6554) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 02:49:32,380 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6554) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6553))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6554) .cse3 v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:49:34,389 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6648))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6647) .cse1 v_ArrVal_6554) (select (select (store .cse2 .cse1 v_ArrVal_6553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6556))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6648))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6553))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6647) .cse4 v_ArrVal_6554) .cse5 v_ArrVal_6556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 02:49:34,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613272888] [2023-11-29 02:49:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613272888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:49:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1849739328] [2023-11-29 02:49:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:34,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:49:34,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:49:34,409 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:49:34,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 02:50:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:13,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 02:50:13,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:50:13,421 INFO L378 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 [2023-11-29 02:50:13,926 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:50:13,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:50:13,946 INFO L378 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:50:14,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:50:14,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:50:14,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:50:14,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:50:15,324 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:50:15,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:50:15,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:50:15,608 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:50:15,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:50:15,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:50:15,802 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:50:15,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:50:15,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:50:15,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:50:15,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:50:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:50:15,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:50:15,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:50:15,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 02:50:16,078 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7115) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7114))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7115) .cse2 v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:50:16,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7115) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7114))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7115) .cse3 v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:50:19,182 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7209))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7208) .cse1 v_ArrVal_7115) (select (select (store .cse2 .cse1 v_ArrVal_7114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7117))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7209 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7209))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7114))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7208) .cse4 v_ArrVal_7115) .cse5 v_ArrVal_7117) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 02:50:19,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1849739328] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:50:19,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:50:19,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 02:50:19,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579196134] [2023-11-29 02:50:19,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:50:19,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 02:50:19,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:50:19,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 02:50:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 02:50:19,197 INFO L87 Difference]: Start difference. First operand 1766 states and 2438 transitions. Second operand has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:50:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:50:54,192 INFO L93 Difference]: Finished difference Result 2119 states and 2758 transitions. [2023-11-29 02:50:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:50:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 02:50:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:50:54,198 INFO L225 Difference]: With dead ends: 2119 [2023-11-29 02:50:54,198 INFO L226 Difference]: Without dead ends: 2119 [2023-11-29 02:50:54,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 02:50:54,200 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1585 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 8996 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 9025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:50:54,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 2793 Invalid, 9025 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 8996 Invalid, 0 Unknown, 0 Unchecked, 34.3s Time] [2023-11-29 02:50:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2023-11-29 02:50:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1765. [2023-11-29 02:50:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1357 states have (on average 1.7686072218128224) internal successors, (2400), 1745 states have internal predecessors, (2400), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:50:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2435 transitions. [2023-11-29 02:50:54,230 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2435 transitions. Word has length 108 [2023-11-29 02:50:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:50:54,231 INFO L495 AbstractCegarLoop]: Abstraction has 1765 states and 2435 transitions. [2023-11-29 02:50:54,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:50:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2435 transitions. [2023-11-29 02:50:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 02:50:54,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:50:54,232 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:54,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 02:50:54,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 02:50:54,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:50:54,633 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:50:54,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash 202263267, now seen corresponding path program 1 times [2023-11-29 02:50:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:50:54,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233775832] [2023-11-29 02:50:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:50:54,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:50:54,635 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:50:54,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 02:50:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:55,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 02:50:55,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:50:55,907 INFO L378 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 [2023-11-29 02:50:56,188 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:50:56,189 INFO L378 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 [2023-11-29 02:50:56,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:50:56,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:50:57,983 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:50:57,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:50:58,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:50:58,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:50:58,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:50:58,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:50:58,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:50:58,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:50:58,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:50:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:50:58,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:51:02,850 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7647) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:51:02,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7646))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7647)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:51:02,898 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7646))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7647)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:51:02,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7645))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7646)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7647)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:51:02,956 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7645))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7646)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7647)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:51:03,576 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7693))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7645)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7646)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7647)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:51:03,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:51:03,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233775832] [2023-11-29 02:51:03,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233775832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:51:03,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [951408422] [2023-11-29 02:51:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:51:03,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:51:03,585 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:51:03,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 02:51:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:48,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 02:51:48,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:51:49,018 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:51:49,018 INFO L378 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 [2023-11-29 02:51:49,872 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:51:49,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:51:49,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:51:51,263 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:51:51,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:51:51,612 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:51:51,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:51:51,826 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:51:51,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:51:52,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:51:52,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:51:52,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:51:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:51:52,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:51:52,223 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8130) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:51:52,247 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8130) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:51:52,272 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8129))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8130)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:51:52,296 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8129))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8130)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:51:52,323 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8128))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8129)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8130)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:51:53,270 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 02:51:53,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2023-11-29 02:51:53,293 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8176 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8128 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8176))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8129)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8130)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:51:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [951408422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:51:53,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:51:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2023-11-29 02:51:53,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497539777] [2023-11-29 02:51:53,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:51:53,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 02:51:53,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:51:53,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 02:51:53,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=713, Unknown=22, NotChecked=780, Total=1640 [2023-11-29 02:51:53,301 INFO L87 Difference]: Start difference. First operand 1765 states and 2435 transitions. Second operand has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:52:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:39,055 INFO L93 Difference]: Finished difference Result 2290 states and 2718 transitions. [2023-11-29 02:52:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 02:52:39,056 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 02:52:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:39,062 INFO L225 Difference]: With dead ends: 2290 [2023-11-29 02:52:39,062 INFO L226 Difference]: Without dead ends: 2290 [2023-11-29 02:52:39,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=279, Invalid=1726, Unknown=23, NotChecked=1164, Total=3192 [2023-11-29 02:52:39,064 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 1536 mSDsluCounter, 8484 mSDsCounter, 0 mSdLazyCounter, 12564 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 9001 SdHoareTripleChecker+Invalid, 12605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 12564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:39,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 9001 Invalid, 12605 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [41 Valid, 12564 Invalid, 0 Unknown, 0 Unchecked, 44.0s Time] [2023-11-29 02:52:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2023-11-29 02:52:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1764. [2023-11-29 02:52:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1357 states have (on average 1.7663964627855564) internal successors, (2397), 1744 states have internal predecessors, (2397), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:52:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 2432 transitions. [2023-11-29 02:52:39,097 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 2432 transitions. Word has length 110 [2023-11-29 02:52:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:39,097 INFO L495 AbstractCegarLoop]: Abstraction has 1764 states and 2432 transitions. [2023-11-29 02:52:39,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:52:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2432 transitions. [2023-11-29 02:52:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 02:52:39,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:39,099 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:39,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 02:52:39,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 02:52:39,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:39,499 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:52:39,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash 202263268, now seen corresponding path program 1 times [2023-11-29 02:52:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:39,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082816970] [2023-11-29 02:52:39,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:39,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:39,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:39,502 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:52:39,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 02:52:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:40,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 02:52:40,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:40,817 INFO L378 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 [2023-11-29 02:52:41,305 INFO L378 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 [2023-11-29 02:52:41,337 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:52:41,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:52:41,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:52:41,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:52:41,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:52:41,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:52:42,740 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:52:42,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:52:42,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:52:42,946 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:52:42,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:52:42,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:52:43,112 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:52:43,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:52:43,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:52:43,288 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:52:43,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:52:43,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:52:43,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:52:43,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:52:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:52:43,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:52:43,629 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:52:43,680 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 02:52:43,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8660))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8659) .cse0 v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8659) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 02:52:43,860 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8659) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8660))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8659) .cse3 v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:52:45,270 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8658))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8657) .cse1 v_ArrVal_8659) (select (select (store .cse2 .cse1 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8662))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8658))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8660))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8657) .cse4 v_ArrVal_8659) .cse5 v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 02:52:45,557 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_8658))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8660))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8657) .cse1 v_ArrVal_8659) .cse2 v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_8658))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8657) .cse7 v_ArrVal_8659) (select (select (store .cse8 .cse7 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8662))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2023-11-29 02:52:51,503 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8753))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8658))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8754) .cse1 v_ArrVal_8657) .cse2 v_ArrVal_8659) (select (select (store .cse3 .cse2 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8662))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8753))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8658))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8660))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8754) .cse6 v_ArrVal_8657) .cse7 v_ArrVal_8659) .cse8 v_ArrVal_8662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 02:52:51,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082816970] [2023-11-29 02:52:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082816970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:52:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [221838516] [2023-11-29 02:52:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:51,540 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:52:51,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:52:51,541 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:52:51,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_311449d0-1679-4608-adcb-e58518ec0b16/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 02:53:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:39,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 02:53:39,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:39,445 INFO L378 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 [2023-11-29 02:53:41,371 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:53:41,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:53:41,430 INFO L378 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 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:53:41,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:53:41,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:53:41,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:53:41,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:53:45,936 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:45,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:53:46,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:53:46,435 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:46,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:53:46,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:53:46,761 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:46,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:53:46,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:53:47,122 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:47,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:53:47,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:53:47,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:53:47,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:53:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:53:47,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:47,504 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:53:47,618 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 02:53:47,765 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9237) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9238))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9237) .cse2 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:53:48,040 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9237) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9238))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9237) .cse3 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:53:48,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9235))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9238))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9236) .cse0 v_ArrVal_9237) .cse1 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9235))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9236) .cse6 v_ArrVal_9237) (select (select (store .cse7 .cse6 v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9239))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 02:53:48,753 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9235))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9238))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9236) .cse1 v_ArrVal_9237) .cse2 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9235))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9236) .cse7 v_ArrVal_9237) (select (select (store .cse8 .cse7 v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9239))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 02:53:56,715 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9331))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9235))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9238))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9332) .cse0 v_ArrVal_9236) .cse1 v_ArrVal_9237) .cse2 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9331))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9235))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9332) .cse8 v_ArrVal_9236) .cse9 v_ArrVal_9237) (select (select (store .cse10 .cse9 v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9239))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 02:53:56,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [221838516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:56,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:53:56,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 02:53:56,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626447881] [2023-11-29 02:53:56,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:53:56,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:53:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:56,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:53:56,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=160, Unknown=14, NotChecked=518, Total=756 [2023-11-29 02:53:56,751 INFO L87 Difference]: Start difference. First operand 1764 states and 2432 transitions. Second operand has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)