./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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_0aa6a315-20bc-4965-b19e-ba12223b613e/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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:23:09,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:23:09,839 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:23:09,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:23:09,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:23:09,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:23:09,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:23:09,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:23:09,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:23:09,872 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:23:09,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:23:09,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:23:09,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:23:09,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:23:09,875 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:23:09,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:23:09,876 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:23:09,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:23:09,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:23:09,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:23:09,878 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:23:09,884 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:23:09,884 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:23:09,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:23:09,885 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:23:09,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:23:09,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:23:09,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:23:09,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:23:09,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:23:09,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:23:09,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:23:09,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:23:09,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:23:09,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:23:09,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:23:09,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:23:09,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:23:09,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:23:09,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:23:09,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:23:09,890 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_0aa6a315-20bc-4965-b19e-ba12223b613e/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_0aa6a315-20bc-4965-b19e-ba12223b613e/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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2023-11-29 03:23:10,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:23:10,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:23:10,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:23:10,161 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:23:10,161 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:23:10,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2023-11-29 03:23:13,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:23:13,443 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:23:13,443 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2023-11-29 03:23:13,462 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/data/71e5a4588/567456504b274aca8f241e6fe5b7b67d/FLAGad9b398c3 [2023-11-29 03:23:13,474 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/data/71e5a4588/567456504b274aca8f241e6fe5b7b67d [2023-11-29 03:23:13,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:23:13,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:23:13,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:23:13,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:23:13,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:23:13,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:23:13" (1/1) ... [2023-11-29 03:23:13,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cf65ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:13, skipping insertion in model container [2023-11-29 03:23:13,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:23:13" (1/1) ... [2023-11-29 03:23:13,543 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:23:13,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:23:13,990 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 03:23:13,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@77877ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:13, skipping insertion in model container [2023-11-29 03:23:13,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:23:13,991 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 03:23:13,993 INFO L158 Benchmark]: Toolchain (without parser) took 513.95ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 104.0MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:23:13,993 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 174.1MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:23:13,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.37ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 104.0MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:23:13,995 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.24ms. Allocated memory is still 174.1MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.37ms. Allocated memory is still 174.1MB. Free memory was 124.6MB in the beginning and 104.0MB in the end (delta: 20.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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_0aa6a315-20bc-4965-b19e-ba12223b613e/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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:23:15,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:23:15,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:23:15,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:23:15,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:23:15,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:23:15,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:23:15,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:23:15,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:23:15,886 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:23:15,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:23:15,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:23:15,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:23:15,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:23:15,889 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:23:15,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:23:15,890 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:23:15,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:23:15,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:23:15,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:23:15,892 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:23:15,893 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:23:15,893 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:23:15,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:23:15,894 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:23:15,894 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:23:15,895 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:23:15,895 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:23:15,896 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:23:15,896 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:23:15,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:23:15,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:23:15,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:23:15,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:23:15,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:23:15,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:23:15,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:23:15,899 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:23:15,899 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:23:15,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:23:15,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:23:15,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:23:15,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:23:15,900 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:23:15,900 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_0aa6a315-20bc-4965-b19e-ba12223b613e/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_0aa6a315-20bc-4965-b19e-ba12223b613e/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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2023-11-29 03:23:16,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:23:16,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:23:16,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:23:16,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:23:16,255 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:23:16,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2023-11-29 03:23:19,060 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:23:19,359 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:23:19,360 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2023-11-29 03:23:19,379 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/data/0eac2fb0f/4d6710290bcd4dd3855560d591a9d940/FLAGb07260ee9 [2023-11-29 03:23:19,395 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/data/0eac2fb0f/4d6710290bcd4dd3855560d591a9d940 [2023-11-29 03:23:19,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:23:19,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:23:19,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:23:19,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:23:19,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:23:19,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:23:19" (1/1) ... [2023-11-29 03:23:19,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7527e8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:19, skipping insertion in model container [2023-11-29 03:23:19,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:23:19" (1/1) ... [2023-11-29 03:23:19,492 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:23:20,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:23:20,037 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 03:23:20,056 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:23:20,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:23:20,193 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:23:20,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:23:20,297 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:23:20,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20 WrapperNode [2023-11-29 03:23:20,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:23:20,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:23:20,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:23:20,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:23:20,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,395 INFO L138 Inliner]: procedures = 180, calls = 350, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1173 [2023-11-29 03:23:20,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:23:20,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:23:20,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:23:20,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:23:20,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,518 INFO L175 MemorySlicer]: Split 319 memory accesses to 4 slices as follows [2, 307, 5, 5]. 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, 82, 1, 1]. [2023-11-29 03:23:20,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:23:20,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:23:20,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:23:20,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:23:20,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (1/1) ... [2023-11-29 03:23:20,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:23:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:23:20,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:23:20,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:23:20,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 03:23:20,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 03:23:20,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 03:23:20,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 03:23:20,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:23:20,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:23:20,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 03:23:20,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 03:23:20,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 03:23:20,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 03:23:20,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 03:23:20,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 03:23:20,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 03:23:20,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 03:23:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 03:23:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 03:23:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 03:23:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 03:23:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:23:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:23:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:23:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:23:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:23:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:23:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 03:23:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:23:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:23:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:23:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 03:23:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:23:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:23:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:23:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:23:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 03:23:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:23:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:23:20,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:23:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 03:23:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:23:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:23:20,940 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:23:20,943 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:23:20,947 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:23:21,001 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:23:21,024 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:23:21,045 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:23:26,235 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:23:26,419 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:23:26,419 INFO L309 CfgBuilder]: Removed 60 assume(true) statements. [2023-11-29 03:23:26,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:23:26 BoogieIcfgContainer [2023-11-29 03:23:26,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:23:26,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:23:26,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:23:26,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:23:26,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:23:19" (1/3) ... [2023-11-29 03:23:26,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d63b6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:23:26, skipping insertion in model container [2023-11-29 03:23:26,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:23:20" (2/3) ... [2023-11-29 03:23:26,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d63b6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:23:26, skipping insertion in model container [2023-11-29 03:23:26,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:23:26" (3/3) ... [2023-11-29 03:23:26,430 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-1.i [2023-11-29 03:23:26,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:23:26,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2023-11-29 03:23:26,520 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:23:26,528 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;@52404a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:23:26,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2023-11-29 03:23:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 1157 states, 496 states have (on average 2.5524193548387095) internal successors, (1266), 1148 states have internal predecessors, (1266), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:23:26,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:26,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:23:26,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 03:23:26,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 62011059, now seen corresponding path program 1 times [2023-11-29 03:23:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:26,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635101534] [2023-11-29 03:23:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:26,563 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 03:23:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:26,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:26,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:26,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:23:26,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:26,800 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 03:23:26,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:26,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635101534] [2023-11-29 03:23:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635101534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:26,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:23:26,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694817752] [2023-11-29 03:23:26,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:26,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:23:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:26,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:23:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:23:26,847 INFO L87 Difference]: Start difference. First operand has 1157 states, 496 states have (on average 2.5524193548387095) internal successors, (1266), 1148 states have internal predecessors, (1266), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:27,693 INFO L93 Difference]: Finished difference Result 1138 states and 1210 transitions. [2023-11-29 03:23:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:23:27,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:23:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:27,721 INFO L225 Difference]: With dead ends: 1138 [2023-11-29 03:23:27,722 INFO L226 Difference]: Without dead ends: 1137 [2023-11-29 03:23:27,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:23:27,727 INFO L413 NwaCegarLoop]: 1085 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:27,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1085 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:23:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2023-11-29 03:23:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2023-11-29 03:23:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 487 states have (on average 2.4168377823408624) internal successors, (1177), 1128 states have internal predecessors, (1177), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1209 transitions. [2023-11-29 03:23:27,856 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1209 transitions. Word has length 4 [2023-11-29 03:23:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:27,856 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1209 transitions. [2023-11-29 03:23:27,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1209 transitions. [2023-11-29 03:23:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:23:27,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:27,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:23:27,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:28,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:28,058 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 03:23:28,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash 62011121, now seen corresponding path program 1 times [2023-11-29 03:23:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:28,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802987524] [2023-11-29 03:23:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:28,061 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 03:23:28,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:28,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:28,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:28,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:23:28,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:28,268 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 03:23:28,286 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 03:23:28,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:28,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802987524] [2023-11-29 03:23:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802987524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:28,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:23:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85925876] [2023-11-29 03:23:28,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:28,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:23:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:28,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:23:28,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:23:28,292 INFO L87 Difference]: Start difference. First operand 1137 states and 1209 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:30,797 INFO L93 Difference]: Finished difference Result 1167 states and 1252 transitions. [2023-11-29 03:23:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:23:30,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:23:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:30,803 INFO L225 Difference]: With dead ends: 1167 [2023-11-29 03:23:30,804 INFO L226 Difference]: Without dead ends: 1167 [2023-11-29 03:23:30,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:23:30,806 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 1042 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:30,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 576 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 03:23:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2023-11-29 03:23:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1110. [2023-11-29 03:23:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 553 states have (on average 2.18625678119349) internal successors, (1209), 1101 states have internal predecessors, (1209), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1241 transitions. [2023-11-29 03:23:30,833 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1241 transitions. Word has length 4 [2023-11-29 03:23:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:30,834 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1241 transitions. [2023-11-29 03:23:30,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1241 transitions. [2023-11-29 03:23:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:23:30,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:30,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:23:30,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:31,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:31,035 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 03:23:31,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash 62011122, now seen corresponding path program 1 times [2023-11-29 03:23:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752082079] [2023-11-29 03:23:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:31,037 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 03:23:31,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:31,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:31,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:31,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:23:31,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:31,174 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 03:23:31,196 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 03:23:31,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:31,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752082079] [2023-11-29 03:23:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752082079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:23:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373505275] [2023-11-29 03:23:31,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:31,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:23:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:31,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:23:31,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:23:31,200 INFO L87 Difference]: Start difference. First operand 1110 states and 1241 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:35,457 INFO L93 Difference]: Finished difference Result 1382 states and 1533 transitions. [2023-11-29 03:23:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:23:35,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:23:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:35,467 INFO L225 Difference]: With dead ends: 1382 [2023-11-29 03:23:35,468 INFO L226 Difference]: Without dead ends: 1382 [2023-11-29 03:23:35,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:23:35,469 INFO L413 NwaCegarLoop]: 809 mSDtfsCounter, 456 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:35,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1198 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 03:23:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2023-11-29 03:23:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1233. [2023-11-29 03:23:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 686 states have (on average 2.1603498542274053) internal successors, (1482), 1224 states have internal predecessors, (1482), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1514 transitions. [2023-11-29 03:23:35,503 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1514 transitions. Word has length 4 [2023-11-29 03:23:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:35,504 INFO L495 AbstractCegarLoop]: Abstraction has 1233 states and 1514 transitions. [2023-11-29 03:23:35,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1514 transitions. [2023-11-29 03:23:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:23:35,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:35,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:23:35,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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)] Ended with exit code 0 [2023-11-29 03:23:35,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:35,706 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 03:23:35,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1924036044, now seen corresponding path program 1 times [2023-11-29 03:23:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628419433] [2023-11-29 03:23:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:35,707 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 03:23:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:35,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:35,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:35,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:23:35,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:35,810 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 03:23:35,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:35,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:35,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628419433] [2023-11-29 03:23:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628419433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:35,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:35,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:23:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597874885] [2023-11-29 03:23:35,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:35,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:23:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:35,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:23:35,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:23:35,816 INFO L87 Difference]: Start difference. First operand 1233 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 03:23:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:37,512 INFO L93 Difference]: Finished difference Result 2422 states and 2964 transitions. [2023-11-29 03:23:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:23:37,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 03:23:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:37,528 INFO L225 Difference]: With dead ends: 2422 [2023-11-29 03:23:37,529 INFO L226 Difference]: Without dead ends: 2422 [2023-11-29 03:23:37,529 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 03:23:37,530 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 1029 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:37,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1955 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 03:23:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2023-11-29 03:23:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1234. [2023-11-29 03:23:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 687 states have (on average 2.158660844250364) internal successors, (1483), 1225 states have internal predecessors, (1483), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1515 transitions. [2023-11-29 03:23:37,575 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1515 transitions. Word has length 5 [2023-11-29 03:23:37,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:37,575 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 1515 transitions. [2023-11-29 03:23:37,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 03:23:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1515 transitions. [2023-11-29 03:23:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:23:37,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:37,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:23:37,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:37,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:37,779 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 03:23:37,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2120129477, now seen corresponding path program 1 times [2023-11-29 03:23:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979722407] [2023-11-29 03:23:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:37,781 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 03:23:37,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:37,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:37,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:37,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:23:37,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:37,932 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 03:23:37,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:37,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:37,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979722407] [2023-11-29 03:23:37,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979722407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:23:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718889542] [2023-11-29 03:23:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:37,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:23:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:23:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:23:37,935 INFO L87 Difference]: Start difference. First operand 1234 states and 1515 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:39,077 INFO L93 Difference]: Finished difference Result 1195 states and 1475 transitions. [2023-11-29 03:23:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:23:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 03:23:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:39,085 INFO L225 Difference]: With dead ends: 1195 [2023-11-29 03:23:39,085 INFO L226 Difference]: Without dead ends: 1195 [2023-11-29 03:23:39,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 03:23:39,086 INFO L413 NwaCegarLoop]: 933 mSDtfsCounter, 70 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1817 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:39,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1817 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:23:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2023-11-29 03:23:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2023-11-29 03:23:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 672 states have (on average 2.1473214285714284) internal successors, (1443), 1186 states have internal predecessors, (1443), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1475 transitions. [2023-11-29 03:23:39,115 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1475 transitions. Word has length 10 [2023-11-29 03:23:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:39,116 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1475 transitions. [2023-11-29 03:23:39,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1475 transitions. [2023-11-29 03:23:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:23:39,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:39,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:23:39,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:23:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:39,317 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 03:23:39,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1629932395, now seen corresponding path program 1 times [2023-11-29 03:23:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561507501] [2023-11-29 03:23:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:39,319 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 03:23:39,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:39,320 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:39,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:39,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:23:39,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:23:39,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:39,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561507501] [2023-11-29 03:23:39,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561507501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:39,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:39,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:23:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335203853] [2023-11-29 03:23:39,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:39,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:23:39,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:39,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:23:39,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:23:39,501 INFO L87 Difference]: Start difference. First operand 1195 states and 1475 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:40,944 INFO L93 Difference]: Finished difference Result 1181 states and 1454 transitions. [2023-11-29 03:23:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:23:40,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:23:40,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:40,951 INFO L225 Difference]: With dead ends: 1181 [2023-11-29 03:23:40,951 INFO L226 Difference]: Without dead ends: 1181 [2023-11-29 03:23:40,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 03:23:40,952 INFO L413 NwaCegarLoop]: 902 mSDtfsCounter, 58 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2682 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.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:40,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2682 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:23:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2023-11-29 03:23:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1180. [2023-11-29 03:23:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 671 states have (on average 2.1177347242921014) internal successors, (1421), 1171 states have internal predecessors, (1421), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1453 transitions. [2023-11-29 03:23:40,973 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1453 transitions. Word has length 12 [2023-11-29 03:23:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:40,973 INFO L495 AbstractCegarLoop]: Abstraction has 1180 states and 1453 transitions. [2023-11-29 03:23:40,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1453 transitions. [2023-11-29 03:23:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:23:40,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:40,974 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] [2023-11-29 03:23:40,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:41,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:41,175 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 03:23:41,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash 380814595, now seen corresponding path program 1 times [2023-11-29 03:23:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620131852] [2023-11-29 03:23:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:41,176 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 03:23:41,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:41,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:41,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:41,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:23:41,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:41,336 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 03:23:41,431 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 03:23:41,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:41,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620131852] [2023-11-29 03:23:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620131852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:41,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:23:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152427142] [2023-11-29 03:23:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:23:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:23:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:23:41,434 INFO L87 Difference]: Start difference. First operand 1180 states and 1453 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:44,904 INFO L93 Difference]: Finished difference Result 1233 states and 1460 transitions. [2023-11-29 03:23:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:23:44,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:23:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:44,909 INFO L225 Difference]: With dead ends: 1233 [2023-11-29 03:23:44,909 INFO L226 Difference]: Without dead ends: 1233 [2023-11-29 03:23:44,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:23:44,910 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 977 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:44,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 913 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 03:23:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2023-11-29 03:23:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1176. [2023-11-29 03:23:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 671 states have (on average 2.1117734724292103) internal successors, (1417), 1167 states have internal predecessors, (1417), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1449 transitions. [2023-11-29 03:23:44,931 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1449 transitions. Word has length 26 [2023-11-29 03:23:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:44,932 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1449 transitions. [2023-11-29 03:23:44,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1449 transitions. [2023-11-29 03:23:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:23:44,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:44,933 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] [2023-11-29 03:23:44,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:45,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:45,134 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 03:23:45,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 380814596, now seen corresponding path program 1 times [2023-11-29 03:23:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553119358] [2023-11-29 03:23:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:45,134 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 03:23:45,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:45,135 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:45,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:45,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:23:45,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:45,276 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 03:23:45,437 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 03:23:45,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:45,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:45,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553119358] [2023-11-29 03:23:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553119358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:45,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:45,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:23:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199499684] [2023-11-29 03:23:45,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:45,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:23:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:23:45,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:23:45,439 INFO L87 Difference]: Start difference. First operand 1176 states and 1449 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:50,153 INFO L93 Difference]: Finished difference Result 1321 states and 1464 transitions. [2023-11-29 03:23:50,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:23:50,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:23:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:50,159 INFO L225 Difference]: With dead ends: 1321 [2023-11-29 03:23:50,159 INFO L226 Difference]: Without dead ends: 1321 [2023-11-29 03:23:50,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:23:50,160 INFO L413 NwaCegarLoop]: 773 mSDtfsCounter, 393 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1577 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 03:23:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2023-11-29 03:23:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1172. [2023-11-29 03:23:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 671 states have (on average 2.105812220566319) internal successors, (1413), 1163 states have internal predecessors, (1413), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1445 transitions. [2023-11-29 03:23:50,184 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1445 transitions. Word has length 26 [2023-11-29 03:23:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:50,184 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1445 transitions. [2023-11-29 03:23:50,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1445 transitions. [2023-11-29 03:23:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 03:23:50,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:50,186 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] [2023-11-29 03:23:50,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:50,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:50,387 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 03:23:50,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 192720509, now seen corresponding path program 1 times [2023-11-29 03:23:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990341154] [2023-11-29 03:23:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:50,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 03:23:50,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:50,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:50,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:50,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:23:50,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:50,619 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 03:23:50,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:50,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:50,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990341154] [2023-11-29 03:23:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990341154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:50,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:50,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:23:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171593840] [2023-11-29 03:23:50,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:50,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:23:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:50,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:23:50,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:23:50,622 INFO L87 Difference]: Start difference. First operand 1172 states and 1445 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 03:23:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:51,986 INFO L93 Difference]: Finished difference Result 1166 states and 1435 transitions. [2023-11-29 03:23:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:23:51,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2023-11-29 03:23:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:51,994 INFO L225 Difference]: With dead ends: 1166 [2023-11-29 03:23:51,994 INFO L226 Difference]: Without dead ends: 1166 [2023-11-29 03:23:51,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 03:23:51,995 INFO L413 NwaCegarLoop]: 896 mSDtfsCounter, 23 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2668 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.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:51,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2668 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 03:23:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-11-29 03:23:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2023-11-29 03:23:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 665 states have (on average 2.1097744360902255) internal successors, (1403), 1157 states have internal predecessors, (1403), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1435 transitions. [2023-11-29 03:23:52,016 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1435 transitions. Word has length 42 [2023-11-29 03:23:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:52,017 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1435 transitions. [2023-11-29 03:23:52,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 03:23:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1435 transitions. [2023-11-29 03:23:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 03:23:52,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:52,019 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] [2023-11-29 03:23:52,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:52,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:52,219 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 03:23:52,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2124802211, now seen corresponding path program 1 times [2023-11-29 03:23:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:52,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897153492] [2023-11-29 03:23:52,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:52,221 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 03:23:52,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:52,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:52,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:52,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:23:52,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:52,721 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 03:23:52,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:52,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897153492] [2023-11-29 03:23:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897153492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:23:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879576141] [2023-11-29 03:23:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:52,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:23:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:23:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:23:52,723 INFO L87 Difference]: Start difference. First operand 1166 states and 1435 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 03:23:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:53,886 INFO L93 Difference]: Finished difference Result 1209 states and 1478 transitions. [2023-11-29 03:23:53,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:23:53,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2023-11-29 03:23:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:53,893 INFO L225 Difference]: With dead ends: 1209 [2023-11-29 03:23:53,893 INFO L226 Difference]: Without dead ends: 1209 [2023-11-29 03:23:53,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 03:23:53,894 INFO L413 NwaCegarLoop]: 911 mSDtfsCounter, 59 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1744 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:53,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1744 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:23:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2023-11-29 03:23:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2023-11-29 03:23:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 708 states have (on average 2.042372881355932) internal successors, (1446), 1200 states have internal predecessors, (1446), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1478 transitions. [2023-11-29 03:23:53,918 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1478 transitions. Word has length 46 [2023-11-29 03:23:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:53,919 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1478 transitions. [2023-11-29 03:23:53,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 03:23:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1478 transitions. [2023-11-29 03:23:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 03:23:53,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:53,921 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] [2023-11-29 03:23:53,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:54,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:54,122 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 03:23:54,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash -862114412, now seen corresponding path program 1 times [2023-11-29 03:23:54,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:54,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818525702] [2023-11-29 03:23:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:54,124 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 03:23:54,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:54,125 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:54,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:54,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:23:54,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:54,529 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 03:23:54,539 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 03:23:55,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:23:55,060 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 03:23:55,081 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:23:55,082 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 03:23:55,098 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 03:23:55,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:55,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818525702] [2023-11-29 03:23:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818525702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:55,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:55,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:23:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744690492] [2023-11-29 03:23:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:55,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:23:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:55,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:23:55,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:23:55,101 INFO L87 Difference]: Start difference. First operand 1209 states and 1478 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 03:23:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:58,318 INFO L93 Difference]: Finished difference Result 1181 states and 1404 transitions. [2023-11-29 03:23:58,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:23:58,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2023-11-29 03:23:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:58,324 INFO L225 Difference]: With dead ends: 1181 [2023-11-29 03:23:58,324 INFO L226 Difference]: Without dead ends: 1181 [2023-11-29 03:23:58,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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 03:23:58,325 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 943 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:58,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 402 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 03:23:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2023-11-29 03:23:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 992. [2023-11-29 03:23:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 575 states have (on average 1.8747826086956523) internal successors, (1078), 983 states have internal predecessors, (1078), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:23:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1110 transitions. [2023-11-29 03:23:58,346 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1110 transitions. Word has length 49 [2023-11-29 03:23:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:58,346 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1110 transitions. [2023-11-29 03:23:58,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 03:23:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1110 transitions. [2023-11-29 03:23:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 03:23:58,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:58,348 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] [2023-11-29 03:23:58,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:58,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:58,556 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 03:23:58,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash 440084550, now seen corresponding path program 1 times [2023-11-29 03:23:58,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:58,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179694904] [2023-11-29 03:23:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:58,557 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 03:23:58,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:58,558 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:58,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:23:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:58,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:23:58,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:58,835 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 03:23:58,852 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 03:23:58,881 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 03:23:58,893 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 03:23:58,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:58,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:58,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179694904] [2023-11-29 03:23:58,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179694904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:58,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:58,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:23:58,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068702396] [2023-11-29 03:23:58,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:58,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:23:58,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:58,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:23:58,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:23:58,896 INFO L87 Difference]: Start difference. First operand 992 states and 1110 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 03:24:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:02,754 INFO L93 Difference]: Finished difference Result 991 states and 1109 transitions. [2023-11-29 03:24:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:24:02,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2023-11-29 03:24:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:02,759 INFO L225 Difference]: With dead ends: 991 [2023-11-29 03:24:02,759 INFO L226 Difference]: Without dead ends: 991 [2023-11-29 03:24:02,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 03:24:02,760 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 3 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:02,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2112 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 03:24:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2023-11-29 03:24:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2023-11-29 03:24:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 575 states have (on average 1.8730434782608696) internal successors, (1077), 982 states have internal predecessors, (1077), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:24:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1109 transitions. [2023-11-29 03:24:02,779 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1109 transitions. Word has length 53 [2023-11-29 03:24:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:02,779 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 1109 transitions. [2023-11-29 03:24:02,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 03:24:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1109 transitions. [2023-11-29 03:24:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 03:24:02,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:02,781 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] [2023-11-29 03:24:02,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:02,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:02,982 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 03:24:02,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 440084551, now seen corresponding path program 1 times [2023-11-29 03:24:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631556054] [2023-11-29 03:24:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:02,983 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 03:24:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:02,984 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:02,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:03,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:24:03,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:03,217 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 03:24:03,235 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 03:24:03,243 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 03:24:03,282 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 03:24:03,300 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 03:24:03,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:24:03,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:03,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631556054] [2023-11-29 03:24:03,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631556054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:24:03,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:24:03,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:24:03,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646489608] [2023-11-29 03:24:03,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:24:03,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:24:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:03,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:24:03,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:24:03,302 INFO L87 Difference]: Start difference. First operand 991 states and 1109 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 03:24:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:07,257 INFO L93 Difference]: Finished difference Result 990 states and 1108 transitions. [2023-11-29 03:24:07,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:24:07,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2023-11-29 03:24:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:07,262 INFO L225 Difference]: With dead ends: 990 [2023-11-29 03:24:07,262 INFO L226 Difference]: Without dead ends: 990 [2023-11-29 03:24:07,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 03:24:07,263 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 1 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:07,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2135 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-29 03:24:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2023-11-29 03:24:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2023-11-29 03:24:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 574 states have (on average 1.8745644599303135) internal successors, (1076), 981 states have internal predecessors, (1076), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 03:24:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1108 transitions. [2023-11-29 03:24:07,277 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1108 transitions. Word has length 53 [2023-11-29 03:24:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:07,278 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1108 transitions. [2023-11-29 03:24:07,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 03:24:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1108 transitions. [2023-11-29 03:24:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:24:07,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:07,279 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] [2023-11-29 03:24:07,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:07,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:07,479 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 03:24:07,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -876921302, now seen corresponding path program 1 times [2023-11-29 03:24:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020560008] [2023-11-29 03:24:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:07,480 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 03:24:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:07,481 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:07,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:07,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:24:07,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:07,726 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 03:24:07,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:24:07,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020560008] [2023-11-29 03:24:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020560008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:24:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:24:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:24:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871632065] [2023-11-29 03:24:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:24:07,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:24:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:24:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:24:07,728 INFO L87 Difference]: Start difference. First operand 990 states and 1108 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 03:24:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:09,005 INFO L93 Difference]: Finished difference Result 992 states and 1112 transitions. [2023-11-29 03:24:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:24:09,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2023-11-29 03:24:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:09,012 INFO L225 Difference]: With dead ends: 992 [2023-11-29 03:24:09,012 INFO L226 Difference]: Without dead ends: 992 [2023-11-29 03:24:09,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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 03:24:09,013 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 1 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2463 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 03:24:09,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2463 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 03:24:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2023-11-29 03:24:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2023-11-29 03:24:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 575 states have (on average 1.8747826086956523) internal successors, (1078), 983 states have internal predecessors, (1078), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:24:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1112 transitions. [2023-11-29 03:24:09,032 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1112 transitions. Word has length 59 [2023-11-29 03:24:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:09,032 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1112 transitions. [2023-11-29 03:24:09,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 03:24:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1112 transitions. [2023-11-29 03:24:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 03:24:09,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:09,033 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 03:24:09,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:09,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:09,234 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 03:24:09,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1359391133, now seen corresponding path program 1 times [2023-11-29 03:24:09,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:09,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562040318] [2023-11-29 03:24:09,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:09,235 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 03:24:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:09,236 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:09,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:09,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:24:09,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:09,571 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 03:24:09,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:24:09,641 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 03:24:09,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:09,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562040318] [2023-11-29 03:24:09,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562040318] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:24:09,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:24:09,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 03:24:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299365719] [2023-11-29 03:24:09,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:24:09,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:24:09,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:09,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:24:09,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:24:09,644 INFO L87 Difference]: Start difference. First operand 992 states and 1112 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 03:24:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:11,583 INFO L93 Difference]: Finished difference Result 1001 states and 1127 transitions. [2023-11-29 03:24:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:24:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2023-11-29 03:24:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:11,589 INFO L225 Difference]: With dead ends: 1001 [2023-11-29 03:24:11,589 INFO L226 Difference]: Without dead ends: 1001 [2023-11-29 03:24:11,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 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 03:24:11,590 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 6 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:11,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3274 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 03:24:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2023-11-29 03:24:11,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1000. [2023-11-29 03:24:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 582 states have (on average 1.8745704467353952) internal successors, (1091), 990 states have internal predecessors, (1091), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:24:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1125 transitions. [2023-11-29 03:24:11,613 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1125 transitions. Word has length 60 [2023-11-29 03:24:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:11,613 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1125 transitions. [2023-11-29 03:24:11,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 03:24:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1125 transitions. [2023-11-29 03:24:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 03:24:11,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:11,614 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] [2023-11-29 03:24:11,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:11,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:11,814 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 03:24:11,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1231289238, now seen corresponding path program 2 times [2023-11-29 03:24:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041114168] [2023-11-29 03:24:11,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:24:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:24:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:11,817 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:11,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:12,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:24:12,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:24:12,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:24:12,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:12,303 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 03:24:12,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:24:12,472 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 03:24:12,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041114168] [2023-11-29 03:24:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041114168] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:24:12,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:24:12,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 03:24:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456012331] [2023-11-29 03:24:12,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:24:12,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:24:12,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:12,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:24:12,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:24:12,475 INFO L87 Difference]: Start difference. First operand 1000 states and 1125 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 03:24:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:15,957 INFO L93 Difference]: Finished difference Result 1015 states and 1151 transitions. [2023-11-29 03:24:15,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:24:15,958 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 63 [2023-11-29 03:24:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:15,965 INFO L225 Difference]: With dead ends: 1015 [2023-11-29 03:24:15,965 INFO L226 Difference]: Without dead ends: 1013 [2023-11-29 03:24:15,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 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 03:24:15,966 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 12 mSDsluCounter, 5727 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6548 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:15,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6548 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 03:24:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2023-11-29 03:24:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1009. [2023-11-29 03:24:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 591 states have (on average 1.8663282571912014) internal successors, (1103), 999 states have internal predecessors, (1103), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:24:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1137 transitions. [2023-11-29 03:24:15,990 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1137 transitions. Word has length 63 [2023-11-29 03:24:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:15,991 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1137 transitions. [2023-11-29 03:24:15,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 03:24:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1137 transitions. [2023-11-29 03:24:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 03:24:15,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:15,992 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] [2023-11-29 03:24:15,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:16,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:16,193 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 03:24:16,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2005504458, now seen corresponding path program 3 times [2023-11-29 03:24:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:16,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026075121] [2023-11-29 03:24:16,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:24:16,194 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 03:24:16,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:16,195 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:16,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:16,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 03:24:16,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:24:16,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:24:16,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:17,091 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 03:24:17,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:24:17,814 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 03:24:17,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026075121] [2023-11-29 03:24:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026075121] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:24:17,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:24:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 03:24:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368170799] [2023-11-29 03:24:17,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:24:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 03:24:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:17,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:24:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:24:17,817 INFO L87 Difference]: Start difference. First operand 1009 states and 1137 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 03:24:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:24,684 INFO L93 Difference]: Finished difference Result 1039 states and 1201 transitions. [2023-11-29 03:24:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 03:24:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 69 [2023-11-29 03:24:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:24,690 INFO L225 Difference]: With dead ends: 1039 [2023-11-29 03:24:24,690 INFO L226 Difference]: Without dead ends: 1036 [2023-11-29 03:24:24,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 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 03:24:24,692 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 24 mSDsluCounter, 9798 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10617 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:24,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10617 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-11-29 03:24:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2023-11-29 03:24:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1027. [2023-11-29 03:24:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 609 states have (on average 1.8489326765188834) internal successors, (1126), 1017 states have internal predecessors, (1126), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:24:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1160 transitions. [2023-11-29 03:24:24,708 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1160 transitions. Word has length 69 [2023-11-29 03:24:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:24,708 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1160 transitions. [2023-11-29 03:24:24,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 03:24:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1160 transitions. [2023-11-29 03:24:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 03:24:24,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:24,709 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] [2023-11-29 03:24:24,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:24,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:24,910 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 03:24:24,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash 416552074, now seen corresponding path program 4 times [2023-11-29 03:24:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758909338] [2023-11-29 03:24:24,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:24:24,910 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 03:24:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:24,911 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:24,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:25,260 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:24:25,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:24:25,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 03:24:25,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:25,640 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 03:24:25,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:24:27,087 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 03:24:27,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:27,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758909338] [2023-11-29 03:24:27,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758909338] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:24:27,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:24:27,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 03:24:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303537961] [2023-11-29 03:24:27,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:24:27,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 03:24:27,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 03:24:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 03:24:27,091 INFO L87 Difference]: Start difference. First operand 1027 states and 1160 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 03:24:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:46,182 INFO L93 Difference]: Finished difference Result 1084 states and 1270 transitions. [2023-11-29 03:24:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 03:24:46,183 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 81 [2023-11-29 03:24:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:46,187 INFO L225 Difference]: With dead ends: 1084 [2023-11-29 03:24:46,187 INFO L226 Difference]: Without dead ends: 1082 [2023-11-29 03:24:46,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 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 03:24:46,193 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 48 mSDsluCounter, 22105 mSDsCounter, 0 mSdLazyCounter, 6306 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 22926 SdHoareTripleChecker+Invalid, 6449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 6306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:46,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 22926 Invalid, 6449 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [143 Valid, 6306 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2023-11-29 03:24:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2023-11-29 03:24:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1061. [2023-11-29 03:24:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 643 states have (on average 1.822706065318818) internal successors, (1172), 1051 states have internal predecessors, (1172), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:24:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1206 transitions. [2023-11-29 03:24:46,222 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1206 transitions. Word has length 81 [2023-11-29 03:24:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:46,222 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1206 transitions. [2023-11-29 03:24:46,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 03:24:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1206 transitions. [2023-11-29 03:24:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 03:24:46,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:46,223 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] [2023-11-29 03:24:46,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:46,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:46,424 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 03:24:46,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1285677802, now seen corresponding path program 5 times [2023-11-29 03:24:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687326863] [2023-11-29 03:24:46,425 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:24:46,425 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 03:24:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:46,426 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:46,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:24:47,849 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 03:24:47,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:24:47,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 03:24:47,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:47,906 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 03:24:47,906 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 03:24:48,324 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:24:48,325 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 03:24:48,404 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 03:24:48,605 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 03:24:51,528 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:24:51,528 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 03:24:51,606 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 03:24:51,691 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 03:24:51,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:24:52,152 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1651) |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 03:24:52,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687326863] [2023-11-29 03:24:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687326863] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:24:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [251648646] [2023-11-29 03:24:52,155 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:24:52,155 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:24:52,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:24:52,156 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:24:52,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 03:26:10,741 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 03:26:10,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:26:10,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 03:26:10,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:11,044 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:26:11,045 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 03:26:11,544 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:26:11,544 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 26 treesize of output 43 [2023-11-29 03:26:11,661 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 03:26:11,910 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 28 treesize of output 16 [2023-11-29 03:26:13,295 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:26:13,295 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 03:26:13,428 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 03:26:13,508 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 03:26:13,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:13,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2097) |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 03:26:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [251648646] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:13,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:26:13,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-29 03:26:13,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450434529] [2023-11-29 03:26:13,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:26:13,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:26:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:26:13,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:26:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=321, Unknown=2, NotChecked=74, Total=462 [2023-11-29 03:26:13,905 INFO L87 Difference]: Start difference. First operand 1061 states and 1206 transitions. Second operand has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 17 states have internal predecessors, (118), 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 03:26:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:31,046 INFO L93 Difference]: Finished difference Result 2062 states and 2249 transitions. [2023-11-29 03:26:31,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:26:31,046 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 17 states have internal predecessors, (118), 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 103 [2023-11-29 03:26:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:31,056 INFO L225 Difference]: With dead ends: 2062 [2023-11-29 03:26:31,056 INFO L226 Difference]: Without dead ends: 2058 [2023-11-29 03:26:31,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=1051, Unknown=2, NotChecked=138, Total=1406 [2023-11-29 03:26:31,057 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 4004 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 5956 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4004 SdHoareTripleChecker+Valid, 4466 SdHoareTripleChecker+Invalid, 6122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 5956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:31,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4004 Valid, 4466 Invalid, 6122 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [166 Valid, 5956 Invalid, 0 Unknown, 0 Unchecked, 16.3s Time] [2023-11-29 03:26:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2023-11-29 03:26:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1107. [2023-11-29 03:26:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 689 states have (on average 1.7677793904208998) internal successors, (1218), 1096 states have internal predecessors, (1218), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:26:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1252 transitions. [2023-11-29 03:26:31,082 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1252 transitions. Word has length 103 [2023-11-29 03:26:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:31,082 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1252 transitions. [2023-11-29 03:26:31,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 17 states have internal predecessors, (118), 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 03:26:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1252 transitions. [2023-11-29 03:26:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 03:26:31,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:31,083 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] [2023-11-29 03:26:31,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 03:26:31,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:26:31,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:26:31,484 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 03:26:31,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1285677803, now seen corresponding path program 1 times [2023-11-29 03:26:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:26:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306801467] [2023-11-29 03:26:31,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:31,485 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 03:26:31,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:26:31,486 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:26:31,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:26:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:32,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 03:26:32,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:32,319 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 03:26:32,576 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:26:32,576 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 03:26:32,586 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 03:26:32,630 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 03:26:32,645 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 03:26:32,745 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 03:26:32,750 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 03:26:33,518 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:26:33,518 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 03:26:33,525 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 03:26:33,576 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 03:26:33,584 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 03:26:33,615 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 03:26:33,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:35,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 03:26:35,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:26:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306801467] [2023-11-29 03:26:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306801467] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1000000973] [2023-11-29 03:26:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:35,296 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:26:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:26:35,298 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:26:35,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 03:28:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:20,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 03:28:20,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:20,076 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 03:28:20,267 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:28:20,268 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 03:28:20,278 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 03:28:20,293 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 03:28:20,303 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 03:28:20,360 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 03:28:20,365 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 03:28:20,976 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:28:20,976 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 03:28:20,984 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 03:28:21,025 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 03:28:21,032 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 03:28:21,036 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 03:28:21,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:28:22,263 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3173 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:28:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1000000973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:28:22,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:28:22,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 03:28:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857670020] [2023-11-29 03:28:22,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:28:22,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:28:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:22,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:28:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 03:28:22,269 INFO L87 Difference]: Start difference. First operand 1107 states and 1252 transitions. Second operand has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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 03:28:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:32,136 INFO L93 Difference]: Finished difference Result 1450 states and 1563 transitions. [2023-11-29 03:28:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:28:32,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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 103 [2023-11-29 03:28:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:32,143 INFO L225 Difference]: With dead ends: 1450 [2023-11-29 03:28:32,143 INFO L226 Difference]: Without dead ends: 1450 [2023-11-29 03:28:32,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 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 03:28:32,144 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 706 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 4225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 4236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:32,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 2008 Invalid, 4236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4225 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2023-11-29 03:28:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2023-11-29 03:28:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1106. [2023-11-29 03:28:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 689 states have (on average 1.7663280116110305) internal successors, (1217), 1095 states have internal predecessors, (1217), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:28:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1251 transitions. [2023-11-29 03:28:32,160 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1251 transitions. Word has length 103 [2023-11-29 03:28:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:32,160 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1251 transitions. [2023-11-29 03:28:32,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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 03:28:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1251 transitions. [2023-11-29 03:28:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:28:32,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:32,162 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] [2023-11-29 03:28:32,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 03:28:32,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:28:32,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:28:32,562 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 03:28:32,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1412521084, now seen corresponding path program 1 times [2023-11-29 03:28:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:32,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548308081] [2023-11-29 03:28:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:32,564 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 03:28:32,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:32,565 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:28:32,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:28:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:33,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 03:28:33,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:33,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 03:28:33,535 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:28:33,536 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 03:28:33,565 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 03:28:33,685 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 03:28:34,542 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:34,542 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 03:28:34,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:34,631 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 03:28:34,645 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 03:28:34,675 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 03:28:34,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:28:34,722 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3580) |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 03:28:34,732 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:28:35,086 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3580 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3626))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3580)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:28:35,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:35,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548308081] [2023-11-29 03:28:35,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548308081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:28:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1685320797] [2023-11-29 03:28:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:35,089 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:28:35,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:28:35,090 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:28:35,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 03:28:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:38,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:28:38,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:38,589 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:28:38,590 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 03:28:38,975 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:28:38,975 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 26 treesize of output 43 [2023-11-29 03:28:39,046 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 03:28:39,245 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 28 treesize of output 16 [2023-11-29 03:28:40,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:28:40,510 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 03:28:40,699 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:28:40,699 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 03:28:40,721 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 03:28:40,781 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 03:28:40,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:28:40,795 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4033) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:28:40,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4033 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:28:41,173 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4033)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:28:41,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1685320797] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:28:41,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:28:41,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2023-11-29 03:28:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404098411] [2023-11-29 03:28:41,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:28:41,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:28:41,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:41,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:28:41,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=342, Unknown=6, NotChecked=258, Total=702 [2023-11-29 03:28:41,177 INFO L87 Difference]: Start difference. First operand 1106 states and 1251 transitions. Second operand has 19 states, 16 states have (on average 7.625) internal successors, (122), 19 states have internal predecessors, (122), 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 03:28:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:52,522 INFO L93 Difference]: Finished difference Result 2054 states and 2237 transitions. [2023-11-29 03:28:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:28:52,523 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 19 states have internal predecessors, (122), 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 105 [2023-11-29 03:28:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:52,532 INFO L225 Difference]: With dead ends: 2054 [2023-11-29 03:28:52,532 INFO L226 Difference]: Without dead ends: 2054 [2023-11-29 03:28:52,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=445, Unknown=6, NotChecked=294, Total=870 [2023-11-29 03:28:52,533 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 2984 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 4770 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3004 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 4835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:52,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3004 Valid, 3621 Invalid, 4835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4770 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-11-29 03:28:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2023-11-29 03:28:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1105. [2023-11-29 03:28:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 689 states have (on average 1.7648766328011611) internal successors, (1216), 1094 states have internal predecessors, (1216), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:28:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1250 transitions. [2023-11-29 03:28:52,551 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1250 transitions. Word has length 105 [2023-11-29 03:28:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:52,552 INFO L495 AbstractCegarLoop]: Abstraction has 1105 states and 1250 transitions. [2023-11-29 03:28:52,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 19 states have internal predecessors, (122), 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 03:28:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1250 transitions. [2023-11-29 03:28:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:28:52,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:52,553 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] [2023-11-29 03:28:52,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 03:28:52,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:28:52,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:28:52,968 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 03:28:52,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1412521083, now seen corresponding path program 1 times [2023-11-29 03:28:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:52,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293471646] [2023-11-29 03:28:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:52,969 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 03:28:52,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:52,970 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:28:52,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:28:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:53,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 03:28:53,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:53,800 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 03:28:53,902 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:28:53,902 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 03:28:53,910 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 03:28:53,930 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 03:28:53,935 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 03:28:54,027 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 03:28:54,032 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 03:28:54,654 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:54,654 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 03:28:54,660 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 03:28:54,759 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:54,759 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 03:28:54,768 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 03:28:54,778 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 03:28:54,783 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 03:28:54,802 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 03:28:54,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:28:54,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:28:54,960 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4533) |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 03:28:56,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4624))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4625) .cse0 v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4625) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4533) |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 03:28:56,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293471646] [2023-11-29 03:28:56,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293471646] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:28:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1993562768] [2023-11-29 03:28:56,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:56,294 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:28:56,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:28:56,295 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:28:56,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 03:28:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:59,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 03:28:59,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:59,987 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 03:29:00,233 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 03:29:00,249 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:29:00,249 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 03:29:00,306 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 03:29:00,310 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 03:29:00,453 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 03:29:00,458 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 03:29:00,970 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:00,970 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 03:29:00,977 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 03:29:01,159 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:01,159 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 03:29:01,166 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 03:29:01,183 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 03:29:01,189 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 03:29:01,191 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 03:29:01,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:01,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 03:29:01,269 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5079) |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 03:29:02,497 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5171))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5172) .cse0 v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5172) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-11-29 03:29:02,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1993562768] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:02,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:29:02,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 03:29:02,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897434956] [2023-11-29 03:29:02,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:29:02,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:29:02,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:02,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:29:02,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 03:29:02,508 INFO L87 Difference]: Start difference. First operand 1105 states and 1250 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 03:29:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:13,184 INFO L93 Difference]: Finished difference Result 1458 states and 1572 transitions. [2023-11-29 03:29:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:29:13,185 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 105 [2023-11-29 03:29:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:13,190 INFO L225 Difference]: With dead ends: 1458 [2023-11-29 03:29:13,190 INFO L226 Difference]: Without dead ends: 1458 [2023-11-29 03:29:13,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 03:29:13,191 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 1126 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 5237 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 5258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:29:13,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 2094 Invalid, 5258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5237 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2023-11-29 03:29:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2023-11-29 03:29:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1104. [2023-11-29 03:29:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 689 states have (on average 1.7634252539912918) internal successors, (1215), 1093 states have internal predecessors, (1215), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:29:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1249 transitions. [2023-11-29 03:29:13,210 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1249 transitions. Word has length 105 [2023-11-29 03:29:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:13,211 INFO L495 AbstractCegarLoop]: Abstraction has 1104 states and 1249 transitions. [2023-11-29 03:29:13,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 03:29:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1249 transitions. [2023-11-29 03:29:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:29:13,212 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:13,212 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] [2023-11-29 03:29:13,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:29:13,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 03:29:13,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:29:13,613 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 03:29:13,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:13,613 INFO L85 PathProgramCache]: Analyzing trace with hash -221409288, now seen corresponding path program 1 times [2023-11-29 03:29:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:13,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731170676] [2023-11-29 03:29:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:13,614 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 03:29:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:13,615 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:29:13,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:29:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:14,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 03:29:14,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:14,521 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 03:29:14,597 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:29:14,598 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 03:29:14,619 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 03:29:14,704 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 03:29:15,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:15,475 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 03:29:15,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:15,560 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 03:29:15,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:15,634 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 03:29:15,650 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 03:29:15,685 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 03:29:15,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:19,793 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 03:29:19,806 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5594))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:29:19,821 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5594))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:29:20,225 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5641))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5594)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:29:20,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731170676] [2023-11-29 03:29:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731170676] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1308148537] [2023-11-29 03:29:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:20,229 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:29:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:29:20,229 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:29:20,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 03:29:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:35,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 03:29:35,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:35,615 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:29:35,616 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 03:29:36,079 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:29:36,079 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 26 treesize of output 43 [2023-11-29 03:29:36,175 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 03:29:36,359 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 28 treesize of output 16 [2023-11-29 03:29:37,660 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:37,660 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 03:29:37,881 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:37,881 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 03:29:38,001 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:38,002 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 03:29:38,019 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 03:29:38,088 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 03:29:38,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:38,105 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6065) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:29:38,116 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6065 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:29:38,129 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6064))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6065)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:29:38,141 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6065 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6064))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6065)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:29:38,543 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6111 (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 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6111))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6064)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6065)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:29:38,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1308148537] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:38,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:29:38,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-11-29 03:29:38,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644795095] [2023-11-29 03:29:38,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:29:38,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:29:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:38,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:29:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=458, Unknown=10, NotChecked=468, Total=1056 [2023-11-29 03:29:38,548 INFO L87 Difference]: Start difference. First operand 1104 states and 1249 transitions. Second operand has 21 states, 18 states have (on average 7.0) internal successors, (126), 21 states have internal predecessors, (126), 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 03:29:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:53,598 INFO L93 Difference]: Finished difference Result 2050 states and 2233 transitions. [2023-11-29 03:29:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:29:53,598 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.0) internal successors, (126), 21 states have internal predecessors, (126), 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 107 [2023-11-29 03:29:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:53,604 INFO L225 Difference]: With dead ends: 2050 [2023-11-29 03:29:53,604 INFO L226 Difference]: Without dead ends: 2050 [2023-11-29 03:29:53,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=150, Invalid=578, Unknown=10, NotChecked=522, Total=1260 [2023-11-29 03:29:53,605 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 2963 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 5851 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2983 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 5916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:29:53,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2983 Valid, 4412 Invalid, 5916 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 5851 Invalid, 0 Unknown, 0 Unchecked, 14.8s Time] [2023-11-29 03:29:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2023-11-29 03:29:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1103. [2023-11-29 03:29:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 689 states have (on average 1.7619738751814225) internal successors, (1214), 1092 states have internal predecessors, (1214), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:29:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1248 transitions. [2023-11-29 03:29:53,622 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1248 transitions. Word has length 107 [2023-11-29 03:29:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:53,622 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1248 transitions. [2023-11-29 03:29:53,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.0) internal successors, (126), 21 states have internal predecessors, (126), 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 03:29:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1248 transitions. [2023-11-29 03:29:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:29:53,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:53,623 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] [2023-11-29 03:29:53,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:29:53,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-29 03:29:54,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:29:54,024 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 03:29:54,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash -221409287, now seen corresponding path program 1 times [2023-11-29 03:29:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340215197] [2023-11-29 03:29:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:54,025 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 03:29:54,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:54,026 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:29:54,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:29:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:55,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 03:29:55,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:55,035 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 03:29:55,143 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:29:55,144 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 03:29:55,151 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 03:29:55,176 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 03:29:55,185 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 03:29:55,291 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 03:29:55,296 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 03:29:55,963 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:55,964 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 03:29:55,970 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 03:29:56,093 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:56,093 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 03:29:56,105 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 03:29:56,188 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:56,189 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 03:29:56,200 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 03:29:56,210 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 03:29:56,214 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 03:29:56,244 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 03:29:56,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:56,404 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:29:56,444 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:29:56,635 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6580) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6579))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6580) .cse2 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:29:56,879 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6579))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6580) .cse1 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6580) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 03:29:58,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6674))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6579))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6673) .cse0 v_ArrVal_6580) .cse1 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6674))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6673) .cse6 v_ArrVal_6580) (select (select (store .cse7 .cse6 v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6582))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 03:29:58,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340215197] [2023-11-29 03:29:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340215197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802898228] [2023-11-29 03:29:58,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:58,236 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:29:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:29:58,237 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:29:58,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 03:30:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:14,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 03:30:14,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:30:14,808 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 03:30:15,109 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:30:15,109 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 03:30:15,119 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 03:30:15,177 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 03:30:15,191 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 03:30:15,351 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 03:30:15,356 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 03:30:15,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:30:15,988 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 03:30:15,997 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 03:30:16,155 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:30:16,156 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 03:30:16,162 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 03:30:16,260 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:30:16,260 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 03:30:16,268 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 03:30:16,280 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 03:30:16,285 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 03:30:16,291 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 03:30:16,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:30:16,344 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:30:16,379 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:30:16,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7143))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7144) .cse0 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7144) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 03:30:16,754 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7143))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7144) .cse1 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7144) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 03:30:18,727 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7237))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7143))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7238) .cse0 v_ArrVal_7144) .cse1 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7237))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7238) .cse6 v_ArrVal_7144) (select (select (store .cse7 .cse6 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7146))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 03:30:18,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [802898228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:30:18,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:30:18,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 03:30:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878046747] [2023-11-29 03:30:18,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:30:18,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:30:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:30:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:30:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 03:30:18,741 INFO L87 Difference]: Start difference. First operand 1103 states and 1248 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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 03:30:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:30:34,492 INFO L93 Difference]: Finished difference Result 1456 states and 1570 transitions. [2023-11-29 03:30:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:30:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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 107 [2023-11-29 03:30:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:30:34,496 INFO L225 Difference]: With dead ends: 1456 [2023-11-29 03:30:34,496 INFO L226 Difference]: Without dead ends: 1456 [2023-11-29 03:30:34,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 03:30:34,496 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 1816 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 4456 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 4489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:30:34,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1834 Valid, 1794 Invalid, 4489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4456 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2023-11-29 03:30:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2023-11-29 03:30:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1102. [2023-11-29 03:30:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 689 states have (on average 1.760522496371553) internal successors, (1213), 1091 states have internal predecessors, (1213), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:30:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1247 transitions. [2023-11-29 03:30:34,509 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1247 transitions. Word has length 107 [2023-11-29 03:30:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:30:34,510 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1247 transitions. [2023-11-29 03:30:34,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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 03:30:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1247 transitions. [2023-11-29 03:30:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 03:30:34,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:30:34,510 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] [2023-11-29 03:30:34,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 03:30:34,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:30:34,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:30:34,911 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 03:30:34,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:30:34,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1975721351, now seen corresponding path program 1 times [2023-11-29 03:30:34,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:30:34,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573502949] [2023-11-29 03:30:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:34,912 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 03:30:34,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:30:34,913 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:30:34,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:30:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:30:35,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:30:35,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:30:35,940 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 03:30:36,168 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:30:36,168 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 03:30:36,223 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 03:30:36,363 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 03:30:37,620 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:30:37,620 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 03:30:37,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:30:37,767 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 03:30:37,893 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:30:37,893 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 03:30:38,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:30:38,035 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 03:30:38,054 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 03:30:38,124 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 03:30:38,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:30:38,228 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7677) |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 03:30:42,346 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (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$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7676))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:30:42,367 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:30:42,390 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (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 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7675))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:30:42,413 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (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 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7675))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:30:42,962 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7723))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7675)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:30:42,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:30:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573502949] [2023-11-29 03:30:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573502949] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:30:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [329046966] [2023-11-29 03:30:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:30:42,969 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:30:42,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:30:42,970 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:30:42,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 03:31:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:31:02,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 03:31:02,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:31:02,426 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:31:02,426 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 03:31:03,254 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:31:03,255 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 26 treesize of output 43 [2023-11-29 03:31:03,407 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 03:31:03,745 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 28 treesize of output 16 [2023-11-29 03:31:05,750 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:05,750 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 03:31:06,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:06,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 03:31:06,280 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:06,280 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 03:31:06,521 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:06,521 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 03:31:06,558 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 03:31:06,675 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 03:31:06,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:31:10,836 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 03:31:10,856 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (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$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:31:10,877 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:31:10,902 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8160))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:31:10,927 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8160 (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 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8160))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:31:11,479 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8208 (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8208))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8160)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:31:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [329046966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:31:11,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:31:11,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-11-29 03:31:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817039100] [2023-11-29 03:31:11,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:31:11,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:31:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:31:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:31:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=581, Unknown=17, NotChecked=732, Total=1482 [2023-11-29 03:31:11,488 INFO L87 Difference]: Start difference. First operand 1102 states and 1247 transitions. Second operand has 23 states, 20 states have (on average 6.5) internal successors, (130), 23 states have internal predecessors, (130), 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 03:31:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:31:36,251 INFO L93 Difference]: Finished difference Result 2046 states and 2229 transitions. [2023-11-29 03:31:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 03:31:36,252 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 23 states have internal predecessors, (130), 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 109 [2023-11-29 03:31:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:31:36,256 INFO L225 Difference]: With dead ends: 2046 [2023-11-29 03:31:36,256 INFO L226 Difference]: Without dead ends: 2046 [2023-11-29 03:31:36,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=185, Invalid=716, Unknown=17, NotChecked=804, Total=1722 [2023-11-29 03:31:36,257 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 1571 mSDsluCounter, 4160 mSDsCounter, 0 mSdLazyCounter, 6198 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 6245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 6198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:31:36,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 4573 Invalid, 6245 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 6198 Invalid, 0 Unknown, 0 Unchecked, 24.3s Time] [2023-11-29 03:31:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2023-11-29 03:31:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1101. [2023-11-29 03:31:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 689 states have (on average 1.7590711175616836) internal successors, (1212), 1090 states have internal predecessors, (1212), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:31:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1246 transitions. [2023-11-29 03:31:36,276 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1246 transitions. Word has length 109 [2023-11-29 03:31:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:31:36,276 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1246 transitions. [2023-11-29 03:31:36,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 23 states have internal predecessors, (130), 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 03:31:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1246 transitions. [2023-11-29 03:31:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 03:31:36,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:31:36,277 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] [2023-11-29 03:31:36,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-11-29 03:31:36,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:31:36,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:31:36,678 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 03:31:36,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:31:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1975721352, now seen corresponding path program 1 times [2023-11-29 03:31:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:31:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400388666] [2023-11-29 03:31:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:31:36,679 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 03:31:36,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:31:36,679 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:31:36,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:31:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:31:37,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 03:31:37,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:31:37,926 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 03:31:38,397 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 03:31:38,423 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:31:38,423 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 03:31:38,482 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 03:31:38,494 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 03:31:38,685 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 03:31:38,692 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 03:31:39,811 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:39,811 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 03:31:39,825 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 03:31:40,026 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:40,027 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 03:31:40,040 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 03:31:40,197 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:40,197 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 03:31:40,210 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 03:31:40,364 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:40,365 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 03:31:40,376 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 03:31:40,396 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 03:31:40,403 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 03:31:40,461 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 03:31:40,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:31:40,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 03:31:40,756 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:31:40,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8694))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8693) .cse0 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8693) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 03:31:41,214 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8694))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8693) .cse1 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8693) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 03:31:41,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8692))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8694))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8691) .cse0 v_ArrVal_8693) .cse1 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8692))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8691) .cse6 v_ArrVal_8693) (select (select (store .cse7 .cse6 v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8695))) |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 03:31:44,468 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8692))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8694))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8691) .cse1 v_ArrVal_8693) .cse2 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8692))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8691) .cse7 v_ArrVal_8693) (select (select (store .cse8 .cse7 v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8695))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 03:31:50,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8787))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8692))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8694))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8788) .cse0 v_ArrVal_8691) .cse1 v_ArrVal_8693) .cse2 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8787))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8692))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8788) .cse8 v_ArrVal_8691) .cse9 v_ArrVal_8693) (select (select (store .cse10 .cse9 v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8695))))) |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 03:31:50,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:31:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400388666] [2023-11-29 03:31:50,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400388666] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:31:50,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [607424418] [2023-11-29 03:31:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:31:50,736 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:31:50,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:31:50,737 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:31:50,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 03:32:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:14,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 03:32:14,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:32:14,685 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 03:32:16,375 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:32:16,375 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 03:32:16,445 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 03:32:16,518 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 03:32:16,536 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 03:32:16,829 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 03:32:16,848 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 03:32:20,363 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:20,363 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 03:32:20,403 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 03:32:20,778 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:20,778 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 03:32:20,816 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 03:32:21,100 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:21,101 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 03:32:21,140 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 03:32:21,392 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:21,392 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 03:32:21,432 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 03:32:21,512 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 03:32:21,532 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 03:32:21,570 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 03:32:21,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:32:21,739 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:32:21,838 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9277) |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 03:32:21,949 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9275))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9274) .cse0 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9274) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 03:32:22,070 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9274) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9275))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9274) .cse3 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:32:22,202 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9272))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9275))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9273) .cse0 v_ArrVal_9274) .cse1 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9272))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9273) .cse6 v_ArrVal_9274) (select (select (store .cse7 .cse6 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9277))) |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 03:32:22,341 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9272))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9275))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9273) .cse1 v_ArrVal_9274) .cse2 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9272))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9273) .cse7 v_ArrVal_9274) (select (select (store .cse8 .cse7 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9277))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 03:32:25,519 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9368))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9272))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9275))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9369) .cse0 v_ArrVal_9273) .cse1 v_ArrVal_9274) .cse2 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9368))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9272))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9369) .cse8 v_ArrVal_9273) .cse9 v_ArrVal_9274) (select (select (store .cse10 .cse9 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9277))))) |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 03:32:25,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [607424418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:32:25,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:32:25,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 03:32:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044824831] [2023-11-29 03:32:25,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:32:25,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:32:25,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:32:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:32:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=160, Unknown=14, NotChecked=518, Total=756 [2023-11-29 03:32:25,558 INFO L87 Difference]: Start difference. First operand 1101 states and 1246 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 03:33:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:33:24,106 INFO L93 Difference]: Finished difference Result 1444 states and 1557 transitions. [2023-11-29 03:33:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:33:24,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 109 [2023-11-29 03:33:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:33:24,109 INFO L225 Difference]: With dead ends: 1444 [2023-11-29 03:33:24,109 INFO L226 Difference]: Without dead ends: 1444 [2023-11-29 03:33:24,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 03:33:24,110 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 697 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 4895 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 4906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:33:24,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2260 Invalid, 4906 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 4895 Invalid, 0 Unknown, 0 Unchecked, 56.8s Time] [2023-11-29 03:33:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-11-29 03:33:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1100. [2023-11-29 03:33:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 689 states have (on average 1.7576197387518142) internal successors, (1211), 1089 states have internal predecessors, (1211), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:33:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1245 transitions. [2023-11-29 03:33:24,130 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1245 transitions. Word has length 109 [2023-11-29 03:33:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:33:24,131 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1245 transitions. [2023-11-29 03:33:24,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 03:33:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1245 transitions. [2023-11-29 03:33:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 03:33:24,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:33:24,132 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, 1] [2023-11-29 03:33:24,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:33:24,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 03:33:24,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:33:24,533 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 03:33:24,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 294403918, now seen corresponding path program 1 times [2023-11-29 03:33:24,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:33:24,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20433583] [2023-11-29 03:33:24,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:24,535 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 03:33:24,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:33:24,536 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:33:24,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 (36)] Waiting until timeout for monitored process [2023-11-29 03:33:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:26,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 03:33:26,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:33:26,963 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 03:33:26,963 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 03:33:30,912 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:33:30,912 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 03:33:31,432 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 03:33:32,564 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 03:33:45,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:45,512 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 03:33:46,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:46,359 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 03:33:47,057 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:47,057 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 03:33:47,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:47,747 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 03:33:48,465 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:48,465 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 03:33:48,625 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 03:33:49,209 INFO L349 Elim1Store]: treesize reduction 44, result has 51.1 percent of original size [2023-11-29 03:33:49,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 73 [2023-11-29 03:33:50,334 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 03:33:50,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:33:50,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9826) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:33:51,000 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9826) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:33:51,052 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9825))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:33:51,105 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:33:51,161 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9824))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:33:51,219 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9824))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:33:51,284 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9823 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9823))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9824)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:33:51,347 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9823 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9823))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9824)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:33:52,686 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9823 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9873))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9823)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9824)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:33:52,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:33:52,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20433583] [2023-11-29 03:33:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20433583] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:33:52,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [20206541] [2023-11-29 03:33:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:52,703 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:33:52,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:33:52,704 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:33:52,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 03:34:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:09,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 03:34:09,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:10,103 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:34:10,104 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 03:34:13,769 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:34:13,769 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 26 treesize of output 43 [2023-11-29 03:34:14,295 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 03:34:15,459 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 28 treesize of output 16 [2023-11-29 03:34:23,809 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:23,809 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 03:34:25,066 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:25,067 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 03:34:25,924 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:25,924 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 03:34:26,747 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:26,747 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 03:34:27,576 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:27,576 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 03:34:28,143 INFO L349 Elim1Store]: treesize reduction 94, result has 30.9 percent of original size [2023-11-29 03:34:28,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 60 [2023-11-29 03:34:28,183 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 03:34:28,668 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 03:34:28,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:34:33,244 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10330) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))))) is different from false [2023-11-29 03:34:33,330 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 03:34:33,404 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:34:33,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:34:33,557 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10328))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:34:33,636 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10328))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:34:33,723 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10327))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10328)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:34:33,813 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10327))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10328)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 03:34:35,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [20206541] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:34:35,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:34:35,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2023-11-29 03:34:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270133487] [2023-11-29 03:34:35,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:34:35,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 03:34:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:35,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 03:34:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=820, Unknown=18, NotChecked=1258, Total=2256 [2023-11-29 03:34:35,748 INFO L87 Difference]: Start difference. First operand 1100 states and 1245 transitions. Second operand has 27 states, 24 states have (on average 5.583333333333333) internal successors, (134), 25 states have internal predecessors, (134), 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 03:36:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:36:05,214 INFO L93 Difference]: Finished difference Result 2042 states and 2225 transitions. [2023-11-29 03:36:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 03:36:05,215 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.583333333333333) internal successors, (134), 25 states have internal predecessors, (134), 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 111 [2023-11-29 03:36:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:36:05,220 INFO L225 Difference]: With dead ends: 2042 [2023-11-29 03:36:05,220 INFO L226 Difference]: Without dead ends: 2042 [2023-11-29 03:36:05,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=435, Invalid=2585, Unknown=18, NotChecked=2074, Total=5112 [2023-11-29 03:36:05,223 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 4630 mSDsluCounter, 4693 mSDsCounter, 0 mSdLazyCounter, 6924 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4630 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 7105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 6924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:36:05,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4630 Valid, 5100 Invalid, 7105 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [181 Valid, 6924 Invalid, 0 Unknown, 0 Unchecked, 82.6s Time] [2023-11-29 03:36:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2023-11-29 03:36:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1099. [2023-11-29 03:36:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 689 states have (on average 1.7561683599419449) internal successors, (1210), 1088 states have internal predecessors, (1210), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:36:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1244 transitions. [2023-11-29 03:36:05,241 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1244 transitions. Word has length 111 [2023-11-29 03:36:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:36:05,242 INFO L495 AbstractCegarLoop]: Abstraction has 1099 states and 1244 transitions. [2023-11-29 03:36:05,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.583333333333333) internal successors, (134), 25 states have internal predecessors, (134), 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 03:36:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1244 transitions. [2023-11-29 03:36:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 03:36:05,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:05,243 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, 1] [2023-11-29 03:36:05,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2023-11-29 03:36:05,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 (36)] Ended with exit code 0 [2023-11-29 03:36:05,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:36:05,644 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 03:36:05,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash 294403919, now seen corresponding path program 1 times [2023-11-29 03:36:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:36:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483883253] [2023-11-29 03:36:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:05,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:36:05,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:36:05,646 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 03:36:05,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/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 (38)] Waiting until timeout for monitored process [2023-11-29 03:36:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:07,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 126 conjunts are in the unsatisfiable core [2023-11-29 03:36:07,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:36:07,661 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 03:36:09,103 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:36:09,103 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 03:36:09,204 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 03:36:09,456 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 03:36:09,537 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 03:36:10,525 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 17 [2023-11-29 03:36:10,552 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 03:36:17,950 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:36:17,950 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 75 treesize of output 68 [2023-11-29 03:36:17,973 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 03:36:18,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:36:18,712 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 75 treesize of output 68 [2023-11-29 03:36:18,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 30 treesize of output 13 [2023-11-29 03:36:19,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:36:19,326 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 75 treesize of output 68 [2023-11-29 03:36:19,348 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 03:36:19,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:36:19,955 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 75 treesize of output 68 [2023-11-29 03:36:19,979 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 03:36:20,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:36:20,596 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 75 treesize of output 68 [2023-11-29 03:36:20,676 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 03:36:20,748 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 44 treesize of output 20 [2023-11-29 03:36:20,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:36:20,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 03:36:20,830 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 03:36:21,011 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 03:36:21,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:36:21,202 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 03:36:21,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:36:22,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))) (forall ((v_ArrVal_10886 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:36:22,545 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))) (forall ((v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))) (forall ((v_ArrVal_10886 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:36:22,702 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10883))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10882) .cse0 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse2 .cse0 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))) (forall ((v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10882) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2023-11-29 03:36:22,840 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10882) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10883))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10882) .cse3 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse4 .cse3 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))))))) is different from false [2023-11-29 03:36:22,986 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10881))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10883))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10880) .cse0 v_ArrVal_10882) .cse1 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse3 .cse1 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (or (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10881))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10880) .cse6 v_ArrVal_10882) (select (select (store .cse7 .cse6 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10885))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))))) is different from false [2023-11-29 03:36:23,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10881))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10880) .cse2 v_ArrVal_10882) (select (select (store .cse3 .cse2 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10885))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10881))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10883))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10880) .cse5 v_ArrVal_10882) .cse6 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse7 .cse6 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))))))) is different from false [2023-11-29 03:36:23,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10879))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10881))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10878) .cse1 v_ArrVal_10880) .cse2 v_ArrVal_10882) (select (select (store .cse3 .cse2 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10885))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10879))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10881))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10883))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10878) .cse6 v_ArrVal_10880) .cse7 v_ArrVal_10882) .cse8 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse9 .cse8 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))))) is different from false [2023-11-29 03:36:28,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10879))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_10881))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_10883))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10878) .cse1 v_ArrVal_10880) .cse2 v_ArrVal_10882) .cse3 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse5 .cse3 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (or (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10879))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_10881))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10878) .cse9 v_ArrVal_10880) .cse10 v_ArrVal_10882) (select (select (store .cse11 .cse10 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10885))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd .cse8 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))))))) is different from false [2023-11-29 03:36:38,101 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10978))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_10879))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_10881))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10977) .cse1 v_ArrVal_10878) .cse2 v_ArrVal_10880) .cse3 v_ArrVal_10882) (select (select (store .cse4 .cse3 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_10885))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))) (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10978))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_10879))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_10881))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_10883))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10977) .cse8 v_ArrVal_10878) .cse9 v_ArrVal_10880) .cse10 v_ArrVal_10882) .cse11 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse12 .cse11 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))) is different from false [2023-11-29 03:36:38,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:36:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483883253] [2023-11-29 03:36:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483883253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:36:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802907295] [2023-11-29 03:36:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:36:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:36:38,169 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:36:38,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0aa6a315-20bc-4965-b19e-ba12223b613e/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process